( en | de | ru )

 

Disambiguation of "Královic, Richard"

Author of the publication

copydeleteadd this publication to your clipboard
Independent Set with Advice: The Impact of Graph Knowledge - (Extended Abstract).

, , and . WAOA, volume 7846 of Lecture Notes in Computer Science, page 2-15. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Richard Janissen

Biomolecular based nano-manipulation with a combined atomic force microscope and single molecule fluorescence setup. Uni Düsseldorf, (2009)

Richard Giesen

Richard Herold

Richard Lucius

Richard Warth

 

Other publications of authors with the same name

Size complexity of rotating and sweeping automata., , and . J. Comput. Syst. Sci., 78 (2): 537-558 (2012)Broadcasting with Many Faulty Links., , and . SIROCCO, volume 17 of Proceedings in Informatics, page 211-222. Carleton Scientific, (2003)Determinism vs. Nondeterminism for Two-Way Automata - Representing the Meaning of States by Logical Formulæ., , , and . Developments in Language Theory, volume 7410 of Lecture Notes in Computer Science, page 24-39. Springer, (2012)Advice Complexity of the Online Induced Subgraph Problem., , , and . MFCS, volume 58 of LIPIcs, page 59:1-59:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Online Graph Coloring Against a Randomized Adversary., , , , , and . Int. J. Found. Comput. Sci., 29 (4): 551-569 (2018)Menej je niekedy viac: Mapreduce a Flume v paralelných výpočtoch.. ITAT, volume 1003 of CEUR Workshop Proceedings, page 88. CEUR-WS.org, (2013)Randomization in Non-Uniform Finite Automata., , , , , and . MFCS, volume 170 of LIPIcs, page 30:1-30:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On the Power of Randomization for One-Way Finite Automata.. NCMA, volume 282 of books@ocg.at, page 165-177. Austrian Computer Society, (2011)Complexity Classes of Finite Automata.. ETH Zurich, Zürich, Switzerland, (2010)base-search.net (ftethz:oai:www.research-collection.ethz.ch:20.500.11850/72810).On Semi-perfect 1-Factorizations., and . SIROCCO, volume 3499 of Lecture Notes in Computer Science, page 216-230. Springer, (2005)