Peter Ruzicka

47 papers A 1B 26Journal 17Unranked 2
YearRankTypeTitle / Venue / Authors
2007 J jnl
Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing.
Theor. Comput. Sci.
Rastislav Kralovic, Peter Ruzicka
2006 J jnl
Black hole search in common interconnection networks.
Networks
Stefan Dobrev, Paola Flocchini, Rastislav Kralovic, Peter Ruzicka, Giuseppe Prencipe, Nicola Santoro
2005 — book
Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
Juraj Hromkovic, Ralf Klasing, Andrzej Pelc, Peter Ruzicka, Walter Unger
2003 B conf
Broadcasting with Many Faulty Links.
SIROCCO
Rastislav Kralovic, Richard Královic, Peter Ruzicka
2003 J jnl
Minimum feedback vertex sets in shuffle-based interconnection networks.
Inf. Process. Lett.
Rastislav Kralovic, Peter Ruzicka
2003 J jnl
On time versus size for monotone dynamic monopolies in regular topologies.
J. Discrete Algorithms
Paola Flocchini, Rastislav Kralovic, Peter Ruzicka, Alessandro Roncato, Nicola Santoro
2002 B conf
Black Hole Search by Mobile Agents in Hypercubes and Related Networks.
OPODIS
Stefan Dobrev, Paola Flocchini, Rastislav Kralovic, Giuseppe Prencipe, Peter Ruzicka, Nicola Santoro
2002 B conf
Minimum Feedback Vertex Sets in Shuffle-based Interconnection Networks.
SIROCCO
Rastislav Kralovic, Peter Ruzicka
2002 J jnl
Preface.
Theor. Comput. Sci.
Peter Ruzicka
2001 J jnl
On Efficiency of Path Systems Induced by Routing and Communication Schemes.
Comput. Artif. Intell.
Peter Ruzicka
2001 B conf
On Immunity and Catastrophic Indices of Graphs.
SIROCCO
Rastislav Kralovic, Peter Ruzicka
2001 B conf
On the Complexity of Path Layouts in Bounded Degree ATM Networks A Case Study for Butterfly Networks.
SIROCCO
Martin Makuch, Peter Ruzicka
2001 B ed.
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
SOFSEM
Leszek Pacholski, Peter Ruzicka
2000 J jnl
On the complexity of multi-dimensional interval routing schemes.
Theor. Comput. Sci.
Peter Ruzicka, Daniel Stefankovic
2000 B conf
On time versus size for monotone dynamic monopolies in regular topologies.
SIROCCO
Paola Flocchini, Rastislav Kralovic, Alessandro Roncato, Peter Ruzicka, Nicola Santoro
2000 J jnl
The complexity of shortest path and dilation bounded interval routing.
Theor. Comput. Sci.
Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic
1999 — conf
Interval Routing on Layered Cross Product of Trees and Cycles.
Euro-Par
Rastislav Kralovic, Branislav Rovan, Peter Ruzicka
1999 B conf
Rank of Graphs: The Size of Acyclic Orientation Cover for Deadlock-Free Packet Routing.
SIROCCO
Rastislav Kralovic, Peter Ruzicka
1998 J jnl
Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages.
Inf. Process. Lett.
Krzysztof Diks, Stefan Dobrev, Evangelos Kranakis, Andrzej Pelc, Peter Ruzicka
1998 B conf
Broadcasting on Anonymous Unoriented Tori.
WG
Stefan Dobrev, Peter Ruzicka
1998 B conf
Efficient Communication Schemes.
SOFSEM
Peter Ruzicka
1998 A conf
Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks.
DISC
Rastislav Kralovic, Branislav Rovan, Peter Ruzicka, Daniel Stefankovic
1998 J jnl
On the Communication Complexity of Strong Time-Optimal Distributed Algorithms.
Nord. J. Comput.
Stefan Dobrev, Peter Ruzicka
1998 B conf
Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes.
SIROCCO
Stefan Dobrev, Peter Ruzicka, Gerard Tel
1998 B conf
Yet Another Modular Technique for Efficient Leader Election.
SOFSEM
Stefan Dobrev, Peter Ruzicka
1997 B conf
Linear Broadcasting and N loglog N Election in Unoriented Hypercubes.
SIROCCO
Stefan Dobrev, Peter Ruzicka
1997 B ed.
Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings
MFCS
Igor Prívara, Peter Ruzicka
1997 — conf
The Complexity of Shortest Path and Dilation Bounded Interval Routing.
Euro-Par
Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic
1996 B conf
Efficient Tree Pattern Unification.
SOFSEM
Peter Ruzicka
1994 B ed.
Mathematical Foundations of Computer Science 1994, 19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings
MFCS
Igor Prívara, Branislav Rovan, Peter Ruzicka
1994 J jnl
Pebbling Dynamic Graphs in Minimal Space.
RAIRO Theor. Informatics Appl.
Peter Ruzicka, Juraj Waczulík
1993 B conf
On Time-Space Trade-Offs in Dynamic Graph Pebbling.
MFCS
Peter Ruzicka, Juraj Waczulík
1993 B conf
On Tree Pattern Unification Problems.
FCT
Peter Ruzicka, Igor Prívara
1991 J jnl
A Note on the Efficiency of an Interval Routing Algorithm.
Comput. J.
Peter Ruzicka, Vusei-Ar
1991 B conf
An Efficient Decision Algorithm for the Uniform Semi-Unification Problem.
MFCS
Peter Ruzicka
1989 J jnl
An Almost Linear Robinson Unification Algorithm.
Acta Informatica
Peter Ruzicka, Igor Prívara
1988 B conf
An Almost Linear Robinson Unification ALgorithm.
MFCS
Peter Ruzicka, Igor Prívara
1988 B conf
On Efficiency of Interval Routing Algorithms.
MFCS
Peter Ruzicka
1981 J jnl
Bounds for on-line selection.
Kybernetika
Peter Ruzicka
1981 J jnl
Validity test for Floyd's operator-precedence parsing algorithms is polynomial in time.
Kybernetika
Peter Ruzicka
1980 B conf
Time and Space Bounds in Producing Certain Partial Orders.
MFCS
Peter Ruzicka
1979 B conf
Validity Test for Floyd's Operator-Precedence Parsing Algorithms.
MFCS
Peter Ruzicka
1977 B conf
How Good Is the Adversary Lower Bound?
MFCS
Peter Ruzicka, Juraj Wiedermann
1976 B conf
On the Lower Bound for Minimum Comparison Selection.
MFCS
Peter Ruzicka, Juraj Wiedermann
1975 B conf
Local Disambiguating Transformation.
MFCS
Peter Ruzicka
1975 J jnl
On the size of DeRemer's analyzers.
Kybernetika
Peter Ruzicka
1975 J jnl
Size Complexity of Context-free Languages.
J. Inf. Process. Cybern.
Peter Ruzicka