-
1
-
-
0029293028
-
Competitive paging with locality of reference
-
April
-
A. Borodin, S. Irani, P. Raghavan, and B. Schieber. Competitive paging with locality of reference. Journal of Computer and System Sciences, 50(2):244-258, April 1995.
-
(1995)
Journal of Computer and System Sciences
, vol.50
, Issue.2
, pp. 244-258
-
-
Borodin, A.1
Irani, S.2
Raghavan, P.3
Schieber, B.4
-
2
-
-
85039774726
-
The statistical adversary allows optimal money-making trading strategies
-
A. Chou, J. Cooperstock, R. El-Yaniv, M. Klugerman, and F. T. Leighton. The statistical adversary allows optimal money-making trading strategies. In Proc. 6th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 467-476, 1995.
-
(1995)
Proc. 6th ACM-SIAM Symposium on Discrete Algorithms (SODA)
, pp. 467-476
-
-
Chou, A.1
Cooperstock, J.2
El-Yaniv, R.3
Klugerman, M.4
Leighton, F.T.5
-
3
-
-
85031287919
-
Competitive analysis of financial games
-
R. El-Yaniv, A. Fiat, R. Karp, and G. Turpin. Competitive analysis of financial games. In Proc. 33rd IEEE Symposium on Foundations of Computer Science (FOCS), pages 327-333, 1992.
-
(1992)
Proc. 33rd IEEE Symposium on Foundations of Computer Science (FOCS)
, pp. 327-333
-
-
El-Yaniv, R.1
Fiat, A.2
Karp, R.3
Turpin, G.4
-
5
-
-
0015960103
-
Some distribution-free aspects of paging algorithm performance
-
P. A. Franaszek and T. J. Wagner. Some distribution-free aspects of paging algorithm performance. Journal of the ACM, 21(1):31-39, 1974.
-
(1974)
Journal of the ACM
, vol.21
, Issue.1
, pp. 31-39
-
-
Franaszek, P.A.1
Wagner, T.J.2
-
6
-
-
0042060224
-
On-line algorithms versus off-line algorithms: How much is it worth to know the future?
-
Jan van Leeuwen, editor, Elsevier, Amsterdam, September
-
R. M. Karp. On-line algorithms versus off-line algorithms: how much is it worth to know the future? In Jan van Leeuwen, editor, Proceedings of the IFIP 12th World Computer Congress, Volume 1, pages 416-429. Elsevier, Amsterdam, September 1992.
-
(1992)
Proceedings of the IFIP 12th World Computer Congress
, vol.1
, pp. 416-429
-
-
Karp, R.M.1
-
9
-
-
0002204085
-
A statistical adversary for on-line algorithms
-
Association for Computing Machinery, New York
-
P. Raghavan. A statistical adversary for on-line algorithms. In DIMACS Series in Discrete Mathematics, pages 79-83. Association for Computing Machinery, New York, 1992.
-
(1992)
DIMACS Series in Discrete Mathematics
, pp. 79-83
-
-
Raghavan, P.1
-
12
-
-
0022012946
-
Amortized efficiency of list update and paging rules
-
D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, 1985.
-
(1985)
Communications of the ACM
, vol.28
, pp. 202-208
-
-
Sleator, D.D.1
Tarjan, R.E.2
|