MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "The Infinite Tree." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1,041 documents found, showing 1 through 10. Next 10 →

ATOM

The infinite tree
by Jenny Rose Finkel, Trond Grenager, Christopher D. Manning — 2007 — In Association for Computational Linguistics (ACL
…The Infinite Tree Jenny Rose Finkel, Trond Grenager, and Christopher D. Manning Computer Science…
Cited by 6 (0 self) – Add To MetaCart

Infinite Trees and the Future
by Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia — 1999 — In Proc. 7th Intern. Symp. on Graph Drawing, volume 1731 of LNCS
…Infinite Trees and the Future # Camil Demetrescu + , Giuseppe Di Battista # , Irene Finocchi…
Cited by 1 (0 self) – Add To MetaCart

Equational and membership constraints for infinite trees
by Joachim Niehren, Andreas Podelski, Ralf Treinen — 1993 — Proceedings of the RTA '93
…-14 Equational and Membership Constraints for Infinite Trees Joachim Niehren, Andreas Podelski, Ralf Treinen…
Cited by 3 (2 self) – Add To MetaCart

Colorings of the D-Regular Infinite Tree
by Shlomo Hoory, Nathan Linial — 2002
…Colorings of the d-regular innite tree Shlomo Hoory Nathan Linial yz October 15, 2002 Abstract…
Add To MetaCart

Improving the Representation of Infinite Trees to Deal with Sets of Trees
by Laurent Mauborgne — 2000 — In ESOP ’00 [ESOP00
…Improving the Representation of Infinite Trees to Deal with Sets of Trees Laurent Mauborgne LIENS…
Cited by 8 (1 self) – Add To MetaCart

Deciding Emptiness for Stack Automata on Infinite Trees
by David Harel, Danny Raz — 1994 — Information and Computation (formerly Information and Control
… on infinite trees is decidable in elementary time. We first establish the decidability of the emptiness…
Cited by 7 (1 self) – Add To MetaCart

On the expressiveness of deterministic transducers over infinite trees
by Thomas Colcombet, Christof Löding — 2004 — In Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2996 of LNCS
…On the Expressiveness of Deterministic Transducers over Infinite Trees ⋆ Thomas Colcombet 1…
Cited by 1 (0 self) – Add To MetaCart

Reasoning in Expressive Description Logics with Fixpoints based on Automata on Infinite Trees
by Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini — 1999 — In Proc. of the 16th Int. Joint Conf. on Artificial Intelligence (IJCAI’99
…Reasoning in Expressive Description Logics with Fixpoints based on Automata on Infinite Trees…
Cited by 42 (12 self) – Add To MetaCart

Bootstrap percolation on infinite trees and non-amenable groups
by József Balogh, Yuval Peres, Gábor Pete — Combinatorics, Probability and Computing
…BOOTSTRAP PERCOLATION ON INFINITE TREES AND NON-AMENABLE GROUPS JÓZSEF BALOGH, YUVAL PERES…
Cited by 2 (1 self) – Add To MetaCart

Effective Transformations on Infinite Trees, with Applications to High Undecidability, Dominoes
by David Harel — 1986 — Journal of the ACM
…Effective Transformations on Infinite Trees, with Applications to High Undecidability, Dominoes…
Cited by 20 (2 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB