Прати
Juraj Hromkovic
Juraj Hromkovic
Professor Emeritus für Informatik, ETH Zürich
Верификована је имејл адреса на inf.ethz.ch
Наслов
Навело
Навело
Година
Taschenbuch der mathematik
IN Bronstein, J Hromkovic, B Luderer, HR Schwarz, J Blath, A Schied, ...
Springer-Verlag, 2012
69262012
Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics
J Hromkovič
Springer Science & Business Media, 2013
7272013
Dissemination of information in interconnection networks (broadcasting and gossiping)
J Hromkovic, R Klasing, B Monien, R Peine
Combinatorial network theory 1, 125-212, 1996
3531996
Communication complexity and parallel computing
J Hromkovič
Springer Science & Business Media, 2013
2852013
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
2192005
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
152*2001
Information complexity of online problems
J Hromkovič, R Královič, R Královič
International Symposium on Mathematical Foundations of Computer Science, 24-36, 2010
1232010
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
1092008
Springer-Taschenbuch der Mathematik: Begründet von IN Bronstein und KA Semendjaew Weitergeführt von G. Grosche, V. Ziegler und D. Ziegler Herausgegeben von E. Zeidler
E Zeidler, W Hackbusch, J Hromkovic, B Luderer, HR Schwarz, J Blath, ...
Springer Fachmedien Wiesbaden, 2013
1042013
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
1032002
Theoretical computer science: introduction to Automata, computability, complexity, algorithmics, randomization, communication, and cryptography
J Hromkovič
Springer Science & Business Media, 2003
972003
Theoretische Informatik
J Hromkovic
Formale Sprachen, Berechenbarkeit, Komplexittstheorie, Algorithmik …, 2002
842002
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
782007
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
732014
Contributing to general education by teaching informatics
J Hromkovič
International Conference on Informatics in Secondary Schools-Evolution and …, 2006
732006
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
692000
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
671997
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
652008
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
632001
Reoptimization of steiner trees: Changing the terminal set
HJ Böckenhauer, J Hromkovič, R Královič, T Mömke, P Rossmanith
Theoretical computer science 410 (36), 3428-3435, 2009
552009
Систем тренутно не може да изврши ову радњу. Пробајте поново касније.
Чланци 1–20