Gary L. Peterson

	2000
22		Prasad Jayanti, James E. Burns, Gary L. Peterson: Almost Optimal Single Reader, Single Writer Atomic Register. J. Parallel Distrib. Comput. 60(2): 150-168 (2000)
	1999
21		Gary L. Peterson: Properties of a Family of Booster Types. PODC 1999: 281
	1997
20		Rida A. Bazzi, Gil Neiger, Gary L. Peterson: On the Use of Registers in Achieving Wait-Free Consensus. Distributed Computing 10(3): 117-127 (1997)
	1994
19		Rida A. Bazzi, Gary L. Peterson: A Gap Theorem for Consensus Types (Extended Abstract). PODC 1994: 344-353
18		Rida A. Bazzi, Gary L. Peterson: On the Use of Registers in Achieving Wait-Free Consensus. PODC 1994: 354-362
	1993
17		Gary L. Peterson, Byungho Yi: Average Case Behavior of Election Algorithms for Unidirectional Rings. ICDCS 1993: 366-373
	1989
16		James E. Burns, Gary L. Peterson: The Ambiguity of Choosing. PODC 1989: 145-157
15		Eugene Styer, Gary L. Peterson: Tight Bounds for Shared Memory Symmetric Mutual Exclusion Problems. PODC 1989: 177-191
	1988
14		Eugene Styer, Gary L. Peterson: Improved Algorithms for Distributed Resource Allocation. PODC 1988: 105-116
	1987
13		Gary L. Peterson, James E. Burns: Concurrent Reading While Writing II: The Multi-writer Case FOCS 1987: 383-392
12		James E. Burns, Gary L. Peterson: Constructing Multi-reader Atomic Values From Non-atomic Values. PODC 1987: 222-231
11		Stuart A. Friedberg, Gary L. Peterson: An Efficient Solution to the Mutual Exclusion Problem Using Weak Semaphores. Inf. Process. Lett. 25(5): 343-348 (1987)
	1983
10		Gary L. Peterson: Concurrent Reading While Writing. ACM Trans. Program. Lang. Syst. 5(1): 46-55 (1983)
9		Gary L. Peterson: A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables. ACM Trans. Program. Lang. Syst. 5(1): 56-65 (1983)
	1982
8		Gary L. Peterson: An O(n log n) Unidirectional Algorithm for the Circular Extrema Problem. ACM Trans. Program. Lang. Syst. 4(4): 758-762 (1982)
7		James E. Burns, Paul Jackson, Nancy A. Lynch, Michael J. Fischer, Gary L. Peterson: Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable. J. ACM 29(1): 183-205 (1982)
	1981
6		Gary L. Peterson: Myths About the Mutual Exclusion Problem. Inf. Process. Lett. 12(3): 115-116 (1981)
	1980
5		Gary L. Peterson: Succinct Representation, Random Strings, and Complexity Classes FOCS 1980: 86-95
4		John H. Reif, Gary L. Peterson: A Dynamic Logic of Multiprocessing with Incomplete Information. POPL 1980: 193-202
	1979
3		Gary L. Peterson, John H. Reif: Multiple-Person Alternation FOCS 1979: 348-363
2		Gary L. Peterson: Time-Space Trade-Offs for Asynchronous Parallel Models: Reducibilities and Equivalences STOC 1979: 224-230
	1977
1		Gary L. Peterson, Michael J. Fischer: Economical Solutions for the Critical Section Problem in a Distributed System (Extended Abstract) STOC 1977: 91-97

Coauthor Index

1	Rida A. Bazzi	[18] [19] [20]
2	James E. Burns	[7] [12] [13] [16] [22]
3	Michael J. Fischer	[1] [7]
4	Stuart A. Friedberg	[11]
5	Paul Jackson	[7]
6	Prasad Jayanti	[22]
7	Nancy A. Lynch	[7]
8	Gil Neiger	[20]
9	John H. Reif	[3] [4]
10	Eugene Styer	[14] [15]
11	Byungho Yi	[17]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page