Time complexity lower bound for randomized implementations of some shared objects

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 1998, Pages 201-210

  Jayanti, Prasad ^a  

^a DARTMOUTH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS TRANSFER MODE; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; DATA COMMUNICATION SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS); STORAGE ALLOCATION (COMPUTER); SYNCHRONIZATION;

SHARED ACCESS TIME COMPLEXITY; WAIT FREE IMPLEMENTATIONS;

MULTIPROCESSING SYSTEMS;

EID: 0031636409     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)