Time and space lower bounds for non-blocking implementations

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 1996, Pages 257-266

  Jayanti, Prasad ^a   Tan, King ^a   Toueg, Sam ^a  

^a Dartmouth Department of Computer Science_Dartmouth College   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMIZATION; RANDOM PROCESSES; SET THEORY; SHIFT REGISTERS;

SPACE COMPLEXITY; SPACE LOWER BOUNDS; TIME LOWER BOUNDS;

DISTRIBUTED COMPUTER SYSTEMS;

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

References (5)