Peter Ruzicka

Publication Activity (10 Years)

Years Active: 1975-2007
Publications (10 Years): 0

Publications

Rastislav Kralovic, Peter Ruzicka
Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing. Theor. Comput. Sci. 374 (1-3) (2007)
Stefan Dobrev, Paola Flocchini, Rastislav Kralovic, Peter Ruzicka, Giuseppe Prencipe, Nicola Santoro
Black hole search in common interconnection networks. Networks 47 (2) (2006)
Rastislav Kralovic, Richard Královic, Peter Ruzicka
Broadcasting with Many Faulty Links. SIROCCO (2003)
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) (2003)
Rastislav Kralovic, Peter Ruzicka
Minimum feedback vertex sets in shuffle-based interconnection networks. Inf. Process. Lett. 86 (4) (2003)
Peter Ruzicka
Preface. Theor. Comput. Sci. 286 (1) (2002)
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)
Rastislav Kralovic, Peter Ruzicka
Minimum Feedback Vertex Sets in Shuffle-based Interconnection Networks. SIROCCO (2002)
Rastislav Kralovic, Peter Ruzicka
On Immunity and Catastrophic Indices of Graphs. SIROCCO (2001)
Peter Ruzicka
On Efficiency of Path Systems Induced by Routing and Communication Schemes. Comput. Artif. Intell. 20 (2) (2001)
Martin Makuch, Peter Ruzicka
On the Complexity of Path Layouts in Bounded Degree ATM Networks A Case Study for Butterfly Networks. SIROCCO (2001)
Peter Ruzicka, Daniel Stefankovic
On the complexity of multi-dimensional interval routing schemes. Theor. Comput. Sci. 245 (2) (2000)
Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic
The complexity of shortest path and dilation bounded interval routing. Theor. Comput. Sci. 234 (1-2) (2000)
Paola Flocchini, Rastislav Kralovic, Alessandro Roncato, Peter Ruzicka, Nicola Santoro
On time versus size for monotone dynamic monopolies in regular topologies. SIROCCO (2000)
Rastislav Kralovic, Peter Ruzicka
Rank of Graphs: The Size of Acyclic Orientation Cover for Deadlock-Free Packet Routing. SIROCCO (1999)
Rastislav Kralovic, Branislav Rovan, Peter Ruzicka
Interval Routing on Layered Cross Product of Trees and Cycles. Euro-Par (1999)
Stefan Dobrev, Peter Ruzicka, Gerard Tel
Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes. SIROCCO (1998)
Rastislav Kralovic, Branislav Rovan, Peter Ruzicka, Daniel Stefankovic
Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks. DISC (1998)
Stefan Dobrev, Peter Ruzicka
On the Communication Complexity of Strong Time-Optimal Distributed Algorithms. Nord. J. Comput. 5 (2) (1998)
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) (1998)
Stefan Dobrev, Peter Ruzicka
Broadcasting on Anonymous Unoriented Tori. WG (1998)
Peter Ruzicka
Efficient Communication Schemes. SOFSEM (1998)
Stefan Dobrev, Peter Ruzicka
Yet Another Modular Technique for Efficient Leader Election. SOFSEM (1998)
Stefan Dobrev, Peter Ruzicka
Linear Broadcasting and N loglog N Election in Unoriented Hypercubes. SIROCCO (1997)
Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic
The Complexity of Shortest Path and Dilation Bounded Interval Routing. Euro-Par (1997)
Peter Ruzicka
Efficient Tree Pattern Unification. SOFSEM (1996)
Peter Ruzicka, Juraj Waczulík
Pebbling Dynamic Graphs in Minimal Space. RAIRO Theor. Informatics Appl. 28 (6) (1994)
Peter Ruzicka, Juraj Waczulík
On Time-Space Trade-Offs in Dynamic Graph Pebbling. MFCS (1993)
Peter Ruzicka, Igor Prívara
On Tree Pattern Unification Problems. FCT (1993)
Peter Ruzicka
An Efficient Decision Algorithm for the Uniform Semi-Unification Problem. MFCS (1991)
Peter Ruzicka, Vusei-Ar
A Note on the Efficiency of an Interval Routing Algorithm. Comput. J. 34 (5) (1991)
Peter Ruzicka, Igor Prívara
An Almost Linear Robinson Unification Algorithm. Acta Informatica 27 (1) (1989)
Peter Ruzicka, Igor Prívara
An Almost Linear Robinson Unification ALgorithm. MFCS (1988)
Peter Ruzicka
On Efficiency of Interval Routing Algorithms. MFCS (1988)
Peter Ruzicka
Bounds for on-line selection. Kybernetika 17 (2) (1981)
Peter Ruzicka
Validity test for Floyd's operator-precedence parsing algorithms is polynomial in time. Kybernetika 17 (5) (1981)
Peter Ruzicka
Time and Space Bounds in Producing Certain Partial Orders. MFCS (1980)
Peter Ruzicka
Validity Test for Floyd's Operator-Precedence Parsing Algorithms. MFCS (1979)
Peter Ruzicka, Juraj Wiedermann
How Good Is the Adversary Lower Bound? MFCS (1977)
Peter Ruzicka, Juraj Wiedermann
On the Lower Bound for Minimum Comparison Selection. MFCS (1976)
Peter Ruzicka
Local Disambiguating Transformation. MFCS (1975)
Peter Ruzicka
Size Complexity of Context-free Languages. J. Inf. Process. Cybern. 11 (4-6) (1975)
Peter Ruzicka
On the size of DeRemer's analyzers. Kybernetika 11 (3) (1975)