Peter Ruzicka

According to our database1, Peter Ruzicka
  • authored at least 44 papers between 1975 and 2007.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2007
Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing.
Theor. Comput. Sci., 2007

2006
Black hole search in common interconnection networks.
Networks, 2006

2005
Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-26663-1, 2005

2003
On time versus size for monotone dynamic monopolies in regular topologies.
J. Discrete Algorithms, 2003

Minimum feedback vertex sets in shuffle-based interconnection networks.
Inf. Process. Lett., 2003

Broadcasting with Many Faulty Links.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

2002
Preface.
Theor. Comput. Sci., 2002

Minimum Feedback Vertex Sets in Shuffle-based Interconnection Networks.
Proceedings of the SIROCCO 9, 2002

Black Hole Search by Mobile Agents in Hypercubes and Related Networks.
Proceedings of the Procedings of the 6th International Conference on Principles of Distributed Systems. OPODIS 2002, 2002

2001
On Efficiency of Path Systems Induced by Routing and Communication Schemes.
Computers and Artificial Intelligence, 2001

On the Complexity of Path Layouts in Bounded Degree ATM Networks A Case Study for Butterfly Networks.
Proceedings of the SIROCCO 8, 2001

On Immunity and Catastrophic Indices of Graphs.
Proceedings of the SIROCCO 8, 2001

2000
On the complexity of multi-dimensional interval routing schemes.
Theor. Comput. Sci., 2000

The complexity of shortest path and dilation bounded interval routing.
Theor. Comput. Sci., 2000

On time versus size for monotone dynamic monopolies in regular topologies.
Proceedings of the SIROCCO 7, 2000

1999
Rank of Graphs: The Size of Acyclic Orientation Cover for Deadlock-Free Packet Routing.
Proceedings of the SIROCCO'99, 1999

Interval Routing on Layered Cross Product of Trees and Cycles.
Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

1998
On the Communication Complexity of Strong Time-Optimal Distributed Algorithms.
Nord. J. Comput., 1998

Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages.
Inf. Process. Lett., 1998

Broadcasting on Anonymous Unoriented Tori.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks.
Proceedings of the Distributed Computing, 12th International Symposium, 1998

Efficient Communication Schemes.
Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

Yet Another Modular Technique for Efficient Leader Election.
Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes.
Proceedings of the SIROCCO'98, 1998

1997
Linear Broadcasting and N loglog N Election in Unoriented Hypercubes.
Proceedings of the SIROCCO'97, 1997

The Complexity of Shortest Path and Dilation Bounded Interval Routing.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

1996
Efficient Tree Pattern Unification.
Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

1994
Pebbling Dynamic Graphs in Minimal Space.
ITA, 1994

1993
On Time-Space Trade-Offs in Dynamic Graph Pebbling.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

On Tree Pattern Unification Problems.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1991
A Note on the Efficiency of an Interval Routing Algorithm.
Comput. J., 1991

An Efficient Decision Algorithm for the Uniform Semi-Unification Problem.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1989
An Almost Linear Robinson Unification Algorithm.
Acta Inf., 1989

1988
An Almost Linear Robinson Unification ALgorithm.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

On Efficiency of Interval Routing Algorithms.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

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

Bounds for on-line selection.
Kybernetika, 1981

1980
Time and Space Bounds in Producing Certain Partial Orders.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1979
Validity Test for Floyd's Operator-Precedence Parsing Algorithms.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1977
How Good Is the Adversary Lower Bound?
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

1976
On the Lower Bound for Minimum Comparison Selection.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1975
On the size of DeRemer's analyzers.
Kybernetika, 1975

Size Complexity of Context-free Languages.
Elektronische Informationsverarbeitung und Kybernetik, 1975

Local Disambiguating Transformation.
Proceedings of the Mathematical Foundations of Computer Science 1975, 1975


  Loading...