Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Juraj Hromkovic
2010 – today
- 2013
[c80]Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen: On the Advice Complexity of the Online L(2, 1)-Coloring Problem on Paths and Cycles. COCOON 2013: 53-64- [c79]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock: The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. COCOON 2013: 493-505
- 2012
- [b9]Juraj Hromkovic: Einführung in die Programmierung mit LOGO - Lehrbuch für Unterricht und Selbststudium (2. Aufl.). Vieweg+Teubner 2012, ISBN 978-3-8348-1852-2, pp. 1-271
- [j77]Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen: Steiner tree reoptimization in graphs with sharpened triangle inequality. J. Discrete Algorithms 11: 73-86 (2012)
- [j76]Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada: On the approximability and hardness of minimum topic connected overlay and its special instances. Theor. Comput. Sci. 429: 144-154 (2012)
- [c78]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Richard Královic, Peter Rossmanith: On the Power of Randomness versus Advice in Online Computation. Languages Alive 2012: 30-43
- [c77]Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller: Online Coloring of Bipartite Graphs with and without Advice. COCOON 2012: 519-530
- [c76]Juraj Hromkovic, Rastislav Královic, Richard Královic, Richard Stefanec: Determinism vs. Nondeterminism for Two-Way Automata - Representing the Meaning of States by Logical Formulæ. Developments in Language Theory 2012: 24-39
- [i9]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock: The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. Electronic Colloquium on Computational Complexity (ECCC) 19: 162 (2012)
- 2011
- [j75]Hans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock: On the Hardness of Reoptimization with Multiple Given Solutions. Fundam. Inform. 110(1-4): 59-76 (2011)
- [j74]D. Frank Hsu, Bruce M. Maggs, Howard C. T. Ho, Juraj Hromkovic, Francis C. M. Lau, Friedhelm Meyer auf der Heide: Editorial. Journal of Interconnection Networks 12(1-2) (2011)
- [j73]Juraj Hromkovic, Lucia Keller, Dennis Komm, Giovanni Serafini, Björn Steffen: Fehlerkorrigierende Codes - Ein Unterrichtsbeispiel zum gelenkten entdeckenden Lernen. LOG IN 31(168): 50-55 (2011)
- [j72]Juraj Hromkovic, Georg Schnitger: Ambiguity and Communication. Theory Comput. Syst. 48(3): 517-534 (2011)
- [c75]Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke: Improved Approximations for Hard Optimization Problems via Problem Instance Classification. Rainbow of Computer Science 2011: 3-19
- [c74]Hans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock: Knowing All Optimal Solutions Does Not Help for TSP Reoptimization. Computation, Cooperation, and Life 2011: 7-15
- [c73]Juraj Hromkovic, Björn Steffen: Why Teaching Informatics in Schools Is as Important as Teaching Mathematics and Natural Sciences. ISSEP 2011: 21-30
- [c72]Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada: On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. MFCS 2011: 376-387
- [e5]Ivana Cerná, Tibor Gyimóthy, Juraj Hromkovic, Keith G. Jeffery, Rastislav Královic, Marko Vukolic, Stefan Wolf (Eds.): SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings. Lecture Notes in Computer Science 6543, Springer 2011, ISBN 978-3-642-18380-5
- [i8]Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada: On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances. CoRR abs/1107.2443 (2011)
- 2010
- [j71]
- [j70]Juraj Hromkovic, Georg Schnitger: On probabilistic pushdown automata. Inf. Comput. 208(8): 982-995 (2010)
- [c71]Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen: The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality. CIAC 2010: 180-191
- [c70]
- [c69]Juraj Hromkovic, Rastislav Královic, Richard Královic: Information Complexity of Online Problems. MFCS 2010: 24-36
- [e4]Juraj Hromkovic, Richard Královic, Jan Vahrenhold (Eds.): Teaching Fundamentals Concepts of Informatics, 4th International Conference on Informatics in Secondary Schools - Evolution and Perspectives, ISSEP 2010, Zurich, Switzerland, January 13-15, 2010. Proceedings. Lecture Notes in Computer Science 5941, Springer 2010, ISBN 978-3-642-11375-8
2000 – 2009
- 2009
- [b8]Juraj Hromkovic: Algorithmic Adventures - From Knowledge to Magic. Springer 2009, ISBN 978-3-540-85985-7, pp. I-XIII, 1-363
- [b7]Juraj Hromkovic: Sieben Wunder der Informatik - Eine Reise an die Grenze des Machbaren mit Aufgaben und Lösungen (2. Aufl.). Teubner 2009, ISBN 978-3-8351-0172-2, pp. I-XV, 1-360
- [j69]Juraj Hromkovic, Georg Schnitger: Lower Bounds on the Size of Sweeping Automata. Journal of Automata, Languages and Combinatorics 14(1): 23-31 (2009)
- [j68]Juraj Hromkovic, Przemyslawa Kanarek, Ralf Klasing, Krzysztof Lorys, Walter Unger, Hubert Wagener: On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. SIAM J. Discrete Math. 23(3): 1612-1645 (2009)
- [j67]Juraj Hromkovic, Holger Petersen, Georg Schnitger: On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's. Theor. Comput. Sci. 410(30-32): 2972-2981 (2009)
- [j66]Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Rossmanith: Reoptimization of Steiner trees: Changing the terminal set. Theor. Comput. Sci. 410(36): 3428-3435 (2009)
- [c68]
- [i7]
- 2008
- [b6]Juraj Hromkovic: Lehrbuch Informatik - Vorkurs Programmieren, Geschichte und Begriffsbildung, Automatenentwurf. Vieweg 2008, ISBN 978-3-8348-0620-8, pp. 1-512
- [j65]Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger: On k-connectivity problems with sharpened triangle inequality. J. Discrete Algorithms 6(4): 605-617 (2008)
- [c67]Juraj Hromkovic, Georg Schnitger: On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes. Developments in Language Theory 2008: 34-55
- [c66]Karin Freiermuth, Juraj Hromkovic, Björn Steffen: Creating and Testing Textbooks for Secondary Schools. ISSEP 2008: 216-228
- [c65]Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer: On the Hardness of Reoptimization. SOFSEM 2008: 50-65
- [c64]Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych: Reoptimization of Steiner Trees. SWAT 2008: 258-269
- 2007
- [j64]Juraj Hromkovic, Tobias Mömke, Kathleen Steinhöfel, Peter Widmayer: Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. Algorithmic Operations Research 2(1) (2007)
- [j63]Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer: On the Approximability of TSP on Local Modifications of Optimally Solved Instances. Algorithmic Operations Research 2(2): 83-93 (2007)
- [j62]Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke: The Parameterized Approximability of TSP with Deadlines. Theory Comput. Syst. 41(3): 431-444 (2007)
- [j61]Juraj Hromkovic, Georg Schnitger: Comparing the size of NFAs with and without epsilon-transitions. Theor. Comput. Sci. 380(1-2): 100-114 (2007)
- [c63]Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel: Efficient Algorithms for the Spoonerism Problem. FUN 2007: 78-92
- [e3]Juraj Hromkovic, Richard Královic, Marc Nunkesser, Peter Widmayer (Eds.): Stochastic Algorithms: Foundations and Applications, 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings. Lecture Notes in Computer Science 4665, Springer 2007, ISBN 978-3-540-74870-0
- 2006
- [b5]Juraj Hromkovic: Sieben Wunder der Informatik - eine Reise an die Grenze des Machbaren mit Aufgaben und Lösungen. Teubner 2006, ISBN 978-3-8351-0078-7, pp. I-XIII, 1-354
- [j60]Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert: On the Stability of Approximation for Hamiltonian Path Problems. Algorithmic Operations Research 1(1) (2006)
- [c62]Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer: Reusing Optimal TSP Solutions for Locally Modified Input Instances. IFIP TCS 2006: 251-270
- [c61]
- [c60]Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke: On the Approximation Hardness of Some Generalizations of TSP. SWAT 2006: 184-195
- 2005
- [b4]Juraj Hromkovic, Ralf Klasing, Andrzej Pelc, Peter Ruzicka, Walter Unger: Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Texts in Theoretical Computer Science. An EATCS Series, Springer 2005, ISBN 978-3-540-00846-0
- [j59]Juraj Hromkovic, Georg Schnitger: On the power of randomized multicounter machines. Theor. Comput. Sci. 330(1): 135-144 (2005)
- [c59]Juraj Hromkovic, Georg Schnitger: Communication Complexity Method for Proving Lower Bounds on Descriptional Complexity in Automata and Formal Language Theory. DCFS 2005: 38-38
- [c58]
- [c57]Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert: On the Stability of Approximation for Hamiltonian Path Problems. SOFSEM 2005: 147-156
- 2004
- [j58]Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger: On multi-partition communication complexity. Inf. Comput. 194(1): 49-75 (2004)
- [j57]Pavol Duris, Juraj Hromkovic, Katsushi Inoue: On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata. J. Comput. Syst. Sci. 68(3): 675-699 (2004)
- [j56]Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger: On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Theor. Comput. Sci. 326(1-3): 137-153 (2004)
- [c56]
- [e2]Juraj Hromkovic, Manfred Nagl, Bernhard Westfechtel (Eds.): Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers. Lecture Notes in Computer Science 3353, Springer 2004, ISBN 3-540-24132-9
- 2003
- [j55]Juraj Hromkovic, Martin Sauerhoff: The Power of Nondeterminism and Randomness for Oblivious Branching Programs. Theory Comput. Syst. 36(2): 159-182 (2003)
- [j54]Juraj Hromkovic, Georg Schnitger: Nondeterministic Communication with a Limited Number of Advice Bits. SIAM J. Comput. 33(1): 43-68 (2003)
- [c55]Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger: On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. CIAC 2003: 189-200
- [c54]Juraj Hromkovic, Georg Schnitger: Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes. ICALP 2003: 66-80
- [c53]Juraj Hromkovic, Georg Schnitger: Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation. ICALP 2003: 439-451
- 2002
- [j53]Juraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger: Communication Complexity Method for Measuring Nondeterminism in Finite Automata. Inf. Comput. 172(2): 202-217 (2002)
- [j52]Juraj Hromkovic: Descriptional Complexity of Finite Automata: Concepts and Open Problems. Journal of Automata, Languages and Combinatorics 7(4): 519-531 (2002)
- [j51]Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger: Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Theor. Comput. Sci. 285(1): 3-24 (2002)
- [c52]Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger: On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. FSTTCS 2002: 59-70
- 2001
- [b3]Juraj Hromkovic: Algorithmics for hard problems - introduction to combinatorial optimization, randomization, approximation, and heuristics. Springer 2001, ISBN 978-3-540-66860-2, pp. I-XI, 1-492
- [b2]Juraj Hromkovic: Algorithmischen Konzepte der Informatik - Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kryptographie. Teubner 2001, ISBN 3-519-00332-5
- [j50]
- [j49]Juraj Hromkovic, Georg Schnitger: On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata. Inf. Comput. 169(2): 284-296 (2001)
- [j48]Juraj Hromkovic, Sebastian Seibert, Thomas Wilke: Translating Regular Expressions into Small -Free Nondeterministic Finite Automata. J. Comput. Syst. Sci. 62(4): 565-588 (2001)
- [j47]
- [j46]Juraj Hromkovic, Georg Schnitger: On the power of Las Vegas II: Two-way finite automata. Theor. Comput. Sci. 262(1): 1-24 (2001)
- [j45]Rusins Freivalds, Juraj Hromkovic, Gheorghe Paun, Walter Unger: Foreword. Theor. Comput. Sci. 264(1): 1-2 (2001)
- [c51]Juraj Hromkovic: Descriptional Complexity of Regular Languages (Concepts and Open Problems). DCFS 2001: 11-13
- [c50]Juraj Hromkovic, Georg Schnitger: On the Power of Randomized Pushdown Automata. Developments in Language Theory 2001: 262-271
- [c49]Juraj Hromkovic, Kathleen Steinhöfel, Peter Widmayer: Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. ICTCS 2001: 90-106
- [c48]
- [c47]Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger: On Multipartition Communication Complexity. STACS 2001: 206-217
- [i6]Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger: On Multipartition Communication Complexity. Electronic Colloquium on Computational Complexity (ECCC) 8(066) (2001)
- 2000
- [j44]Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger: Approximation algorithms for the TSP with sharpened triangle inequality. Inf. Process. Lett. 75(3): 133-138 (2000)
- [c46]Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger: Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. CIAC 2000: 72-86
- [c45]Pavol Duris, Juraj Hromkovic, Katsushi Inoue: A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition. IEEE Conference on Computational Complexity 2000: 214-228
- [c44]Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert: Measures of Nondeterminism in Finite Automata. ICALP 2000: 199-210
- [c43]Juraj Hromkovic, Ingo Wegener: Introduction: Workshop on Boolean Functions and Applications. ICALP Satellite Workshops 2000: 227-228
- [c42]Juraj Hromkovic, Martin Sauerhoff: Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs. STACS 2000: 145-156
- [c41]Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger: An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. STACS 2000: 382-394
- [i5]Pavol Duris, Juraj Hromkovic, Katsushi Inoue: A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition. Electronic Colloquium on Computational Complexity (ECCC) 7(27) (2000)
- [i4]Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert: Measures of Nondeterminism in Finite Automata. Electronic Colloquium on Computational Complexity (ECCC) 7(76) (2000)
1990 – 1999
- 1999
- [j43]Juraj Hromkovic: Some Constributions of the Study of Abstract Communication Complexity to Other Areas of Computer Science. ACM Comput. Surv. 31(3es): 8 (1999)
- [j42]Juraj Hromkovic: Communication complexity and lower bounds on multilective computations. ITA 33(2): 193-212 (1999)
- [c40]Juraj Hromkovic: Stability of Approximation Algorithms and the Knapsack Problem. Jewels are Forever 1999: 238-249
- [c39]Juraj Hromkovic, Georg Schnitger: On the Power of Las Vegas II. Two-Way Finite Automata. ICALP 1999: 433-442
- [c38]Juraj Hromkovic: Stability of Approximation Algorithms for Hard Optimization Problems. SOFSEM 1999: 29-47
- [i3]Juraj Hromkovic, Georg Schnitger: On the Power of Las Vegas II: Two-Way Finite Automata. Electronic Colloquium on Computational Complexity (ECCC) 6(7) (1999)
- [i2]Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger: Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. Electronic Colloquium on Computational Complexity (ECCC) 6(31) (1999)
- 1998
- [j41]Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Juraj Waczulík, Hubert Wagener: Effective Systolic Algorithms for Gossiping in Cycles. Parallel Processing Letters 8(2): 197-205 (1998)
- [c37]Juraj Hromkovic: Communication Complexity and Lower Bounds on Multilective Computations. MFCS 1998: 789-797
- [e1]Juraj Hromkovic, Ondrej Sýkora (Eds.): Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings. Lecture Notes in Computer Science 1517, Springer 1998, ISBN 3-540-65195-0
- 1997
- [b1]Juraj Hromkovic: Communication complexity and parallel computing. Texts in theoretical computer science, Springer 1997, ISBN 978-3-540-57459-0, pp. I-X, 1-336
- [j40]Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener: Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes. Inf. Comput. 133(1): 1-33 (1997)
- [c36]Juraj Hromkovic, Juhani Karhumäki: Two Lower Bounds on Computational Complexity of Infinite Words. New Trends in Formal Languages 1997: 366-376
- [c35]Juraj Hromkovic, Georg Schnitger: Communication Complexity and Sequential Compuation. MFCS 1997: 71-84
- [c34]Juraj Hromkovic, Sebastian Seibert, Thomas Wilke: Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. STACS 1997: 55-66
- [c33]Pavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger: Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations. STACS 1997: 117-128
- [i1]Pavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger: On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations. Electronic Colloquium on Computational Complexity (ECCC) 4(29) (1997)
- 1996
- [j39]Juraj Hromkovic, Ralf Klasing, Elena Stöhr: Dissemination of Information in Vertex-Disjoint Paths Mode. Computers and Artificial Intelligence 15(4) (1996)
- [j38]Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská: Two Lower Bounds on Distributive Generation of Languages. Fundam. Inform. 25(3): 271-284 (1996)
- [j37]Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger: A Comparison of Two Lower-Bound Methods for Communication Complexity. Theor. Comput. Sci. 168(1): 39-51 (1996)
- [c32]Juraj Hromkovic, Georg Schnitger: Nondeterministic Communication with a Limited Number of Advice Bits. STOC 1996: 551-560
- 1995
- [j36]Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto: On Embeddings in Cycles. Inf. Comput. 118(2): 302-305 (1995)
- [j35]Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener: Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. Inf. Comput. 123(1): 17-28 (1995)
- [j34]Xaver Gubás, Juraj Hromkovic, Juraj Waczulík: A Nonlinear Lower Bound on the Practical Combinational Complexity. Theor. Comput. Sci. 143(2): 335-342 (1995)
- [c31]Juraj Hromkovic: On the Communication Complexity of Distributive Language Generation. Developments in Language Theory 1995: 237-246
- [c30]Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Walter Unger, Juraj Waczulík, Hubert Wagener: Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract). FCT 1995: 273-282
- [c29]Juraj Hromkovic, Krzysztof Lorys, Przemyslawa Kanarek, Ralf Klasing, Walter Unger, Hubert Wagener: On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. STACS 1995: 255-266
- 1994
- [j33]Rainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz: Optimal algorithms for dissemination of information in generalized communication modes. Discrete Applied Mathematics 53(1-3): 55-78 (1994)
- [j32]Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská: The Complexity of Systolic Dissemination of Information in Interconnection Networks. ITA 28(3-4): 303-342 (1994)
- [j31]Juraj Hromkovic, Jarkko Kari, Lila Kari: Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems. Theor. Comput. Sci. 127(1): 123-147 (1994)
- [j30]Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien: Note on Optimal Gossiping in Some Weak-Connected Graphs. Theor. Comput. Sci. 127(2): 395-402 (1994)
- [j29]Juraj Hromkovic, Branislav Rovan, Anna Slobodová: Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines. Theor. Comput. Sci. 132(2): 319-336 (1994)
- [c28]Juraj Hromkovic, Juhani Karhumäki, Arto Lepistö: Comparing Descriptional and Computational Complexity of Infinite Words. Results and Trends in Theoretical Computer Science 1994: 169-182
- [c27]Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská: The Complexity of Systolic Dissemination of Information in Interconnection Networks. Canada-France Conference on Parallel and Distributed Computing 1994: 235-249
- [c26]Juraj Hromkovic, Juhani Karhumäki: Two Lower Bounds on Computational Complexity of Infinite Word Generation. IFIP Congress (1) 1994: 479-484
- [c25]Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger: A Comparison of Two Lower Bound Methods for Communication Complexity. MFCS 1994: 326-335
- [c24]Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská: Two Lower Bounds on Distributive Generation of Languages. MFCS 1994: 423-432
- [c23]Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener: Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract). SWAT 1994: 219-230
- 1993
- [j28]Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien: Optimal Algorithms for Dissemination of Information in Some Interconnection Networks. Algorithmica 10(1): 24-40 (1993)
- [j27]Juraj Hromkovic, Katsushi Inoue: A Note on Realtime One-Way Synchronized Alternating One-Counter Automata. Theor. Comput. Sci. 108(2): 393-400 (1993)
- [c22]Juraj Hromkovic, Branislav Rovan, Anna Slobodová: Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating Machines. Developments in Language Theory 1993: 314-325
- [c21]Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener: Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. ESA 1993: 200-211
- [c20]Juraj Hromkovic, Jarkko Kari, Lila Kari: Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems. MFCS 1993: 495-505
- [c19]Juraj Hromkovic, Ralf Klasing, Elena Stöhr: Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks. WG 1993: 288-300
- 1992
- [j26]Juraj Hromkovic, Matthias Krause, Christoph Meinel, Stephan Waack: Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits. Inf. Comput. 96(2): 168-178 (1992)
- [j25]Juraj Hromkovic, Katsushi Inoue, Branislav Rovan, Anna Slobodová, Itsuo Takanami, Klaus W. Wagner: On the Power of One-Way Synchronized Alternating Machines with Small Space. Int. J. Found. Comput. Sci. 3(1): 65-79 (1992)
- [j24]Juraj Hromkovic, Jozef Kelemen, Juraj Waczulík: Abstract symbol systems - an exercise of the bottom-up approach in artificial intelligence. J. Exp. Theor. Artif. Intell. 4(1): 49-58 (1992)
- [j23]Juraj Hromkovic, Sergej A. Lozkin, Andrej I. Rybko, Alexander A. Sapozhenko, Nadezda A. Skalikova: Lower Bounds on the Area Complexity of Boolean Circuits. Theor. Comput. Sci. 97(2): 285-300 (1992)
- [c18]Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto: On Embedding Interconnection Networks into Rings of Processors. PARLE 1992: 53-62
- [c17]Rainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz: Optimal Algorithms for Disemination of Information in Generalized Communication Modes. PARLE 1992: 115-130
- [c16]Xaver Gubás, Juraj Hromkovic, Juraj Waczulík: A Nonlinear Lower Bound on the Practical Combinational Complexity. STACS 1992: 293-302
- [c15]Juraj Hromkovic: Topology of Parallel Networks and Computational Complexity (Extended Abstract). WG 1992: 70-77
- 1991
- [j22]Juraj Hromkovic, Juhani Karhumäki, Branislav Rovan, Anna Slobodová: On the power of synchronization in parallel computations. Discrete Applied Mathematics 32(2): 155-182 (1991)
- [j21]Juraj Hromkovic, Ladislav Janiga, Václav Koubek: Variable Multihead Machines. Elektronische Informationsverarbeitung und Kybernetik 27(8): 411-424 (1991)
- [j20]Juraj Hromkovic: On the power of two-dimensional synchronized alternating finite automata. Fundam. Inform. 15(1): 90-98 (1991)
- [j19]Juraj Hromkovic: Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators. Inf. Comput. 95(2): 117-128 (1991)
- [j18]Juraj Hromkovic: On Problems for Which no Oracle Can Help. Mathematical Systems Theory 24(1): 41-52 (1991)
- [c14]Juraj Hromkovic: Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (Extended Abstract). FCT 1991: 240-247
- [c13]Juraj Hromkovic, Burkhard Monien: The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). MFCS 1991: 211-220
- 1990
- [c12]Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien: Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract). MFCS 1990: 337-346
1980 – 1989
- 1989
- [j17]Juraj Hromkovic: The knowledge on information content of problems provides much useful information to circuit designers. Bulletin of the EATCS 39: 154-170 (1989)
- [j16]Juraj Hromkovic, Katsushi Inoue, Itsuo Takanami: Lower Bounds for Language Recognition on Two-Dimensional Alternating Multihead Machines. J. Comput. Syst. Sci. 38(3): 431-451 (1989)
- [j15]Juraj Hromkovic: Tradeoffs for Language Recognition on Alternating Machines. Theor. Comput. Sci. 63(2): 203-221 (1989)
- [j14]Katsushi Inoue, Itsuo Takanami, Juraj Hromkovic: A Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines. Theor. Comput. Sci. 67(1): 99-110 (1989)
- [c11]Jürgen Dassow, Juraj Hromkovic, Juhani Karhumäki, Branislav Rovan, Anna Slobodová: On the Power of Synchronization in Parallel Computations. MFCS 1989: 196-206
- 1988
- [j13]Juraj Hromkovic: A candidate for nonlinear lower bound on the combinatorial complexity. Bulletin of the EATCS 36: 126-128 (1988)
- [j12]Juraj Hromkovic, Erika Kupková: Graph Controlled Table Lindenmayer Systems. Elektronische Informationsverarbeitung und Kybernetik 24(10): 481-493 (1988)
- [j11]Juraj Hromkovic: The Advantages of a New Approach to Defining the Communication Complexity for VLSI. Theor. Comput. Sci. 57: 91-111 (1988)
- [c10]Juraj Hromkovic, Juraj Procházka: Branching Programs as a Tool for Proving Lower Bounds on VLSI Computations and Optimal Algorithms for Systolic Arrays. MFCS 1988: 360-370
- 1987
- [j10]Juraj Hromkovic: Reversal-Bounded Nondeterministic Multicounter Machines and Complementation. Theor. Comput. Sci. 51: 325-330 (1987)
- [c9]
- 1986
- [j9]
- [c8]Juraj Hromkovic: Tradeoffs for Language Recognition on Parallel Computing Models. ICALP 1986: 157-166
- [c7]
- [c6]
- 1985
- [j8]Juraj Hromkovic: Fooling a Two-Way Nondeterministic Multihead Automaton with Reversal Number Restriction. Acta Inf. 22(5): 589-594 (1985)
- [j7]Juraj Hromkovic: Alternating Multicounter Machines with Constant Number of Reversals. Inf. Process. Lett. 21(1): 7-9 (1985)
- [j6]Juraj Hromkovic: Linear Lower Bounds on Unbounded Fan-In Boolean Circuits. Inf. Process. Lett. 21(2): 71-74 (1985)
- [j5]Juraj Hromkovic: On the Power of Alternation in Automata Theory. J. Comput. Syst. Sci. 31(1): 28-39 (1985)
- 1984
- [j4]Juraj Hromkovic: A note on the "Comuunication Complexity" paper by Papadimitriou and Sipser. Bulletin of the EATCS 22: 20 (1984)
- [j3]
- [c5]
- [c4]Juraj Hromkovic: Hierarchy of Reversal and Zerotesting Bounded Multicounter Machines. MFCS 1984: 312-321
- [c3]
- 1983
- [j2]
- [j1]Pavol Duris, Juraj Hromkovic: One-Way Simple Multihead Finite Automata are not Closed Under Concatenation. Theor. Comput. Sci. 27: 121-125 (1983)
- 1982
- [c2]Pavol Duris, Juraj Hromkovic: Multihead Finite State Automata and Concatenation. ICALP 1982: 176-186
- 1981
- [c1]Juraj Hromkovic: Closure Properties of the Family of Languages Recognized by One-Way Two-Head Deterministic Finite State Automata. MFCS 1981: 304-313
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-23 22:16 CEST by the dblp team