Local Disambiguating Transformation. - Peter Ruzicka (MFCS, 1975)

Size Complexity of Context-free Languages. - Peter Ruzicka (J. Inf. Process. Cybern., 1975)

On the size of DeRemer's analyzers. - Peter Ruzicka (Kybernetika, 1975)

On the Lower Bound for Minimum Comparison Selection. - Peter Ruzicka; Juraj Wiedermann (MFCS, 1976)

How Good Is the Adversary Lower Bound? - Peter Ruzicka; Juraj Wiedermann (MFCS, 1977)

Validity Test for Floyd's Operator-Precedence Parsing Algorithms. - Peter Ruzicka (MFCS, 1979)

Time and Space Bounds in Producing Certain Partial Orders. - Peter Ruzicka (MFCS, 1980)

Bounds for on-line selection. - Peter Ruzicka (Kybernetika, 1981)

Validity test for Floyd's operator-precedence parsing algorithms is polynomial in time. - Peter Ruzicka (Kybernetika, 1981)

On Efficiency of Interval Routing Algorithms. - Peter Ruzicka (MFCS, 1988)

An Almost Linear Robinson Unification Algorithm. - Peter Ruzicka; Igor Prívara (Acta Informatica, 1989)

An Efficient Decision Algorithm for the Uniform Semi-Unification Problem. - Peter Ruzicka (MFCS, 1991)

A Note on the Efficiency of an Interval Routing Algorithm. - Peter Ruzicka; Vusei-Ar (Comput. J., 1991)

On Tree Pattern Unification Problems. - Peter Ruzicka; Igor Prívara (FCT, 1993)

On Time-Space Trade-Offs in Dynamic Graph Pebbling. - Peter Ruzicka; Juraj Waczulík (MFCS, 1993)

Pebbling Dynamic Graphs in Minimal Space. - Peter Ruzicka; Juraj Waczulík (RAIRO Theor. Informatics Appl., 1994)

Efficient Tree Pattern Unification. - Peter Ruzicka (SOFSEM, 1996)

Linear Broadcasting and N loglog N Election in Unoriented Hypercubes. - Stefan Dobrev; Peter Ruzicka (SIROCCO, 1997)

Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes. - Stefan Dobrev; Peter Ruzicka; Gerard Tel (SIROCCO, 1998)

Yet Another Modular Technique for Efficient Leader Election. - Stefan Dobrev; Peter Ruzicka (SOFSEM, 1998)

Efficient Communication Schemes. - Peter Ruzicka (SOFSEM, 1998)

Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks. - Rastislav Kralovic; Branislav Rovan; Peter Ruzicka; Daniel Stefankovic (DISC, 1998)

Broadcasting on Anonymous Unoriented Tori. - Stefan Dobrev; Peter Ruzicka (WG, 1998)

Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages. - Krzysztof Diks; Stefan Dobrev; Evangelos Kranakis; Andrzej Pelc; Peter Ruzicka (Inf. Process. Lett., 1998)

On the Communication Complexity of Strong Time-Optimal Distributed Algorithms. - Stefan Dobrev; Peter Ruzicka (Nord. J. Comput., 1998)

Interval Routing on Layered Cross Product of Trees and Cycles. - Rastislav Kralovic; Branislav Rovan; Peter Ruzicka (Euro-Par, 1999)

Rank of Graphs: The Size of Acyclic Orientation Cover for Deadlock-Free Packet Routing. - Rastislav Kralovic; Peter Ruzicka (SIROCCO, 1999)

The complexity of shortest path and dilation bounded interval routing. - Rastislav Kralovic; Peter Ruzicka; Daniel Stefankovic (Theor. Comput. Sci., 2000)

On the complexity of multi-dimensional interval routing schemes. - Peter Ruzicka; Daniel Stefankovic (Theor. Comput. Sci., 2000)

On Immunity and Catastrophic Indices of Graphs. - Rastislav Kralovic; Peter Ruzicka (SIROCCO, 2001)

On the Complexity of Path Layouts in Bounded Degree ATM Networks A Case Study for Butterfly Networks. - Martin Makuch; Peter Ruzicka (SIROCCO, 2001)

On Efficiency of Path Systems Induced by Routing and Communication Schemes. - Peter Ruzicka (Comput. Artif. Intell., 2001)

Black Hole Search by Mobile Agents in Hypercubes and Related Networks. - Stefan Dobrev; Paola Flocchini; Rastislav Kralovic; Giuseppe Prencipe; Peter Ruzicka; Nicola Santoro (OPODIS, 2002)

Preface. - Peter Ruzicka (Theor. Comput. Sci., 2002)

Broadcasting with Many Faulty Links. - Rastislav Kralovic; Richard Královic; Peter Ruzicka (SIROCCO, 2003)

Minimum feedback vertex sets in shuffle-based interconnection networks. - Rastislav Kralovic; Peter Ruzicka (Inf. Process. Lett., 2003)

On time versus size for monotone dynamic monopolies in regular topologies. - Paola Flocchini; Rastislav Kralovic; Peter Ruzicka; Alessandro Roncato; Nicola Santoro (J. Discrete Algorithms, 2003)

Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance - Juraj Hromkovic; Ralf Klasing; Andrzej Pelc; Peter Ruzicka; Walter Unger (Springer, 2005)

Black hole search in common interconnection networks. - Stefan Dobrev; Paola Flocchini; Rastislav Kralovic; Peter Ruzicka; Giuseppe Prencipe; Nicola Santoro (Networks, 2006)

Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing. - Rastislav Kralovic; Peter Ruzicka (Theor. Comput. Sci., 2007)