A time-randomness tradeoff for oblivious routing

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1988, Pages 93-102

  Krizanc, Danny ^a   Peleg, David ^b   Upfal, Eli ^c,d  

^a HARVARD UNIVERSITY   (United States)

^b STANFORD UNIVERSITY   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

^d WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ENTROPY; OPTIMIZATION; RANDOM PROCESSES;

ARBITRARY PERMUTATIONS; BOUNDED-DEGREE NETWORKS; EXPLICIT CONSTRUCTIONS; OBLIVIOUS ALGORITHMS; OBLIVIOUS ROUTING; OPTIMAL ALGORITHM; PROBABILISTIC ALGORITHM; THREE PARAMETERS;

ALGORITHMS;

EID: 84894203891     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/62212.62221     Document Type: Conference Paper

References (0)