Edit Profile (opens in new tab) Hromkovič, Juraj Compute Distance To: Compute Author ID: hromkovic.juraj Published as: Hromkovič, Juraj; Hromkovic, Juraj; Hromkovič, J.; Hromkovic, J.; Hromkovič, Juray more...less Homepage: http://www.ite.ethz.ch/people/host/jhromkov/index External Links: MGP · Wikidata · ResearchGate · dblp · GND · IdRef Documents Indexed: 192 Publications since 1981, including 17 Books 5 Contributions as Editor Reviewing Activity: 121 Reviews Biographic References: 1 Publication Co-Authors: 104 Co-Authors with 136 Joint Publications 1,857 Co-Co-Authors all top 5 Co-Authors 61 single-authored 31 Böckenhauer, Hans-Joachim 25 Schnitger, Georg 17 Unger, Walter 16 Klasing, Ralf 14 Seibert, Sebastian 11 Královič, Richard 9 Mömke, Tobias 7 Ďuriš, Pavol 7 Inoue, Katsushi 7 Královič, Rastislav 7 Proietti, Guido 7 Steffen, Björn 6 Bianchi, Maria Paola 6 Komm, Dennis 6 Krug, Sacha 6 Monien, Burkhard 6 Sprock, Andreas 6 Wagener, Hubert 6 Widmayer, Peter 5 Karhumaki, Juhani 5 Pardubská, Dana 5 Takanami, Itsuo 4 Bongartz, Dirk 4 Freiermuth, Karin 4 Kari, Jarkko 4 Kari, Lila 4 Keller, Lucia 4 Rossmanith, Peter 4 Rovan, Branislav 4 Sauerhoff, Martin 4 Slobodová, Anna 3 Forlizzi, Luca 3 Hosoda, Jun 3 Izumi, Taisuke 3 Jeschke, Claus-Dieter 3 Kneis, Joachim 3 Kupke, Joachim 3 Ono, Hirotaka 3 Smula, Jasmin 3 Steinhöfel, Kathleen K. 3 Steinová, Monika 3 Sýkora, Ondrej 3 Waczulík, Juraj 3 Wada, Koichi 2 Barhum, Kfir 2 Barot, Michael 2 Burjons, Elisabet 2 Dassow, Jürgen 2 Dietzfelbinger, Martin 2 Frei, Fabian 2 Gubáš, Xaver 2 Klauck, Hartmut 2 Kováč, Ivan 2 Muñoz, Xavier 2 Štefanec, Richard 2 Wilke, Thomas 2 Yukna, Stasys P. 1 Bilò, Davide 1 Černá, Ivana 1 Chrobak, Marek 1 Clemente, Jhoirene 1 Dobrev, Stefan 1 Feldmann, Rainer 1 Forišek, Michal 1 Ftáčnik, Milan 1 Gebauer, Heidi 1 Gyimóthy, Tibor 1 Ito, Akira 1 Janiga, Ladislav 1 Jefferey, Keith 1 Kanarek, Przemysawa 1 Kelemen, Jozef 1 Koubek, Vaclav 1 Krause, Matthias 1 Kudahl, Christian 1 Kupková, Erika 1 Lory, Krzysztof 1 Loryś, Krzysztof 1 Lozhkin, Sergei A. 1 Madhavapeddy, Seshu 1 Meinel, Christoph 1 Mertan, Jozef 1 Müller, Vladimír 1 Mysliwietz, Peter 1 Nagl, Manfred 1 Nunkesser, Marc 1 Peine, Regine 1 Pelc, Andrzej 1 Petersen, Holger 1 Procházka, Juraj 1 Rolim, José D. P. 1 Ruzicka, Peter 1 Rybko, Andrej I. 1 Sapozhenko, Aleksandr Antonovich 1 Škalikova, Nadežda A. 1 Stöhr, Elena A. 1 Šuster, B. 1 Vrto, Imrich 1 Vukolić, Marko 1 Waack, Stephan ...and 4 more Co-Authors all top 5 Serials 26 Theoretical Computer Science 15 Computers and Artificial Intelligence 9 Information and Computation 5 Journal of Computer and System Sciences 4 Kybernetika 4 International Journal of Foundations of Computer Science 4 Lecture Notes in Computer Science 4 Texts in Theoretical Computer Science. An EATCS Series 3 Discrete Applied Mathematics 3 Information Processing Letters 3 Theory of Computing Systems 3 Algorithmic Operations Research 2 Acta Informatica 2 Annales Societatis Mathematicae Polonae. Series IV 2 Algorithmica 2 Journal of Information Processing and Cybernetics 2 Bulletin of the European Association for Theoretical Computer Science (EATCS) 2 Journal of Automata, Languages and Combinatorics 2 Fundamenta Informaticae 2 Journal of Discrete Algorithms 2 Grundstudium Mathematik 1 Mathematica Slovaca 1 Mathematical Systems Theory 1 SIAM Journal on Computing 1 Acta Mathematica Universitatis Comenianae 1 SIAM Journal on Discrete Mathematics 1 Diskretnaya Matematika 1 JETAI. Journal of Experimental & Theoretical Artificial Intelligence 1 RAIRO. Informatique Théorique et Applications 1 RAIRO. Theoretical Informatics and Applications all top 5 Fields 181 Computer science (68-XX) 34 Information and communication theory, circuits (94-XX) 22 Operations research, mathematical programming (90-XX) 19 Combinatorics (05-XX) 11 Mathematical logic and foundations (03-XX) 9 General and overarching topics; collections (00-XX) 3 Number theory (11-XX) 3 Probability theory and stochastic processes (60-XX) 3 Mathematics education (97-XX) 2 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 1 History and biography (01-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 Statistics (62-XX) 1 Numerical analysis (65-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 132 Publications have been cited 859 times in 487 Documents Cited by ▼ Year ▼ Dissemination of information in interconnection networks (broadcasting & gossiping). Zbl 0840.68088Hromkovič, Juraj; Klasing, Ralf; Monien, Burkhard; Peine, Regine 61 1996 Communication complexity and parallel computing. Zbl 0873.68098Hromkovič, Juraj 39 1997 Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance. Zbl 1067.68016Hromkovič, Juraj; Klasing, Ralf; Pelc, Andrzej; Ružička, Peter; Unger, Walter 37 2005 Information complexity of online problems. Zbl 1287.68083Hromkovič, Juraj; Královič, Rastislav; Královič, Richard 31 2010 Communication complexity method for measuring nondeterminism in finite automata. Zbl 1009.68067Hromkovič, Juraj; Seibert, Sebastian; Karhumäki, Juhani; Klauck, Hartmut; Schnitger, Georg 30 2002 Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata. Zbl 1014.68093Hromkovič, Juraj; Seibert, Sebastian; Wilke, Thomas 26 2001 On the hardness of reoptimization. Zbl 1133.68351Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Mömke, Tobias; Widmayer, Peter 21 2008 On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata. Zbl 1007.68065Hromkovič, Juraj; Schnitger, Georg 18 2001 The string guessing problem as a method to prove lower bounds on the advice complexity. Zbl 1360.68908Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Komm, Dennis; Krug, Sacha; Smula, Jasmin; Sprock, Andreas 18 2014 On the power of synchronization in parallel computations. Zbl 0734.68036Hromkovič, Juraj; Karhumäki, Juhani; Rovan, Branislav; Slobodová, Anna 17 1991 On the approximability of TSP on local modifications of optimally solved instances. Zbl 1206.90134Böckenhauer, Hans-Joachim; Forlizzi, Luca; Hromkovič, Juraj; Kneis, Joachim; Kupke, Joachim; Proietti, Guido; Widmayer, Peter 17 2007 Approximation algorithms for the TSP with sharpened triangle inequality. Zbl 1338.68289Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Klasing, Ralf; Seibert, Sebastian; Unger, Walter 16 2000 An improved lower bound on the approximability of metric TSP and approximation algorithms for the TSP with sharpened triangle inequality (extended abstract). Zbl 1028.90044Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Klasing, Ralf; Seibert, Sebastian; Unger, Walter 16 2000 Reoptimization of Steiner trees. Zbl 1155.68574Bilò, Davide; Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Královič, Richard; Mömke, Tobias; Widmayer, Peter; Zych, Anna 15 2008 One way multihead deterministic finite automata. Zbl 0504.68049Hromkovic, J. 14 1983 A comparison of two lower-bound methods for communication complexity. Zbl 0874.68150Dietzfelbinger, Martin; Hromkovič, Juraj; Schnitger, Georg 14 1996 Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Zbl 1094.90036Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Klasing, Ralf; Seibert, Sebastian; Unger, Walter 14 2002 On the power of advice and randomization for the disjoint path allocation problem. Zbl 1432.68009Barhum, Kfir; Böckenhauer, Hans-Joachim; Forišek, Michal; Gebauer, Heidi; Hromkovič, Juraj; Krug, Sacha; Smula, Jasmin; Steffen, Björn 14 2014 Nondeterminism versus determinism for two-way finite automata: Generalizations of Sipser’s separation. Zbl 1039.68068Hromkovič, Juraj; Schnitger, Georg 12 2003 Descriptional complexity of finite automata: concepts and open problems. Zbl 1094.68576Hromkovič, Juraj 12 2002 On the power of alternation in automata theory. Zbl 0582.68018Hromkovič, Juraj 12 1985 Optimal algorithms for dissemination of information in generalized communication modes. Zbl 0823.68041Feldmann, R.; Hromkovič, Juraj; Madhavapeddy, S.; Monien, B.; Mysliwietz, P. 11 1994 On the power of synchronization in parallel computations. Zbl 0755.68045Dassow, Jürgen; Hromkovič, Juraj; Karhumäki, Juhani; Rovan, Branislav; Slobodová, Anna 11 1989 Reoptimization of Steiner trees: changing the terminal set. Zbl 1192.68471Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Královič, Richard; Mömke, Tobias; Rossmanith, Peter 11 2009 Online coloring of bipartite graphs with and without advice. Zbl 1314.68403Bianchi, Maria Paola; Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Keller, Lucia 11 2012 Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs. Zbl 1096.68514Hromkovič, Juraj; Klasing, Ralf; Stöhr, Elena A.; Wagener, Hubert 10 1995 Deterministic versus nondeterministic space in terms of synchronized alternating machines. Zbl 0821.68056Hromkovič, Juraj; Rovan, Branislav; Slobodova, Anna 10 1994 Online coloring of bipartite graphs with and without advice. Zbl 1314.68404Bianchi, Maria Paola; Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Keller, Lucia 10 2014 The parameterized approximability of TSP with deadlines. Zbl 1148.68052Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Kneis, Joachim; Kupke, Joachim 9 2007 The string guessing problem as a method to prove lower bounds on the advice complexity (extended abstract). Zbl 1382.68333Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Komm, Dennis; Krug, Sacha; Smula, Jasmin; Sprock, Andreas 9 2013 Algorithmics for hard problems. 2nd ed., corr. 2nd printing. Zbl 1069.68642Hromkovič, Juraj 8 2004 Design and analysis of randomized algorithms. Introduction to design paradigms. Zbl 1083.68146Hromkovič, Juraj 8 2005 Tradeoffs between nondeterminism and complexity for communication protocols and branching programs (extended abstract). Zbl 0959.68522Hromkovič, Juraj; Sauerhoff, Martin 8 2000 Tradeoffs for language recognition on alternating machines. Zbl 0667.68060Hromkovič, Juraj 7 1989 On the power of randomness versus advice in online computation. Zbl 1367.68340Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Komm, Dennis; Královič, Richard; Rossmanith, Peter 7 2012 The power of nondeterminism and randomness for oblivious branching programs. Zbl 1039.68083Hromkovič, Juraj; Sauerhoff, Martin 7 2003 On the power of one-way synchronized alternating machines with small space. Zbl 0769.68030Hromkovič, Juraj; Inoue, Katsushi; Rovan, Branislav; Slobodová, Anna; Takanami, Itsuo; Wagner, Klaus W. 6 1992 On multi-partition communication complexity. Zbl 1073.68030Ďuriš, Pavol; Hromkovič, Juraj; Jukna, Stasys; Sauerhoff, Martin; Schnitger, Georg 6 2004 Optimal algorithms for broadcast and gossip in the edge-disjoint modes. Zbl 0878.68070Hromkovič, Juraj; Klasing, Ralf; Unger, Walter; Wagener, Hubert 6 1997 Measures of nondeterminism in finite automata. Zbl 0973.68114Hromkovič, Juray; Karhumäki, Juhani; Klauck, Hartmut; Schnitger, Georg; Seibert, Sebastian 6 2000 On the power of Las Vegas II: Two-way finite automata. Zbl 0983.68098Hromkovič, J.; Schnitger, G. 6 2001 Job shop scheduling with unit length tasks: bounds and algorithms. Zbl 1186.90051Hromkovič, Juraj; Mömke, Tobias; Steinhöfel, Kathleen; Widmayer, Peter 6 2007 Hierarchy of reversal and zerotesting bounded multicounter machines. Zbl 0582.68049Hromkovič, J. 6 1984 Some complexity aspects of VLSI computations. I: A framework for the study of information transfer in VLSI circuits. Zbl 0644.94027Hromkovič, Juraj 6 1988 One-way simple multihead finite automata are not closed under concatenation. Zbl 0523.68070Duris, Pavol; Hromkovic, Juraj 5 1983 Fooling a two-way nondeterministic multihead automaton with reversal number restriction. Zbl 0565.68078Hromkovič, Juraj 5 1985 Alternating multicounter machines with constant number of reversals. Zbl 0579.68033Hromkovič, Juraj 5 1985 On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Zbl 1093.68070Böckenhauer, Hans-Joachim; Bongartz, Dirk; Hromkovič, Juraj; Klasing, Ralf; Proietti, Guido; Seibert, Sebastian; Unger, Walter 5 2004 Optimal algorithms for dissemination of information in some interconnection networks. Zbl 0773.68007Hromkovič, Juraj; Jeschke, Claus-Dieter; Monien, Burkhard 5 1993 Communication protocols – an exemplary study of the power of randomness. Zbl 1056.68087Hromkovič, Juraj 5 2001 On the approximability and hardness of minimum topic connected overlay and its special instances. Zbl 1238.68063Hosoda, Jun; Hromkovič, Juraj; Izumi, Taisuke; Ono, Hirotaka; Steinová, Monika; Wada, Koichi 5 2012 Stability of approximation algorithms and the knapsack problem. Zbl 0945.68074Hromkovič, Juraj 5 1999 On \(k\)-edge-connectivity problems with sharpened triangle inequality. Zbl 1032.68116Böckenhauer, Hans-Joachim; Bongartz, Dirk; Hromkovič, Juraj; Klasing, Ralf; Proietti, Guido; Seibert, Sebastian; Unger, Walter 5 2003 Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Zbl 0961.68058Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Klasing, Ralf; Seibert, Sebastian; Unger, Walter 5 2000 Algorithmics for hard problems. Introduction to combinatorial optimization, randomization, approximation, and heuristics. Zbl 0968.68190Hromkovič, Juraj 5 2000 Comparing the size of NFAs with and without \(\epsilon\)-transitions. Zbl 1115.68098Hromkovič, Juraj; Schnitger, Georg 5 2007 Reversal bounded multicounter machines. Zbl 0579.68032Hromkovič, Juraj 4 1985 Relation between Chomsky hierarchy and communication complexity hierarchy. Zbl 0631.68068Hromkovič, Juraj 4 1986 Lower bounds for language recognition on two-dimensional alternating multihead machines. Zbl 0678.68037Hromkovič, Juraj; Inoue, Katsushi; Takanami, Itsuo 4 1989 Steiner tree reoptimization in graphs with sharpened triangle inequality. Zbl 1238.68105Böckenhauer, Hans-Joachim; Freiermuth, Karin; Hromkovič, Juraj; Mömke, Tobias; Sprock, Andreas; Steffen, Björn 4 2012 On the power of Las Vegas. II: Two-way finite automata. Zbl 0939.68071Hromkovič, Juraj; Schnitger, Georg 4 1999 Nondeterministic communication with a limited number of advice bits. Zbl 1040.68046Hromkovic, Juraj; Schnitger, Georg 4 2003 On probabilistic pushdown automata. Zbl 1205.68202Hromkovič, Juraj; Schnitger, Georg 4 2010 Knowing all optimal solutions does not help for TSP reoptimization. Zbl 1331.90060Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Sprock, Andreas 4 2011 On \(k\)-connectivity problems with sharpened triangle inequality. Zbl 1154.90576Böckenhauer, Hans-Joachim; Bongartz, Dirk; Hromkovič, Juraj; Klasing, Ralf; Proietti, Guido; Seibert, Sebastian; Unger, Walter 4 2008 The Steiner tree reoptimization problem with sharpened triangle inequality (extended abstract). Zbl 1284.68654Böckenhauer, Hans-Joachim; Freiermuth, Karin; Hromkovič, Juraj; Mömke, Tobias; Sprock, Andreas; Steffen, Björn 4 2010 On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles. Zbl 1381.68095Bianchi, Maria Paola; Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Krug, Sacha; Steffen, Björn 4 2013 On the approximation hardness of some generalizations of TSP. (Extended abstract). Zbl 1141.90507Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Kneis, Joachim; Kupke, Joachim 4 2006 The bisection problem for graphs of degree 4. (Configuring transputer systems). Zbl 0768.68145Hromkovič, Juraj; Monien, Burkhard 3 1991 On one-way two-head deterministic finite state automata. Zbl 0605.68079Hromkovič, Juraj 3 1985 Some complexity aspects of VLSI computations. VI: Communication complexity. Zbl 0676.68014Hromkovič, Juraj 3 1989 On the stability of approximation for Hamiltonian path problems. Zbl 1148.05040Forlizzi, Luca; Hromkovič, Juraj; Proietti, Guido; Seibert, Sebastian 3 2006 Nonlinear lower bounds on the number of processors of circuits with sublinear separators. Zbl 0747.94025Hromkovič, Juraj 3 1991 On embeddings in cycles. Zbl 0826.68012Hromkovič, Juraj; Müller, Vladimír; Sýkora, Ondrej; Vrťo, Imrich 3 1995 The complexity of systolic dissemination of information in interconnection networks. Zbl 0888.68014Hromkovič, J.; Klasing, R.; Unger, W.; Wagener, H.; Pardubská, D. 3 1994 Nondeterministic communication with a limited number of advice bits. Zbl 0922.68060Hromkovic, J.; Schnitger, G. 3 1996 On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles. Zbl 1382.68099Bianchi, Maria Paola; Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Krug, Sacha; Steffen, Björn 3 2014 On the hardness of reoptimization with multiple given solutions. Zbl 1254.90185Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Sprock, Andreas 3 2011 Ambiguity and communication. Zbl 1246.68146Hromkovič, Juraj; Schnitger, Georg 3 2011 On the hardness of determining small NFA’s and of proving lower bounds on their sizes. Zbl 1159.68017Hromkovič, Juraj; Schnitger, Georg 3 2008 Stability of approximation algorithms for hard optimization problems. Zbl 0961.65060Hromkovič, Juraj 3 1999 Advice complexity of the online search problem. Zbl 1478.68452Clemente, Jhoirene; Hromkovič, Juraj; Komm, Dennis; Kudahl, Christian 3 2016 Optimal algorithms for dissemination of information in some interconnection networks. Zbl 0733.68007Hromkovič, Juraj; Jeschke, Claus-Dieter; Monien, Burkhard 2 1990 Nonlinear lower bound for real-time branching programs. Zbl 0579.68031Ftáčnik, Milan; Hromkovič, Juraj 2 1985 A note on realtime one-way synchronized alternating one-counter automata. Zbl 0776.68039Hromkovič, Juraj; Inoue, Katsushi 2 1993 Hierarchy of reversal bounded one-way multicounter machines. Zbl 0607.68034Hromkovič, Juraj 2 1986 Graph-theoretic concepts in computer science. 30th international workshop, WG 2004, Bad Honnef, Germany, June 21–23, 2004. Revised papers. Zbl 1067.68006 2 2004 The advantages of a new approach to defining the communication complexity for VLSI. Zbl 0651.68035Hromkovič, Juraj 2 1988 The advantages of a new approach to defining the communication complexity for VLSI. Zbl 0651.68050Hromkovič, Juraj 2 1988 Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits. Zbl 0674.68033Hromkovič, Juraj; Krause, Matthias; Meinel, Christoph; Waack, Stephan 2 1990 On the power of randomized multicounter machines. Zbl 1078.68037Hromkovič, Juraj; Schnitger, Georg 2 2005 Note on optimal gossiping in some weak-connected graphs. Zbl 0824.68010Hromkovič, Juraj; Jeschke, Claus-Dieter; Monien, Burkhard 2 1994 NFAs with and without \(\epsilon\)-transitions. Zbl 1082.68052Hromkovič, Juraj; Schnitger, Georg 2 2005 On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks. Zbl 1379.68013Hromkovič, J.; Loryś, K.; Kanarek, P.; Klasing, R.; Unger, W.; Wagener, H. 2 1995 A technique to obtain hardness results for randomized online algorithms – a survey. Zbl 1323.68575Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Komm, Dennis 2 2014 Communication complexity and sequential computation. Zbl 0941.68090Hromkovič, Juraj; Schnitger, Georg 2 1997 Online graph coloring against a randomized adversary. Zbl 1397.68229Burjons, Elisabet; Hromkovič, Juraj; Královič, Rastislav; Královič, Richard; Muñoz, Xavier; Unger, Walter 2 2018 Online graph coloring with advice and randomized adversary (extended abstract). Zbl 1442.68271Burjons, Elisabet; Hromkovič, Juraj; Muñoz, Xavier; Unger, Walter 2 2016 Theoretical computer science. Introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography. Zbl 1113.68001Hromkovič, Juraj 2 2004 Pushdown automata and multicounter machines, a comparison of computation modes. Zbl 1039.68554Hromkovič, Juraj; Schnitger, Georg 2 2003 Online graph coloring against a randomized adversary. Zbl 1397.68229Burjons, Elisabet; Hromkovič, Juraj; Královič, Rastislav; Královič, Richard; Muñoz, Xavier; Unger, Walter 2 2018 Advice complexity of the online search problem. Zbl 1478.68452Clemente, Jhoirene; Hromkovič, Juraj; Komm, Dennis; Kudahl, Christian 3 2016 Online graph coloring with advice and randomized adversary (extended abstract). Zbl 1442.68271Burjons, Elisabet; Hromkovič, Juraj; Muñoz, Xavier; Unger, Walter 2 2016 The complexity of paging against a probabilistic adversary. Zbl 1442.68276Dobrev, Stefan; Hromkovič, Juraj; Komm, Dennis; Královič, Richard; Královič, Rastislav; Mömke, Tobias 1 2016 The string guessing problem as a method to prove lower bounds on the advice complexity. Zbl 1360.68908Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Komm, Dennis; Krug, Sacha; Smula, Jasmin; Sprock, Andreas 18 2014 On the power of advice and randomization for the disjoint path allocation problem. Zbl 1432.68009Barhum, Kfir; Böckenhauer, Hans-Joachim; Forišek, Michal; Gebauer, Heidi; Hromkovič, Juraj; Krug, Sacha; Smula, Jasmin; Steffen, Björn 14 2014 Online coloring of bipartite graphs with and without advice. Zbl 1314.68404Bianchi, Maria Paola; Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Keller, Lucia 10 2014 On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles. Zbl 1382.68099Bianchi, Maria Paola; Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Krug, Sacha; Steffen, Björn 3 2014 A technique to obtain hardness results for randomized online algorithms – a survey. Zbl 1323.68575Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Komm, Dennis 2 2014 The string guessing problem as a method to prove lower bounds on the advice complexity (extended abstract). Zbl 1382.68333Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Komm, Dennis; Krug, Sacha; Smula, Jasmin; Sprock, Andreas 9 2013 On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles. Zbl 1381.68095Bianchi, Maria Paola; Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Krug, Sacha; Steffen, Björn 4 2013 Determinism vs. nondeterminism for two-way automata: representing the meaning of states by logical formulæ. Zbl 1293.68188Hromkovič, Juraj; Královič, Rastislav; Královič, Richard; Štefanec, Richard 1 2013 Online coloring of bipartite graphs with and without advice. Zbl 1314.68403Bianchi, Maria Paola; Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Keller, Lucia 11 2012 On the power of randomness versus advice in online computation. Zbl 1367.68340Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Komm, Dennis; Královič, Richard; Rossmanith, Peter 7 2012 On the approximability and hardness of minimum topic connected overlay and its special instances. Zbl 1238.68063Hosoda, Jun; Hromkovič, Juraj; Izumi, Taisuke; Ono, Hirotaka; Steinová, Monika; Wada, Koichi 5 2012 Steiner tree reoptimization in graphs with sharpened triangle inequality. Zbl 1238.68105Böckenhauer, Hans-Joachim; Freiermuth, Karin; Hromkovič, Juraj; Mömke, Tobias; Sprock, Andreas; Steffen, Björn 4 2012 Knowing all optimal solutions does not help for TSP reoptimization. Zbl 1331.90060Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Sprock, Andreas 4 2011 On the hardness of reoptimization with multiple given solutions. Zbl 1254.90185Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Sprock, Andreas 3 2011 Ambiguity and communication. Zbl 1246.68146Hromkovič, Juraj; Schnitger, Georg 3 2011 Information complexity of online problems. Zbl 1287.68083Hromkovič, Juraj; Královič, Rastislav; Královič, Richard 31 2010 On probabilistic pushdown automata. Zbl 1205.68202Hromkovič, Juraj; Schnitger, Georg 4 2010 The Steiner tree reoptimization problem with sharpened triangle inequality (extended abstract). Zbl 1284.68654Böckenhauer, Hans-Joachim; Freiermuth, Karin; Hromkovič, Juraj; Mömke, Tobias; Sprock, Andreas; Steffen, Björn 4 2010 Reoptimization of Steiner trees: changing the terminal set. Zbl 1192.68471Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Královič, Richard; Mömke, Tobias; Rossmanith, Peter 11 2009 On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA’s. Zbl 1173.68035Hromkovič, Juraj; Petersen, Holger; Schnitger, Georg 2 2009 Ambiguity and communication. Zbl 1236.68169Hromkovič, Juraj; Schnitger, Georg 1 2009 Lower bounds on the size of sweeping automata. Zbl 1192.68413Hromkovič, Juraj; Schnitger, Georg 1 2009 On the hardness of reoptimization. Zbl 1133.68351Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Mömke, Tobias; Widmayer, Peter 21 2008 Reoptimization of Steiner trees. Zbl 1155.68574Bilò, Davide; Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Královič, Richard; Mömke, Tobias; Widmayer, Peter; Zych, Anna 15 2008 On \(k\)-connectivity problems with sharpened triangle inequality. Zbl 1154.90576Böckenhauer, Hans-Joachim; Bongartz, Dirk; Hromkovič, Juraj; Klasing, Ralf; Proietti, Guido; Seibert, Sebastian; Unger, Walter 4 2008 On the hardness of determining small NFA’s and of proving lower bounds on their sizes. Zbl 1159.68017Hromkovič, Juraj; Schnitger, Georg 3 2008 On the approximability of TSP on local modifications of optimally solved instances. Zbl 1206.90134Böckenhauer, Hans-Joachim; Forlizzi, Luca; Hromkovič, Juraj; Kneis, Joachim; Kupke, Joachim; Proietti, Guido; Widmayer, Peter 17 2007 The parameterized approximability of TSP with deadlines. Zbl 1148.68052Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Kneis, Joachim; Kupke, Joachim 9 2007 Job shop scheduling with unit length tasks: bounds and algorithms. Zbl 1186.90051Hromkovič, Juraj; Mömke, Tobias; Steinhöfel, Kathleen; Widmayer, Peter 6 2007 Comparing the size of NFAs with and without \(\epsilon\)-transitions. Zbl 1115.68098Hromkovič, Juraj; Schnitger, Georg 5 2007 Stability of approximation algorithms or parameterization of the approximation ratio. Zbl 1147.90417Böckenhauer, Hans-Joachim; Hromkovič, Juraj 1 2007 On the approximation hardness of some generalizations of TSP. (Extended abstract). Zbl 1141.90507Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Kneis, Joachim; Kupke, Joachim 4 2006 On the stability of approximation for Hamiltonian path problems. Zbl 1148.05040Forlizzi, Luca; Hromkovič, Juraj; Proietti, Guido; Seibert, Sebastian 3 2006 Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance. Zbl 1067.68016Hromkovič, Juraj; Klasing, Ralf; Pelc, Andrzej; Ružička, Peter; Unger, Walter 37 2005 Design and analysis of randomized algorithms. Introduction to design paradigms. Zbl 1083.68146Hromkovič, Juraj 8 2005 On the power of randomized multicounter machines. Zbl 1078.68037Hromkovič, Juraj; Schnitger, Georg 2 2005 NFAs with and without \(\epsilon\)-transitions. Zbl 1082.68052Hromkovič, Juraj; Schnitger, Georg 2 2005 Algorithmics for hard problems. 2nd ed., corr. 2nd printing. Zbl 1069.68642Hromkovič, Juraj 8 2004 On multi-partition communication complexity. Zbl 1073.68030Ďuriš, Pavol; Hromkovič, Juraj; Jukna, Stasys; Sauerhoff, Martin; Schnitger, Georg 6 2004 On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Zbl 1093.68070Böckenhauer, Hans-Joachim; Bongartz, Dirk; Hromkovič, Juraj; Klasing, Ralf; Proietti, Guido; Seibert, Sebastian; Unger, Walter 5 2004 Graph-theoretic concepts in computer science. 30th international workshop, WG 2004, Bad Honnef, Germany, June 21–23, 2004. Revised papers. Zbl 1067.68006 2 2004 Theoretical computer science. Introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography. Zbl 1113.68001Hromkovič, Juraj 2 2004 On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata. Zbl 1069.68061Ďuriš, Pavol; Hromkovič, Juraj; Inoue, Katsushi 1 2004 Nondeterminism versus determinism for two-way finite automata: Generalizations of Sipser’s separation. Zbl 1039.68068Hromkovič, Juraj; Schnitger, Georg 12 2003 The power of nondeterminism and randomness for oblivious branching programs. Zbl 1039.68083Hromkovič, Juraj; Sauerhoff, Martin 7 2003 On \(k\)-edge-connectivity problems with sharpened triangle inequality. Zbl 1032.68116Böckenhauer, Hans-Joachim; Bongartz, Dirk; Hromkovič, Juraj; Klasing, Ralf; Proietti, Guido; Seibert, Sebastian; Unger, Walter 5 2003 Nondeterministic communication with a limited number of advice bits. Zbl 1040.68046Hromkovic, Juraj; Schnitger, Georg 4 2003 Pushdown automata and multicounter machines, a comparison of computation modes. Zbl 1039.68554Hromkovič, Juraj; Schnitger, Georg 2 2003 Communication complexity method for measuring nondeterminism in finite automata. Zbl 1009.68067Hromkovič, Juraj; Seibert, Sebastian; Karhumäki, Juhani; Klauck, Hartmut; Schnitger, Georg 30 2002 Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Zbl 1094.90036Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Klasing, Ralf; Seibert, Sebastian; Unger, Walter 14 2002 Descriptional complexity of finite automata: concepts and open problems. Zbl 1094.68576Hromkovič, Juraj 12 2002 On the power of randomized pushdown automata. Zbl 1073.68047Hromkovič, Juraj; Schnitger, Georg 2 2002 On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Zbl 1027.68097Böckenhauer, Hans-Joachim; Bongartz, Dirk; Hromkovič, Juraj; Klasing, Ralf; Proietti, Guido; Seibert, Sebastian; Unger, Walter 1 2002 Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata. Zbl 1014.68093Hromkovič, Juraj; Seibert, Sebastian; Wilke, Thomas 26 2001 On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata. Zbl 1007.68065Hromkovič, Juraj; Schnitger, Georg 18 2001 On the power of Las Vegas II: Two-way finite automata. Zbl 0983.68098Hromkovič, J.; Schnitger, G. 6 2001 Communication protocols – an exemplary study of the power of randomness. Zbl 1056.68087Hromkovič, Juraj 5 2001 Randomized communication protocols (a survey). Zbl 1054.68060Hromkovič, Juraj 1 2001 On multipartition communication complexity (extended abstract). Zbl 0976.68514Duriš, Pavol; Hromkovič, Juraj; Jukna, Stasys; Sauerhoff, Martin; Schnitger, Georg 1 2001 Job shop scheduling with unit length tasks: bounds and algorithms. Zbl 1042.90020Hromkovic, Juraj; Steinhöfel, Kathleen; Widmayer, Peter 1 2001 Approximation algorithms for the TSP with sharpened triangle inequality. Zbl 1338.68289Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Klasing, Ralf; Seibert, Sebastian; Unger, Walter 16 2000 An improved lower bound on the approximability of metric TSP and approximation algorithms for the TSP with sharpened triangle inequality (extended abstract). Zbl 1028.90044Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Klasing, Ralf; Seibert, Sebastian; Unger, Walter 16 2000 Tradeoffs between nondeterminism and complexity for communication protocols and branching programs (extended abstract). Zbl 0959.68522Hromkovič, Juraj; Sauerhoff, Martin 8 2000 Measures of nondeterminism in finite automata. Zbl 0973.68114Hromkovič, Juray; Karhumäki, Juhani; Klauck, Hartmut; Schnitger, Georg; Seibert, Sebastian 6 2000 Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Zbl 0961.68058Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Klasing, Ralf; Seibert, Sebastian; Unger, Walter 5 2000 Algorithmics for hard problems. Introduction to combinatorial optimization, randomization, approximation, and heuristics. Zbl 0968.68190Hromkovič, Juraj 5 2000 Stability of approximation algorithms and the knapsack problem. Zbl 0945.68074Hromkovič, Juraj 5 1999 On the power of Las Vegas. II: Two-way finite automata. Zbl 0939.68071Hromkovič, Juraj; Schnitger, Georg 4 1999 Stability of approximation algorithms for hard optimization problems. Zbl 0961.65060Hromkovič, Juraj 3 1999 Communication complexity and lower bounds on multilective computations. Zbl 0946.68052Hromkovič, Juraj 1 1999 Communication complexity and parallel computing. Zbl 0873.68098Hromkovič, Juraj 39 1997 Optimal algorithms for broadcast and gossip in the edge-disjoint modes. Zbl 0878.68070Hromkovič, Juraj; Klasing, Ralf; Unger, Walter; Wagener, Hubert 6 1997 Communication complexity and sequential computation. Zbl 0941.68090Hromkovič, Juraj; Schnitger, Georg 2 1997 Dissemination of information in interconnection networks (broadcasting & gossiping). Zbl 0840.68088Hromkovič, Juraj; Klasing, Ralf; Monien, Burkhard; Peine, Regine 61 1996 A comparison of two lower-bound methods for communication complexity. Zbl 0874.68150Dietzfelbinger, Martin; Hromkovič, Juraj; Schnitger, Georg 14 1996 Nondeterministic communication with a limited number of advice bits. Zbl 0922.68060Hromkovic, J.; Schnitger, G. 3 1996 Two lower bounds on distributive generation of languages. Zbl 0843.68052Hromkovič, Juraj; Kari, Jarkko; Kari, Lila; Pardubská, Dana 1 1996 Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs. Zbl 1096.68514Hromkovič, Juraj; Klasing, Ralf; Stöhr, Elena A.; Wagener, Hubert 10 1995 On embeddings in cycles. Zbl 0826.68012Hromkovič, Juraj; Müller, Vladimír; Sýkora, Ondrej; Vrťo, Imrich 3 1995 On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks. Zbl 1379.68013Hromkovič, J.; Loryś, K.; Kanarek, P.; Klasing, R.; Unger, W.; Wagener, H. 2 1995 Optimal algorithms for dissemination of information in generalized communication modes. Zbl 0823.68041Feldmann, R.; Hromkovič, Juraj; Madhavapeddy, S.; Monien, B.; Mysliwietz, P. 11 1994 Deterministic versus nondeterministic space in terms of synchronized alternating machines. Zbl 0821.68056Hromkovič, Juraj; Rovan, Branislav; Slobodova, Anna 10 1994 The complexity of systolic dissemination of information in interconnection networks. Zbl 0888.68014Hromkovič, J.; Klasing, R.; Unger, W.; Wagener, H.; Pardubská, D. 3 1994 Note on optimal gossiping in some weak-connected graphs. Zbl 0824.68010Hromkovič, Juraj; Jeschke, Claus-Dieter; Monien, Burkhard 2 1994 Some hierarchies for the communication complexity measures of cooperating grammar systems. Zbl 0805.68043Hromkovič, Juraj; Kari, Jarkko; Kari, Lila 1 1994 Two lower bounds on distributive generation of languages. Zbl 1493.68146Hromkovič, Juraj; Kari, Jarkko; Kari, Lila; Pardubská, Dana 1 1994 Optimal algorithms for dissemination of information in some interconnection networks. Zbl 0773.68007Hromkovič, Juraj; Jeschke, Claus-Dieter; Monien, Burkhard 5 1993 A note on realtime one-way synchronized alternating one-counter automata. Zbl 0776.68039Hromkovič, Juraj; Inoue, Katsushi 2 1993 Some hierarchies for the communication complexity measures of cooperating grammar systems. Zbl 0925.68283Hromkovič, Juraj; Kari, Jarkko; Kari, Lila 1 1993 On the power of one-way synchronized alternating machines with small space. Zbl 0769.68030Hromkovič, Juraj; Inoue, Katsushi; Rovan, Branislav; Slobodová, Anna; Takanami, Itsuo; Wagner, Klaus W. 6 1992 Lower bounds on the area complexity of Boolean circuits. Zbl 0769.68045Hromkovič, Juraj; Ložkin, Sergej A.; Rybko, Andrej I.; Sapoženko, Alexander A.; Škalikova, Nadežda A. 1 1992 On synchronized Lindenmayer picture languages. Zbl 0771.68073Dassow, Jürgen; Hromkovič, Juraj 1 1992 On the power of synchronization in parallel computations. Zbl 0734.68036Hromkovič, Juraj; Karhumäki, Juhani; Rovan, Branislav; Slobodová, Anna 17 1991 The bisection problem for graphs of degree 4. (Configuring transputer systems). Zbl 0768.68145Hromkovič, Juraj; Monien, Burkhard 3 1991 Nonlinear lower bounds on the number of processors of circuits with sublinear separators. Zbl 0747.94025Hromkovič, Juraj 3 1991 On problems for which no oracle can help. Zbl 0674.68031Hromkovič, Juraj 1 1991 ...and 32 more Documents all cited Publications top 5 cited Publications all top 5 Cited by 591 Authors 57 Hromkovič, Juraj 31 Böckenhauer, Hans-Joachim 24 Salomaa, Kai T. 20 Komm, Dennis 18 Královič, Richard 15 Klasing, Ralf 14 Mömke, Tobias 12 Jirásková, Galina 11 Harutyunyan, Hovhannes A. 10 Geffert, Viliam 10 Kutrib, Martin 9 Holzer, Markus 9 Královič, Rastislav 9 Schnitger, Georg 9 Seibert, Sebastian 9 Yu, Sheng 8 Ibarra, Oscar H. 8 Unger, Walter 7 Bollig, Beate 7 Boyar, Joan F. 7 Gargano, Luisa 7 Inoue, Katsushi 7 Kamali, Shahin 7 Paschos, Vangelis Th. 7 Pérennes, Stéphane 7 Pighizzini, Giovanni 6 Bilò, Davide 6 Chen, Li-Hsuan 6 Favrholdt, Lene Monrad 6 Fraigniaud, Pierre 6 Hung, Ling-Ju 6 Krug, Sacha 6 Larsen, Kim Skak 6 Liestman, Arthur L. 6 Rossmanith, Peter 6 Theis, Dirk Oliver 5 Boria, Nicolas 5 Gruber, Hermann 5 Jiang, Tao 5 Kapoutsis, Christos A. 5 Malcher, Andreas 5 Monnot, Jérôme 5 Rescigno, Adele Anna 5 Slobodová, Anna 5 Takanami, Itsuo 5 Vaccaro, Ugo 4 Bermond, Jean-Claude 4 Bianchi, Maria Paola 4 Czyzowicz, Jurek 4 Ďuriš, Pavol 4 Fertin, Guillaume 4 Gregor, Petr 4 Hsieh, Sun-Yuan 4 Kowalski, Dariusz R. 4 Kudahl, Christian 4 López-Ortiz, Alejandro 4 Manthey, Bodo 4 Monien, Burkhard 4 Niedermeier, Rolf 4 Pankratov, Denis 4 Pardubská, Dana 4 Peters, Joseph G. 4 Proietti, Guido 4 Sauerhoff, Martin 4 Škrekovski, Riste 4 Trân, Nicholas Q. 4 Vukašinović, Vida 4 Yakaryılmaz, Abuzer 4 Zych, Anna 3 Anselmo, Marcella 3 Burjons, Elisabet 3 Dar, Muhammad Abid 3 De Marco, Gianluca 3 Dobrev, Stefan 3 Farley, Arthur M. 3 Fischer, Andreas 3 Itsykson, Dmitry M. 3 Karhumaki, Juhani 3 Kari, Lila 3 Keeler, Chris 3 Kranakis, Evangelos Konstantinou 3 Krause, Matthias 3 Madonia, Maria 3 Martinovic, John 3 Mereghetti, Carlo 3 Mignot, Ludovic 3 Mikkelsen, Jesper W. 3 Okhotin, Alexander 3 Păun, Gheorghe 3 Petersen, Holger 3 Pourmoradnasseri, Mozhgan 3 Qiu, Daowen 3 Renault, Marc P. 3 Rosén, Adi 3 Say, A. C. Cem 3 Scheithauer, Guntram 3 Sprock, Andreas 3 Štefáneková, Ivana 3 Steinová, Monika 3 Vrto, Imrich ...and 491 more Authors all top 5 Cited in 61 Serials 121 Theoretical Computer Science 42 Discrete Applied Mathematics 28 Information and Computation 26 Information Processing Letters 22 International Journal of Foundations of Computer Science 18 Journal of Computer and System Sciences 17 Algorithmica 17 RAIRO. Theoretical Informatics and Applications 15 Theory of Computing Systems 13 Journal of Discrete Algorithms 8 RAIRO. Theoretical Informatics and Applications 6 Distributed Computing 5 Kybernetika 5 Journal of Combinatorial Optimization 3 Acta Informatica 3 Artificial Intelligence 3 Discrete Mathematics 3 Information Sciences 3 Networks 3 RAIRO. Informatique Théorique et Applications 3 Lobachevskii Journal of Mathematics 2 Applied Mathematics and Computation 2 European Journal of Combinatorics 2 Optimization 2 Computational Geometry 2 Linear Algebra and its Applications 2 RAIRO. Operations Research 2 Discrete Optimization 1 International Journal of Theoretical Physics 1 Annales de l’Institut Fourier 1 Automatica 1 Journal of Combinatorial Theory. Series A 1 The Journal of Symbolic Logic 1 Mathematica Slovaca 1 Mathematical Systems Theory 1 Opsearch 1 Annals of Pure and Applied Logic 1 Bulletin of the Iranian Mathematical Society 1 Journal of Complexity 1 Machine Learning 1 MSCS. Mathematical Structures in Computer Science 1 Computational Statistics 1 European Journal of Operational Research 1 International Journal of Computer Mathematics 1 The Australasian Journal of Combinatorics 1 Cybernetics and Systems Analysis 1 Computational Optimization and Applications 1 The Electronic Journal of Combinatorics 1 Acta Mathematica et Informatica Universitatis Ostraviensis 1 Journal of Scheduling 1 Fundamenta Informaticae 1 The Journal of Logic and Algebraic Programming 1 Natural Computing 1 ACM Journal of Experimental Algorithmics 1 Sibirskie Èlektronnye Matematicheskie Izvestiya 1 Mathematics in Computer Science 1 Logical Methods in Computer Science 1 Discrete Mathematics, Algorithms and Applications 1 Advances in Operations Research 1 Fuzzy Information and Engineering 1 Journal of Membrane Computing all top 5 Cited in 17 Fields 428 Computer science (68-XX) 96 Operations research, mathematical programming (90-XX) 94 Combinatorics (05-XX) 30 Information and communication theory, circuits (94-XX) 15 Mathematical logic and foundations (03-XX) 6 Quantum theory (81-XX) 6 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 4 Order, lattices, ordered algebraic structures (06-XX) 3 Linear and multilinear algebra; matrix theory (15-XX) 2 History and biography (01-XX) 2 Probability theory and stochastic processes (60-XX) 2 Statistics (62-XX) 2 Numerical analysis (65-XX) 1 Group theory and generalizations (20-XX) 1 Dynamical systems and ergodic theory (37-XX) 1 Biology and other natural sciences (92-XX) 1 Systems theory; control (93-XX) Citations by Year Wikidata Timeline The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.