| 2007 |
|---|
| 44 | EE | 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 |
|---|
| 43 | EE | 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 |
|---|
| 42 | | Juraj Hromkovic,
Ralf Klasing,
Andrzej Pelc,
Peter Ruzicka,
Walter Unger:
Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
Springer 2005 |
| 2003 |
|---|
| 41 | | Rastislav Kralovic,
Richard Královic,
Peter Ruzicka:
Broadcasting with Many Faulty Links.
SIROCCO 2003: 211-222 |
| 40 | EE | Rastislav Kralovic,
Peter Ruzicka:
Minimum feedback vertex sets in shuffle-based interconnection networks.
Inf. Process. Lett. 86(4): 191-196 (2003) |
| 39 | EE | 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) |
| 2002 |
|---|
| 38 | | 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 |
| 37 | | Rastislav Kralovic,
Peter Ruzicka:
Minimum Feedback Vertex Sets in Shuffle-based Interconnection Networks.
SIROCCO 2002: 237-245 |
| 36 | EE | Peter Ruzicka:
Preface.
Theor. Comput. Sci. 286(1): 1 (2002) |
| 2001 |
|---|
| 35 | | 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
Springer 2001 |
| 34 | | Rastislav Kralovic,
Peter Ruzicka:
On Immunity and Catastrophic Indices of Graphs.
SIROCCO 2001: 231-242 |
| 33 | | 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 |
| 32 | | Peter Ruzicka:
On Efficiency of Path Systems Induced by Routing and Communication Schemes.
Computers and Artificial Intelligence 20(2): (2001) |
| 2000 |
|---|
| 31 | | 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 |
| 30 | EE | 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) |
| 29 | EE | Peter Ruzicka,
Daniel Stefankovic:
On the complexity of multi-dimensional interval routing schemes.
Theor. Comput. Sci. 245(2): 255-280 (2000) |
| 1999 |
|---|
| 28 | EE | Rastislav Kralovic,
Branislav Rovan,
Peter Ruzicka:
Interval Routing on Layered Cross Product of Trees and Cycles.
Euro-Par 1999: 1231-1239 |
| 27 | | Rastislav Kralovic,
Peter Ruzicka:
Rank of Graphs: The Size of Acyclic Orientation Cover for Deadlock-Free Packet Routing.
SIROCCO 1999: 181-193 |
| 1998 |
|---|
| 26 | EE | Rastislav Kralovic,
Branislav Rovan,
Peter Ruzicka,
Daniel Stefankovic:
Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks.
DISC 1998: 273-287 |
| 25 | | Stefan Dobrev,
Peter Ruzicka,
Gerard Tel:
Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes.
SIROCCO 1998: 173-187 |
| 24 | EE | Peter Ruzicka:
Efficient Communication Schemes.
SOFSEM 1998: 244-263 |
| 23 | EE | Stefan Dobrev,
Peter Ruzicka:
Yet Another Modular Technique for Efficient Leader Election.
SOFSEM 1998: 312-321 |
| 22 | | Stefan Dobrev,
Peter Ruzicka:
Broadcasting on Anonymous Unoriented Tori.
WG 1998: 50-62 |
| 21 | EE | 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) |
| 20 | | Stefan Dobrev,
Peter Ruzicka:
On the Communication Complexity of Strong Time-Optimal Distributed Algorithms.
Nord. J. Comput. 5(2): 87-104 (1998) |
| 1997 |
|---|
| 19 | | Igor Prívara,
Peter Ruzicka:
Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings
Springer 1997 |
| 18 | | Rastislav Kralovic,
Peter Ruzicka,
Daniel Stefankovic:
The Complexity of Shortest Path and Dilation Bounded Interval Routing.
Euro-Par 1997: 258-265 |
| 17 | | Stefan Dobrev,
Peter Ruzicka:
Linear Broadcasting and N loglog N Election in Unoriented Hypercubes.
SIROCCO 1997: 53-68 |
| 1996 |
|---|
| 16 | | Peter Ruzicka:
Efficient Tree Pattern Unification.
SOFSEM 1996: 417-424 |
| 1994 |
|---|
| 15 | | 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
Springer 1994 |
| 14 | | Peter Ruzicka,
Juraj Waczulík:
Pebbling Dynamic Graphs in Minimal Space.
ITA 28(6): 557-565 (1994) |
| 1993 |
|---|
| 13 | | Peter Ruzicka,
Igor Prívara:
On Tree Pattern Unification Problems.
FCT 1993: 418-429 |
| 12 | | Peter Ruzicka,
Juraj Waczulík:
On Time-Space Trade-Offs in Dynamic Graph Pebbling.
MFCS 1993: 671-681 |
| 1991 |
|---|
| 11 | | Peter Ruzicka:
An Efficient Decision Algorithm for the Uniform Semi-Unification Problem.
MFCS 1991: 415-425 |
| 10 | | Peter Ruzicka,
Vusei-Ar:
A Note on the Efficiency of an Interval Routing Algorithm.
Comput. J. 34(5): 475-476 (1991) |
| 1989 |
|---|
| 9 | | Peter Ruzicka,
Igor Prívara:
An Almost Linear Robinson Unification Algorithm.
Acta Inf. 27(1): 61-71 (1989) |
| 1988 |
|---|
| 8 | | Peter Ruzicka:
On Efficiency of Interval Routing Algorithms.
MFCS 1988: 492-500 |
| 7 | | Peter Ruzicka,
Igor Prívara:
An Almost Linear Robinson Unification ALgorithm.
MFCS 1988: 501-511 |
| 1980 |
|---|
| 6 | | Peter Ruzicka:
Time and Space Bounds in Producing Certain Partial Orders.
MFCS 1980: 539-551 |
| 1979 |
|---|
| 5 | | Peter Ruzicka:
Validity Test for Floyd's Operator-Precedence Parsing Algorithms.
MFCS 1979: 415-424 |
| 1977 |
|---|
| 4 | | Peter Ruzicka,
Juraj Wiedermann:
How Good Is the Adversary Lower Bound?
MFCS 1977: 465-474 |
| 1976 |
|---|
| 3 | | Peter Ruzicka,
Juraj Wiedermann:
On the Lower Bound for Minimum Comparison Selection.
MFCS 1976: 495-502 |
| 1975 |
|---|
| 2 | | Peter Ruzicka:
Local Disambiguating Transformation.
MFCS 1975: 399-404 |
| 1 | | Peter Ruzicka:
Size Complexity of Context-free Languages.
Elektronische Informationsverarbeitung und Kybernetik 11(4-6): 296-299 (1975) |
