Gary L. Peterson

According to our database, Gary L. Peterson authored at least 23 papers between 1977 and 2000.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2000

Almost Optimal Single Reader, Single Writer Atomic Register.

Prasad Jayanti, James E. Burns, Gary L. Peterson

J. Parallel Distributed Comput., 2000

1999

Properties of a Family of Booster Types.

Gary L. Peterson

Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1997

On the Use of Registers in Achieving Wait-Free Consensus.

Rida A. Bazzi, Gil Neiger, Gary L. Peterson

Distributed Comput., 1997

1994

Election on faulty rings with incomplete size information.

Gary L. Peterson, Byungho Yi

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

On the Use of Registers in Achieving Wait-Free Consensus.

Rida A. Bazzi, Gary L. Peterson

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

A Gap Theorem for Consensus Types (Extended Abstract).

Rida A. Bazzi, Gary L. Peterson

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1993

Average Case Behavior of Election Algorithms for Unidirectional Rings.

Gary L. Peterson, Byungho Yi

Proceedings of the 13th International Conference on Distributed Computing Systems, 1993

1989

Tight Bounds for Shared Memory Symmetric Mutual Exclusion Problems.

Eugene Styer, Gary L. Peterson

Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

The Ambiguity of Choosing.

James E. Burns, Gary L. Peterson

Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

1988

Improved Algorithms for Distributed Resource Allocation.

Eugene Styer, Gary L. Peterson

Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

1987

An Efficient Solution to the Mutual Exclusion Problem Using Weak Semaphores.

Stuart A. Friedberg, Gary L. Peterson

Inf. Process. Lett., 1987

Constructing Multi-reader Atomic Values From Non-atomic Values.

James E. Burns, Gary L. Peterson

Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

Concurrent Reading While Writing II: The Multi-writer Case

Gary L. Peterson, James E. Burns

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1983

A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables.

Gary L. Peterson

ACM Trans. Program. Lang. Syst., 1983

Concurrent Reading While Writing.

Gary L. Peterson

ACM Trans. Program. Lang. Syst., 1983

1982

An O(n log n) Unidirectional Algorithm for the Circular Extrema Problem.

Gary L. Peterson

ACM Trans. Program. Lang. Syst., 1982

Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable.

James E. Burns, Paul Jackson, Nancy A. Lynch, Michael J. Fischer, Gary L. Peterson

J. ACM, 1982

1981

Myths About the Mutual Exclusion Problem.

Gary L. Peterson

Inf. Process. Lett., 1981

1980

A Dynamic Logic of Multiprocessing with Incomplete Information.

John H. Reif, Gary L. Peterson

Proceedings of the Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, 1980

Succinct Representation, Random Strings, and Complexity Classes

Gary L. Peterson

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979

Time-Space Trade-Offs for Asynchronous Parallel Models: Reducibilities and Equivalences

Gary L. Peterson

Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

Multiple-Person Alternation

Gary L. Peterson, John H. Reif

Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1977

Economical Solutions for the Critical Section Problem in a Distributed System (Extended Abstract)

Gary L. Peterson, Michael J. Fischer

Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977