488 citations found. Retrieving documents...
D. D. Sleator and R. E. Tarjan, Amortized efficiency of list update and paging rules, Comm. ACM, 28 (1985), pp. 202--208.

 Home/Search   Document Not in Database   Summary   ACM   TOC   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

Online Performance-Improvement - Prasad Chalasani August   Self-citation (Sleator)   (Correct)

No context found.

D. D. Sleator and R. T. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202--208, Feb. 1985.


SIAM J. DISCRETE MATH. c fl 1998 Society for.. - On-Line Difference..   (Correct)

No context found.

D. D. Sleator and R. E. Tarjan, Amortized efficiency of list update and paging rules, Comm. ACM, 28 (1985), pp. 202--208.


Searching in an Unknown Environment: An Optimal Randomized.. - Kao, Reif, Tate (1993)   (33 citations)  (Correct)

No context found.

Sleator, D. D., and Tarjan, R. E. (1985), Amortized efficiency of list update and paging rules, Comm. ACM 28, pp. 202--208.


Provably Competitive Adaptive Routing - Awerbuch, Holmer, Rubens, al. (2005)   (Correct)

No context found.

Sleator and Tarjan. Amortized efficiency of list update and paging rules. Comm. ACM, 28(2):202--208, 1985.


The Roommates Problem - Online Matching On   (Correct)

No context found.

D.Sleator, R.Tarjan. "Amortized Efficiency of List Update and Paging Rules", Communications of the ACM, vol. 28, pp. 202--208, 1985.


Constant Factor Bounds for On-line Load Balancing on Related.. - Andrews   (1 citation)  (Correct)

No context found.

D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202--208, 1985.


Improved Bounds for On-line Load Balancing - Matthew Andrews Andrews (1996)   (3 citations)  (Correct)

No context found.

D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202--208, 1985.


The k-client Problem - Alborzi, Torng, Uthaisombut, Wagner (1997)   (Correct)

No context found.

D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. CACM, 28:202--208, 1985.


Scheduling Contract Algorithms on Multiple Processors - Bernstein, Zilberstein.. (2002)   (2 citations)  (Correct)

No context found.

Sleator, D. D. & Tarjan, R. E. (1985). Amortized efficiency of list update and paging rules. Communications of the ACM, 28, 202--208.


Optimal Online Scheduling - Of Parallel Jobs (1992)   (Correct)

No context found.

D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. CACM, 28(2):202--208, 1985.


Competitive Access Time via Dynamic Storage Rearrangement - Fiat, Mansour, Rosen, Waarts (1995)   (7 citations)  (Correct)

No context found.

D.D. Sleator and R.E. Tarjan. "Amortized Efficiency of List Update and Paging Rules". In Communications of the ACM, 28(2) pages 202-208, 1985.


Assignment of Reusable and Non-Reusable Frequencies - Fotakis, Spirakis (1998)   (Correct)

No context found.

D. Sleator and R.E. Tarjan (1985), "Amortized Efficiency of List Update and Paging Rules", Communications of the Association for Computing Machinery 28, pp. 202--208. 19


Competitive Non-Preemptive Call Control - Awerbuch, Bartal, Fiat, Rosen   (94 citations)  (Correct)

No context found.

D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communication of the ACM, 28(2):202--208, 1985.


The Distributed k-Server Problem - A Competitive Distributed.. - Bartal, Rosen (1992)   (Correct)

No context found.

D.D. Sleator and R.E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Communication of the ACM, 28(2) pages 202--208, 1985.


On-line Competitive Algorithms for Call Admission.. - Awerbuch, Azar.. (1996)   (22 citations)  (Correct)

No context found.

D. Sleator, R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of ACM 28(2): 202-208, 1985. 17


Competitive Queue Policies for Differentiated Services - Aiello, Mansour.. (2000)   (3 citations)  (Correct)

No context found.

D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202--208, 1985.


Second-Level Buffer Cache Management - Zhou, Chen, Li (2004)   (Correct)

No context found.

D. Sleator and R. Tarjan, "Amortized Efficiency of List Update and Paging Rules," Comm. ACM, vol. 28, no. 2, pp. 202-208, Feb. 1985.


Packet-Mode Policies for Input-Queued Switches - Guez, Kesselman, Rosen (2004)   (Correct)

No context found.

D. Sleator and R. Tarjan, "Amortized Efficiency of List Update and Paging Rules," CACM 28, pp. 202-208, 1985.


USENIX Association - Fast Nd Usenix (2004)   (2 citations)  (Correct)

No context found.

D. D. Sleator and R. E. Tarjan, "Amortized efficiency of list update and paging rules," Comm. ACM, vol. 28, no. 2, pp. 202-- 208, 1985.


On Capital Investment - Azar, Bartal, Feuerstein, Fiat.. (1996)   (4 citations)  (Correct)

No context found.

D.D. Sleator and R.E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Communications of the ACM. 28:202--208, February 1985. 21


Collective Asynchronous Reading with Polylogarithmic.. - Chlebus, Kowalski..   (Correct)

No context found.

D. Sleator and R. Tarjan, Amortized efficiency of list update and paging rules, Communications of the ACM, 28 (1985) 202--208.


Nearly Optimal Competitive Online Replacement - Policies Ran El-Yaniv   (Correct)

No context found.

D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communication of the ACM, 28:202--208, 1985.


Algorithms for Flow Time Scheduling - Bansal (2003)   (Correct)

No context found.

D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202--208, 1985.


Connection Caching under - Various Models Of   (Correct)

No context found.

D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Commun. ACM, 28(2):202--208, 1985.


Base Station Scheduling of Requests with Fixed Deadlines - Agarwal, Puri (2002)   (3 citations)  (Correct)

No context found.

D. Sleator and R. Tarjan, Amortized efficiency of list update and paging rules, Communications of the ACM, 28:202-208, 1985.

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