No coin nor oath required. For personal study only.
Arnold, A. and I. Castellani, An algebraic characterization of observational equivalence (Note) Bedon, N., Finite automata and ordinals Castellani, I., see A. Arnold De Prisco, R. and A. De Santis, New lower bounds on the cost of binary search trees (Note) De Santis, A., see R. De Prisco Forti, M. and F. Honsell, A general construction of hyperuniverses FranCon, J., Sur la topologie d'un plan arithmktique Gyenizse, P. and S. Vggvalgyi, Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations Honsell, F., see M. Forti Kemp, R., Binary search trees constructed from nondistinct keys with/without specified probabilities Kim, Y., New values in Domineering (Mathematical Games) Krause, M., Geometric arguments yield better bounds for threshold circuits and distributed computing Louscou-Bozapalidou, O., Stochastically costed tree automata: Turakainen's theorem Manzini, G., On the ordering of sparse linear systems (Note) Nehlig, P., Applications quasi affines: pavages par images reciproques (Fundamental
๐ SIMILAR VOLUMES