External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Higher-Order Pushdown Trees Are Easy

Teodor Knapik, Damian Niwinski, Pawel Urzyczyn. Higher-Order Pushdown Trees Are Easy. In Mogens Nielsen, Uffe Engberg, editors, Foundations of Software Science and Computation Structures, 5th International Conference, FOSSACS 2002. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 Grenoble, France, April 8-12, 2002, Proceedings. Volume 2303 of Lecture Notes in Computer Science, pages 205-222, Springer, 2002. [doi]

Authors

Teodor Knapik

This author has not been identified. Look up 'Teodor Knapik' in Google

Damian Niwinski

This author has not been identified. Look up 'Damian Niwinski' in Google

Pawel Urzyczyn

This author has not been identified. Look up 'Pawel Urzyczyn' in Google
runs on