The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Juraj Hromkovic: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Juraj Hromkovic
    Stability of Approximation Algorithms and the Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:238-249 [Conf]
  2. Juraj Hromkovic, Juhani Karhumäki
    Two Lower Bounds on Computational Complexity of Infinite Words. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:366-376 [Conf]
  3. Juraj Hromkovic, Juhani Karhumäki, Arto Lepistö
    Comparing Descriptional and Computational Complexity of Infinite Words. [Citation Graph (0, 0)][DBLP]
    Results and Trends in Theoretical Computer Science, 1994, pp:169-182 [Conf]
  4. Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská
    The Complexity of Systolic Dissemination of Information in Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Canada-France Conference on Parallel and Distributed Computing, 1994, pp:235-249 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:189-200 [Conf]
  6. 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. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:72-86 [Conf]
  7. Pavol Duris, Juraj Hromkovic, Katsushi Inoue
    A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:214-228 [Conf]
  8. Juraj Hromkovic
    On the Communication Complexity of Distributive Language Generation. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:237-246 [Conf]
  9. Juraj Hromkovic, Branislav Rovan, Anna Slobodová
    Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating Machines. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1993, pp:314-325 [Conf]
  10. Juraj Hromkovic, Georg Schnitger
    On the Power of Randomized Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:262-271 [Conf]
  11. Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener
    Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:200-211 [Conf]
  12. Juraj Hromkovic
    Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:240-247 [Conf]
  13. 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). [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:273-282 [Conf]
  14. 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. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:59-70 [Conf]
  15. Pavol Duris, Juraj Hromkovic
    Multihead Finite State Automata and Concatenation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:176-186 [Conf]
  16. Juraj Hromkovic
    Communication Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:235-246 [Conf]
  17. Juraj Hromkovic
    Tradeoffs for Language Recognition on Parallel Computing Models. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:157-166 [Conf]
  18. Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert
    Measures of Nondeterminism in Finite Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:199-210 [Conf]
  19. Juraj Hromkovic, Georg Schnitger
    Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:66-80 [Conf]
  20. Juraj Hromkovic, Georg Schnitger
    Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:439-451 [Conf]
  21. Juraj Hromkovic, Georg Schnitger
    NFAs With and Without epsilon-Transitions. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:385-396 [Conf]
  22. Juraj Hromkovic, Georg Schnitger
    On the Power of Las Vegas II. Two-Way Finite Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:433-442 [Conf]
  23. Juraj Hromkovic, Ingo Wegener
    Introduction: Workshop on Boolean Functions and Applications. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:227-228 [Conf]
  24. Juraj Hromkovic, Kathleen Steinhöfel, Peter Widmayer
    Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:90-106 [Conf]
  25. Juraj Hromkovic, Juhani Karhumäki
    Two Lower Bounds on Computational Complexity of Infinite Word Generation. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1994, pp:479-484 [Conf]
  26. Juraj Hromkovic
    Stability of Approximation in Discrete Optimization. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:3-18 [Conf]
  27. Juraj Hromkovic
    Lower bound techniques for VLSI algorithms. [Citation Graph (0, 0)][DBLP]
    IMYCS, 1986, pp:2-25 [Conf]
  28. Juraj Hromkovic
    Contributing to General Education by Teaching Informatics. [Citation Graph (0, 0)][DBLP]
    ISSEP, 2006, pp:25-37 [Conf]
  29. Jürgen Dassow, Juraj Hromkovic, Juhani Karhumäki, Branislav Rovan, Anna Slobodová
    On the Power of Synchronization in Parallel Computations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:196-206 [Conf]
  30. Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger
    A Comparison of Two Lower Bound Methods for Communication Complexity. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:326-335 [Conf]
  31. Juraj Hromkovic
    Closure Properties of the Family of Languages Recognized by One-Way Two-Head Deterministic Finite State Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1981, pp:304-313 [Conf]
  32. Juraj Hromkovic
    Hierarchy of Reversal and Zerotesting Bounded Multicounter Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:312-321 [Conf]
  33. Juraj Hromkovic
    On the Power of Alternation in Finite Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:322-329 [Conf]
  34. Juraj Hromkovic
    A New Approach to Defining the Complexity for VLSI. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:431-439 [Conf]
  35. Juraj Hromkovic
    Communication Complexity and Lower Bounds on Multilective Computations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:789-797 [Conf]
  36. Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien
    Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:337-346 [Conf]
  37. Juraj Hromkovic, Jarkko Kari, Lila Kari
    Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:495-505 [Conf]
  38. Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská
    Two Lower Bounds on Distributive Generation of Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:423-432 [Conf]
  39. Juraj Hromkovic, Burkhard Monien
    The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:211-220 [Conf]
  40. Juraj Hromkovic, Juraj Procházka
    Branching Programs as a Tool for Proving Lower Bounds on VLSI Computations and Optimal Algorithms for Systolic Arrays. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:360-370 [Conf]
  41. Juraj Hromkovic, Georg Schnitger
    Communication Complexity and Sequential Compuation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:71-84 [Conf]
  42. Rainer Feldmann, Juraj Hromkovic, S. Madhavapeddy, Burkhard Monien, Peter Mysliwietz
    Optimal Algorithms for Disemination of Information in Generalized Communication Modes. [Citation Graph (0, 0)][DBLP]
    PARLE, 1992, pp:115-130 [Conf]
  43. Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto
    On Embedding Interconnection Networks into Rings of Processors. [Citation Graph (0, 0)][DBLP]
    PARLE, 1992, pp:53-62 [Conf]
  44. Juraj Hromkovic
    Randomized Communication Protocols (A Survey). [Citation Graph (0, 0)][DBLP]
    SAGA, 2001, pp:1-32 [Conf]
  45. Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert
    On the Stability of Approximation for Hamiltonian Path Problems. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:147-156 [Conf]
  46. Juraj Hromkovic
    Stability of Approximation Algorithms for Hard Optimization Problems. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1999, pp:29-47 [Conf]
  47. 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. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:382-394 [Conf]
  48. Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
    On Multipartition Communication Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:206-217 [Conf]
  49. 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. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:117-128 [Conf]
  50. Xaver Gubás, Juraj Hromkovic, Juraj Waczulík
    A Nonlinear Lower Bound on the Practical Combinational Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:293-302 [Conf]
  51. Juraj Hromkovic
    Reversal Complexity of Multicounter and Multihead Machines. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:159-168 [Conf]
  52. 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. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:255-266 [Conf]
  53. Juraj Hromkovic, Martin Sauerhoff
    Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:145-156 [Conf]
  54. Juraj Hromkovic, Sebastian Seibert, Thomas Wilke
    Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:55-66 [Conf]
  55. Juraj Hromkovic, Georg Schnitger
    Nondeterministic Communication with a Limited Number of Advice Bits. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:551-560 [Conf]
  56. Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke
    On the Approximation Hardness of Some Generalizations of TSP. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:184-195 [Conf]
  57. Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener
    Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:219-230 [Conf]
  58. Juraj Hromkovic, Ralf Klasing, Elena Stöhr
    Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:288-300 [Conf]
  59. Juraj Hromkovic
    Topology of Parallel Networks and Computational Complexity (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1992, pp:70-77 [Conf]
  60. Juraj Hromkovic
    On-Way Multihead Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:377-384 [Journal]
  61. Juraj Hromkovic
    Fooling a Two-Way Nondeterministic Multihead Automaton with Reversal Number Restriction. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1985, v:22, n:5, pp:589-594 [Journal]
  62. Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien
    Optimal Algorithms for Dissemination of Information in Some Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:10, n:1, pp:24-40 [Journal]
  63. Juraj Hromkovic, Ralf Klasing, Elena Stöhr
    Dissemination of Information in Vertex-Disjoint Paths Mode. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 1996, v:15, n:4, pp:- [Journal]
  64. Juraj Hromkovic
    Some Constributions of the Study of Abstract Communication Complexity to Other Areas of Computer Science. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1999, v:31, n:3es, pp:8- [Journal]
  65. Rainer Feldmann, Juraj Hromkovic, S. Madhavapeddy, Burkhard Monien, Peter Mysliwietz
    Optimal algorithms for dissemination of information in generalized communication modes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:55-78 [Journal]
  66. Juraj Hromkovic, Ondrej Sýkora
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:1-2 [Journal]
  67. Juraj Hromkovic
    On the power of Yao-Rivest technique. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1984, v:23, n:, pp:33-34 [Journal]
  68. Juraj Hromkovic
    A note on the "Comuunication Complexity" paper by Papadimitriou and Sipser. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1984, v:22, n:, pp:20- [Journal]
  69. Juraj Hromkovic
    A candidate for nonlinear lower bound on the combinatorial complexity. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:36, n:, pp:126-128 [Journal]
  70. Juraj Hromkovic
    The knowledge on information content of problems provides much useful information to circuit designers. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1989, v:39, n:, pp:154-170 [Journal]
  71. Pavol Duris, Juraj Hromkovic, Katsushi Inoue
    A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:27, pp:- [Journal]
  72. Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert
    Measures of Nondeterminism in Finite Automata [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:76, pp:- [Journal]
  73. Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
    On Multipartition Communication Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:066, pp:- [Journal]
  74. 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 [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:29, pp:- [Journal]
  75. 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 [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:31, pp:- [Journal]
  76. Juraj Hromkovic, Ladislav Janiga, Václav Koubek
    Variable Multihead Machines. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1991, v:27, n:8, pp:411-424 [Journal]
  77. Juraj Hromkovic, Erika Kupková
    Graph Controlled Table Lindenmayer Systems. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1988, v:24, n:10, pp:481-493 [Journal]
  78. Juraj Hromkovic
    On the power of two-dimensional synchronized alternating finite automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1991, v:15, n:1, pp:90-98 [Journal]
  79. Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská
    Two Lower Bounds on Distributive Generation of Languages. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:25, n:3, pp:271-284 [Journal]
  80. Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
    On multi-partition communication complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:194, n:1, pp:49-75 [Journal]
  81. Juraj Hromkovic
    Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:95, n:2, pp:117-128 [Journal]
  82. Juraj Hromkovic, Matthias Krause, Christoph Meinel, Stephan Waack
    Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:96, n:2, pp:168-178 [Journal]
  83. Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener
    Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:123, n:1, pp:17-28 [Journal]
  84. Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener
    Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:133, n:1, pp:1-33 [Journal]
  85. Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto
    On Embeddings in Cycles [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:118, n:2, pp:302-305 [Journal]
  86. Juraj Hromkovic, Georg Schnitger
    On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:169, n:2, pp:284-296 [Journal]
  87. Juraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger
    Communication Complexity Method for Measuring Nondeterminism in Finite Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:172, n:2, pp:202-217 [Journal]
  88. 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. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1992, v:3, n:1, pp:65-79 [Journal]
  89. Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
    Approximation algorithms for the TSP with sharpened triangle inequality. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:3, pp:133-138 [Journal]
  90. Juraj Hromkovic
    Alternating Multicounter Machines with Constant Number of Reversals. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:21, n:1, pp:7-9 [Journal]
  91. Juraj Hromkovic
    Linear Lower Bounds on Unbounded Fan-In Boolean Circuits. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:21, n:2, pp:71-74 [Journal]
  92. Juraj Hromkovic
    Communication complexity and lower bounds on multilective computations. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:2, pp:193-212 [Journal]
  93. Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská
    The Complexity of Systolic Dissemination of Information in Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    ITA, 1994, v:28, n:3-4, pp:303-342 [Journal]
  94. Juraj Hromkovic
    Descriptional Complexity of Finite Automata: Concepts and Open Problems. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:4, pp:519-531 [Journal]
  95. Pavol Duris, Juraj Hromkovic, Katsushi Inoue
    On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:3, pp:675-699 [Journal]
  96. Juraj Hromkovic
    On the Power of Alternation in Automata Theory. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:31, n:1, pp:28-39 [Journal]
  97. Juraj Hromkovic, Katsushi Inoue, Itsuo Takanami
    Lower Bounds for Language Recognition on Two-Dimensional Alternating Multihead Machines. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:38, n:3, pp:431-451 [Journal]
  98. Juraj Hromkovic, Sebastian Seibert, Thomas Wilke
    Translating Regular Expressions into Small -Free Nondeterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:4, pp:565-588 [Journal]
  99. Juraj Hromkovic, Jozef Kelemen, Juraj Waczulík
    Abstract symbol systems - an exercise of the bottom-up approach in artificial intelligence. [Citation Graph (0, 0)][DBLP]
    J. Exp. Theor. Artif. Intell., 1992, v:4, n:1, pp:49-58 [Journal]
  100. Juraj Hromkovic
    Zufall und zufallsgesteuerte Algorithmen. [Citation Graph (0, 0)][DBLP]
    LOG IN, 2001, v:21, n:1, pp:- [Journal]
  101. Juraj Hromkovic
    On Problems for Which no Oracle Can Help. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1991, v:24, n:1, pp:41-52 [Journal]
  102. Juraj Hromkovic, Martin Sauerhoff
    The Power of Nondeterminism and Randomness for Oblivious Branching Programs. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:2, pp:159-182 [Journal]
  103. Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Juraj Waczulík, Hubert Wagener
    Effective Systolic Algorithms for Gossiping in Cycles. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:2, pp:197-205 [Journal]
  104. Juraj Hromkovic, Georg Schnitger
    Nondeterministic Communication with a Limited Number of Advice Bits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:33, n:1, pp:43-68 [Journal]
  105. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:137-153 [Journal]
  106. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:285, n:1, pp:3-24 [Journal]
  107. Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger
    A Comparison of Two Lower-Bound Methods for Communication Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:168, n:1, pp:39-51 [Journal]
  108. Pavol Duris, Juraj Hromkovic
    One-Way Simple Multihead Finite Automata are not Closed Under Concatenation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:121-125 [Journal]
  109. Rusins Freivalds, Juraj Hromkovic, Gheorghe Paun, Walter Unger
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:264, n:1, pp:1-2 [Journal]
  110. Xaver Gubás, Juraj Hromkovic, Juraj Waczulík
    A Nonlinear Lower Bound on the Practical Combinational Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:2, pp:335-342 [Journal]
  111. Juraj Hromkovic
    Communication Complexity Hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:48, n:3, pp:109-115 [Journal]
  112. Juraj Hromkovic
    Reversal-Bounded Nondeterministic Multicounter Machines and Complementation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:325-330 [Journal]
  113. Juraj Hromkovic
    The Advantages of a New Approach to Defining the Communication Complexity for VLSI. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:57, n:, pp:91-111 [Journal]
  114. Juraj Hromkovic
    Tradeoffs for Language Recognition on Alternating Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:63, n:2, pp:203-221 [Journal]
  115. Juraj Hromkovic, Katsushi Inoue
    A Note on Realtime One-Way Synchronized Alternating One-Counter Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:108, n:2, pp:393-400 [Journal]
  116. Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien
    Note on Optimal Gossiping in Some Weak-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:127, n:2, pp:395-402 [Journal]
  117. Juraj Hromkovic, Jarkko Kari, Lila Kari
    Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:127, n:1, pp:123-147 [Journal]
  118. Juraj Hromkovic, Sergej A. Lozkin, Andrej I. Rybko, Alexander A. Sapozhenko, Nadezda A. Skalikova
    Lower Bounds on the Area Complexity of Boolean Circuits. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:97, n:2, pp:285-300 [Journal]
  119. Juraj Hromkovic, Branislav Rovan, Anna Slobodová
    Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:132, n:2, pp:319-336 [Journal]
  120. Juraj Hromkovic, Georg Schnitger
    On the power of Las Vegas II: Two-way finite automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:1-24 [Journal]
  121. Juraj Hromkovic, Georg Schnitger
    On the power of randomized multicounter machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:1, pp:135-144 [Journal]
  122. Katsushi Inoue, Itsuo Takanami, Juraj Hromkovic
    A Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:67, n:1, pp:99-110 [Journal]
  123. Juraj Hromkovic, Tobias Mömke, Kathleen Steinhöfel, Peter Widmayer
    Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmic Operations Research, 2007, v:2, n:1, pp:- [Journal]
  124. Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert
    On the Stability of Approximation for Hamiltonian Path Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmic Operations Research, 2006, v:1, n:1, pp:- [Journal]
  125. Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel
    Efficient Algorithms for the Spoonerism Problem. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:78-92 [Conf]
  126. Juraj Hromkovic, Georg Schnitger
    Comparing the size of NFAs with and without epsilon-transitions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:1-2, pp:100-114 [Journal]

  127. The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality. [Citation Graph (, )][DBLP]


  128. Algorithmics - Is There Hope for a Unified Theory? [Citation Graph (, )][DBLP]


  129. On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes. [Citation Graph (, )][DBLP]


  130. Reusing Optimal TSP Solutions for Locally Modified Input Instances. [Citation Graph (, )][DBLP]


  131. Creating and Testing Textbooks for Secondary Schools. [Citation Graph (, )][DBLP]


  132. Information Complexity of Online Problems. [Citation Graph (, )][DBLP]


  133. On the Hardness of Reoptimization. [Citation Graph (, )][DBLP]


  134. Ambiguity and Communication. [Citation Graph (, )][DBLP]


  135. Reoptimization of Steiner Trees. [Citation Graph (, )][DBLP]


  136. Ambiguity and Communication [Citation Graph (, )][DBLP]


  137. On the power of synchronization in parallel computations. [Citation Graph (, )][DBLP]


Search in 0.027secs, Finished in 0.031secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002