Constant time per edge is optimal on rooted tree networks

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 1996, Pages 162-169

  Mitzenmacher, Michael ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DELAY CONTROL SYSTEMS; OPTIMIZATION; QUEUEING THEORY; RANDOM PROCESSES;

ROOTED TREE NETWORKS;

PACKET NETWORKS;

EID: 0030399701     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237502.237524     Document Type: Conference Paper

References (19)