Peter Ruzicka

Theor. Comput. Sci., 2007

2006

Black hole search in common interconnection networks.

[BibT_eX]

[DOI]

Networks, 2006

2005

Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2003

Minimum feedback vertex sets in shuffle-based interconnection networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Broadcasting with Many Faulty Links.

[BibT_eX]

Richard Královic

Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

2002

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Black Hole Search by Mobile Agents in Hypercubes and Related Networks.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 2001

On the Complexity of Path Layouts in Bounded Degree ATM Networks A Case Study for Butterfly Networks.

[BibT_eX]

Martin Makuch

Proceedings of the SIROCCO 8, 2001

On Immunity and Catastrophic Indices of Graphs.

[BibT_eX]

Proceedings of the SIROCCO 8, 2001

2000

On the complexity of multi-dimensional interval routing schemes.

[BibT_eX]

[DOI]

Daniel Stefankovic

Theor. Comput. Sci., 2000

The complexity of shortest path and dilation bounded interval routing.

[BibT_eX]

[DOI]

Daniel Stefankovic

Theor. Comput. Sci., 2000

1999

Rank of Graphs: The Size of Acyclic Orientation Cover for Deadlock-Free Packet Routing.

[BibT_eX]

Proceedings of the SIROCCO'99, 1999

Interval Routing on Layered Cross Product of Trees and Cycles.

[BibT_eX]

[DOI]

Branislav Rovan

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.

[BibT_eX]

Nord. J. Comput., 1998

Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Broadcasting on Anonymous Unoriented Tori.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 12th International Symposium, 1998

Efficient Communication Schemes.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

Yet Another Modular Technique for Efficient Leader Election.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes.

[BibT_eX]

Gerard Tel

Proceedings of the SIROCCO'98, 1998

1997

Linear Broadcasting and N loglog N Election in Unoriented Hypercubes.

[BibT_eX]

Proceedings of the SIROCCO'97, 1997

1996

Efficient Tree Pattern Unification.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

1994

Pebbling Dynamic Graphs in Minimal Space.

[BibT_eX]

[DOI]

Juraj Waczulík

RAIRO Theor. Informatics Appl., 1994

1993

On Time-Space Trade-Offs in Dynamic Graph Pebbling.

[BibT_eX]

[DOI]

Juraj Waczulík

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

On Tree Pattern Unification Problems.

[BibT_eX]

[DOI]

Igor Prívara

Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1991

A Note on the Efficiency of an Interval Routing Algorithm.

[BibT_eX]

[DOI]

Vusei-Ar

Comput. J., 1991

An Efficient Decision Algorithm for the Uniform Semi-Unification Problem.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1989

An Almost Linear Robinson Unification Algorithm.

[BibT_eX]

[DOI]

Igor Prívara

Acta Informatica, 1989

1988

On Efficiency of Interval Routing Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1981

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

[BibT_eX]

[DOI]

Kybernetika, 1981

Bounds for on-line selection.

[BibT_eX]

[DOI]

Kybernetika, 1981

1980

Time and Space Bounds in Producing Certain Partial Orders.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1979

Validity Test for Floyd's Operator-Precedence Parsing Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1977

How Good Is the Adversary Lower Bound?

[BibT_eX]

[DOI]

Juraj Wiedermann

Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

1976

On the Lower Bound for Minimum Comparison Selection.

[BibT_eX]

[DOI]

Juraj Wiedermann

Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1975

On the size of DeRemer's analyzers.

[BibT_eX]

[DOI]

Kybernetika, 1975

Size Complexity of Context-free Languages.

[BibT_eX]

J. Inf. Process. Cybern., 1975

Local Disambiguating Transformation.

[BibT_eX]

[DOI]