Searching for authors named "Juraj Hromkovic" – sorted by Relevance.

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

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

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

Two Lower Bounds on Computational Complexity of Infinite Words
by Juraj Hromkovic, Juhani Karhumäki — 1996 — trends in formal languages, LNCS 1218
…Two Lower Bounds on Computational Complexity of Infinite Words Juraj Hromkovic + Institute…
Cited by 1 (0 self) – Add To MetaCart

Note on Optimal Gossiping in some Weak-Connected Graphs
by Juraj Hromkovic, Claus-dieter Jeschke, Burkhard Monien
…Note on Optimal Gossiping in some Weak-Connected Graphs Juraj Hromkovic , Claus-Dieter Jeschke…
Cited by 2 (0 self) – Add To MetaCart

On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks (Extended Abstract)
by Juraj Hromkovic, Extended Abstract, J. Hromkovic, R. Klasing, W. Unger, H. Wagener — 1995
…) J. Hromkovic 1 , K. Lory's 2;y , P. Kanarek 2; y , R. Klasing 3 , W. Unger 3 , H. Wagener 3;z 1 Institut fur Informatik und Praktische Mathematik, Christian-Albrechts-Universitat zu Kiel, D-24098 Kiel, Germany, E-Mail: jhr@informatik.uni-kiel.d400.de 2 University of Wroc/law, Institu…
Cited by 2 (1 self) – Add To MetaCart

Two Lower Bounds on Distributive Generation of Languages
by Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubska
…Two lower bounds on distributive generation of languages Juraj Hromkovic + Dept. of Mathematics…
Cited by 1 (1 self) – Add To MetaCart

Optimal Algorithms for Dissemination of Information in Some Interconnection Networks
by Juraj Hromkovic, Claus-dieter Jeschke, Burkhard Monien — 1992 — Proc. MFCS'90, Lecture Notes in Computer Science 452
…Optimal Algorithms for Dissemination of Information in Some Interconnection Networks Juraj…
Cited by 11 (7 self) – Add To MetaCart

Dissemination Of Information In Interconnection Networks (Broadcasting & Gossiping)
by Juraj Hromkovic, Ralf Klasing, Burkhard Monien, Regine Peine — 1996
… DISSEMINATION OF INFORMATION IN INTERCONNECTION NETWORKS (BROADCASTING & GOSSIPING) Juraj Hromkovic y , Ralf…
Cited by 83 (7 self) – Add To MetaCart

Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata
by Juraj Hromkovic, Sebastian Seibert, Thomas Wilke — 1997 — In STACS 97, Lecture Notes in Computer Science
… Automata Juraj Hromkovic ? and Sebastian Seibert ? and Thomas Wilke Institut fur Informatik und…
Cited by 4 (0 self) – Add To MetaCart

On Multipartition Communication Complexity (Extended Abstract)
by Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
…On Multipartition Communication Complexity # (Extended Abstract) Pavol Duri s 1,2 , Juraj…
Add To MetaCart

On Multi-Partition Communication Complexity
by Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger — 2001 — In Proc. of 18th Int. Symp. on Theoretical Aspects of Computer Science vol. 2010 of Springer Lecture Notes in Computer Science
…On Multi-Partition Communication Complexity Pavol ˇ Duriˇs Juraj Hromkovič Stasys Jukna Martin…
Add To MetaCart

Measures of Nondeterminism in Finite Automata
by Juraj Hromkovic, Juhani Karhumaki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert — 2000
…Measures of Nondeterminism in Finite Automata Juraj Hromkovic 1 y Juhani Karhumaki 2 y…
Cited by 3 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

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