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

Juraj Hromkovic Home Page Coauthor index pubzone.org

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

DBLP keys2012
171Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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)
2011
170Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIvana Cerná, Tibor Gyimóthy, Juraj Hromkovic, Keith G. Jeffery, Rastislav Královic, Marko Vukolic, Stefan Wolf: 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 Springer 2011
169Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock: Knowing All Optimal Solutions Does Not Help for TSP Reoptimization. Computation, Cooperation, and Life 2011: 7-15
168Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Björn Steffen: Why Teaching Informatics in Schools Is as Important as Teaching Mathematics and Natural Sciences. ISSEP 2011: 21-30
167Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJun 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
166Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
165Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJun 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)
164Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock: On the Hardness of Reoptimization with Multiple Given Solutions. Fundam. Inform. 110(1-4): 59-76 (2011)
163Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLD. 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)
162no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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)
161Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Georg Schnitger: Ambiguity and Communication. Theory Comput. Syst. 48(3): 517-534 (2011)
2010
160Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Richard Královic, Jan Vahrenhold: 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 Springer 2010
159Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
158Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Algorithmics - Is There Hope for a Unified Theory? CSR 2010: 181-194
157Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Rastislav Královic, Richard Královic: Information Complexity of Online Problems. MFCS 2010: 24-36
156Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Borislav Suster, Eduard Toman: Preface. Fundam. Inform. 104(3): (2010)
155Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Georg Schnitger: On probabilistic pushdown automata. Inf. Comput. 208(8): 982-995 (2010)
2009
154Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Algorithmic Adventures - From Knowledge to Magic. Springer 2009: I-XIII, 1-363
153Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Sieben Wunder der Informatik - Eine Reise an die Grenze des Machbaren mit Aufgaben und Lösungen (2. Aufl.). Teubner 2009: I-XV, 1-360
152Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Georg Schnitger: Ambiguity and Communication. STACS 2009: 553-564
151Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Georg Schnitger: Ambiguity and Communication CoRR abs/0902.2140: (2009)
150Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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)
149Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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)
148Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
147Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Lehrbuch Informatik - Vorkurs Programmieren, Geschichte und Begriffsbildung, Automatenentwurf. Vieweg 2008: 1-512
146Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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
145Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKarin Freiermuth, Juraj Hromkovic, Björn Steffen: Creating and Testing Textbooks for Secondary Schools. ISSEP 2008: 216-228
144Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer: On the Hardness of Reoptimization. SOFSEM 2008: 50-65
143Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavide 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
142Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
141no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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
140Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel: Efficient Algorithms for the Spoonerism Problem. FUN 2007: 78-92
139Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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)
138Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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)
137Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Georg Schnitger: Comparing the size of NFAs with and without epsilon-transitions. Theor. Comput. Sci. 380(1-2): 100-114 (2007)
136Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
135no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Sieben Wunder der Informatik - eine Reise an die Grenze des Machbaren mit Aufgaben und Lösungen. Teubner 2006: I-XIII, 1-354
134Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
133Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Contributing to General Education by Teaching Informatics. ISSEP 2006: 25-37
132Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke: On the Approximation Hardness of Some Generalizations of TSP. SWAT 2006: 184-195
131Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert: On the Stability of Approximation for Hamiltonian Path Problems. Algorithmic Operations Research 1(1): (2006)
2005
130no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Ralf Klasing, Andrzej Pelc, Peter Ruzicka, Walter Unger: Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance Springer 2005
129no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Georg Schnitger: Communication Complexity Method for Proving Lower Bounds on Descriptional Complexity in Automata and Formal Language Theory. DCFS 2005: 38-38
128Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Georg Schnitger: NFAs With and Without epsilon-Transitions. ICALP 2005: 385-396
127Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert: On the Stability of Approximation for Hamiltonian Path Problems. SOFSEM 2005: 147-156
126Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Georg Schnitger: On the power of randomized multicounter machines. Theor. Comput. Sci. 330(1): 135-144 (2005)
2004
125no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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
124no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Stability of Approximation in Discrete Optimization. IFIP TCS 2004: 3-18
123Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger: On multi-partition communication complexity. Inf. Comput. 194(1): 49-75 (2004)
122Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavol 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)
121Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
120Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
119Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Georg Schnitger: Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation. ICALP 2003: 439-451
118Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Georg Schnitger: Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes. ICALP 2003: 66-80
117Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Georg Schnitger: Nondeterministic Communication with a Limited Number of Advice Bits. SIAM J. Comput. 33(1): 43-68 (2003)
116Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Martin Sauerhoff: The Power of Nondeterminism and Randomness for Oblivious Branching Programs. Theory Comput. Syst. 36(2): 159-182 (2003)
2002
115Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
114Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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)
113no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Descriptional Complexity of Finite Automata: Concepts and Open Problems. Journal of Automata, Languages and Combinatorics 7(4): 519-531 (2002)
112Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
111no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Algorithmics for hard problems - introduction to combinatorial optimization, randomization, approximation, and heuristics. Springer 2001: I-XI, 1-492
110no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Algorithmischen Konzepte der Informatik - Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kryptographie Teubner 2001
109no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Descriptional Complexity of Regular Languages (Concepts and Open Problems). DCFS 2001: 11-13
108Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Georg Schnitger: On the Power of Randomized Pushdown Automata. Developments in Language Theory 2001: 262-271
107Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Kathleen Steinhöfel, Peter Widmayer: Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. ICTCS 2001: 90-106
106Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Randomized Communication Protocols (A Survey). SAGA 2001: 1-32
105Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger: On Multipartition Communication Complexity. STACS 2001: 206-217
104Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Ondrej Sýkora: Preface. Discrete Applied Mathematics 108(1-2): 1-2 (2001)
103Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger: On Multipartition Communication Complexity Electronic Colloquium on Computational Complexity (ECCC) 8(066): (2001)
102Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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)
101Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Sebastian Seibert, Thomas Wilke: Translating Regular Expressions into Small -Free Nondeterministic Finite Automata. J. Comput. Syst. Sci. 62(4): 565-588 (2001)
100no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Zufall und zufallsgesteuerte Algorithmen. LOG IN 21(1): (2001)
99Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Georg Schnitger: On the power of Las Vegas II: Two-way finite automata. Theor. Comput. Sci. 262(1): 1-24 (2001)
98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRusins Freivalds, Juraj Hromkovic, Gheorghe Paun, Walter Unger: Foreword. Theor. Comput. Sci. 264(1): 1-2 (2001)
2000
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert: Measures of Nondeterminism in Finite Automata. ICALP 2000: 199-210
95no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Ingo Wegener: Introduction: Workshop on Boolean Functions and Applications. ICALP Satellite Workshops 2000: 227-228
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavol Duris, Juraj Hromkovic, Katsushi Inoue: A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition. IEEE Conference on Computational Complexity 2000: 214-228
93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Martin Sauerhoff: Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs. STACS 2000: 145-156
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavol 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)
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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)
89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Georg Schnitger: On the Power of Las Vegas II. Two-Way Finite Automata. ICALP 1999: 433-442
87no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Stability of Approximation Algorithms and the Knapsack Problem. Jewels are Forever 1999: 238-249
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Stability of Approximation Algorithms for Hard Optimization Problems. SOFSEM 1999: 29-47
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Some Constributions of the Study of Abstract Communication Complexity to Other Areas of Computer Science. ACM Comput. Surv. 31(3es): 8 (1999)
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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)
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Georg Schnitger: On the Power of Las Vegas II: Two-Way Finite Automata Electronic Colloquium on Computational Complexity (ECCC) 6(7): (1999)
82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Communication complexity and lower bounds on multilective computations. ITA 33(2): 193-212 (1999)
1998
81no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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
80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Communication Complexity and Lower Bounds on Multilective Computations. MFCS 1998: 789-797
79no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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
78no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Communication complexity and parallel computing. Springer 1997: I-X, 1-336
77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Georg Schnitger: Communication Complexity and Sequential Compuation. MFCS 1997: 71-84
76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Juhani Karhumäki: Two Lower Bounds on Computational Complexity of Infinite Words. New Trends in Formal Languages 1997: 366-376
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavol 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
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Sebastian Seibert, Thomas Wilke: Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. STACS 1997: 55-66
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavol 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)
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Georg Schnitger: Nondeterministic Communication with a Limited Number of Advice Bits. STOC 1996: 551-560
70no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Ralf Klasing, Elena Stöhr: Dissemination of Information in Vertex-Disjoint Paths Mode. Computers and Artificial Intelligence 15(4): (1996)
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská: Two Lower Bounds on Distributive Generation of Languages. Fundam. Inform. 25(3): 271-284 (1996)
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger: A Comparison of Two Lower-Bound Methods for Communication Complexity. Theor. Comput. Sci. 168(1): 39-51 (1996)
1995
67no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: On the Communication Complexity of Distributive Language Generation. Developments in Language Theory 1995: 237-246
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto: On Embeddings in Cycles Inf. Comput. 118(2): 302-305 (1995)
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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)
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLXaver 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
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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
60no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Juhani Karhumäki: Two Lower Bounds on Computational Complexity of Infinite Word Generation. IFIP Congress (1) 1994: 479-484
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger: A Comparison of Two Lower Bound Methods for Communication Complexity. MFCS 1994: 326-335
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská: Two Lower Bounds on Distributive Generation of Languages. MFCS 1994: 423-432
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Juhani Karhumäki, Arto Lepistö: Comparing Descriptional and Computational Complexity of Infinite Words. Results and Trends in Theoretical Computer Science 1994: 169-182
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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
55no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRainer 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)
54no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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)
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Jarkko Kari, Lila Kari: Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems. Theor. Comput. Sci. 127(1): 123-147 (1994)
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien: Note on Optimal Gossiping in Some Weak-Connected Graphs. Theor. Comput. Sci. 127(2): 395-402 (1994)
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Branislav Rovan, Anna Slobodová: Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines. Theor. Comput. Sci. 132(2): 319-336 (1994)
1993
50no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Branislav Rovan, Anna Slobodová: Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating Machines. Developments in Language Theory 1993: 314-325
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Jarkko Kari, Lila Kari: Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems. MFCS 1993: 495-505
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Ralf Klasing, Elena Stöhr: Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks. WG 1993: 288-300
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien: Optimal Algorithms for Dissemination of Information in Some Interconnection Networks. Algorithmica 10(1): 24-40 (1993)
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Katsushi Inoue: A Note on Realtime One-Way Synchronized Alternating One-Counter Automata. Theor. Comput. Sci. 108(2): 393-400 (1993)
1992
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz: Optimal Algorithms for Disemination of Information in Generalized Communication Modes. PARLE 1992: 115-130
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto: On Embedding Interconnection Networks into Rings of Processors. PARLE 1992: 53-62
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLXaver Gubás, Juraj Hromkovic, Juraj Waczulík: A Nonlinear Lower Bound on the Practical Combinational Complexity. STACS 1992: 293-302
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Topology of Parallel Networks and Computational Complexity (Extended Abstract). WG 1992: 70-77
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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)
39no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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)
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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)
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (Extended Abstract). FCT 1991: 240-247
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Burkhard Monien: The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). MFCS 1991: 211-220
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Juhani Karhumäki, Branislav Rovan, Anna Slobodová: On the power of synchronization in parallel computations. Discrete Applied Mathematics 32(2): 155-182 (1991)
33no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Ladislav Janiga, Václav Koubek: Variable Multihead Machines. Elektronische Informationsverarbeitung und Kybernetik 27(8): 411-424 (1991)
32no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: On the power of two-dimensional synchronized alternating finite automata. Fundam. Inform. 15(1): 90-98 (1991)
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators Inf. Comput. 95(2): 117-128 (1991)
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: On Problems for Which no Oracle Can Help. Mathematical Systems Theory 24(1): 41-52 (1991)
1990
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien: Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract). MFCS 1990: 337-346
1989
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJürgen Dassow, Juraj Hromkovic, Juhani Karhumäki, Branislav Rovan, Anna Slobodová: On the Power of Synchronization in Parallel Computations. MFCS 1989: 196-206
27no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: The knowledge on information content of problems provides much useful information to circuit designers. Bulletin of the EATCS 39: 154-170 (1989)
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Tradeoffs for Language Recognition on Alternating Machines. Theor. Comput. Sci. 63(2): 203-221 (1989)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKatsushi Inoue, Itsuo Takanami, Juraj Hromkovic: A Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines. Theor. Comput. Sci. 67(1): 99-110 (1989)
1988
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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
22no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: A candidate for nonlinear lower bound on the combinatorial complexity. Bulletin of the EATCS 36: 126-128 (1988)
21no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic, Erika Kupková: Graph Controlled Table Lindenmayer Systems. Elektronische Informationsverarbeitung und Kybernetik 24(10): 481-493 (1988)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: The Advantages of a New Approach to Defining the Communication Complexity for VLSI. Theor. Comput. Sci. 57: 91-111 (1988)
1987
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Reversal Complexity of Multicounter and Multihead Machines. STACS 1987: 159-168
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Reversal-Bounded Nondeterministic Multicounter Machines and Complementation. Theor. Comput. Sci. 51: 325-330 (1987)
1986
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Tradeoffs for Language Recognition on Parallel Computing Models. ICALP 1986: 157-166
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Lower bound techniques for VLSI algorithms. IMYCS 1986: 2-25
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: A New Approach to Defining the Complexity for VLSI. MFCS 1986: 431-439
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Communication Complexity Hierarchy. Theor. Comput. Sci. 48(3): 109-115 (1986)
1985
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Fooling a Two-Way Nondeterministic Multihead Automaton with Reversal Number Restriction. Acta Inf. 22(5): 589-594 (1985)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Alternating Multicounter Machines with Constant Number of Reversals. Inf. Process. Lett. 21(1): 7-9 (1985)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Linear Lower Bounds on Unbounded Fan-In Boolean Circuits. Inf. Process. Lett. 21(2): 71-74 (1985)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: On the Power of Alternation in Automata Theory. J. Comput. Syst. Sci. 31(1): 28-39 (1985)
1984
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Communication Complexity. ICALP 1984: 235-246
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: Hierarchy of Reversal and Zerotesting Bounded Multicounter Machines. MFCS 1984: 312-321
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: On the Power of Alternation in Finite Automata. MFCS 1984: 322-329
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: A note on the "Comuunication Complexity" paper by Papadimitriou and Sipser. Bulletin of the EATCS 22: 20 (1984)
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: On the power of Yao-Rivest technique. Bulletin of the EATCS 23: 33-34 (1984)
1983
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj Hromkovic: On-Way Multihead Deterministic Finite Automata. Acta Inf. 19: 377-384 (1983)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavol Duris, Juraj Hromkovic: One-Way Simple Multihead Finite Automata are not Closed Under Concatenation. Theor. Comput. Sci. 27: 121-125 (1983)
1982
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavol Duris, Juraj Hromkovic: Multihead Finite State Automata and Concatenation. ICALP 1982: 176-186
1981
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuraj 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ò [143]
2Hans-Joachim Böckenhauer [84] [89] [92] [97] [112] [115] [120] [121] [132] [134] [136] [138] [140] [142] [143] [144] [148] [159] [164] [166] [169] [171]
3Dirk Bongartz [115] [120] [121] [142]
4Ivana Cerná (Ivana Cerna) [170]
5Jürgen Dassow [28]
6Martin Dietzfelbinger [59] [68]
7Pavol Duris [2] [3] [73] [75] [91] [94] [103] [105] [122] [123]
8Rainer Feldmann [44] [55]
9Luca Forlizzi [127] [131] [134] [138]
10Karin Freiermuth [145] [159] [171]
11Rusins Freivalds [98]
12Xaver Gubás [42] [62]
13Tibor Gyimóthy [170]
14Friedhelm Meyer auf der Heide [163]
15Howard C. T. Ho [163]
16Jun Hosoda [165] [167]
17D. Frank Hsu [163]
18Katsushi Inoue [24] [26] [39] [45] [91] [94] [122]
19Taisuke Izumi [165] [167]
20Ladislav Janiga [33]
21Keith G. Jeffery [170]
22Claus-Dieter Jeschke [29] [46] [52]
23Stasys Jukna [103] [105] [123]
24Przemyslawa Kanarek [65] [150]
25Juhani Karhumäki [28] [34] [57] [60] [76] [90] [96] [114]
26Jarkko Kari [48] [53] [58] [69]
27Lila Kari (Lila Santean) [48] [53] [58] [69]
28Jozef Kelemen [38]
29Lucia Keller [162]
30Ralf Klasing [47] [49] [54] [56] [61] [63] [65] [66] [70] [72] [79] [84] [89] [92] [97] [112] [115] [120] [121] [130] [142] [150]
31Hartmut Klauck [90] [96] [114]
32Joachim Kneis [132] [134] [136] [138]
33Dennis Komm [162]
34Václav Koubek [33]
35Rastislav Kralovic (Rastislav Královic) [157] [170]
36Richard Královic [140] [141] [143] [148] [157] [160]
37Matthias Krause [40]
38Joachim Kupke [132] [134] [136] [138]
39Erika Kupková [21]
40Francis Chi-Moon Lau (Francis C. M. Lau) [163]
41Arto Lepistö [57]
42Krzysztof Lorys [65] [150]
43Sergej A. Lozkin [37]
44Seshu Madhavapeddy [44] [55]
45Bruce M. Maggs [163]
46Christoph Meinel [40]
47Tobias Mömke [139] [140] [143] [144] [148] [159] [166] [171]
48Burkhard Monien [29] [35] [44] [46] [52] [55]
49Vladimír Müller [43] [64]
50Peter Mysliwietz [44] [55]
51Manfred Nagl [125]
52Marc Nunkesser [141]
53Hirotaka Ono [165] [167]
54Dana Pardubská [54] [58] [61] [66] [69] [79]
55Gheorghe Paun [98]
56Andrzej Pelc [130]
57Holger Petersen [149]
58Juraj Procházka [23]
59Guido Proietti [115] [120] [121] [127] [131] [134] [138] [142]
60José D. P. Rolim [73] [75]
61Peter Rossmanith [148]
62Branislav Rovan [28] [34] [39] [50] [51]
63Peter Ruzicka [130]
64Andrej I. Rybko [37]
65Alexander A. Sapozhenko [37]
66Martin Sauerhoff [93] [103] [105] [116] [123]
67Georg Schnitger [59] [68] [71] [73] [75] [77] [83] [88] [90] [96] [99] [102] [103] [105] [108] [114] [117] [118] [119] [123] [126] [128] [129] [137] [146] [149] [151] [152] [155] [161]
68Sebastian Seibert [74] [84] [89] [90] [92] [96] [97] [101] [112] [114] [115] [120] [121] [127] [131] [142]
69Giovanni Serafini [162]
70Nadezda A. Skalikova [37]
71Anna Slobodová [28] [34] [39] [50] [51]
72Andreas Sprock [159] [164] [169] [171]
73Björn Steffen [145] [159] [162] [168] [171]
74Kathleen Steinhöfel [107] [139] [140]
75Monika Steinová [165] [167]
76Elena Stöhr [47] [49] [63] [70]
77Borislav Suster [156]
78Ondrej Sýkora [43] [64] [81] [104]
79Itsuo Takanami [24] [26] [39]
80Eduard Toman [156]
81Walter Unger [54] [56] [61] [65] [66] [72] [84] [89] [92] [97] [98] [112] [115] [120] [121] [130] [142] [150]
82Jan Vahrenhold [160]
83Imrich Vrto (Imrich Vrt'o) [43] [64]
84Marko Vukolic [170]
85Stephan Waack [40]
86Juraj Waczulík [38] [42] [62] [66] [79]
87Koichi Wada [165] [167]
88Hubert Wagener [49] [54] [56] [61] [63] [65] [66] [72] [79] [150]
89Klaus W. Wagner [39]
90Ingo Wegener [95]
91Bernhard Westfechtel [125]
92Peter Widmayer [107] [134] [138] [139] [141] [143] [144]
93Thomas Wilke [74] [101]
94Stefan Wolf [170]
95Anna Zych [143]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page