( en | de | ru )

 

Disambiguation of "Hromkovic, Juraj"

Author of the publication

copydeleteadd this publication to your clipboard
Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits

, , , and . Inf. Comput., 96 (2): 168-178 (February 1992)

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 Mészáro

 

Other publications of authors with the same name

On the Power of Laconic Advice in Communication Complexity., and . SOFSEM, volume 9587 of Lecture Notes in Computer Science, page 161-170. Springer, (2016)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)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)Algorithmics - Is There Hope for a Unified Theory?. CSR, volume 6072 of Lecture Notes in Computer Science, page 181-194. Springer, (2010)Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (Extended Abstract).. FCT, volume 529 of Lecture Notes in Computer Science, page 240-247. Springer, (1991)Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems., , and . MFCS, volume 711 of Lecture Notes in Computer Science, page 495-505. Springer, (1993)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)The Computer Science Way of Thinking in Human History and Consequences for the Design of Computer Science Curricula., and . ISSEP, volume 10696 of Lecture Notes in Computer Science, page 3-11. Springer, (2017)Efficient Algorithms for the Spoonerism Problem., , , , and . FUN, volume 4475 of Lecture Notes in Computer Science, page 78-92. Springer, (2007)Stability of Approximation., , and . Handbook of Approximation Algorithms and Metaheuristics (1), Chapman and Hall/CRC, (2018)