default search action
Gary L. Peterson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
- [j8]Prasad Jayanti, James E. Burns, Gary L. Peterson:
Almost Optimal Single Reader, Single Writer Atomic Register. J. Parallel Distributed Comput. 60(2): 150-168 (2000)
1990 – 1999
- 1999
- [c15]Gary L. Peterson:
Properties of a Family of Booster Types. PODC 1999: 281 - 1997
- [j7]Rida A. Bazzi, Gil Neiger, Gary L. Peterson:
On the Use of Registers in Achieving Wait-Free Consensus. Distributed Comput. 10(3): 117-127 (1997) - 1994
- [c14]Rida A. Bazzi, Gary L. Peterson:
A Gap Theorem for Consensus Types (Extended Abstract). PODC 1994: 344-353 - [c13]Rida A. Bazzi, Gary L. Peterson:
On the Use of Registers in Achieving Wait-Free Consensus. PODC 1994: 354-362 - [c12]Gary L. Peterson, Byungho Yi:
Election on faulty rings with incomplete size information. SPDP 1994: 232-239 - 1993
- [c11]Gary L. Peterson, Byungho Yi:
Average Case Behavior of Election Algorithms for Unidirectional Rings. ICDCS 1993: 366-373
1980 – 1989
- 1989
- [c10]James E. Burns, Gary L. Peterson:
The Ambiguity of Choosing. PODC 1989: 145-157 - [c9]Eugene Styer, Gary L. Peterson:
Tight Bounds for Shared Memory Symmetric Mutual Exclusion Problems. PODC 1989: 177-191 - 1988
- [c8]Eugene Styer, Gary L. Peterson:
Improved Algorithms for Distributed Resource Allocation. PODC 1988: 105-116 - 1987
- [j6]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) - [c7]Gary L. Peterson, James E. Burns:
Concurrent Reading While Writing II: The Multi-writer Case. FOCS 1987: 383-392 - [c6]James E. Burns, Gary L. Peterson:
Constructing Multi-reader Atomic Values From Non-atomic Values. PODC 1987: 222-231 - 1983
- [j5]Gary L. Peterson:
Concurrent Reading While Writing. ACM Trans. Program. Lang. Syst. 5(1): 46-55 (1983) - [j4]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
- [j3]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) - [j2]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) - 1981
- [j1]Gary L. Peterson:
Myths About the Mutual Exclusion Problem. Inf. Process. Lett. 12(3): 115-116 (1981) - 1980
- [c5]Gary L. Peterson:
Succinct Representation, Random Strings, and Complexity Classes. FOCS 1980: 86-95 - [c4]John H. Reif, Gary L. Peterson:
A Dynamic Logic of Multiprocessing with Incomplete Information. POPL 1980: 193-202
1970 – 1979
- 1979
- [c3]Gary L. Peterson, John H. Reif:
Multiple-Person Alternation. FOCS 1979: 348-363 - [c2]Gary L. Peterson:
Time-Space Trade-Offs for Asynchronous Parallel Models: Reducibilities and Equivalences. STOC 1979: 224-230 - 1977
- [c1]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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: