( en | de | ru )

 

Disambiguation of "Geffert, Viliam"

Author of the publication

copydeleteadd this publication to your clipboard
Complement for two-way alternating automata.

, , and . Acta Informatica, 58 (5): 463-495 (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michael Geffert

Martin Geffert

Robert Geffert

Heinrich Geffert

Bruno Geffert

 

Other publications of authors with the same name

Nondeterministic Computations in Sublogarithmic Space and Space Constructibility.. SIAM J. Comput., 20 (3): 484-498 (1991)How to Generate Languages Using Only Two Pairs of Parentheses.. Elektronische Informationsverarbeitung und Kybernetik, 27 (5/6): 303-315 (1991)Hyper-Minimizing Minimized Deterministic Automata., , and . AFL, page 9-30. (2008)One Pebble Versus log(n) Bits., , and . NCMA, volume 256 of books@ocg.at, page 121-134. Austrian Computer Society, (2009)Linear-Time In-Place Selection with epsilon.n Element Moves., and . Comput. Artif. Intell., 25 (4): 333-350 (2006)Asymptotically efficient in-place merging., , and . Theor. Comput. Sci., 237 (1-2): 159-181 (2000)Unary Coded PSPACE-Complete Languages in ASPACE(loglog n).. Theory Comput. Syst., 63 (4): 688-714 (2019)Unary Coded PSPACE-Complete Languages in ASPACE(loglog n).. CSR, volume 10304 of Lecture Notes in Computer Science, page 141-153. Springer, (2017)Normal forms for phrase-structure grammars.. RAIRO Theor. Informatics Appl., (1991)Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata., and . MFCS (1), volume 8634 of Lecture Notes in Computer Science, page 291-302. Springer, (2014)