Juraj Hromkovic
According to our database1,
Juraj Hromkovic
authored at least 192 papers
between 1981 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:
-
at zbmath.org
-
at inf.ethz.ch
-
at id.loc.gov
-
at d-nb.info
-
at isni.org
On csauthors.net:
Bibliography
2020
2019
Wirtschaftsinformatik Manag., 2019
Bilden wir die Erfinderinnen, Gestalter und Entwicklerinnen digitaler Technologie aus und nicht nur ihre Konsumenten!
Informatik Spektrum, 2019
2018
Int. J. Found. Comput. Sci., 2018
Int. J. Found. Comput. Sci., 2018
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2017
How to convince teachers to teach computer science even if informatics was never a part of their own studies.
Bull. EATCS, 2017
XLogoOnline: A Single-Page, Browser-Based Programming Environment for Schools Aiming at Reducing Cognitive Load on Pupils.
Proceedings of the Informatics in Schools: Focus on Learning Programming, 2017
The Computer Science Way of Thinking in Human History and Consequences for the Design of Computer Science Curricula.
Proceedings of the Informatics in Schools: Focus on Learning Programming, 2017
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017
2016
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016
Combining the Power of Python with the Simplicity of Logo for a Sustainable Computer Science Education.
Proceedings of the Informatics in Schools: Improvement of Informatics Knowledge and Perception, 2016
2015
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., 2015
Electronic Colloquium on Computational Complexity (ECCC), 2015
2014
The string guessing problem as a method to prove lower bounds on the advice complexity.
Theor. Comput. Sci., 2014
Theor. Comput. Sci., 2014
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014
Proceedings of the Computing with New Resources, 2014
2013
Determinism vs. Nondeterminism for Two-Way Automata: Representing the Meaning of States by Logical Formulæ.
Int. J. Found. Comput. Sci., 2013
On the Advice Complexity of the Online <i>L</i>(2, 1)-Coloring Problem on Paths and Cycles.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013
Konzepte und Inhalte eines Fachs Informatik.
Proceedings of the informatik@gymnasium - Ein Entwurf für die Schweiz., 2013
Die Bildungsziele.
Proceedings of the informatik@gymnasium - Ein Entwurf für die Schweiz., 2013
Was ist Informatik?
Proceedings of the informatik@gymnasium - Ein Entwurf für die Schweiz., 2013
2012
On the approximability and hardness of minimum topic connected overlay and its special instances.
Theor. Comput. Sci., 2012
J. Discrete Algorithms, 2012
Proceedings of the Languages Alive, 2012
Einführung in die Programmierung mit LOGO - Lehrbuch für Unterricht und Selbststudium (2. Aufl.).
Vieweg+Teubner, ISBN: 978-3-8348-2266-6, 2012
2011
Fehlerkorrigierende Codes - Ein Unterrichtsbeispiel zum gelenkten entdeckenden Lernen.
LOG IN, 2011
Fundam. Inform., 2011
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011
Why Teaching Informatics in Schools Is as Important as Teaching Mathematics and Natural Sciences.
Proceedings of the Informatics in Schools. Contributing to 21st Century Education, 2011
Proceedings of the Computation, 2011
Improved Approximations for Hard Optimization Problems via Problem Instance Classification.
Proceedings of the Rainbow of Computer Science, 2011
2010
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010
Proceedings of the Computer Science, 2010
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010
2009
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's.
Theor. Comput. Sci., 2009
Theor. Comput. Sci., 2009
On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
SIAM J. Discret. Math., 2009
Sieben Wunder der Informatik - Eine Reise an die Grenze des Machbaren mit Aufgaben und Lösungen (2. Aufl.).
Teubner, ISBN: 978-3-8351-0172-2, 2009
Springer, ISBN: 978-3-540-85985-7, 2009
2008
J. Discrete Algorithms, 2008
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008
Proceedings of the Informatics Education - Supporting Computational Thinking, Third International Conference on Informatics in Secondary Schools, 2008
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008
Lehrbuch Informatik - Vorkurs Programmieren, Geschichte und Begriffsbildung, Automatenentwurf.
Vieweg, ISBN: 978-3-8348-0620-8, 2008
2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Theor. Comput. Sci., 2007
Algorithmic Oper. Res., 2007
Algorithmic Oper. Res., 2007
Proceedings of the Fun with Algorithms, 4th International Conference, 2007
Theoretische Informatik - formale Sprachen, Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kommunikation und Kryptographie, 3. Auflage.
Leitfäden der Informatik, Teubner, ISBN: 978-3-8351-0043-5, 2007
2006
Algorithmic Oper. Res., 2006
Proceedings of the Algorithm Theory, 2006
Proceedings of the Informatics Education - The Bridge between Using and Understanding Computers, International Conference in Informatics in Secondary Schools, 2006
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006
Sieben Wunder der Informatik - eine Reise an die Grenze des Machbaren mit Aufgaben und Lösungen.
Teubner, ISBN: 978-3-8351-0078-7, 2006
2005
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-27903-7, 2005
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005
Communication Complexity Method for Proving Lower Bounds on Descriptional Complexity in Automata and Formal Language Theory.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005
Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-26663-1, 2005
2004
Algorithmics for Hard Problems - Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics, Second Edition
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-05269-3, 2004
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality.
Theor. Comput. Sci., 2004
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata.
J. Comput. Syst. Sci., 2004
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004
2003
SIAM J. Comput., 2003
Theory Comput. Syst., 2003
Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003
2002
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
Theor. Comput. Sci., 2002
J. Autom. Lang. Comb., 2002
Inf. Comput., 2002
2001
Algorithmics for Hard Problems - Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-04616-6, 2001
Zufall und zufallsgesteuerte Algorithmen.
LOG IN, 2001
J. Comput. Syst. Sci., 2001
On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata.
Inf. Comput., 2001
Electronic Colloquium on Computational Complexity (ECCC), 2001
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2001
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001
Proceedings of the Developments in Language Theory, 5th International Conference, 2001
Descriptional Complexity of Regular Languages (Concepts and Open Problems).
Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001
Algorithmischen Konzepte der Informatik - Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kryptographie
Teubner, ISBN: 3-519-00332-5, 2001
Algorithmics for hard problems - introduction to combinatorial optimization, randomization, approximation, and heuristics.
Springer, ISBN: 978-3-540-66860-2, 2001
2000
Inf. Process. Lett., 2000
Electronic Colloquium on Computational Complexity (ECCC), 2000
Electronic Colloquium on Computational Complexity (ECCC), 2000
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs.
Proceedings of the STACS 2000, 2000
An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality.
Proceedings of the STACS 2000, 2000
Introduction: Workshop on Boolean Functions and Applications.
Proceedings of the ICALP Workshops 2000, 2000
1999
RAIRO Theor. Informatics Appl., 1999
Some Constributions of the Study of Abstract Communication Complexity to Other Areas of Computer Science.
ACM Comput. Surv., 1999
Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999
Stability of Approximation Algorithms and the Knapsack Problem.
Proceedings of the Jewels are Forever, 1999
1998
1997
Proceedings of the Handbook of Formal Languages, 1997
Inf. Comput., 1997
On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations
Electronic Colloquium on Computational Complexity (ECCC), 1997
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997
Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997
Proceedings of the New Trends in Formal Languages, 1997
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-03442-2, 1997
1996
Theor. Comput. Sci., 1996
Dissemination of Information in Vertex-Disjoint Paths Mode.
Comput. Artif. Intell., 1996
1995
Theor. Comput. Sci., 1995
Inf. Comput., 1995
On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
Proceedings of the STACS 95, 1995
Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995
On the Communication Complexity of Distributive Language Generation.
Proceedings of the Developments in Language Theory II, 1995
1994
Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines.
Theor. Comput. Sci., 1994
Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems.
Theor. Comput. Sci., 1994
RAIRO Theor. Informatics Appl., 1994
Optimal algorithms for dissemination of information in generalized communication modes.
Discret. Appl. Math., 1994
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract).
Proceedings of the Algorithm Theory, 1994
Two Lower Bounds on Computational Complexity of Infinite Word Generation.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994
Proceedings of the Results and Trends in Theoretical Computer Science, 1994
Lower Bounds on Systolic Array Computations and the Optimality of Kung's Convolution Algorithm.
Proceedings of the Mathematical Aspects of Natural and Formal Languages, 1994
1993
Theor. Comput. Sci., 1993
Optimal Algorithms for Dissemination of Information in Some Interconnection Networks.
Algorithmica, 1993
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993
1992
Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits
Inf. Comput., February, 1992
Abstract symbol systems - an exercise of the bottom-up approach in artificial intelligence.
J. Exp. Theor. Artif. Intell., 1992
Int. J. Found. Comput. Sci., 1992
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992
Proceedings of the PARLE '92: Parallel Architectures and Languages Europe, 1992
Optimal Algorithms for Disemination of Information in Generalized Communication Modes.
Proceedings of the PARLE '92: Parallel Architectures and Languages Europe, 1992
Proceedings of the Informatik, Festschrift zum 60. Geburtstag von Günter Hotz, 1992
1991
Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators
Inf. Comput., December, 1991
Kybernetika, 1991
On the power of two-dimensional synchronized alternating finite automata.
Fundam. Inform., 1991
Variable Multihead Machines.
J. Inf. Process. Cybern., 1991
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991
Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991
1990
Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990
1989
Theor. Comput. Sci., 1989
Theor. Comput. Sci., 1989
Lower Bounds for Language Recognition on Two-Dimensional Alternating Multihead Machines.
J. Comput. Syst. Sci., 1989
The knowledge on information content of problems provides much useful information to circuit designers.
Bull. EATCS, 1989
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989
1988
Theor. Comput. Sci., 1988
Graph Controlled Table Lindenmayer Systems.
J. Inf. Process. Cybern., 1988
A candidate for nonlinear lower bound on the combinatorial complexity.
Bull. EATCS, 1988
Branching Programs as a Tool for Proving Lower Bounds on VLSI Computations and Optimal Algorithms for Systolic Arrays.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988
1987
Theor. Comput. Sci., 1987
Proceedings of the STACS 87, 1987
1986
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986
1985
Kybernetika, 1985
Inf. Process. Lett., 1985
Fooling a Two-Way Nondeterministic Multihead Automaton with Reversal Number Restriction.
Acta Informatica, 1985
1984
A note on the "Comuunication Complexity" paper by Papadimitriou and Sipser.
Bull. EATCS, 1984
On the power of Yao-Rivest technique.
Bull. EATCS, 1984
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984
1983
Theor. Comput. Sci., 1983
1982
1981
Closure Properties of the Family of Languages Recognized by One-Way Two-Head Deterministic Finite State Automata.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981