C. Greg Plaxton

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

Active and Concurrent Topology Maintenance.

[BibT_eX]

[DOI]

Xiaozhou Li

Jayadev Misra

Proceedings of the Distributed Computing, 18th International Conference, 2004

Online hierarchical cooperative caching.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Brief announcement: concurrent maintenance of rings.

[BibT_eX]

[DOI]

Xiaozhou Li

Jayadev Misra

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003

Approximation algorithms for hierarchical location problems.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002

Optimal Time Bounds for Approximate Clustering.

[BibT_eX]

[DOI]

Ramgopal R. Mettu

Proceedings of the UAI '02, 2002

On name resolution in peer-to-peer networks.

[BibT_eX]

[DOI]

Xiaozhou (Steve) Li

Proceedings of the 2002 Workshop on Principles of Mobile Computing, 2002

2000

A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2000

Sorting-Based Selection Algorithms for Hypercubic Networks.

[BibT_eX]

[DOI]

Algorithmica, 2000

The Online Median Problem.

[BibT_eX]

[DOI]

Ramgopal R. Mettu

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

Placement Algorithms for Hierarchical Cooperative Caching.

[BibT_eX]

[DOI]

Madhukar R. Korupolu

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

Hypercubic Sorting Networks.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Sorting Algorithms.

[BibT_eX]

Theory Comput. Syst., 1998

Thread Scheduling for Multiprogrammed Multiprocessors.

[BibT_eX]

[DOI]

Nimar S. Arora

Robert D. Blumofe

Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998

Analysis of a Local Search Heuristic for Facility Location Problems.

[BibT_eX]

[DOI]

Madhukar R. Korupolu

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997

Breaking the Theta (n log² n) Barrier for Sorting with Faults.

[BibT_eX]

[DOI]

Yuan Ma

J. Comput. Syst. Sci., 1997

Lower Bounds for Shellsort.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Fair On-Line Scheduling of a Dynamic Set of Tasks on a Single Resource.

[BibT_eX]

[DOI]

Hussein M. Abdel-Wahab

Kevin Jeffay

Inf. Process. Lett., 1997

Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings.

[BibT_eX]

[DOI]

Johannes Gehrke

Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

Accessing Nearby Copies of Replicated Objects in a Distributed Environment.

[BibT_eX]

[DOI]

Andréa W. Richa

Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

1996

All Nearest Smaller Values on the Hypercube.

[BibT_eX]

[DOI]

Dina Kravets

IEEE Trans. Parallel Distributed Syst., 1996

A proportional share resource allocation algorithm for real-time, time-shared systems.

[BibT_eX]

[DOI]

Ion Stoica

Hussein M. Abdel-Wahab

Proceedings of the 17th IEEE Real-Time Systems Symposium (RTSS '96), 1996

Fast Fault-Tolerant Concurrent Access to Shared Objects.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995

Lower bounds for sorting networks.

[BibT_eX]

[DOI]

Nabil Kahalé

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

Tight analyses of two local load balancing algorithms.

[BibT_eX]

[DOI]

Bhaskar Ghosh

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

Fast scheduling of periodic tasks on multiple resources.

[BibT_eX]

[DOI]

Sanjoy K. Baruah

Johannes Gehrke

Proceedings of IPPS '95, 1995

Tight Bounds for a Distributed Selection Game with Applications to Fixed-Connection Machines.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

On contention resolution protocols and associated probabilistic phenomena.

[BibT_eX]

[DOI]

Philip D. MacKenzie

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

An optimal hypercube algorithm for the all nearest smaller values problem.

[BibT_eX]

[DOI]

Dina Kravets

Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Optimal Parallel Sorting in Multi-Level Storage.

[BibT_eX]

[DOI]

Alok Aggarwal

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993

Pipelined Parallel Prefix Computations, and Sorting on a Pipelined Hypercube.

[BibT_eX]

[DOI]

Ernst W. Mayr

J. Parallel Distributed Comput., 1993

Proportionate progress: a notion of fairness in resource allocation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Sorting-Based Selection Algorithms for Hypercube Networks.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Parallel Processing Symposium, 1993

1992

A Hypercubic Sorting Network with Nearly Logarithmic Depth

[BibT_eX]

[DOI]

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Small-Depth Counting Networks

[BibT_eX]

[DOI]

Michael Klugerman

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

A Lower Bound for Sorting Networks Based on the Shuffle Permutation.

[BibT_eX]

[DOI]

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

Improved Lower Bounds for Shellsort

[BibT_eX]

[DOI]

Bjorn Poonen

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

A Comparison of Sorting Algorithms for the Connection Machine CM-2.

[BibT_eX]

[DOI]

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

Highly Fault-Tolerant Sorting Circuits

[BibT_eX]

[DOI]

Yuan Ma

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers

[BibT_eX]

[DOI]

Robert Cypher

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

A (fairly) Simple Circuit that (usually) Sorts

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

Efficient computation on sparse interconnection networks.

[BibT_eX]

[DOI]

C. Gregory Plaxton

PhD thesis, 1989

Load Balancing, Selection Sorting on the Hypercube.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

On the Network Complexity of Selection

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

On the Spanning Trees of Weighted Graphs.

[BibT_eX]

[DOI]

Ernst W. Mayr