Suivre
Juraj Hromkovic
Juraj Hromkovic
Professor der Informatik, ETH Zuerich
Adresse e-mail validée de inf.ethz.ch - Page d'accueil
Titre
Citée par
Citée par
Année
Taschenbuch der mathematik
IN Bronstein, J Hromkovic, B Luderer, HR Schwarz, J Blath, A Schied, ...
Springer-Verlag, 2012
68132012
Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics
J Hromkovič
Springer Science & Business Media, 2013
6942013
Dissemination of information in interconnection networks (broadcasting & gossiping)
J Hromkovič, R Klasing, B Monien, R Peine
Combinatorial network theory, 125-212, 1996
3281996
Communication complexity and parallel computing
J Hromkovič
Springer Science & Business Media, 1997
2771997
Dissemination of information in communication networks: broadcasting, gossiping, leader election, and fault-tolerance
J Hromkovič, R Klasing, A Pelc, P Ruzicka, W Unger
Springer Science & Business Media, 2005
2022005
Translating regular expressions into small ε-free nondeterministic finite automata
J Hromkovič, S Seibert, T Wilke
Journal of Computer and System Sciences 62 (4), 565-588, 2001
144*2001
On the hardness of reoptimization
HJ Böckenhauer, J Hromkovič, T Mömke, P Widmayer
SOFSEM 2008: Theory and Practice of Computer Science: 34th Conference on …, 2008
1012008
Information complexity of online problems
J Hromkovič, R Královič, R Královič
Mathematical Foundations of Computer Science 2010: 35th International …, 2010
992010
Communication complexity method for measuring nondeterminism in finite automata
J Hromkovič, S Seibert, J Karhumäki, H Klauck, G Schnitger
Information and Computation 172 (2), 202-217, 2002
912002
Theoretical computer science: introduction to Automata, computability, complexity, algorithmics, randomization, communication, and cryptography
J Hromkovič
Springer Science & Business Media, 2003
892003
On the approximability of TSP on local modifications of optimally solved instances
HJ Böckenhauer, L Forlizzi, J Hromkovič, J Kneis, J Kupke, G Proietti, ...
Algorithmic Operations Research 2 (2), 83-93, 2007
702007
Contributing to general education by teaching informatics
J Hromkovič
Informatics Education–The Bridge between Using and Understanding Computers …, 2006
692006
The string guessing problem as a method to prove lower bounds on the advice complexity
HJ Böckenhauer, J Hromkovič, D Komm, S Krug, J Smula, A Sprock
Theoretical Computer Science 554, 95-108, 2014
662014
Approximation algorithms for the TSP with sharpened triangle inequality
HJ Böckenhauer, J Hromkovič, R Klasing, S Seibert, W Unger
Information Processing Letters 75 (3), 133-138, 2000
652000
Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
P Ďuriš, J Hromkovič, JDP Rolim, G Schnitger
STACS 97: 14th Annual Symposium on Theoretical Aspects of Computer Science …, 1997
641997
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
J Hromkovič, G Schnitger
Information and Computation 169 (2), 284-296, 2001
622001
Theoretische informatik
J Hromkovic
Formale Sprachen, Berechenbarkeit, Komplexittstheorie, Algorithmik …, 2002
602002
Reoptimization of Steiner trees
D Bilò, HJ Böckenhauer, J Hromkovič, R Královič, T Mömke, P Widmayer, ...
Algorithm Theory–SWAT 2008: 11th Scandinavian Workshop on Algorithm Theory …, 2008
582008
Algorithmic adventures: From knowledge to magic
J Hromkovič
Springer Science & Business Media, 2009
542009
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem
HJ Böckenhauer, J Hromkovič, R Klasing, S Seibert, W Unger
Theoretical Computer Science 285 (1), 3-24, 2002
542002
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20