| 2009 |
|---|
| 142 | EE | Juraj Hromkovic,
Georg Schnitger:
Ambiguity and Communication.
STACS 2009: 553-564 |
| 141 | EE | Juraj Hromkovic,
Georg Schnitger:
Ambiguity and Communication
CoRR abs/0902.2140: (2009) |
| 2008 |
|---|
| 140 | EE | 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 |
| 139 | EE | Karin Freiermuth,
Juraj Hromkovic,
Björn Steffen:
Creating and Testing Textbooks for Secondary Schools.
ISSEP 2008: 216-228 |
| 138 | EE | Hans-Joachim Böckenhauer,
Juraj Hromkovic,
Tobias Mömke,
Peter Widmayer:
On the Hardness of Reoptimization.
SOFSEM 2008: 50-65 |
| 137 | EE | 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 |
| 136 | EE | 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) |
| 2007 |
|---|
| 135 | | Juraj Hromkovic,
Richard Královic,
Marc Nunkesser,
Peter Widmayer:
Stochastic Algorithms: Foundations and Applications, 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings
Springer 2007 |
| 134 | EE | 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 |
| 133 | EE | 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) |
| 132 | EE | Juraj Hromkovic,
Georg Schnitger:
Comparing the size of NFAs with and without epsilon-transitions.
Theor. Comput. Sci. 380(1-2): 100-114 (2007) |
| 131 | EE | 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) |
| 2006 |
|---|
| 130 | EE | 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 |
| 129 | EE | Juraj Hromkovic:
Contributing to General Education by Teaching Informatics.
ISSEP 2006: 25-37 |
| 128 | EE | Hans-Joachim Böckenhauer,
Juraj Hromkovic,
Joachim Kneis,
Joachim Kupke:
On the Approximation Hardness of Some Generalizations of TSP.
SWAT 2006: 184-195 |
| 127 | EE | Luca Forlizzi,
Juraj Hromkovic,
Guido Proietti,
Sebastian Seibert:
On the Stability of Approximation for Hamiltonian Path Problems.
Algorithmic Operations Research 1(1): (2006) |
| 2005 |
|---|
| 126 | | Juraj Hromkovic,
Ralf Klasing,
Andrzej Pelc,
Peter Ruzicka,
Walter Unger:
Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
Springer 2005 |
| 125 | EE | Juraj Hromkovic,
Georg Schnitger:
NFAs With and Without epsilon-Transitions.
ICALP 2005: 385-396 |
| 124 | EE | Luca Forlizzi,
Juraj Hromkovic,
Guido Proietti,
Sebastian Seibert:
On the Stability of Approximation for Hamiltonian Path Problems.
SOFSEM 2005: 147-156 |
| 123 | EE | Juraj Hromkovic,
Georg Schnitger:
On the power of randomized multicounter machines.
Theor. Comput. Sci. 330(1): 135-144 (2005) |
| 2004 |
|---|
| 122 | | Juraj Hromkovic,
Manfred Nagl,
Bernhard Westfechtel:
Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers
Springer 2004 |
| 121 | | Juraj Hromkovic:
Stability of Approximation in Discrete Optimization.
IFIP TCS 2004: 3-18 |
| 120 | EE | Pavol Duris,
Juraj Hromkovic,
Stasys Jukna,
Martin Sauerhoff,
Georg Schnitger:
On multi-partition communication complexity.
Inf. Comput. 194(1): 49-75 (2004) |
| 119 | EE | 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) |
| 118 | EE | 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) |
| 2003 |
|---|
| 117 | EE | 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 |
| 116 | EE | Juraj Hromkovic,
Georg Schnitger:
Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation.
ICALP 2003: 439-451 |
| 115 | EE | Juraj Hromkovic,
Georg Schnitger:
Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes.
ICALP 2003: 66-80 |
| 114 | EE | Juraj Hromkovic,
Georg Schnitger:
Nondeterministic Communication with a Limited Number of Advice Bits.
SIAM J. Comput. 33(1): 43-68 (2003) |
| 113 | EE | Juraj Hromkovic,
Martin Sauerhoff:
The Power of Nondeterminism and Randomness for Oblivious Branching Programs.
Theory Comput. Syst. 36(2): 159-182 (2003) |
| 2002 |
|---|
| 112 | EE | 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 |
| 111 | EE | 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) |
| 110 | | Juraj Hromkovic:
Descriptional Complexity of Finite Automata: Concepts and Open Problems.
Journal of Automata, Languages and Combinatorics 7(4): 519-531 (2002) |
| 109 | EE | 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) |
| 2001 |
|---|
| 108 | | Juraj Hromkovic:
Algorithmischen Konzepte der Informatik - Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kryptographie
Teubner 2001 |
| 107 | EE | Juraj Hromkovic,
Georg Schnitger:
On the Power of Randomized Pushdown Automata.
Developments in Language Theory 2001: 262-271 |
| 106 | EE | Juraj Hromkovic,
Kathleen Steinhöfel,
Peter Widmayer:
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms.
ICTCS 2001: 90-106 |
| 105 | EE | Juraj Hromkovic:
Randomized Communication Protocols (A Survey).
SAGA 2001: 1-32 |
| 104 | EE | Pavol Duris,
Juraj Hromkovic,
Stasys Jukna,
Martin Sauerhoff,
Georg Schnitger:
On Multipartition Communication Complexity.
STACS 2001: 206-217 |
| 103 | | Juraj Hromkovic,
Ondrej Sýkora:
Preface.
Discrete Applied Mathematics 108(1-2): 1-2 (2001) |
| 102 | EE | Pavol Duris,
Juraj Hromkovic,
Stasys Jukna,
Martin Sauerhoff,
Georg Schnitger:
On Multipartition Communication Complexity
Electronic Colloquium on Computational Complexity (ECCC) 8(066): (2001) |
| 101 | | 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) |
| 100 | | Juraj Hromkovic,
Sebastian Seibert,
Thomas Wilke:
Translating Regular Expressions into Small -Free Nondeterministic Finite Automata.
J. Comput. Syst. Sci. 62(4): 565-588 (2001) |
| 99 | | Juraj Hromkovic:
Zufall und zufallsgesteuerte Algorithmen.
LOG IN 21(1): (2001) |
| 98 | EE | Juraj Hromkovic,
Georg Schnitger:
On the power of Las Vegas II: Two-way finite automata.
Theor. Comput. Sci. 262(1): 1-24 (2001) |
| 97 | EE | Rusins Freivalds,
Juraj Hromkovic,
Gheorghe Paun,
Walter Unger:
Foreword.
Theor. Comput. Sci. 264(1): 1-2 (2001) |
| 2000 |
|---|
| 96 | EE | 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 |
| 95 | EE | Juraj Hromkovic,
Juhani Karhumäki,
Hartmut Klauck,
Georg Schnitger,
Sebastian Seibert:
Measures of Nondeterminism in Finite Automata.
ICALP 2000: 199-210 |
| 94 | | Juraj Hromkovic,
Ingo Wegener:
Introduction: Workshop on Boolean Functions and Applications.
ICALP Satellite Workshops 2000: 227-228 |
| 93 | EE | 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 |
| 92 | EE | Juraj Hromkovic,
Martin Sauerhoff:
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs.
STACS 2000: 145-156 |
| 91 | EE | 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 |
| 90 | EE | 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) |
| 89 | EE | 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) |
| 88 | EE | 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) |
| 1999 |
|---|
| 87 | EE | Juraj Hromkovic,
Georg Schnitger:
On the Power of Las Vegas II. Two-Way Finite Automata.
ICALP 1999: 433-442 |
| 86 | | Juraj Hromkovic:
Stability of Approximation Algorithms and the Knapsack Problem.
Jewels are Forever 1999: 238-249 |
| 85 | EE | Juraj Hromkovic:
Stability of Approximation Algorithms for Hard Optimization Problems.
SOFSEM 1999: 29-47 |
| 84 | EE | Juraj Hromkovic:
Some Constributions of the Study of Abstract Communication Complexity to Other Areas of Computer Science.
ACM Comput. Surv. 31(3es): 8 (1999) |
| 83 | EE | 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) |
| 82 | EE | Juraj Hromkovic,
Georg Schnitger:
On the Power of Las Vegas II: Two-Way Finite Automata
Electronic Colloquium on Computational Complexity (ECCC) 6(7): (1999) |
| 81 | | Juraj Hromkovic:
Communication complexity and lower bounds on multilective computations.
ITA 33(2): 193-212 (1999) |
| 1998 |
|---|
| 80 | | Juraj Hromkovic,
Ondrej Sýkora:
Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings
Springer 1998 |
| 79 | EE | Juraj Hromkovic:
Communication Complexity and Lower Bounds on Multilective Computations.
MFCS 1998: 789-797 |
| 78 | | 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) |
| 1997 |
|---|
| 77 | | Juraj Hromkovic,
Georg Schnitger:
Communication Complexity and Sequential Compuation.
MFCS 1997: 71-84 |
| 76 | | Juraj Hromkovic,
Juhani Karhumäki:
Two Lower Bounds on Computational Complexity of Infinite Words.
New Trends in Formal Languages 1997: 366-376 |
| 75 | | 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 |
| 74 | | Juraj Hromkovic,
Sebastian Seibert,
Thomas Wilke:
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata.
STACS 1997: 55-66 |
| 73 | EE | 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) |
| 72 | | 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) |
| 1996 |
|---|
| 71 | EE | Juraj Hromkovic,
Georg Schnitger:
Nondeterministic Communication with a Limited Number of Advice Bits.
STOC 1996: 551-560 |
| 70 | | Juraj Hromkovic,
Ralf Klasing,
Elena Stöhr:
Dissemination of Information in Vertex-Disjoint Paths Mode.
Computers and Artificial Intelligence 15(4): (1996) |
| 69 | | Juraj Hromkovic,
Jarkko Kari,
Lila Kari,
Dana Pardubská:
Two Lower Bounds on Distributive Generation of Languages.
Fundam. Inform. 25(3): 271-284 (1996) |
| 68 | EE | Martin Dietzfelbinger,
Juraj Hromkovic,
Georg Schnitger:
A Comparison of Two Lower-Bound Methods for Communication Complexity.
Theor. Comput. Sci. 168(1): 39-51 (1996) |
| 1995 |
|---|
| 67 | | Juraj Hromkovic:
On the Communication Complexity of Distributive Language Generation.
Developments in Language Theory 1995: 237-246 |
| 66 | | 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 |
| 65 | | 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 |
| 64 | | Juraj Hromkovic,
Vladimír Müller,
Ondrej Sýkora,
Imrich Vrto:
On Embeddings in Cycles
Inf. Comput. 118(2): 302-305 (1995) |
| 63 | | 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) |
| 62 | EE | 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) |
| 1994 |
|---|
| 61 | | 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 |
| 60 | | Juraj Hromkovic,
Juhani Karhumäki:
Two Lower Bounds on Computational Complexity of Infinite Word Generation.
IFIP Congress (1) 1994: 479-484 |
| 59 | | Martin Dietzfelbinger,
Juraj Hromkovic,
Georg Schnitger:
A Comparison of Two Lower Bound Methods for Communication Complexity.
MFCS 1994: 326-335 |
| 58 | | Juraj Hromkovic,
Jarkko Kari,
Lila Kari,
Dana Pardubská:
Two Lower Bounds on Distributive Generation of Languages.
MFCS 1994: 423-432 |
| 57 | | 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 |
| 56 | | 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 |
| 55 | | 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) |
| 54 | | 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) |
| 53 | | 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) |
| 52 | | Juraj Hromkovic,
Claus-Dieter Jeschke,
Burkhard Monien:
Note on Optimal Gossiping in Some Weak-Connected Graphs.
Theor. Comput. Sci. 127(2): 395-402 (1994) |
| 51 | | Juraj Hromkovic,
Branislav Rovan,
Anna Slobodová:
Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines.
Theor. Comput. Sci. 132(2): 319-336 (1994) |
| 1993 |
|---|
| 50 | | Juraj Hromkovic,
Branislav Rovan,
Anna Slobodová:
Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating Machines.
Developments in Language Theory 1993: 314-325 |
| 49 | | 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 |
| 48 | | Juraj Hromkovic,
Jarkko Kari,
Lila Kari:
Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems.
MFCS 1993: 495-505 |
| 47 | | Juraj Hromkovic,
Ralf Klasing,
Elena Stöhr:
Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks.
WG 1993: 288-300 |
| 46 | | Juraj Hromkovic,
Claus-Dieter Jeschke,
Burkhard Monien:
Optimal Algorithms for Dissemination of Information in Some Interconnection Networks.
Algorithmica 10(1): 24-40 (1993) |
| 45 | | Juraj Hromkovic,
Katsushi Inoue:
A Note on Realtime One-Way Synchronized Alternating One-Counter Automata.
Theor. Comput. Sci. 108(2): 393-400 (1993) |
| 1992 |
|---|
| 44 | | Rainer Feldmann,
Juraj Hromkovic,
Seshu Madhavapeddy,
Burkhard Monien,
Peter Mysliwietz:
Optimal Algorithms for Disemination of Information in Generalized Communication Modes.
PARLE 1992: 115-130 |
| 43 | | Juraj Hromkovic,
Vladimír Müller,
Ondrej Sýkora,
Imrich Vrto:
On Embedding Interconnection Networks into Rings of Processors.
PARLE 1992: 53-62 |
| 42 | | Xaver Gubás,
Juraj Hromkovic,
Juraj Waczulík:
A Nonlinear Lower Bound on the Practical Combinational Complexity.
STACS 1992: 293-302 |
| 41 | | Juraj Hromkovic:
Topology of Parallel Networks and Computational Complexity (Extended Abstract).
WG 1992: 70-77 |
| 40 | | 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) |
| 39 | | 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) |
| 38 | | 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) |
| 37 | | 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) |
| 1991 |
|---|
| 36 | | Juraj Hromkovic:
Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (Extended Abstract).
FCT 1991: 240-247 |
| 35 | | Juraj Hromkovic,
Burkhard Monien:
The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems).
MFCS 1991: 211-220 |
| 34 | EE | 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) |
| 33 | | Juraj Hromkovic,
Ladislav Janiga,
Václav Koubek:
Variable Multihead Machines.
Elektronische Informationsverarbeitung und Kybernetik 27(8): 411-424 (1991) |
| 32 | | Juraj Hromkovic:
On the power of two-dimensional synchronized alternating finite automata.
Fundam. Inform. 15(1): 90-98 (1991) |
| 31 | | Juraj Hromkovic:
Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators
Inf. Comput. 95(2): 117-128 (1991) |
| 30 | | Juraj Hromkovic:
On Problems for Which no Oracle Can Help.
Mathematical Systems Theory 24(1): 41-52 (1991) |
| 1990 |
|---|
| 29 | | Juraj Hromkovic,
Claus-Dieter Jeschke,
Burkhard Monien:
Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract).
MFCS 1990: 337-346 |
| 1989 |
|---|
| 28 | | Jürgen Dassow,
Juraj Hromkovic,
Juhani Karhumäki,
Branislav Rovan,
Anna Slobodová:
On the Power of Synchronization in Parallel Computations.
MFCS 1989: 196-206 |
| 27 | | Juraj Hromkovic:
The knowledge on information content of problems provides much useful information to circuit designers.
Bulletin of the EATCS 39: 154-170 (1989) |
| 26 | | 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) |
| 25 | | Juraj Hromkovic:
Tradeoffs for Language Recognition on Alternating Machines.
Theor. Comput. Sci. 63(2): 203-221 (1989) |
| 24 | | Katsushi Inoue,
Itsuo Takanami,
Juraj Hromkovic:
A Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines.
Theor. Comput. Sci. 67(1): 99-110 (1989) |
| 1988 |
|---|
| 23 | | 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 |
| 22 | | Juraj Hromkovic:
A candidate for nonlinear lower bound on the combinatorial complexity.
Bulletin of the EATCS 36: 126-128 (1988) |
| 21 | | Juraj Hromkovic,
Erika Kupková:
Graph Controlled Table Lindenmayer Systems.
Elektronische Informationsverarbeitung und Kybernetik 24(10): 481-493 (1988) |
| 20 | | Juraj Hromkovic:
The Advantages of a New Approach to Defining the Communication Complexity for VLSI.
Theor. Comput. Sci. 57: 91-111 (1988) |
| 1987 |
|---|
| 19 | | Juraj Hromkovic:
Reversal Complexity of Multicounter and Multihead Machines.
STACS 1987: 159-168 |
| 18 | | Juraj Hromkovic:
Reversal-Bounded Nondeterministic Multicounter Machines and Complementation.
Theor. Comput. Sci. 51: 325-330 (1987) |
| 1986 |
|---|
| 17 | | Juraj Hromkovic:
Tradeoffs for Language Recognition on Parallel Computing Models.
ICALP 1986: 157-166 |
| 16 | | Juraj Hromkovic:
Lower bound techniques for VLSI algorithms.
IMYCS 1986: 2-25 |
| 15 | | Juraj Hromkovic:
A New Approach to Defining the Complexity for VLSI.
MFCS 1986: 431-439 |
| 14 | | Juraj Hromkovic:
Communication Complexity Hierarchy.
Theor. Comput. Sci. 48(3): 109-115 (1986) |
| 1985 |
|---|
| 13 | | Juraj Hromkovic:
Fooling a Two-Way Nondeterministic Multihead Automaton with Reversal Number Restriction.
Acta Inf. 22(5): 589-594 (1985) |
| 12 | | Juraj Hromkovic:
Alternating Multicounter Machines with Constant Number of Reversals.
Inf. Process. Lett. 21(1): 7-9 (1985) |
| 11 | | Juraj Hromkovic:
Linear Lower Bounds on Unbounded Fan-In Boolean Circuits.
Inf. Process. Lett. 21(2): 71-74 (1985) |
| 10 | | Juraj Hromkovic:
On the Power of Alternation in Automata Theory.
J. Comput. Syst. Sci. 31(1): 28-39 (1985) |
| 1984 |
|---|
| 9 | | Juraj Hromkovic:
Communication Complexity.
ICALP 1984: 235-246 |
| 8 | | Juraj Hromkovic:
Hierarchy of Reversal and Zerotesting Bounded Multicounter Machines.
MFCS 1984: 312-321 |
| 7 | | Juraj Hromkovic:
On the Power of Alternation in Finite Automata.
MFCS 1984: 322-329 |
| 6 | | Juraj Hromkovic:
A note on the "Comuunication Complexity" paper by Papadimitriou and Sipser.
Bulletin of the EATCS 22: 20 (1984) |
| 5 | | Juraj Hromkovic:
On the power of Yao-Rivest technique.
Bulletin of the EATCS 23: 33-34 (1984) |
| 1983 |
|---|
| 4 | | Juraj Hromkovic:
On-Way Multihead Deterministic Finite Automata.
Acta Inf. 19: 377-384 (1983) |
| 3 | | Pavol Duris,
Juraj Hromkovic:
One-Way Simple Multihead Finite Automata are not Closed Under Concatenation.
Theor. Comput. Sci. 27: 121-125 (1983) |
| 1982 |
|---|
| 2 | | Pavol Duris,
Juraj Hromkovic:
Multihead Finite State Automata and Concatenation.
ICALP 1982: 176-186 |
| 1981 |
|---|
| 1 | | Juraj Hromkovic:
Closure Properties of the Family of Languages Recognized by One-Way Two-Head Deterministic Finite State Automata.
MFCS 1981: 304-313 |
