default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Ruzicka
Person information
- affiliation: Comenius University, Bratislava, Slovak Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j17]Rastislav Kralovic
, Peter Ruzicka:
Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing. Theor. Comput. Sci. 374(1-3): 203-213 (2007)- 2006
- [j16]Stefan Dobrev, Paola Flocchini, Rastislav Kralovic, Peter Ruzicka, Giuseppe Prencipe, Nicola Santoro:
Black hole search in common interconnection networks. Networks 47(2): 61-71 (2006) - 2005
- [b1]Juraj Hromkovic, Ralf Klasing, Andrzej Pelc, Peter Ruzicka, Walter Unger:
Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Texts in Theoretical Computer Science. An EATCS Series, Springer 2005, ISBN 978-3-540-00846-0, pp. 1-361 - 2003
- [j15]Rastislav Kralovic, Peter Ruzicka:
Minimum feedback vertex sets in shuffle-based interconnection networks. Inf. Process. Lett. 86(4): 191-196 (2003) - [j14]Paola Flocchini, Rastislav Kralovic, Peter Ruzicka, Alessandro Roncato, Nicola Santoro:
On time versus size for monotone dynamic monopolies in regular topologies. J. Discrete Algorithms 1(2): 129-150 (2003) - [c26]Rastislav Kralovic, Richard Královic, Peter Ruzicka:
Broadcasting with Many Faulty Links. SIROCCO 2003: 211-222 - 2002
- [j13]Peter Ruzicka:
Preface. Theor. Comput. Sci. 286(1): 1 (2002) - [c25]Stefan Dobrev, Paola Flocchini, Rastislav Kralovic, Giuseppe Prencipe, Peter Ruzicka, Nicola Santoro:
Black Hole Search by Mobile Agents in Hypercubes and Related Networks. OPODIS 2002: 169-180 - [c24]Rastislav Kralovic, Peter Ruzicka:
Minimum Feedback Vertex Sets in Shuffle-based Interconnection Networks. SIROCCO 2002: 237-245 - 2001
- [j12]Peter Ruzicka:
On Efficiency of Path Systems Induced by Routing and Communication Schemes. Comput. Artif. Intell. 20(2): 181-205 (2001) - [c23]Rastislav Kralovic, Peter Ruzicka:
On Immunity and Catastrophic Indices of Graphs. SIROCCO 2001: 231-242 - [c22]Martin Makuch, Peter Ruzicka:
On the Complexity of Path Layouts in Bounded Degree ATM Networks A Case Study for Butterfly Networks. SIROCCO 2001: 243-258 - [e3]Leszek Pacholski, Peter Ruzicka:
SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24 - December 1, 2001, Proceedings. Lecture Notes in Computer Science 2234, Springer 2001, ISBN 3-540-42912-3 [contents] - 2000
- [j11]Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic:
The complexity of shortest path and dilation bounded interval routing. Theor. Comput. Sci. 234(1-2): 85-107 (2000) - [j10]Peter Ruzicka, Daniel Stefankovic:
On the complexity of multi-dimensional interval routing schemes. Theor. Comput. Sci. 245(2): 255-280 (2000) - [c21]Paola Flocchini, Rastislav Kralovic, Alessandro Roncato, Peter Ruzicka, Nicola Santoro:
On time versus size for monotone dynamic monopolies in regular topologies. SIROCCO 2000: 111-125
1990 – 1999
- 1999
- [c20]Rastislav Kralovic, Branislav Rovan, Peter Ruzicka:
Interval Routing on Layered Cross Product of Trees and Cycles. Euro-Par 1999: 1231-1239 - [c19]Rastislav Kralovic, Peter Ruzicka:
Rank of Graphs: The Size of Acyclic Orientation Cover for Deadlock-Free Packet Routing. SIROCCO 1999: 181-193 - 1998
- [j9]Krzysztof Diks, Stefan Dobrev, Evangelos Kranakis, Andrzej Pelc, Peter Ruzicka:
Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages. Inf. Process. Lett. 66(4): 181-186 (1998) - [j8]Stefan Dobrev, Peter Ruzicka:
On the Communication Complexity of Strong Time-Optimal Distributed Algorithms. Nord. J. Comput. 5(2): 87-104 (1998) - [c18]Stefan Dobrev, Peter Ruzicka, Gerard Tel:
Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes. SIROCCO 1998: 173-187 - [c17]Peter Ruzicka:
Efficient Communication Schemes. SOFSEM 1998: 244-263 - [c16]Stefan Dobrev, Peter Ruzicka:
Yet Another Modular Technique for Efficient Leader Election. SOFSEM 1998: 312-321 - [c15]Rastislav Kralovic, Branislav Rovan, Peter Ruzicka, Daniel Stefankovic:
Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks. DISC 1998: 273-287 - [c14]Stefan Dobrev, Peter Ruzicka:
Broadcasting on Anonymous Unoriented Tori. WG 1998: 50-62 - 1997
- [c13]Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic:
The Complexity of Shortest Path and Dilation Bounded Interval Routing. Euro-Par 1997: 258-265 - [c12]Stefan Dobrev, Peter Ruzicka:
Linear Broadcasting and N loglog N Election in Unoriented Hypercubes. SIROCCO 1997: 53-68 - [e2]Igor Prívara, Peter Ruzicka:
Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings. Lecture Notes in Computer Science 1295, Springer 1997, ISBN 3-540-63437-1 [contents] - 1996
- [c11]Peter Ruzicka:
Efficient Tree Pattern Unification. SOFSEM 1996: 417-424 - 1994
- [j7]Peter Ruzicka, Juraj Waczulík:
Pebbling Dynamic Graphs in Minimal Space. RAIRO Theor. Informatics Appl. 28(6): 557-565 (1994) - [e1]Igor Prívara, Branislav Rovan, Peter Ruzicka:
Mathematical Foundations of Computer Science 1994, 19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings. Lecture Notes in Computer Science 841, Springer 1994, ISBN 3-540-58338-6 [contents] - 1993
- [c10]Peter Ruzicka, Igor Prívara:
On Tree Pattern Unification Problems. FCT 1993: 418-429 - [c9]Peter Ruzicka, Juraj Waczulík:
On Time-Space Trade-Offs in Dynamic Graph Pebbling. MFCS 1993: 671-681 - 1991
- [j6]Peter Ruzicka, Vusei-Ar:
A Note on the Efficiency of an Interval Routing Algorithm. Comput. J. 34(5): 475-476 (1991) - [c8]Peter Ruzicka:
An Efficient Decision Algorithm for the Uniform Semi-Unification Problem. MFCS 1991: 415-425
1980 – 1989
- 1989
- [j5]Peter Ruzicka, Igor Prívara:
An Almost Linear Robinson Unification Algorithm. Acta Informatica 27(1): 61-71 (1989) - 1988
- [c7]Peter Ruzicka:
On Efficiency of Interval Routing Algorithms. MFCS 1988: 492-500 - [c6]Peter Ruzicka, Igor Prívara:
An Almost Linear Robinson Unification ALgorithm. MFCS 1988: 501-511 - 1981
- [j4]Peter Ruzicka:
Bounds for on-line selection. Kybernetika 17(2): 147-157 (1981) - [j3]Peter Ruzicka:
Validity test for Floyd's operator-precedence parsing algorithms is polynomial in time. Kybernetika 17(5): 368-379 (1981) - 1980
- [c5]Peter Ruzicka:
Time and Space Bounds in Producing Certain Partial Orders. MFCS 1980: 539-551
1970 – 1979
- 1979
- [c4]Peter Ruzicka:
Validity Test for Floyd's Operator-Precedence Parsing Algorithms. MFCS 1979: 415-424 - 1977
- [c3]Peter Ruzicka, Juraj Wiedermann:
How Good Is the Adversary Lower Bound? MFCS 1977: 465-474 - 1976
- [c2]Peter Ruzicka, Juraj Wiedermann:
On the Lower Bound for Minimum Comparison Selection. MFCS 1976: 495-502 - 1975
- [j2]Peter Ruzicka:
Size Complexity of Context-free Languages. J. Inf. Process. Cybern. 11(4-6): 296-299 (1975) - [j1]Peter Ruzicka:
On the size of DeRemer's analyzers. Kybernetika 11(3): 207-217 (1975) - [c1]Peter Ruzicka:
Local Disambiguating Transformation. MFCS 1975: 399-404
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
