MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Markus Holzer" – sorted by Relevance.

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

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

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

ATOM

Multi-Head Finite Automata: Data-Independent Versus Data-Dependent Computations
by Markus Holzer — in Proc. Mathematical Foundations of Computer Science, 1997, LNCS 1295, Springer-Verlag
…Multi-Head Finite Automata: Data-Independent Versus Data-Dependent Computations Markus Holzer…
Cited by 3 (0 self) – Add To MetaCart

On the Complexity of Iterated Insertions
by Markus Holzer, Klaus-Jörn Lange — 1997 — Trends in Formal Languages, Lecture Notes in Computer Science 1218
…On the Complexity of Iterated Insertions Markus Holzer and Klaus-Jorn Lange Wilhelm…
Add To MetaCart

A Simpler Grammar for Fibonacci Numbers
by Markus Holzer, Peter Rossmanith
…A Simpler Grammar for Fibonacci Numbers Markus Holzer 1;2 and Peter Rossmanith 2 1 Wilhelm…
Add To MetaCart

The Complexity of Tensor Circuit Evaluation (Extended Abstract)
by Martin Beaudry, Markus Holzer
…The complexity of tensor circuit evaluation 1 EXTENDED ABSTRACT Martin Beaudry 2 Markus Holzer…
Add To MetaCart

Improving Raster Image Run-Length Encoding Using Data Order
by Markus Holzer, Martib Kutrib, Markus Holzer, Martin Kutrib, Martin Kutrib — 2001
….informatik.uni-giessen.de Institut f ur Informatik Improving Raster Image Run-Length Encoding Using Data Order Markus Holzer Martin…
Add To MetaCart

Grammar systems with negated conditions in their cooperation protocols
by Henning Bordihn, Markus Holzer — JUCS
…@(email omitted);) Markus Holzer 1 (Departement d'I.R.O., Universite deMontreal, C.P. 6128, succ. Centre-Ville, Montreal…
Cited by 1 (1 self) – Add To MetaCart

Nondeterministic Descriptional Complexity of Regular Languages
by Markus Holzer, Markus Holzer, Martin Kutrib, Martin Kutrib — 2002 — International Journal of Foundations of Computer Science
….informatik.uni-giessen.de Institut f ur Informatik Nondeterministic Descriptional Complexity of Regular Languages Markus Holzer…
Cited by 8 (1 self) – Add To MetaCart

On deterministic finite automata and syntactic monoid size
by Markus Holzer, Barbara König — 2003 — Proceedings of the 7th International Conference on Developments in Language Theory, number 2710 in LNCS
…On Deterministic Finite Automata and Syntactic Monoid Size Markus Holzer and Barbara König…
Cited by 3 (1 self) – Add To MetaCart

Flip-Pushdown Automata: Nondeterminism is Better than Determinism
by Matkus Holzer, Markus Holzer, Martin Kutrib, Martin Kutrib — 2003 — IFIG Research Report 0301 ¡ ¢ Flip-Pushdown Automata – p.16/16
….informatik.uni-giessen.de Institut f ur Informatik Flip-Pushdown Automata: Nondeterminism is Better Than Determinism Markus Holzer…
Cited by 2 (0 self) – Add To MetaCart

On the Complexities of Linear LL(1) and LR(1) Grammars
by Markus Holzer, Klaus-Jörn Lange — 1993 — Proceedings of the 9th International Conference on Fundamentals of Computation Theory, Lecture Notes in Computer Science 710
…On the Complexities of Linear LL(1) and LR(1) Grammars Markus Holzer Klaus-Jorn Lange Fakultat…
Cited by 4 (1 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

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