Juraj Hromkovič

Q: What Schools Are Affiliated With Juraj Hromkovič

Juraj Hromkovič is affiliated with the following schools: ETH Zurich, Kiel University, Paderborn University, RWTH Aachen University, Comenius University

Juraj Hromkovič's AcademicInfluence.com Rankings

Juraj Hromkovič

Computer Science

#873

World Rank

#905

Historical Rank

Theoretical Computer Science

#27

World Rank

#27

Historical Rank

Database

#7963

World Rank

#8296

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Juraj Hromkovič Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Juraj Hromkovič is a Slovak Computer Scientist and Professor at ETH Zürich. He is the author of numerous monographs and scientific publications in the field of algorithmics, computational complexity theory, and randomization.

(See a Problem?)

Juraj Hromkovič's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping) (1996) (233)
Algorithmics for hard problems - introduction to combinatorial optimization, randomization, approximation, and heuristics (2001) (225)
Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (2005) (167)
Algorithmics for Hard Problems (2002) (139)
Communication Complexity and Parallel Computing (1997) (121)
Information Complexity of Online Problems (2010) (97)
Translating Regular Expressions into Small -Free Nondeterministic Finite Automata (2001) (97)
On the Hardness of Reoptimization (2008) (88)
Communication Complexity Method for Measuring Nondeterminism in Finite Automata (2002) (76)
The string guessing problem as a method to prove lower bounds on the advice complexity (2013) (68)
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem (2000) (65)
On the Approximability of TSP on Local Modifications of Optimally Solved Instances (2007) (57)
On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata (2001) (54)
Approximation algorithms for the TSP with sharpened triangle inequality (2000) (50)
Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations (1997) (49)
Reoptimization of Steiner Trees (2008) (48)
Online Coloring of Bipartite Graphs with and without Advice (2012) (47)
Design and Analysis of Randomized Algorithms - Introduction to Design Paradigms (2010) (46)
On the power of synchronization in parallel computations (1989) (44)
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata (1997) (43)
An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality (2000) (40)
Reoptimization of Steiner trees: Changing the terminal set (2009) (40)
Algorithmics for Hard Problems (2004) (40)
Descriptional Complexity of Finite Automata: Concepts and Open Problems (2002) (40)
The Parameterized Approximability of TSP with Deadlines (2007) (39)
Contributing to General Education by Teaching Informatics (2006) (39)
Nondeterministic communication with a limited number of advice bits (1996) (38)
Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs (1993) (38)
Reusing Optimal TSP Solutions for Locally Modified Input Instances (2006) (35)
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 (2011) (35)
The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems) (1991) (34)
A Comparison of Two Lower Bound Methods for Communication Complexity (1994) (32)
On the Power of Alternation in Automata Theory (1985) (32)
Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation (2003) (32)
On the Power of Advice and Randomization for the Disjoint Path Allocation Problem (2014) (31)
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (1997) (31)
Optimal algorithms for dissemination of information in generalized communication modes (1994) (31)
On the power of Las Vegas II: Two-way finite automata (1999) (29)
Theoretical Computer Science: Introduction to Automata, Compurability, Complexity, Algorithmics, Randomization, Communication, and Cryptography (2004) (29)
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (2002) (28)
Measures of Nondeterminism in Finite Automata (2000) (28)
Combining the Power of Python with the Simplicity of Logo for a Sustainable Computer Science Education (2016) (27)
The Complexity of Systolic Dissemination of Information in Interconnection Networks (1994) (27)
Models and algorithms for ground staff scheduling on airports (2005) (26)
Algorithmic Adventures - From Knowledge to Magic (2009) (26)
Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract) (1990) (25)
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms (2001) (25)
On the advice complexity of the online L(2, 1)-coloring problem on paths and cycles (2013) (23)
Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines (1994) (22)
Why Teaching Informatics in Schools Is as Important as Teaching Mathematics and Natural Sciences (2011) (21)
A Comparison of Two Lower-Bound Methods for Communication Complexity (1994) (21)
Design and Analysis of Randomized Algorithms (2005) (21)
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs (2000) (20)
Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms (Texts in Theoretical Computer Science. An EATCS Series) (2005) (20)
Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems (1993) (19)
On the Stability of Approximation for Hamiltonian Path Problems (2005) (19)
On the Power of Randomness versus Advice in Online Computation (2012) (18)
Examples of Algorithmic Thinking in Programming Education (2016) (18)
Dissemination of Information in Vertex-Disjoint Paths Mode (1996) (18)
One-way multihead deterministic finite automata (1983) (17)
On the approximability and hardness of minimum topic connected overlay and its special instances (2011) (17)
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 (2010) (17)
On the Power of One-Way Synchronized Alternating Machines with Small Space (1992) (17)
A robust PTAS for maximum independent sets in unit disk graphs (2004) (17)
Lower Bounds on the Size of Sweeping Automata (2009) (16)
Two Lower Bounds on Distributive Generation of Languages (1994) (16)
Stability of Approximation Algorithms for Hard Optimization Problems (1999) (16)
On multi-partition communication complexity (2004) (15)
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality (2003) (15)
Communication Complexity Hierarchy (1986) (15)
On the Approximation Hardness of Some Generalizations of TSP (2006) (15)
Stability of Approximation (2007) (15)
On probabilistic pushdown automata (2010) (15)
Creating and Testing Textbooks for Secondary Schools (2008) (15)
On Embedding Interconnection Networks into Rings of Processors (1992) (15)
Ambiguity and Communication (2009) (14)
Communication Protocols — An Exemplary Study of the Power of Randomness (2001) (14)
Knowing All Optimal Solutions Does Not Help for TSP Reoptimization (2011) (13)
The Power of Nondeterminism and Randomness for Oblivious Branching Programs (2003) (13)
XLogoOnline: A Single-Page, Browser-Based Programming Environment for Schools Aiming at Reducing Cognitive Load on Pupils (2017) (13)
Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract) (2016) (12)
The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality (2010) (12)
Algorithmic Thinking from the Start (2017) (12)
Optimal algorithms for dissemination of information in some interconnection networks (1993) (12)
Stability of Approximation Algorithms and the Knapsack Problem (1999) (12)
Comparing the size of NFAs with and without epsilon-transitions (2007) (11)
Hierarchy of Reversal and Zerotesting Bounded Multicounter Machines (1984) (11)
One-Way Simple Multihead Finite Automata are not Closed Under Concatenation (1983) (11)
On k-connectivity problems with sharpened triangle inequality (2008) (11)
Optimal Algorithms for Disemination of Information in Generalized Communication Modes (1992) (11)
Alternating Multicounter Machines with Constant Number of Reversals (1985) (10)
Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits (1992) (10)
Steiner tree reoptimization in graphs with sharpened triangle inequality (2012) (10)
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract) (1994) (10)
On Embeddings in Cycles (1995) (10)
NFAs With and Without epsilon-Transitions (2005) (9)
Tradeoffs for Language Recognition on Alternating Machines (1989) (9)
On Multipartition Communication Complexity (2001) (9)
Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (1991) (9)
The Computer Science Way of Thinking in Human History and Consequences for the Design of Computer Science Curricula (2017) (9)
The Advantages of a New Approach to Defining the Communication Complexity for VLSI (1988) (9)
Tradeoffs for Language Recognition on Parallel Computing Models (1986) (9)
Some complexity aspects of VLSI computations, part 1 (1988) (9)
On the Hardness of Reoptimization with Multiple Given Solutions (2011) (9)
Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks (1993) (9)
Communication Complexity and Sequential Compuation (1997) (9)
Advice Complexity of the Online Search Problem (2016) (9)
Hierarchy of reversal bounded one-way multicounter machines (1986) (8)
A separation of determinism, Las Vegas and nondeterminism for picture recognition (2000) (8)
Lower Bounds for Language Recognition on Two-Dimensional Alternating Multihead Machines (1989) (8)
On Synchronized Lindenmayer Picture Languages (1992) (8)
Comparing Descriptional and Computational Complexity of Infinite Words (1994) (7)
Lower Bounds on the Area Complexity of Boolean Circuits (1992) (7)
Reoptimization of Hard Optimization Problems (2018) (7)
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes (2008) (6)
Online Graph Coloring Against a Randomized Adversary (2018) (6)
On the Power of Alternation in Finite Automata (1984) (6)
Communication complexity and lower bounds on multilective computations (1998) (6)
Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes (2003) (6)
Teaching with LOGO Philosophy (2020) (6)
Homo Informaticus – Why Computer Science Fundamentals are an Unavoidable Part of Human Culture and How to Teach Them (2016) (6)
On the Power of Randomized Pushdown Automata (2001) (6)
On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations (1997) (6)
A Technique to Obtain Hardness Results for Randomized Online Algorithms - A Survey (2014) (6)
On one-way two-head deterministic finite state automata (1985) (6)
Zerotesting bounded one-way multicounter machines (1987) (5)
Homo Informaticus (2015) (5)
Some complexity aspects of VLSI computations. Part 6. Communication complexity (1989) (5)
Closure Properties of the Family of Languages Recognized by One-Way Two-Head Deterministic Finite State Automata (1981) (5)
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (2009) (5)
Linear Lower Bounds on Unbounded Fan-In Boolean Circuits (1985) (5)
Note on Optimal Gossiping in Some Weak-Connected Graphs (1994) (5)
On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks (1995) (5)
On the power of randomized multicounter machines (2005) (5)
A Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines (1989) (5)
Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract) (1995) (5)
Communication Complexity (1984) (4)
Some complexity aspects of VLSI computations. Part 4. VLSI circuits with programs (1988) (4)
Reversal-Bounded Nondeterministic Multicounter Machines and Complementation (1987) (4)
Graph Controlled Table Lindenmayer Systems (1988) (4)
ICALP Workshops 2000: Proceedings of the Satellite Workshops of the 27th International Colloquium on Automata, Languages, and Programming (2000) (4)
Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata (2020) (4)
Lower bound techniques for VLSI algorithms (1986) (4)
A Note on Realtime One-Way Synchronized Alternating One-Counter Automata (1993) (3)
On the number of monotonic functions from two-valued logic to k-valued logic (1985) (3)
Algorithmic aspects of some combinatorial problems in bioinformatics (2006) (3)
Fooling a two-way nondeterministic multihead automaton with reversal number restriction (1985) (3)
Stochastic Algorithms: Foundations and Applications, 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings (2007) (3)
Branching Programs as a Tool for Proving Lower Bounds on VLSI Computations and Optimal Algorithms for Systolic Arrays (1988) (3)
The Complexity of Paging Against a Probabilistic Adversary (2016) (3)
Complexity: A Language-Theoretic Point of View (1997) (3)
Reversals-space-parallelism tradeoffs for language recognition (1991) (3)
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata (2004) (3)
Proceedings of the 37th international conference on Current trends in theory and practice of computer science (2011) (3)
What One Has to Know When Attacking P vs. NP (Extended Abstract) (2017) (2)
Randomized Communication Protocols (A Survey) (2001) (2)
Abundance of Witnesses (2005) (2)
Online Simple Knapsack with Reservation Costs (2020) (2)
Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers (2004) (2)
Stability of Approximation in Discrete Optimization (2004) (2)
Determinism vs. Nondeterminism for Two-Way Automata - Representing the Meaning of States by Logical Formulæ (2012) (2)
On the power of two-dimensional synchronized alternating finite automata (1991) (2)
On the Size of Two-Way Reasonable Automata for the Liveness Problem (2015) (2)
Theoretical Computer Science (2003) (2)
Multihead Finite State Automata and Concatenation (1982) (2)
Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science (1998) (2)
Some complexity aspects of VLSI computations. V: Nondeterministic and probabilistic VLSI circuits (1989) (2)
On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks (2009) (2)
Determinism vs. Nondeterminism for Two-Way Automata: Representing the Meaning of States by Logical Formulæ (2013) (2)
Effective Systolic Algorithms for Gossiping in Cycles (1998) (2)
On the Approximability of Minimum Topic Connected Overlay and Its Special Instances (2011) (2)
Designing informatics curriculum for K-12 education: From Concepts to Implementations (2021) (2)
Some complexity aspects of VLSI computations. Part 3. On the power of input bit permutation in tree and trellis automata (1988) (2)
A Nonlinear Lower Bound on the Practical Combinational Complexity (1992) (2)
Two Lower Bounds on Computational Complexity of Infinite Word Generation (1994) (1)
On the Communication Complexity of Distributive Language Generation (1995) (1)
Algorithmics - Is There Hope for a Unified Theory? (2010) (1)
Efficient Algorithms for the Spoonerism Problem (2007) (1)
On the inapproximability of the metric traveling salesman problem (2000) (1)
Descriptional Complexity of Regular Languages (Concepts and Open Problems) (2001) (1)
A New Approach to Defining the Complexity for VLSI (1986) (1)
On the advice complexity of the online dominating set problem (2021) (1)
Can Solving Short Tasks be an Essential Part of Constructionist Learning (2019) (1)
How to convince teachers to teach computer science even if informatics was never a part of their own studies (2017) (1)
Topology of Parallel Networks and Computational Complexity (Extended Abstract) (1992) (1)
Two Lower Bounds on Computational Complexity of Infinite Words (1997) (1)
What one has to know when attacking P vs. NP (2020) (1)
Editorial (2011) (1)
Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429(2012) 144-154] (2015) (1)
Lower Bounds on Systolic Array Computations and the Optimality of Kung's Convolution Algorithm (1994) (1)
Abstract symbol systems - an exercise of the bottom-up approach in artificial intelligence (1992) (1)
A Two-Dimensional Classification Model for the Bebras Tasks on Informatics Based Simultaneously on Subfields and Competencies (2020) (1)
Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (Extended Abstract) (1991) (1)
On the Power of Laconic Advice in Communication Complexity (2016) (0)
The Education Column (2018) (0)
Salomaa Prize in Automata Theory, Formal Languages and related topics (2022) (0)
Lineare Regression (2020) (0)
Success Amplification and Random Sampling (2005) (0)
Branching programs versus oblivious branching programs (1991) (0)
How to Make Good Decisions for an Unknown Future or How to Foil an Adversary (2009) (0)
Computing with DNA Molecules, or Biological Computer Technology on the Horizon (2009) (0)
The growth functions of stochastic TOL languages (1986) (0)
Communication Protocol Models (1997) (0)
Some contributions of the study of abstract communication complexity to other areas of computer science (1999) (0)
Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations (2021) (0)
Information Content of Online Problems Advice versus Determinism and Randomization (2015) (0)
Infinity Is Not Equal to Infinity, or Why Infinity Is Infinitely Important in Computer Science (2009) (0)
Preface (2010) (0)
Randomness in Nature and as a Source of Efficiency in Algorithmics (2009) (0)
A Guide to Solving Hard Problems (2004) (0)
The knowledge on information content of problems provides much useful information to circuit designers (1989) (0)
On the power of Yao-Rivest technique (1984) (0)
A note on the "Comuunication Complexity" paper by Papadimitriou and Sipser (1984) (0)
Series Complexity : A Language-- Theoretic Point of View (1995) (0)
The Problem with Debugging in Current Block-based Programming Environments (2021) (0)
Introduction: Workshop on Boolean Functions and Applications (2000) (0)
Limits of Computability or Why Do There Exist Tasks That Cannot Be Solved Automatically by Computers (2009) (0)
Online Coloring of Bipartite Graphs with and without Advice (2013) (0)
Complexity Theory or What to Do When the Energy of the Universe Doesn’t Suffice for Performing a Computation? (2009) (0)
A candidate for nonlinear lower bound on the combinatorial complexity (1988) (0)
Preface (2013) (0)
Bandwidth Constrained Multi-interface Networks (2018) (0)
Two-Way Non-uniform Finite Automata (2022) (0)
Alan Turing and the Foundation of Computer Science (2015) (0)
Improved Approximations for Hard Optimization Problems via Problem Instance Classification (2011) (0)
Variable Multihead Machines (1991) (0)
Foiling the Adversary (2005) (0)
Optimization and Random Rounding (2005) (0)
Algorithmics, or What Have Programming and Baking in Common? (2009) (0)
ETH Library On the Advice Complexity of the Online L(2, 1)-Coloring Problem on Paths and Cycles (2017) (0)
Branching programs provide lower bounds on the area of VLSI circuits (1991) (0)
A Short Story About the Development of Computer Science or Why Computer Science Is Not a Computer Driving Licence (2009) (0)
SOFSEM 2011: Theory and Practice of Computer Science 37thConference on Current Trends in Theory and Practice of ComputerScience (2011) (0)
Constructing Computational Thinking using CS Unplugged (2019) (0)
VLSI Circuits and Interconnection Networks (1997) (0)
Stochastic Algorithms: Foundations and Applications (2008) (0)
Languages Alive (2012) (0)
Developments in Language Theory (2012) (0)
Quantum Computers, or Computing in the Wonderland of Particles (2009) (0)
Communication Complexity Method for Proving Lower Bounds on Descriptional Complexity in Automata and Formal Language Theory (2005) (0)
Why the Concept of Computational Complexity is Hard for Verifiable Mathematics (2015) (0)
Proceedings of the 4th International Conference on Informatics in Secondary Schools - Evolution and Perspectives: Teaching Fundamentals Concepts of Informatics (2009) (0)
Open problems in automata theory related to complexity theory (1986) (0)
A Case for Interdisciplinarity (2020) (0)
Distributed Computing and Education Column Special Issue (2018) (0)
Cryptography, or How to Transform Drawbacks into Advantages (2009) (0)
Algorithms for Hard Problems: Approximation and Parameterization (2018) (0)
Reversal Complexity of Multicounter and Multihead Machines (1987) (0)
Graph-theoretic concepts in computer science : 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998 : proceedings (1998) (0)
On problems for which no oracle can help (1991) (0)
Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science (2004) (0)
Fun with Algorithms (2007) (0)
Foreword (2001) (0)

This paper list is powered by the following services:

Other Resources About Juraj Hromkovič

en.wikipedia.org

What Schools Are Affiliated With Juraj Hromkovič?

Juraj Hromkovič is affiliated with the following schools:

Juraj Hromkovič's Academic­Influence.com Rankings

Why Is Juraj Hromkovič Influential?

Juraj Hromkovič's Published Works

Published Works

Other Resources About Juraj Hromkovič

What Schools Are Affiliated With Juraj Hromkovič?

Image Attributions

Juraj Hromkovič's AcademicInfluence.com Rankings