Search the dblp DataBase
Peter Ruzicka :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Rastislav Kralovic , Branislav Rovan , Peter Ruzicka Interval Routing on Layered Cross Product of Trees and Cycles. [Citation Graph (0, 0)][DBLP ] Euro-Par, 1999, pp:1231-1239 [Conf ] Rastislav Kralovic , Peter Ruzicka , Daniel Stefankovic The Complexity of Shortest Path and Dilation Bounded Interval Routing. [Citation Graph (0, 0)][DBLP ] Euro-Par, 1997, pp:258-265 [Conf ] Peter Ruzicka , Igor Prívara On Tree Pattern Unification Problems. [Citation Graph (0, 0)][DBLP ] FCT, 1993, pp:418-429 [Conf ] Peter Ruzicka Local Disambiguating Transformation. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:399-404 [Conf ] Peter Ruzicka Validity Test for Floyd's Operator-Precedence Parsing Algorithms. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:415-424 [Conf ] Peter Ruzicka Time and Space Bounds in Producing Certain Partial Orders. [Citation Graph (0, 0)][DBLP ] MFCS, 1980, pp:539-551 [Conf ] Peter Ruzicka On Efficiency of Interval Routing Algorithms. [Citation Graph (0, 0)][DBLP ] MFCS, 1988, pp:492-500 [Conf ] Peter Ruzicka An Efficient Decision Algorithm for the Uniform Semi-Unification Problem. [Citation Graph (0, 0)][DBLP ] MFCS, 1991, pp:415-425 [Conf ] Peter Ruzicka , Igor Prívara An Almost Linear Robinson Unification ALgorithm. [Citation Graph (0, 0)][DBLP ] MFCS, 1988, pp:501-511 [Conf ] Peter Ruzicka , Juraj Wiedermann On the Lower Bound for Minimum Comparison Selection. [Citation Graph (0, 0)][DBLP ] MFCS, 1976, pp:495-502 [Conf ] Peter Ruzicka , Juraj Wiedermann How Good Is the Adversary Lower Bound? [Citation Graph (0, 0)][DBLP ] MFCS, 1977, pp:465-474 [Conf ] Peter Ruzicka , Juraj Waczulík On Time-Space Trade-Offs in Dynamic Graph Pebbling. [Citation Graph (0, 0)][DBLP ] MFCS, 1993, pp:671-681 [Conf ] Stefan Dobrev , Paola Flocchini , Rastislav Kralovic , Giuseppe Prencipe , Peter Ruzicka , Nicola Santoro Black Hole Search by Mobile Agents in Hypercubes and Related Networks. [Citation Graph (0, 0)][DBLP ] OPODIS, 2002, pp:169-180 [Conf ] Stefan Dobrev , Peter Ruzicka Linear Broadcasting and N loglog N Election in Unoriented Hypercubes. [Citation Graph (0, 0)][DBLP ] SIROCCO, 1997, pp:53-68 [Conf ] Stefan Dobrev , Peter Ruzicka , Gerard Tel Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes. [Citation Graph (0, 0)][DBLP ] SIROCCO, 1998, pp:173-187 [Conf ] Paola Flocchini , Rastislav Kralovic , Alessandro Roncato , Peter Ruzicka , Nicola Santoro On time versus size for monotone dynamic monopolies in regular topologies. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2000, pp:111-125 [Conf ] Rastislav Kralovic , Richard Královic , Peter Ruzicka Broadcasting with Many Faulty Links. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2003, pp:211-222 [Conf ] Rastislav Kralovic , Peter Ruzicka On Immunity and Catastrophic Indices of Graphs. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2001, pp:231-242 [Conf ] Rastislav Kralovic , Peter Ruzicka Minimum Feedback Vertex Sets in Shuffle-based Interconnection Networks. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2002, pp:237-245 [Conf ] Rastislav Kralovic , Peter Ruzicka Rank of Graphs: The Size of Acyclic Orientation Cover for Deadlock-Free Packet Routing. [Citation Graph (0, 0)][DBLP ] SIROCCO, 1999, pp:181-193 [Conf ] Martin Makuch , Peter Ruzicka On the Complexity of Path Layouts in Bounded Degree ATM Networks A Case Study for Butterfly Networks. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2001, pp:243-258 [Conf ] Stefan Dobrev , Peter Ruzicka Yet Another Modular Technique for Efficient Leader Election. [Citation Graph (0, 0)][DBLP ] SOFSEM, 1998, pp:312-321 [Conf ] Peter Ruzicka Efficient Tree Pattern Unification. [Citation Graph (0, 0)][DBLP ] SOFSEM, 1996, pp:417-424 [Conf ] Peter Ruzicka Efficient Communication Schemes. [Citation Graph (0, 0)][DBLP ] SOFSEM, 1998, pp:244-263 [Conf ] Rastislav Kralovic , Branislav Rovan , Peter Ruzicka , Daniel Stefankovic Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks. [Citation Graph (0, 0)][DBLP ] DISC, 1998, pp:273-287 [Conf ] Stefan Dobrev , Peter Ruzicka Broadcasting on Anonymous Unoriented Tori. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:50-62 [Conf ] Peter Ruzicka , Igor Prívara An Almost Linear Robinson Unification Algorithm. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1989, v:27, n:1, pp:61-71 [Journal ] Peter Ruzicka On Efficiency of Path Systems Induced by Routing and Communication Schemes. [Citation Graph (0, 0)][DBLP ] Computers and Artificial Intelligence, 2001, v:20, n:2, pp:- [Journal ] Peter Ruzicka , Vusei-Ar A Note on the Efficiency of an Interval Routing Algorithm. [Citation Graph (0, 0)][DBLP ] Comput. J., 1991, v:34, n:5, pp:475-476 [Journal ] Peter Ruzicka Size Complexity of Context-free Languages. [Citation Graph (0, 0)][DBLP ] Elektronische Informationsverarbeitung und Kybernetik, 1975, v:11, n:4-6, pp:296-299 [Journal ] Krzysztof Diks , Stefan Dobrev , Evangelos Kranakis , Andrzej Pelc , Peter Ruzicka Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:66, n:4, pp:181-186 [Journal ] Rastislav Kralovic , Peter Ruzicka Minimum feedback vertex sets in shuffle-based interconnection networks. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2003, v:86, n:4, pp:191-196 [Journal ] Peter Ruzicka , Juraj Waczulík Pebbling Dynamic Graphs in Minimal Space. [Citation Graph (0, 0)][DBLP ] ITA, 1994, v:28, n:6, pp:557-565 [Journal ] Paola Flocchini , Rastislav Kralovic , Peter Ruzicka , Alessandro Roncato , Nicola Santoro On time versus size for monotone dynamic monopolies in regular topologies. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2003, v:1, n:2, pp:129-150 [Journal ] Stefan Dobrev , Paola Flocchini , Rastislav Kralovic , Peter Ruzicka , Giuseppe Prencipe , Nicola Santoro Black hole search in common interconnection networks. [Citation Graph (0, 0)][DBLP ] Networks, 2006, v:47, n:2, pp:61-71 [Journal ] Stefan Dobrev , Peter Ruzicka On the Communication Complexity of Strong Time-Optimal Distributed Algorithms. [Citation Graph (0, 0)][DBLP ] Nord. J. Comput., 1998, v:5, n:2, pp:87-104 [Journal ] Rastislav Kralovic , Peter Ruzicka , Daniel Stefankovic The complexity of shortest path and dilation bounded interval routing. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2000, v:234, n:1-2, pp:85-107 [Journal ] Peter Ruzicka Preface. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:286, n:1, pp:1- [Journal ] Peter Ruzicka , Daniel Stefankovic On the complexity of multi-dimensional interval routing schemes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2000, v:245, n:2, pp:255-280 [Journal ] Rastislav Kralovic , Peter Ruzicka Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:374, n:1-3, pp:203-213 [Journal ] Search in 0.003secs, Finished in 0.334secs