dblp.uni-trier.dewww.uni-trier.de

Juraj Hromkovic Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
144EEJuraj Hromkovic, Georg Schnitger: Ambiguity and Communication. STACS 2009: 553-564
143EEJuraj Hromkovic, Georg Schnitger: Ambiguity and Communication CoRR abs/0902.2140: (2009)
142EEJuraj 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)
141EEHans-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)
2008
140EEJuraj 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
139EEKarin Freiermuth, Juraj Hromkovic, Björn Steffen: Creating and Testing Textbooks for Secondary Schools. ISSEP 2008: 216-228
138EEHans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer: On the Hardness of Reoptimization. SOFSEM 2008: 50-65
137EEDavide 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
136EEHans-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
134EEHans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel: Efficient Algorithms for the Spoonerism Problem. FUN 2007: 78-92
133EEJuraj 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)
132EEJuraj Hromkovic, Georg Schnitger: Comparing the size of NFAs with and without epsilon-transitions. Theor. Comput. Sci. 380(1-2): 100-114 (2007)
131EEHans-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
130EEHans-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
129EEJuraj Hromkovic: Contributing to General Education by Teaching Informatics. ISSEP 2006: 25-37
128EEHans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke: On the Approximation Hardness of Some Generalizations of TSP. SWAT 2006: 184-195
127EELuca 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
125EEJuraj Hromkovic, Georg Schnitger: NFAs With and Without epsilon-Transitions. ICALP 2005: 385-396
124EELuca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert: On the Stability of Approximation for Hamiltonian Path Problems. SOFSEM 2005: 147-156
123EEJuraj 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
120EEPavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger: On multi-partition communication complexity. Inf. Comput. 194(1): 49-75 (2004)
119EEPavol 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)
118EEHans-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
117EEHans-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
116EEJuraj Hromkovic, Georg Schnitger: Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation. ICALP 2003: 439-451
115EEJuraj Hromkovic, Georg Schnitger: Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes. ICALP 2003: 66-80
114EEJuraj Hromkovic, Georg Schnitger: Nondeterministic Communication with a Limited Number of Advice Bits. SIAM J. Comput. 33(1): 43-68 (2003)
113EEJuraj Hromkovic, Martin Sauerhoff: The Power of Nondeterminism and Randomness for Oblivious Branching Programs. Theory Comput. Syst. 36(2): 159-182 (2003)
2002
112EEHans-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
111EEJuraj 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)
109EEHans-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
107EEJuraj Hromkovic, Georg Schnitger: On the Power of Randomized Pushdown Automata. Developments in Language Theory 2001: 262-271
106EEJuraj Hromkovic, Kathleen Steinhöfel, Peter Widmayer: Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. ICTCS 2001: 90-106
105EEJuraj Hromkovic: Randomized Communication Protocols (A Survey). SAGA 2001: 1-32
104EEPavol 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)
102EEPavol 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)
98EEJuraj Hromkovic, Georg Schnitger: On the power of Las Vegas II: Two-way finite automata. Theor. Comput. Sci. 262(1): 1-24 (2001)
97EERusins Freivalds, Juraj Hromkovic, Gheorghe Paun, Walter Unger: Foreword. Theor. Comput. Sci. 264(1): 1-2 (2001)
2000
96EEHans-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
95EEJuraj 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
93EEPavol Duris, Juraj Hromkovic, Katsushi Inoue: A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition. IEEE Conference on Computational Complexity 2000: 214-228
92EEJuraj Hromkovic, Martin Sauerhoff: Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs. STACS 2000: 145-156
91EEHans-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
90EEPavol 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)
89EEJuraj 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)
88EEHans-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
87EEJuraj 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
85EEJuraj Hromkovic: Stability of Approximation Algorithms for Hard Optimization Problems. SOFSEM 1999: 29-47
84EEJuraj Hromkovic: Some Constributions of the Study of Abstract Communication Complexity to Other Areas of Computer Science. ACM Comput. Surv. 31(3es): 8 (1999)
83EEHans-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)
82EEJuraj 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
79EEJuraj 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
77EEJuraj 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
75EEPavol 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
74EEJuraj Hromkovic, Sebastian Seibert, Thomas Wilke: Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. STACS 1997: 55-66
73EEPavol 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
71EEJuraj 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)
68EEMartin 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
65EEJuraj 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)
62EEXaver 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
59EEMartin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger: A Comparison of Two Lower Bound Methods for Communication Complexity. MFCS 1994: 326-335
58EEJuraj 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
56EEJuraj 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
49EEJuraj 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
48EEJuraj Hromkovic, Jarkko Kari, Lila Kari: Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems. MFCS 1993: 495-505
47EEJuraj 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
44EERainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz: Optimal Algorithms for Disemination of Information in Generalized Communication Modes. PARLE 1992: 115-130
43EEJuraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto: On Embedding Interconnection Networks into Rings of Processors. PARLE 1992: 53-62
42EEXaver Gubás, Juraj Hromkovic, Juraj Waczulík: A Nonlinear Lower Bound on the Practical Combinational Complexity. STACS 1992: 293-302
41EEJuraj 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
35EEJuraj Hromkovic, Burkhard Monien: The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). MFCS 1991: 211-220
34EEJuraj 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
29EEJuraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien: Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract). MFCS 1990: 337-346
1989
28EEJü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
23EEJuraj 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
19EEJuraj 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
17EEJuraj Hromkovic: Tradeoffs for Language Recognition on Parallel Computing Models. ICALP 1986: 157-166
16EEJuraj Hromkovic: Lower bound techniques for VLSI algorithms. IMYCS 1986: 2-25
15EEJuraj 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
9EEJuraj Hromkovic: Communication Complexity. ICALP 1984: 235-246
8EEJuraj Hromkovic: Hierarchy of Reversal and Zerotesting Bounded Multicounter Machines. MFCS 1984: 312-321
7EEJuraj 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
2EEPavol Duris, Juraj Hromkovic: Multihead Finite State Automata and Concatenation. ICALP 1982: 176-186
1981
1EEJuraj Hromkovic: Closure Properties of the Family of Languages Recognized by One-Way Two-Head Deterministic Finite State Automata. MFCS 1981: 304-313

Coauthor Index

1Davide Bilò [137]
2Hans-Joachim Böckenhauer [83] [88] [91] [96] [109] [112] [117] [118] [128] [130] [131] [134] [136] [137] [138] [141]
3Dirk Bongartz [112] [117] [118] [136]
4Jürgen Dassow [28]
5Martin Dietzfelbinger [59] [68]
6Pavol Duris [2] [3] [73] [75] [90] [93] [102] [104] [119] [120]
7Rainer Feldmann [44] [55]
8Luca Forlizzi [124] [127] [130]
9Karin Freiermuth [139]
10Rusins Freivalds [97]
11Xaver Gubás [42] [62]
12Katsushi Inoue [24] [26] [39] [45] [90] [93] [119]
13Ladislav Janiga [33]
14Claus-Dieter Jeschke [29] [46] [52]
15Stasys Jukna [102] [104] [120]
16Przemyslawa Kanarek [65]
17Juhani Karhumäki [28] [34] [57] [60] [76] [89] [95] [111]
18Jarkko Kari [48] [53] [58] [69]
19Lila Kari (Lila Santean) [48] [53] [58] [69]
20Jozef Kelemen [38]
21Ralf Klasing [47] [49] [54] [56] [61] [63] [65] [66] [70] [72] [78] [83] [88] [91] [96] [109] [112] [117] [118] [126] [136]
22Hartmut Klauck [89] [95] [111]
23Joachim Kneis [128] [130] [131]
24Václav Koubek [33]
25Richard Královic [134] [135] [137] [141]
26Matthias Krause [40]
27Joachim Kupke [128] [130] [131]
28Erika Kupková [21]
29Arto Lepistö [57]
30Krzysztof Lorys [65]
31Sergej A. Lozkin [37]
32Seshu Madhavapeddy [44] [55]
33Christoph Meinel [40]
34Tobias Mömke [133] [134] [137] [138] [141]
35Burkhard Monien [29] [35] [44] [46] [52] [55]
36Vladimír Müller [43] [64]
37Peter Mysliwietz [44] [55]
38Manfred Nagl [122]
39Marc Nunkesser [135]
40Dana Pardubská [54] [58] [61] [66] [69] [78]
41Gheorghe Paun [97]
42Andrzej Pelc [126]
43Holger Petersen [142]
44Juraj Procházka [23]
45Guido Proietti [112] [117] [118] [124] [127] [130] [136]
46José D. P. Rolim [73] [75]
47Peter Rossmanith [141]
48Branislav Rovan [28] [34] [39] [50] [51]
49Peter Ruzicka [126]
50Andrej I. Rybko [37]
51Alexander A. Sapozhenko [37]
52Martin Sauerhoff [92] [102] [104] [113] [120]
53Georg Schnitger [59] [68] [71] [73] [75] [77] [82] [87] [89] [95] [98] [101] [102] [104] [107] [111] [114] [115] [116] [120] [123] [125] [132] [140] [142] [143] [144]
54Sebastian Seibert [74] [83] [88] [89] [91] [95] [96] [100] [109] [111] [112] [117] [118] [124] [127] [136]
55Nadezda A. Skalikova [37]
56Anna Slobodová [28] [34] [39] [50] [51]
57Björn Steffen [139]
58Kathleen Steinhöfel [106] [133] [134]
59Elena Stöhr [47] [49] [63] [70]
60Ondrej Sýkora [43] [64] [80] [103]
61Itsuo Takanami [24] [26] [39]
62Walter Unger [54] [56] [61] [65] [66] [72] [83] [88] [91] [96] [97] [109] [112] [117] [118] [126] [136]
63Imrich Vrto [43] [64]
64Stephan Waack [40]
65Juraj Waczulík [38] [42] [62] [66] [78]
66Hubert Wagener [49] [54] [56] [61] [63] [65] [66] [72] [78]
67Klaus W. Wagner [39]
68Ingo Wegener [94]
69Bernhard Westfechtel [122]
70Peter Widmayer [106] [130] [133] [135] [137] [138]
71Thomas Wilke [74] [100]
72Anna Zych [137]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)