Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Optimization Problems in Congestion Control - Karp Karp Icsi (Correct)
No context found.
Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
Improved Bounds for Online Multi-Path Routing in Faulty.. - Rührup, Schindelhauer (2006) (Correct)
No context found.
Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
Online Routing in Faulty Meshes with Sub-linear.. - Rührup, Schindelhauer (2005) (Correct)
No context found.
Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
Scheduling Search Procedures: The Wheel of Fortune - Damaschke (Correct)
No context found.
A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, 1998.
Competitive Time and Traffic Analysis of Position-based.. - Rührup, Schindelhauer (2005) (Correct)
No context found.
A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
On an Online Spanning Tree Problem in Randomly Weighted Graphs - Remy, Souza, Steger (2005) (Correct)
No context found.
A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
Scheduling Search Procedures - Damaschke (2004) (Correct)
No context found.
Borodin A and El-Yaniv R. Online Computation and Competitive Analysis. Cambridge Univ. Press, 1998.
On Queuing Lengths in On-Line Switching - Damaschke, Zhou (Correct)
No context found.
A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
Wavelength Assignment Algorithms for WDM Optical Networks - Bian (2003) (Correct)
No context found.
Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
Competitive Algorithms for High-Speed QoS Switches - Kesselman (2003) (Correct)
No context found.
A. Borodin and R. El-Yaniv, \Online Computation and Competitive Analysis," Cambridge University Press, 1998.
Call Control with k Rejections - Anand, Erlebach, Hall, Stefanakos (2002) (Correct)
No context found.
A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
Dynamic TCP Acknowledgment in the LogP Model - Frederiksen, Larsen, Noga.. (Correct)
No context found.
Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
Efficient URL Caching for World Wide Web Crawling - Broder, Najork, Wiener (2003) (1 citation) (Correct)
No context found.
A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press, 1998.
Constructing Disjoint Paths for Secure Communication - Bagchi, Chaudhary, Goodrich.. (2003) (Correct)
No context found.
A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
Competitive Queue Policies for Differentiated Services - Aiello, Mansour.. (2000) (3 citations) (Correct)
No context found.
A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
Efficient Strategies for Topics in Internet Algorithmics - Bagchi (2002) (Correct)
No context found.
A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
Packet-Mode Policies for Input-Queued Switches - Guez, Kesselman, Rosen (2004) (Correct)
No context found.
A. Borodin and R. El-Yaniv, "Online Computation and Competitive Analysis," Cambridge University Press, 1998.
Dynamic Routing on Networks with Fixed-Size Buffers - Aiello, Ostrovsky.. (2003) (2 citations) (Correct)
No context found.
A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
Load Balanced Short Path Routing in Wireless Networks - Gao, Zhang (2004) (1 citation) (Correct)
No context found.
Allan Borodin and Ran El-Yaniv, Online Computation and Competitive Analysis, Cambrdige University Press, 1998.
Constructing Disjoint Paths for Secure Communication - Bagchi, Chaudhary, Goodrich.. (2003) (Correct)
No context found.
A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
Computational Experiments on Graph Width Metrics - Fouhy (2003) (1 citation) (Correct)
No context found.
BORODIN, A., AND EL-YANIV, R. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
Exploring Congestion Control - Akella, Seshan, Shenker, Stoica (2002) (Correct)
No context found.
A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, 1998.
Algorithms for Distributed and Mobile Sensing - Isler (2004) (Correct)
No context found.
A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Pres, 1998.
Mechanism Design for Online Real-Time Scheduling - Ryan Porter Computer (2004) (3 citations) (Correct)
No context found.
A. Borodin and R. El-Yaniv, Online computation and competitive analysis, Cambridge University Press, 1998.
Seller-Focused Algorithms for Online Auctioning - Bagchi, Chaudhary, Garg.. (2001) (8 citations) (Correct)
No context found.
A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC