Danny Krizanc

Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences, 1998

Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract).

[BibT_eX]

[DOI]

Andrzej Pelc

Proceedings of the Algorithms, 1998

1997

Planar Stage Graphs: Characterizations and Applications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Time-Message Trade-Offs for the Weak Unison Problem.

[BibT_eX]

Nord. J. Comput., 1997

New Graph Decompositions with Applications to Emulations.

[BibT_eX]

[DOI]

Theory Comput. Syst., 1997

Distributed Computing on Anonymous Hypercube Networks.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Hop-Congestion Trade-Offs for High-Speed Networks.

[BibT_eX]

[DOI]

Andrzej Pelc

Int. J. Found. Comput. Sci., 1997

The VC-dimension of Set Systems Defined by Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Stage-graph Representations.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Power Consumption in Packet Radio Networks (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Discrete Realizations of Contact and Intersection Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

Many-to-One Packed Routing via Matchings.

[BibT_eX]

[DOI]

Louxin Zhang

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996

Time-Randomness Trade-offs in Parallel Computation.

[BibT_eX]

[DOI]

J. Algorithms, 1996

On Multi-Label Linear Interval Routing Schemes.

[BibT_eX]

[DOI]

S. S. Ravi

Comput. J., 1996

Fast Deterministic Selection on Mesh-Connected Processor Arrays.

[BibT_eX]

[DOI]

Rajeev Raman

Algorithmica, 1996

Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract).

[BibT_eX]

[DOI]

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

Lower Bounds for Compact Routing (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the STACS 96, 1996

Boolean Routing on Cayley Networks.

[BibT_eX]

Proceedings of the SIROCCO'96, 1996

The Complexity of Data Mining on the Web (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Baked Potatoes: Deadlock Prevention Via Scheduling (Abstract).

[BibT_eX]

[DOI]

Shlomi Dolev

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Multipacket Hot-Potato Routing on Processor Arrays.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par '96 Parallel Processing, 1996

Approximating the Unsatisfiability Threshold of Random Formulas (Extended Abstract).

[BibT_eX]

[DOI]

Lefteris M. Kirousis

Proceedings of the Algorithms, 1996

A better upper bound for the unsatisfiability threshold.

[BibT_eX]

[DOI]

Lefteris M. Kirousis

Proceedings of the Satisfiability Problem: Theory and Applications, 1996

Maximal Length Common Non-intersecting Paths.

[BibT_eX]

[DOI]

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995

Zero-One Sorting on the Mesh.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1995

Labeled Versus Unlabeled Distributed Cayley Networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

VC-Dimensions for Graphs (Extended Abstract).

[BibT_eX]

[DOI]

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

Bubbles: adaptive routing scheme for high-speed dynamic networks (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Boolean Routing on Chordal Rings.

[BibT_eX]

Flaminia L. Luccio

Proceedings of the Structure, Information and Communication Complexity, 1995

Implicit Routing and Shortest Path Information (Extended Abstract).

[BibT_eX]

Jorge Urrutia

Proceedings of the Structure, Information and Communication Complexity, 1995

String Recognition on Anonymous Rings.

[BibT_eX]

[DOI]

Flaminia L. Luccio

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Optimal Shooting: Characterizations and Applications.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994

Computing Boolean Functions on Anonymous Networks

[BibT_eX]

[DOI]

Jacob van den Berg

Inf. Comput., November, 1994

Optimal Coteries and Voting Schemes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

On the Number of Directions in Visibility Representations.

[BibT_eX]

[DOI]

Jorge Urrutia

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Sorting and Selection on Arrays with Diagonal Connections.

[BibT_eX]

[DOI]

Proceedings of the Parallel and Distributed Computing, 1994

On Key Distribution via True Broadcasting.

[BibT_eX]

[DOI]

Proceedings of the CCS '94, 1994

1993

A Comparison of Meshes with Static Buses and Half-Duplex Wrap-Arounds.

[BibT_eX]

[DOI]

Sanguthevar Rajasekaran

Sunil M. Shende

Parallel Process. Lett., 1993

Integer Sorting on a Mesh-Connected Array of Processors.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

On Multi-Label Linear Interval Routing Schemes (Extended Abstract).

[BibT_eX]

[DOI]

S. S. Ravi

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

A Time-Randomness Tradeoff for Selection in Parallel.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies.

[BibT_eX]

[DOI]

Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

Universal Emulations with Sublogarithmic Slowdown

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

The Average Complexity of Parallel Comparison Merging.

[BibT_eX]

[DOI]

Mihály Geréb-Graus

SIAM J. Comput., 1992

Optimal Algorithms for Selection on a Mesh-Connected Processor Array.

[BibT_eX]

[DOI]

Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

Distributed Computing on Cayley Networks (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

Simple Path Selection for Optimal Routing on Processor Arrays.

[BibT_eX]

[DOI]

Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

Optimal Sorting on Mesh-Connected Processor Arrays.

[BibT_eX]

[DOI]

Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

Multipacket Selection on Mesh-Connected Processor Arrays.

[BibT_eX]

[DOI]

Proceedings of the 6th International Parallel Processing Symposium, 1992

1991

A Note on Off-Line Permutation Routing on a Mesh-Connected Processor Array.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1991

Tight Bounds for Oblivious Routing in the Hypercube.

[BibT_eX]

[DOI]

Thanasis Tsantilas

Math. Syst. Theory, 1991

Oblivious Routing with Limited Buffer Capacity.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1991

Off-line routing with small queues on a mesh-connected processor array.

[BibT_eX]

[DOI]

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

1988

A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract)

[BibT_eX]

[DOI]

David Peleg

Eli Upfal

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Optimal Routing Algorithms for Mesh-Connected Processor Arrays.

[BibT_eX]

[DOI]

Sanguthevar Rajasekaran

Thanasis Tsantilas

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

The Complexity of Parallel Comparison Merging

[BibT_eX]

[DOI]

Mihály Geréb-Graus