Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,104,089 papers from all fields of science
Search
Sign In
Create Free Account
Lamport's distributed mutual exclusion algorithm
Known as:
Lamport
Lamport's Distributed Mutual Exclusion Algorithm is a contention-based algorithm for mutual exclusion on a distributed system.
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Lamport timestamps
Lamport's bakery algorithm
Mutual exclusion
Suzuki-Kasami algorithm
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Improved mathematical model of the post-quantum eletronic signature mechanism
Y. Gorbenko
,
K. Isirova
2018
Corpus ID: 199013619
In the paper new electronic signature mechanisms which will be urgent in the post-quantum period development necessity is…
Expand
Review
2016
Review
2016
Increasing Learner Engagement in Online Learning through Use of Interactive Feedback: Results of a Pilot Study
E. Rutz
,
Suzanne Ehrlich
2016
Corpus ID: 57576116
Technologies for eLearning continue to evolve and provide additional mechanisms for teaching and facilitating learner engagement…
Expand
Review
2012
Review
2012
Breakfast and Adolescent Academic Performance : An Analytical Review of Recent Research
L. A. Hasz
,
M. A. Lamport
2012
Corpus ID: 23742302
ver the past several decades, researchers have suspected and confirmed various links between breakfast consumption and adolescent…
Expand
Review
2010
Review
2010
A Review of Checkpointing Fault Tolerance Techniques in Distributed Mobile Systems
R. Garg
,
Praveen Kumar
2010
Corpus ID: 15172201
Fault Tolerance Techniques enable systems to perform tasks in the presence of faults. A checkpoint is a local state of a process…
Expand
Review
2000
Review
2000
A survey of checkpointing algorithms for parallel and distributed computers
S. Kalaiselvi
,
V. Rajaraman
2000
Corpus ID: 14673679
Checkpoint is defined as a designated place in a program at which normal processing is interrupted specifically to preserve the…
Expand
Highly Cited
1993
Highly Cited
1993
Fully polynomial Byzantine agreement in t + 1 rounds
J. Garay
,
Y. Moses
Symposium on the Theory of Computing
1993
Corpus ID: 18954759
This paper presents a polynomial protocol for reaching Byzantine agreement in t + 1 rounds whenever n > 3t, where n is the number…
Expand
1989
1989
Efficient temporal reasoning (extended abstract)
E. Emerson
,
T. Sadler
,
J. Srinivasan
ACM-SIGACT Symposium on Principles of Programming…
1989
Corpus ID: 10984449
There has been much interest in decision procedures for testing satisfiability (or validity) of formulae in various systems of…
Expand
Review
1986
Review
1986
The Quest Goes on: A Survey of Proofsystems for Partial Correctness of CSP
J. Hooman
,
W. P. Roever
Current Trends in Concurrency
1986
Corpus ID: 18606632
Proofsystems for proving partial correctness of distributed processes which communicate through message-passing are discussed…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE