Krzysztof Diks

Piotr Sankowski

Proceedings of the Algorithms, 2007

2006

Exploring Planar Graphs Using Unoriented Maps.

[BibT_eX]

[DOI]

Stefan Dobrev

J. Interconnect. Networks, 2006

2002

The impact of information on broadcasting time in linear radio networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

A New 3-Color Criterion for Planar Graphs.

[BibT_eX]

[DOI]

Lukasz Kowalik

Maciej Kurowski

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

Tree exploration with little memory.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2000

Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes.

[BibT_eX]

[DOI]

Algorithmica, 2000

1999

The Impact of Knowledge on Broadcasting Time in Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1999

1998

Broadcasting in Unlabeled Tori.

[BibT_eX]

[DOI]

Evangelos Kranakis

Parallel Process. Lett., 1998

Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Perfect Broadcasting in Unlabeled Networks.

[BibT_eX]

[DOI]

Evangelos Kranakis

Discret. Appl. Math., 1998

1997

Globally Optimal Diagnosis in Systems with Random Faults.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1997

Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures.

[BibT_eX]

[DOI]

Piotr Berman

J. Algorithms, 1997

Transition-Optimal Token Distribution.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1997

An Optimal Algorithm for Broadcasting Multiple Messages in Trees.

[BibT_eX]

Andrzej Lingas

Proceedings of the SIROCCO'97, 1997

Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

1996

Reliable Computations on Faulty EREW PRAM.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Efficient Gossiping by Packets in Networks with Random Faults.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1996

Parallel Maximum Independent Set in Convex Bipartite Graphs.

[BibT_eX]

[DOI]

Artur Czumaj

Teresa M. Przytycka

Inf. Process. Lett., 1996

Reliable Broadcasting in Hypercubes with Random Link and Node Failures.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1996

System Diagnosis with Smallest Risk of Error.

[BibT_eX]

[DOI]

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

More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree.

[BibT_eX]

[DOI]

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

1995

Anonymous Wireless Rings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Token Transfer in a Faulty Network.

[BibT_eX]

[DOI]

Adam Malinowski

RAIRO Theor. Informatics Appl., 1995

O(log log n)-Time Integer Geometry on the CRCW PRAM.

[BibT_eX]

[DOI]

Miroslaw Kowaluk

Algorithmica, 1995

Broadcasting with universal lists.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

1994

Sorting on a Mesh-Connected Computer with Delaying Links.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1994

Reliable Token Despersal with Random Faults.

[BibT_eX]

[DOI]

Adam Malinowski

Parallel Process. Lett., 1994

Optimal Coteries and Voting Schemes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Fast gossiping with short unreliable messages.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

The Buffer Potential of a Network.

[BibT_eX]

Proceedings of the Structural Information and Communication Complexity, 1994

Reliable Minimum Finding Comparator Networks.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Waking up an Anonymous Faulty Network from a Single Source.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

Fault-Tolerant Linear Broadcasting.

[BibT_eX]

[DOI]

Proceedings of the Parallel and Distributed Computing, 1994

1993

Edge Separators of Planar and Outerplanar Graphs with Applications.

[BibT_eX]

[DOI]

J. Algorithms, 1993

Fast Diagnosis of Multiprocessor Systems with Random Faults.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1993

Sparse Networks Supporting Efficient Reliable Broadcasting.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992

Almost Safe Gossiping in Bounded Degree Networks.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1992

1991

Improved Deterministic Parallel Integer Sorting

[BibT_eX]

[DOI]

Inf. Comput., September, 1991

On Optimal Parallel Computations for Sequences of Brackets.

[BibT_eX]

[DOI]

Wojciech Rytter

Theor. Comput. Sci., 1991

Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings.

[BibT_eX]

[DOI]

Oscar Garrido

Andrzej Lingas

Proceedings of the ISA '91 Algorithms, 1991

Optimal Broadcasting in Faulty Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the 1991 International Symposium on Fault-Tolerant Computing, 1991

1989

Optimal Parallel 5-Colouring of Planar Graphs.

[BibT_eX]

[DOI]

Marek Chrobak

SIAM J. Comput., 1989

Optimal Parallel Computations for Halin Graphs.

[BibT_eX]

[DOI]

Wojciech Rytter

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Wojciech Rytter

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

New Simulations between CRCW PRAMs.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1989

1988

Edge Separators for Planar Graphs and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Testing Isomorphism of Outerplanar Graphs in Parallel.

[BibT_eX]

[DOI]

Tomasz Radzik

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987

Parallel Recognition of Outerplanar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Parallel Algorithms and Architectures, 1987

Parallel 5-Colouring of Planar Graphs.

[BibT_eX]

[DOI]

Marek Chrobak

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

Saturating Flows in Networks.

[BibT_eX]

[DOI]

Marek Chrobak

Proceedings of the Fundamentals of Computation Theory, 1987

1986

A Fast Parallel Algorithm for Six-Colouring of Planar Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985

Embeddings of Binary Trees in Lines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

1984

A note on selection networks.

[BibT_eX]

[DOI]