Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuraj Hromkovic
Person information
- affiliation: ETH Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j101]Fabian Frei
, Juraj Hromkovic, Rastislav Královic, Richard Královic:
Two-Way Non-Uniform Finite Automata. Int. J. Found. Comput. Sci. 34(2&3): 145-162 (2023)- 2022
- [j100]Juraj Hromkovic:
Salomaa Prize in Automata Theory, Formal Languages and related topics. Bull. EATCS 136 (2022) - 2021
- [j99]Juraj Hromkovic, Jacqueline Staub:
The Problem with Debugging in Current Block-based Programming Environments. Bull. EATCS 135 (2021) - [j98]Valentina Dagiene, Juraj Hromkovic, Regula Lacher:
Designing informatics curriculum for K-12 education: From Concepts to Implementations. Informatics Educ. 20(3): 333-360 (2021) - [j97]Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Walter Unger:
On the advice complexity of the online dominating set problem. Theor. Comput. Sci. 862: 81-96 (2021) - [c94]Fabian Frei, Juraj Hromkovic, Richard Královic, Rastislav Královic:
Two-Way Non-uniform Finite Automata. DLT 2021: 155-166 - [c93]Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith:
Online Simple Knapsack with Reservation Costs. STACS 2021: 16:1-16:18 - [i13]Juraj Hromkovic:
Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j96]Fabian Frei, Juraj Hromkovic, Juhani Karhumäki:
Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata. Fundam. Informaticae 175(1-4): 173-185 (2020) - [j95]Juraj Hromkovic, Peter Rossmanith:
What one has to know when attacking P vs. NP. J. Comput. Syst. Sci. 107: 142-155 (2020) - [c92]Valentina Dagiene, Juraj Hromkovic, Regula Lacher:
A Two-Dimensional Classification Model for the Bebras Tasks on Informatics Based Simultaneously on Subfields and Competencies. ISSEP 2020: 42-54 - [p9]Juraj Hromkovic, Dennis Komm, Regula Lacher, Jacqueline Staub:
Teaching with LOGO Philosophy. Encyclopedia of Education and Information Technologies 2020: 1-9 - [i12]Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith:
Online Simple Knapsack with Reservation Costs. CoRR abs/2009.14043 (2020)
2010 – 2019
- 2019
- [j94]Juraj Hromkovic:
Bilden wir die Erfinderinnen, Gestalter und Entwicklerinnen digitaler Technologie aus und nicht nur ihre Konsumenten! Inform. Spektrum 42(2): 77-79 (2019) - [j93]Juraj Hromkovic:
Informatik im Kontext der allgemeinen Bildung. Inform. Spektrum 42(2): 80-87 (2019) - [j92]Juraj Hromkovic, Regula Lacher:
E-Learning - Erwartungen, Möglichkeiten und Grenzen. Wirtschaftsinformatik Manag. 11(6): 356-363 (2019) - 2018
- [j91]Maria Paola Bianchi, Juraj Hromkovic, Ivan Kovác:
On the Size of Two-Way Reasonable Automata for the Liveness Problem. Int. J. Found. Comput. Sci. 29(2): 187-212 (2018) - [j90]Elisabet Burjons, Juraj Hromkovic, Rastislav Královic, Richard Královic, Xavier Muñoz, Walter Unger:
Online Graph Coloring Against a Randomized Adversary. Int. J. Found. Comput. Sci. 29(4): 551-569 (2018) - [p8]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm:
Reoptimization of Hard Optimization Problems. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 427-454 - [p7]Hans-Joachim Böckenhauer, Juraj Hromkovic, Sebastian Seibert:
Stability of Approximation. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 473-487 - 2017
- [j89]Juraj Hromkovic, Tobias Kohn, Dennis Komm, Giovanni Serafini:
Algorithmic Thinking from the Start. Bull. EATCS 121 (2017) - [j88]Juraj Hromkovic, Regula Lacher:
How to convince teachers to teach computer science even if informatics was never a part of their own studies. Bull. EATCS 123 (2017) - [c91]Juraj Hromkovic, Peter Rossmanith:
What One Has to Know When Attacking P vs. NP (Extended Abstract). FCT 2017: 11-28 - [c90]Juraj Hromkovic, Regula Lacher:
The Computer Science Way of Thinking in Human History and Consequences for the Design of Computer Science Curricula. ISSEP 2017: 3-11 - [c89]Juraj Hromkovic, Giovanni Serafini, Jacqueline Staub:
XLogoOnline: A Single-Page, Browser-Based Programming Environment for Schools Aiming at Reducing Cognitive Load on Pupils. ISSEP 2017: 219-231 - 2016
- [c88]Juraj Hromkovic, Tobias Kohn, Dennis Komm, Giovanni Serafini:
Combining the Power of Python with the Simplicity of Logo for a Sustainable Computer Science Education. ISSEP 2016: 155-166 - [c87]Jhoirene B. Clemente, Juraj Hromkovic, Dennis Komm, Christian Kudahl:
Advice Complexity of the Online Search Problem. IWOCA 2016: 203-212 - [c86]Kfir Barhum, Juraj Hromkovic:
On the Power of Laconic Advice in Communication Complexity. SOFSEM 2016: 161-170 - [c85]Elisabet Burjons, Juraj Hromkovic, Xavier Muñoz, Walter Unger:
Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract). SOFSEM 2016: 229-240 - [c84]Stefan Dobrev, Juraj Hromkovic, Dennis Komm, Richard Královic, Rastislav Královic, Tobias Mömke:
The Complexity of Paging Against a Probabilistic Adversary. SOFSEM 2016: 265-276 - [i11]Jhoirene B. Clemente, Juraj Hromkovic, Dennis Komm, Christian Kudahl:
Advice Complexity of the Online Search Problem. CoRR abs/1612.09299 (2016) - 2015
- [j87]Juraj Hromkovic:
Homo Informaticus. Bull. EATCS 115 (2015) - [j86]Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada:
Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429(2012) 144-154]. Theor. Comput. Sci. 562: 660-661 (2015) - [c83]Maria Paola Bianchi, Juraj Hromkovic, Ivan Kovác:
On the Size of Two-Way Reasonable Automata for the Liveness Problem. DLT 2015: 120-131 - [i10]Juraj Hromkovic:
Why the Concept of Computational Complexity is Hard for Verifiable Mathematics. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j85]Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller:
Online Coloring of Bipartite Graphs with and without Advice. Algorithmica 70(1): 92-111 (2014) - [j84]Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen:
On the advice complexity of the online L(2, 1)-coloring problem on paths and cycles. Theor. Comput. Sci. 554: 22-39 (2014) - [j83]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock:
The string guessing problem as a method to prove lower bounds on the advice complexity. Theor. Comput. Sci. 554: 95-108 (2014) - [c82]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm:
A Technique to Obtain Hardness Results for Randomized Online Algorithms - A Survey. Computing with New Resources 2014: 264-276 - [c81]Kfir Barhum, Hans-Joachim Böckenhauer, Michal Forisek, Heidi Gebauer, Juraj Hromkovic, Sacha Krug, Jasmin Smula, Björn Steffen:
On the Power of Advice and Randomization for the Disjoint Path Allocation Problem. SOFSEM 2014: 89-101 - 2013
- [j82]Juraj Hromkovic, Rastislav Královic, Richard Královic, Richard Stefanec:
Determinism vs. Nondeterminism for Two-Way Automata: Representing the Meaning of States by Logical Formulæ. Int. J. Found. Comput. Sci. 24(7): 955-978 (2013) - [c80]Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen:
On the Advice Complexity of the Online L(2, 1)-Coloring Problem on Paths and Cycles. COCOON 2013: 53-64 - [c79]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock:
The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. COCOON 2013: 493-505 - [p6]Juraj Hromkovic, Jürg Kohlas:
Was ist Informatik? informatik@gymnasium 2013: 39-59 - [p5]Juraj Hromkovic, Jürg Kohlas:
Die Bildungsziele. informatik@gymnasium 2013: 60-78 - [p4]Juraj Hromkovic, Jürg Kohlas, Carl August Zehnder:
Konzepte und Inhalte eines Fachs Informatik. informatik@gymnasium 2013: 128-157 - 2012
- [b13]Juraj Hromkovic:
Einführung in die Programmierung mit LOGO - Lehrbuch für Unterricht und Selbststudium (2. Aufl.). Vieweg+Teubner 2012, ISBN 978-3-8348-1852-2, pp. 1-271 - [j81]Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen:
Steiner tree reoptimization in graphs with sharpened triangle inequality. J. Discrete Algorithms 11: 73-86 (2012) - [j80]Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada:
On the approximability and hardness of minimum topic connected overlay and its special instances. Theor. Comput. Sci. 429: 144-154 (2012) - [c78]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Richard Královic, Peter Rossmanith:
On the Power of Randomness versus Advice in Online Computation. Languages Alive 2012: 30-43 - [c77]Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller:
Online Coloring of Bipartite Graphs with and without Advice. COCOON 2012: 519-530 - [c76]Juraj Hromkovic, Rastislav Královic, Richard Královic, Richard Stefanec:
Determinism vs. Nondeterminism for Two-Way Automata - Representing the Meaning of States by Logical Formulæ. Developments in Language Theory 2012: 24-39 - [i9]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock:
The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j79]Hans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock:
On the Hardness of Reoptimization with Multiple Given Solutions. Fundam. Informaticae 110(1-4): 59-76 (2011) - [j78]D. Frank Hsu, Bruce M. Maggs, Howard C. T. Ho, Juraj Hromkovic, Francis C. M. Lau, Friedhelm Meyer auf der Heide:
Editorial. J. Interconnect. Networks 12(1-2) (2011) - [j77]Juraj Hromkovic, Lucia Keller, Dennis Komm, Giovanni Serafini, Björn Steffen:
Fehlerkorrigierende Codes - Ein Unterrichtsbeispiel zum gelenkten entdeckenden Lernen. LOG IN 31(168): 50-55 (2011) - [j76]Juraj Hromkovic, Georg Schnitger:
Ambiguity and Communication. Theory Comput. Syst. 48(3): 517-534 (2011) - [c75]Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke:
Improved Approximations for Hard Optimization Problems via Problem Instance Classification. Rainbow of Computer Science 2011: 3-19 - [c74]Hans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock:
Knowing All Optimal Solutions Does Not Help for TSP Reoptimization. Computation, Cooperation, and Life 2011: 7-15 - [c73]Juraj Hromkovic, Björn Steffen:
Why Teaching Informatics in Schools Is as Important as Teaching Mathematics and Natural Sciences. ISSEP 2011: 21-30 - [c72]Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada:
On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. MFCS 2011: 376-387 - [e6]Ivana 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. Lecture Notes in Computer Science 6543, Springer 2011, ISBN 978-3-642-18380-5 [contents] - [i8]Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada:
On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances. CoRR abs/1107.2443 (2011) - 2010
- [j75]Juraj Hromkovic, Borislav Suster, Eduard Toman:
Preface. Fundam. Informaticae 104(3) (2010) - [j74]Juraj Hromkovic, Georg Schnitger:
On probabilistic pushdown automata. Inf. Comput. 208(8): 982-995 (2010) - [c71]Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen:
The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality. CIAC 2010: 180-191 - [c70]Juraj Hromkovic:
Algorithmics - Is There Hope for a Unified Theory? CSR 2010: 181-194 - [c69]Juraj Hromkovic, Rastislav Královic, Richard Královic:
Information Complexity of Online Problems. MFCS 2010: 24-36 - [e5]Juraj 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. Lecture Notes in Computer Science 5941, Springer 2010, ISBN 978-3-642-11375-8 [contents]
2000 – 2009
- 2009
- [b12]Juraj Hromkovic:
Algorithmic Adventures - From Knowledge to Magic. Springer 2009, ISBN 978-3-540-85985-7, pp. I-XIII, 1-363 - [b11]Juraj Hromkovic:
Sieben Wunder der Informatik - Eine Reise an die Grenze des Machbaren mit Aufgaben und Lösungen (2. Aufl.). Teubner 2009, ISBN 978-3-8351-0172-2, pp. I-XV, 1-360 - [j73]Juraj Hromkovic, Georg Schnitger:
Lower Bounds on the Size of Sweeping Automata. J. Autom. Lang. Comb. 14(1): 23-31 (2009) - [j72]Juraj Hromkovic, Przemyslawa Kanarek, Ralf Klasing, Krzysztof Lorys, Walter Unger, Hubert Wagener:
On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. SIAM J. Discret. Math. 23(3): 1612-1645 (2009) - [j71]Juraj Hromkovic, Holger Petersen, Georg Schnitger:
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's. Theor. Comput. Sci. 410(30-32): 2972-2981 (2009) - [j70]Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Rossmanith:
Reoptimization of Steiner trees: Changing the terminal set. Theor. Comput. Sci. 410(36): 3428-3435 (2009) - [c68]Juraj Hromkovic, Georg Schnitger:
Ambiguity and Communication. STACS 2009: 553-564 - [i7]Juraj Hromkovic, Georg Schnitger:
Ambiguity and Communication. CoRR abs/0902.2140 (2009) - 2008
- [b10]Juraj Hromkovic:
Lehrbuch Informatik - Vorkurs Programmieren, Geschichte und Begriffsbildung, Automatenentwurf. Vieweg 2008, ISBN 978-3-8348-0620-8, pp. 1-512 - [j69]Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger:
On k-connectivity problems with sharpened triangle inequality. J. Discrete Algorithms 6(4): 605-617 (2008) - [c67]Juraj Hromkovic, Georg Schnitger:
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes. Developments in Language Theory 2008: 34-55 - [c66]Karin Freiermuth, Juraj Hromkovic, Björn Steffen:
Creating and Testing Textbooks for Secondary Schools. ISSEP 2008: 216-228 - [c65]Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer:
On the Hardness of Reoptimization. SOFSEM 2008: 50-65 - [c64]Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych:
Reoptimization of Steiner Trees. SWAT 2008: 258-269 - 2007
- [b9]Juraj Hromkovic:
Theoretische Informatik - formale Sprachen, Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kommunikation und Kryptographie, 3. Auflage. Leitfäden der Informatik, Teubner 2007, ISBN 978-3-8351-0043-5, pp. 1-415 - [j68]Juraj Hromkovic, Tobias Mömke, Kathleen Steinhöfel, Peter Widmayer:
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. Algorithmic Oper. Res. 2(1) (2007) - [j67]Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer:
On the Approximability of TSP on Local Modifications of Optimally Solved Instances. Algorithmic Oper. Res. 2(2): 83-93 (2007) - [j66]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) - [j65]Juraj Hromkovic, Georg Schnitger:
Comparing the size of NFAs with and without epsilon-transitions. Theor. Comput. Sci. 380(1-2): 100-114 (2007) - [c63]Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel:
Efficient Algorithms for the Spoonerism Problem. FUN 2007: 78-92 - [e4]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. Lecture Notes in Computer Science 4665, Springer 2007, ISBN 978-3-540-74870-0 [contents] - [r1]Hans-Joachim Böckenhauer, Sebastian Seibert, Juraj Hromkovic:
Stability of Approximation. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [b8]Juraj Hromkovic:
Sieben Wunder der Informatik - eine Reise an die Grenze des Machbaren mit Aufgaben und Lösungen. Teubner 2006, ISBN 978-3-8351-0078-7, pp. I-XIII, 1-354 - [j64]Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert:
On the Stability of Approximation for Hamiltonian Path Problems. Algorithmic Oper. Res. 1(1) (2006) - [c62]Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer:
Reusing Optimal TSP Solutions for Locally Modified Input Instances. IFIP TCS 2006: 251-270 - [c61]Juraj Hromkovic:
Contributing to General Education by Teaching Informatics. ISSEP 2006: 25-37 - [c60]Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke:
On the Approximation Hardness of Some Generalizations of TSP. SWAT 2006: 184-195 - 2005
- [b7]Juraj Hromkovic, Ralf Klasing, Andrzej Pelc, Peter Ruzicka, Walter Unger:
Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Texts in Theoretical Computer Science. An EATCS Series, Springer 2005, ISBN 978-3-540-00846-0, pp. 1-361 - [b6]Juraj Hromkovic:
Design and Analysis of Randomized Algorithms - Introduction to Design Paradigms. Texts in Theoretical Computer Science. An EATCS Series, Springer 2005, ISBN 978-3-540-23949-9, pp. 1-274 - [j63]Juraj Hromkovic, Georg Schnitger:
On the power of randomized multicounter machines. Theor. Comput. Sci. 330(1): 135-144 (2005) - [c59]Juraj Hromkovic, Georg Schnitger:
Communication Complexity Method for Proving Lower Bounds on Descriptional Complexity in Automata and Formal Language Theory. DCFS 2005: 38-38 - [c58]Juraj Hromkovic, Georg Schnitger:
NFAs With and Without epsilon-Transitions. ICALP 2005: 385-396 - [c57]Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert:
On the Stability of Approximation for Hamiltonian Path Problems. SOFSEM 2005: 147-156 - 2004
- [b5]Juraj Hromkovic:
Algorithmics for Hard Problems - Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics, Second Edition. Texts in Theoretical Computer Science. An EATCS Series, Springer 2004, ISBN 978-3-642-07909-2, pp. 1-538 - [j62]Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger:
On multi-partition communication complexity. Inf. Comput. 194(1): 49-75 (2004) - [j61]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) - [j60]Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger:
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Theor. Comput. Sci. 326(1-3): 137-153 (2004) - [c56]Juraj Hromkovic:
Stability of Approximation in Discrete Optimization. IFIP TCS 2004: 3-18 - [e3]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. Lecture Notes in Computer Science 3353, Springer 2004, ISBN 3-540-24132-9 [contents] - 2003
- [j59]Juraj Hromkovic, Martin Sauerhoff:
The Power of Nondeterminism and Randomness for Oblivious Branching Programs. Theory Comput. Syst. 36(2): 159-182 (2003) - [j58]Juraj Hromkovic, Georg Schnitger:
Nondeterministic Communication with a Limited Number of Advice Bits. SIAM J. Comput. 33(1): 43-68 (2003) - [c55]Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger:
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. CIAC 2003: 189-200 - [c54]Juraj Hromkovic, Georg Schnitger:
Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes. ICALP 2003: 66-80 - [c53]Juraj Hromkovic, Georg Schnitger:
Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation. ICALP 2003: 439-451 - 2002
- [j57]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) - [j56]Juraj Hromkovic:
Descriptional Complexity of Finite Automata: Concepts and Open Problems. J. Autom. Lang. Comb. 7(