The complexity of distributed concurrency control

Authors:
Paris C. Kanellakis;Christos H. Papadimitriou
Affiliations:
Massachusetts Institute of Technology, Cambridge;Massachusetts Institute of Technology, Cambridge
Venue:
SIAM Journal on Computing
Year:
1985

Citing 0
Cited 2

Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control (extended abstract)

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Optimal, Distributed Decision-Making: The Case of No Communication

FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract