We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...
``Church's thesis'' is at the foundation of computer science. We point out that with any particular set of physical laws, Church's thesis need not merely be po...
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fado...
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two pol...