( en | de | ru )

 

Disambiguation of "Hromkovic, Juraj"

Author of the publication

copydeleteadd this publication to your clipboard
Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating Machines.

, , and . Developments in Language Theory, page 314-325. World Scientific, Singapore, (1993)

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.

Juraj Kukolja

Juraj Kukolja

Juraj Böhm

Juraj Koza

Juraj Slovak

 

Other publications of authors with the same name

On the Power of One-Way Synchronized Alternating Machines with Small Space., , , , , and . Int. J. Found. Comput. Sci., 3 (1): 65-79 (1992)On the power of two-dimensional synchronized alternating finite automata.. Fundam. Informaticae, 15 (1): 90-98 (1991)On the Hardness of Reoptimization with Multiple Given Solutions., , and . Fundam. Informaticae, 110 (1-4): 59-76 (2011)Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata., , and . Fundam. Informaticae, 175 (1-4): 173-185 (2020)Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs., and . STACS, volume 1770 of Lecture Notes in Computer Science, page 145-156. Springer, (2000)On the Power of Laconic Advice in Communication Complexity., and . SOFSEM, volume 9587 of Lecture Notes in Computer Science, page 161-170. Springer, (2016)Knowing All Optimal Solutions Does Not Help for TSP Reoptimization., , and . Computation, Cooperation, and Life, volume 6610 of Lecture Notes in Computer Science, page 7-15. Springer, (2011)Improved Approximations for Hard Optimization Problems via Problem Instance Classification., , and . Rainbow of Computer Science, volume 6570 of Lecture Notes in Computer Science, page 3-19. Springer, (2011)Algorithmics - Is There Hope for a Unified Theory?. CSR, volume 6072 of Lecture Notes in Computer Science, page 181-194. Springer, (2010)Efficient Algorithms for the Spoonerism Problem., , , , and . FUN, volume 4475 of Lecture Notes in Computer Science, page 78-92. Springer, (2007)