@article{AdAz03,
	title="Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms",
	author="R.~Adler and Y.~Azar",
	journal="J. of Scheduling",
	year=2003,
	pages="113--129",
	url="http://www.springerlink.com/link.asp?id=jq27641706456655",
        doi="10.1023/A:1022933824889",
        eprint="soda:314500.314512,jsched:jq27641706456655",
	note="Prelimary version in Proc. 10th ACM-SIAM Symp. on
	Discrete Algorithms, pp. 1--10, 1999."}


@inproceedings{AwAzFL96,
	title="Making commitments in the face of uncertainty: How to pick a winner almost every time",
	author="B.~Awerbuch and Y.~Azar and A.~Fiat and T.~Leighton",
	booktitle="Proc. 28th {ACM} Symp. on Theory of Computing",
	pages="519--530",
	year=1996,
	eprint={stoc:237814.238000},
	ps="http://www.cs.tau.ac.il/~azar/set.ps"}

@inproceedings{AwAzPl93,
	title="Throughput-competitive online routing",
	author="B.~Awerbuch and Y.~Azar and S.~Plotkin",
	booktitle="Proc. 34th IEEE Symp. on Foundations of Computer Science",
	pages="32--40",
	year=1993,
	ps="http://www.cs.tau.ac.il/~azar/route.ps",
        eprint="focs:10.1109/SFCS.1993.366884"
}

@inproceedings{AwBaFR94,
	title="Competitive non-preemptive call control",
	author="B.~Awerbuch and Y.~Bartal and A.~Fiat and A.~Ros\'en",
	booktitle="Proc. 5th ACM-SIAM Symp. on Discrete Algorithms",
	pages="312--320",
	year=1994,
	eprint="soda:314464.314510",
	ps="http://www.icsi.berkeley.edu/~yairb/pubs/ABFR-call-control.ps"}

@inproceedings{AGLR94,
	title="On-line admission control and circuit routing for high performance computation and communication",
	author="B.~Awerbuch and R.~Gawlick and T.~Leighton and Y.~Rabani",
	booktitle="Proc. 35th IEEE Symp. on Foundations of Computer Science",
	pages="412--423",
	year=1994,
	ps="http://www.cs.technion.ac.il/~rabani/pss/Publications/AwerbuchGLR94.ps.gz",
        eprint="focs:10.1109/SFCS.1994.365675"}

@inproceedings{AzBlMa03,
	title="Combining online algorithms for rejection and acceptance",
	author="Y.~Azar and A.~Blum and Y.~Mansour",
	booktitle="Proc. 15th ACM Symp. Parallelism in Algorithms and Architectures",
	pages="159--163",
	year=2003,
	url="http://doi.acm.org/10.1145/777412.777438",
        eprint="spaa:10.1145/777412.777438",
	ps="http://www.cs.tau.ac.il/~azar/acc_rej.ps"}

@inproceedings{AzBrMa93,
	title="On-line choice of on-line algorithms",
	author="Y.~Azar and A.~Broder and M.~Manasse",
	booktitle="Proc. 4th ACM-SIAM Symp. on Discrete Algorithms",
	pages="432--440",
	year=1993,
	eprint="soda:313559.313847",
	ps="http://www.cs.tau.ac.il/~azar/choice.ps"}

@article{BaCuRa93,
	title="Searching in the plane",
	author="R.~Baeza-Yates and J.~Culberson and G.~Rawlins",
	journal="Information and Computation",
	volume=106,
	number=2,
	pages="234--252",
	year=1993,
	url="http://dx.doi.org/10.1006/inco.1993.1054",
        eprint={iandc:10.1006/inco.1993.1054},
	note="Preliminary version in Proc. 1st Scandinavian Workshop
	on Algorithm Theory, LNCS 318, pp. 176--189, 1988.",
	ps="ftp://sunsite.dcc.uchile.cl/pub/users/rbaeza/papers/searchingtheplane.ps.gz"}

@article{BlKaKl04,
	title="Admission control to minimize rejections",
	author="A.~Blum and A.~Kalai and J.~Kleinberg",
	journal="Internet Mathematics",
	volume=1,
	number=2,
	pages="165--176",
	year=2004,
	note="Preliminary version in Proc. 7th Workshop on Algorithms
	and Data Structures, LNCS 2125, pp. 155--164, 2001.",
        eprint={wads:9ukehq56d6yp2m22,internetmath:1/2/165/176},
	pdf="http://www.internetmathematics.org/volumes/1/2/pp165_176.pdf",
	ps="http://www.cs.cmu.edu/~avrim/Papers/admission.ps"}

@inproceedings{BuMa04,
	title="Improved combination of online algorithms for acceptance and
rejection",
	author="D.P.~Bunde and Y.~Mansour",
	booktitle="Proc. 16th ACM Symp.\ Parallelism in Algorithms and
Architectures",
	pages="265--266",
	year=2004,
        eprint="spaa:10.1145/1007912.1007952",
	ps="http://www.math.tau.ac.il/~mansour/papers/04spaa.ps",
	pdf="http://compgeom.cs.uiuc.edu/~bunde/pubs/acceptreject.pdf"}

@article{FFKRRV91,
	title="Competitive algorithms for layered graph traversal",
	author="A.~Fiat and D.~Foster and H.~Karloff and Y.~Rabani and Y.~Ravid and S.~Vishwanathan",
	journal="SIAM J. on Computing",
	volume=28,
	number=2,
	pages="447--462",
	year=1998,
	note="Preliminary version in Proc. 32nd IEEE Symp. on Foundations
	of Computer Science, pp 288--297, 1991.",
	eprint="focs:10.1109/SFCS.1991.185381,sicomp:10.1137/S0097539795279943",
	ps="http://www.cs.technion.ac.il/~rabani/pss/Publications/FiatFKRRV91.ps.gz"}