Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
 
Awerbuch, Baruch
MIT
Cambridge, Massachusetts
  Follow this Reviewer
 
 
 
Options:
Date Reviewed  
 
1 review

   
  A time-randomness trade-off for oblivious routing
Peleg D., Upfal E. SIAM Journal on Computing 19(2): 256-266, 1990.  Type: Article

Understanding the role of randomness in the theory of computation is rapidly becoming one of the central, challenging problems facing computer scientists. The ultimate goal of research in this area is to develop a clear theory that exp...

Aug 1 1991  
 
 
   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy