% Last updates:
% marek, Tue Aug 29 12:51:57 PDT 2006
% marek, Thu Oct 19 12:40:45 PDT 2006
% jiri, Sat Oct 21, 2006
% marek Wed Nov 15 13:48:02 PST 2006
% marek Fri Jan  5 18:52:06 PST 2007
% marek Mon Feb 19 10:31:40 PST 2007
% Mon May 21 14:38:03 PDT 2007
% Tue Jul 17 12:31:42 PDT 2007
% jiri, Fri Sep 21, 2007
% marek, Sat, Dec 29, 2007
% marek, Aug 4, 2008

% Originally compiled by Marek Chrobak and John Noga,
% with generous contributions and help from
% Gerhard Woeginger, Jiri Sgall, Wojtek Jawor
% and many others

% Work partially supported by NSF Grants
% CCR-95034498, CCR-9988360, CCF-0208856

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%

% General stuff
@string{LNCS      = "Lecture Notes in Comput. Sci."}
@string{inprep    = "In preparation"}
@string{submitted = "Submitted"}
@string{toappear  = "To appear"}
@string{toappin   = "To appear in "}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Journals
%
@STRING{ACMcomsur    = {ACM Computing Surveys} }
@STRING{ACMTAlg    = {ACM Trans. Algorithms} }
@STRING{ActCyb       = {Acta Cybernet.} }
@STRING{ActMatSciHun = {Acta Math. Sci. Hung.} }
@STRING{ActInf       = {Acta Inform.} }
@STRING{AdvAppMat    = {Adv. Appl. Math.} }
@STRING{Algorithmica = {Algorithmica} }
@STRING{AlgReview    = {Algorithms Review} }
@STRING{AMM          = {Amer. Math. Monthly} }
@STRING{AnnProb      = {Ann. Probab.} }
@STRING{CACM         = {Commun. ACM} }
@STRING{CanadJM      = {Canad. J. Math.} },
@STRING{CollBolyai   = {Coll. Math. Soc. Janos Bolyai} },
@STRING{Combinatorica= {Combinatorica} }
@STRING{CompGeo      = {Comput. Geom.} }
@STRING{CompCompl    = {Comput. Complexity.} }
@STRING{Computing    = {Computing} }
@STRING{CongNum      = {Congr. Numer.} }
@STRING{DisComGeo    = {Discrete Comput. Geom.} }
@STRING{DAM          = {Discrete Appl. Math.} }
@STRING{DM           = {Discrete Math.} }
@STRING{Doklady      = {Soviet Mathematics Doklady} }
@STRING{EJOR         = {European J. Oper. Res.} }
@STRING{IBMres       = {IBM J. Res. Dev.} }
@STRING{IBMsys       = {IBM Syst. J.} }
@STRING{IEEEauto     = {IEEE Trans. Automat. Control} }
@STRING{IEEEcomm     = {IEEE Trans. Commun.} }
@STRING{IEEEcomp     = {IEEE Trans. Comput.} }
@STRING{IEEEinfo     = {IEEE Trans. Inf. Theory} }
@STRING{IEEEknow     = {IEEE Trans. Knowl. Data Eng.} }
@STRING{IEEEsoft     = {IEEE Trans. Softw. Eng.} }
@STRING{InfComp      = {Inform. and Comput.} }
@STRING{InfCont      = {Inform. and Control} }
@STRING{INFORMS      = {INFORMS J. Comput.} }
@STRING{IntComGeo    = {Int. J. of Comput. Geom. Appl.} }
@STRING{IntFoun      = {Int. J. on Found. Comput. Sci.} }
@STRING{IPL          = {Inform. Process. Lett.} }
@STRING{JACM         = {J. ACM} }
@STRING{JAlg         = {J. Algorithms} }
@STRING{JAppProb     = {J. Appl. Probab.} }
@STRING{JCSS         = {J. Comput. Systems Sci.} }
@STRING{JCT          = {J. Combin. Theory} }
@STRING{JCTA         = {J. Combin. Theory Ser. A} }
@STRING{JCTB         = {J. Combin. Theory Ser. B} }
@STRING{JDA          = {J. Discrete Algorithms} }
@STRING{JInfOptSci   = {J. Information and Optimization Sciences} }
@STRING{JOCO         = {J. Comb. Optim.} }
@STRING{JoGraTh      = {J. Graph Theory} }
@STRING{JOS          = {J. Sched.} }
@STRING{JpardisCom   = {J. Parallel Distrib. Comput.} }
@STRING{JSL          = {J. of Symbolic Logic} }
@STRING{MathFinance  = {Math. Finance} }
@STRING{MathProg     = {Math. Program.} }
@STRING{MgtSci       = {Manage. Sci.} }
@STRING{ML           = {Mach. Learn.} }
@STRING{MOR          = {Math. Oper. Res.} }
@STRING{MST          = {Math. Syst. Theory} }
@STRING{Naval        = {Naval Res. Logist.} }
@STRING{OpRes        = {Oper. Res.} }
@STRING{ORL          = {Oper. Res. Lett.} }
@STRING{ORSAJComp    = {ORSA J. Comput.} }
@STRING{PacifJ       = {Pacific J. Math.} }
@STRING{PEngInf      = {Probab Engrg. Inform. Sci.} }
@STRING{PLond        = {Proc. London Math. Soc.} },
@STRING{PAMS         = {Proc. AMS} },
@STRING{PrCoSoft     = {Program. Comput. Software} }
@STRING{RAIROinf     = {RAIRO Inform. Theor. Appl.} }
@STRING{RAIROopr     = {RAIRO Oper. Res.} }
@STRING{RealTime     = {Real Time Syst.} }
@STRING{SiamRev      = {SIAM Rev.} }
@STRING{Sialgdis     = {SIAM J. on Algebraic and Discrete Methods} }
@STRING{Siappmat     = {SIAM J. Appl. Math.} }
@STRING{Sicomp       = {SIAM J. Comput.} }
@STRING{Sidma        = {SIAM J. Discrete Math.} }
@STRING{Sicontropt        = {SIAM J. Control Optim.} }
@STRING{Siopt        = {SIAM J. Optim.} }
@STRING{Sigactnews   = {SIGACT News} }
@STRING{SoftwarePE   = {Softw. Pract. Exper.} }
@STRING{TAMS         = {Trans. AMS} },
@STRING{TCS          = {Theoret. Comput. Sci.} }
@STRING{WirelessNet  = {Wireless Networks} }
@STRING{ZOR          = {ZOR Math. Methods Oper. Res.} }

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Conferences
%
% AAIM
@string{AAIM    = " International Conf. on Algorithmic Aspects in  Information and Management (AAIM)"}
@string{AAIM06    = "Proc. 2nd" # AAIM}
@string{AAIM07    = "Proc. 2nd" # AAIM}


% COCOON
@string{COCOON    = " Annual International Computing and Combinatorics Conf. (COCOON)"}
@string{COCOON95    = "Proc. 1st" # COCOON}
@string{COCOON01    = "Proc. 7th" # COCOON}
@string{COCOON02    = "Proc. 8th" # COCOON}
@string{COCOON03    = "Proc. 9th" # COCOON}
@string{COCOON04    = "Proc. 10th" # COCOON}
@string{COCOON05    = "Proc. 11th" # COCOON}
@string{COCOON06    = "Proc. 12th" # COCOON}
@string{COCOON07    = "Proc. 13th" # COCOON}

% COLT
@string{COLT    = " Conf. on Computational Learning Theory (COLT)"}
@string{COLT88  = "Proc.  1st" # COLT}
@string{COLT89  = "Proc.  2nd" # COLT}
@string{COLT90  = "Proc.  3rd" # COLT}
@string{COLT91  = "Proc.  4th" # COLT}
@string{COLT92  = "Proc.  5th" # COLT}
@string{COLT93  = "Proc.  6th" # COLT}
@string{COLT94  = "Proc.  7th" # COLT}
@string{COLT95  = "Proc.  8th" # COLT}
@string{COLT96  = "Proc.  9th" # COLT}
@string{COLT97  = "Proc. 10th" # COLT}
@string{COLT98  = "Proc. 11th" # COLT}
@string{COLT99  = "Proc. 12th" # COLT}
@string{COLT00  = "Proc. 13th" # COLT}

% ESA
@string{ESA    = " European Symp. on Algorithms (ESA)"}
@string{ESA93  = "Proc. 1st" # ESA}
@string{ESA94  = "Proc. 2nd" # ESA}
@string{ESA95  = "Proc. 3rd" # ESA}
@string{ESA96  = "Proc. 4th" # ESA}
@string{ESA97  = "Proc. 5th" # ESA}
@string{ESA98  = "Proc. 6th" # ESA}
@string{ESA99  = "Proc. 7th" # ESA}
@string{ESA00  = "Proc. 8th" # ESA}
@string{ESA01  = "Proc. 9th" # ESA}
@string{ESA02  = "Proc. 10th" # ESA}
@string{ESA03  = "Proc. 11th" # ESA}
@string{ESA04  = "Proc. 12th" # ESA}
@string{ESA05  = "Proc. 12th" # ESA}
@string{ESA06  = "Proc. 13th" # ESA}
@string{ESA07  = "Proc. 13th" # ESA}

% FCT
@string{FCT   = " International Symp.
        on Fundamentals of Computation Theory (FCT)"},
@string{FCT05 = "Proc. 15th" # FCT}

% FOCS
@string{FOCS   = " Symp. Foundations of Computer Science (FOCS)"}
@string{FOCS77 = "Proc. 18th" # FOCS}
@string{FOCS78 = "Proc. 19th" # FOCS}
@string{FOCS79 = "Proc. 20th" # FOCS}
@string{FOCS80 = "Proc. 21st" # FOCS}
@string{FOCS81 = "Proc. 22nd" # FOCS}
@string{FOCS82 = "Proc. 23rd" # FOCS}
@string{FOCS83 = "Proc. 24th" # FOCS}
@string{FOCS84 = "Proc. 25th" # FOCS}
@string{FOCS85 = "Proc. 26th" # FOCS}
@string{FOCS86 = "Proc. 27th" # FOCS}
@string{FOCS87 = "Proc. 28th" # FOCS}
@string{FOCS88 = "Proc. 29th" # FOCS}
@string{FOCS89 = "Proc. 30th" # FOCS}
@string{FOCS90 = "Proc. 31st" # FOCS}
@string{FOCS91 = "Proc. 32nd" # FOCS}
@string{FOCS92 = "Proc. 33rd" # FOCS}
@string{FOCS93 = "Proc. 34th" # FOCS}
@string{FOCS94 = "Proc. 35th" # FOCS}
@string{FOCS95 = "Proc. 36th" # FOCS}
@string{FOCS96 = "Proc. 37th" # FOCS}
@string{FOCS97 = "Proc. 38th" # FOCS}
@string{FOCS98 = "Proc. 39th" # FOCS}
@string{FOCS99 = "Proc. 40th" # FOCS}
@string{FOCS00 = "Proc. 41st" # FOCS}
@string{FOCS01 = "Proc. 42st" # FOCS}
@string{FOCS02 = "Proc. 43rd" # FOCS}
@string{FOCS03 = "Proc. 44th" # FOCS}
@string{FOCS04 = "Proc. 45th" # FOCS}
@string{FOCS05 = "Proc. 46th" # FOCS}
@string{FOCS06 = "Proc. 47th" # FOCS}
@string{FOCS07 = "Proc. 48th" # FOCS}

% ICALP
@string{ICALP =   " International Colloquium on Automata, Languages, 
                   and Programming (ICALP)"}
@string{ICALP87 = "Proc. 14th" # ICALP}
@string{ICALP88 = "Proc. 15th" # ICALP}
@string{ICALP89 = "Proc. 16th" # ICALP}
@string{ICALP90 = "Proc. 17th" # ICALP}
@string{ICALP91 = "Proc. 18th" # ICALP}
@string{ICALP92 = "Proc. 19th" # ICALP}
@string{ICALP93 = "Proc. 20th" # ICALP}
@string{ICALP94 = "Proc. 21st" # ICALP}
@string{ICALP95 = "Proc. 22nd" # ICALP}
@string{ICALP96 = "Proc. 23rd" # ICALP}
@string{ICALP97 = "Proc. 24th" # ICALP}
@string{ICALP98 = "Proc. 25th" # ICALP}
@string{ICALP99 = "Proc. 26th" # ICALP}
@string{ICALP00 = "Proc. 27th" # ICALP}
@string{ICALP01 = "Proc. 28th" # ICALP}
@string{ICALP02 = "Proc. 29th" # ICALP}
@string{ICALP03 = "Proc. 30th" # ICALP}
@string{ICALP04 = "Proc. 31st" # ICALP}
@string{ICALP05 = "Proc. 32nd" # ICALP}
@string{ICALP06 = "Proc. 33rd" # ICALP}
@string{ICALP07 = "Proc. 34rd" # ICALP}

% ISAAC 
@string{ISAAC =   " International Symp. on Algorithms and Computation (ISAAC)"}
@string{ISAAC90 = "Proc.  1st" # ISAAC}
@string{ISAAC91 = "Proc.  2nd" # ISAAC}
@string{ISAAC92 = "Proc.  3rd" # ISAAC}
@string{ISAAC93 = "Proc.  4th" # ISAAC}
@string{ISAAC94 = "Proc.  5th" # ISAAC}
@string{ISAAC95 = "Proc.  6th" # ISAAC}
@string{ISAAC96 = "Proc.  7th" # ISAAC}
@string{ISAAC97 = "Proc.  8th" # ISAAC}
@string{ISAAC98 = "Proc.  9th" # ISAAC}
@string{ISAAC99 = "Proc. 10th" # ISAAC}
@string{ISAAC05 = "Proc. 16th" # ISAAC}
@string{ISAAC07 = "Proc. 18th" # ISAAC}

% ISTCS  (somewhat irregular event)
@string{ISTCS =   " Israel Symp. on Theory of Computing and Systems (ISTCS)"}
@string{ISTCS92 = "Proc. 1st" # ISTCS}
@string{ISTCS93 = "Proc. 2nd" # ISTCS}
@string{ISTCS95 = "Proc. 3rd" # ISTCS}
@string{ISTCS96 = "Proc. 4th" # ISTCS}
@string{ISTCS97 = "Proc. 5th" # ISTCS}
@string{ISTCS98 = "Proc. 6th" # ISTCS}


% LATIN (every second year)

@string{LATIN = " Latin American Theoretical Informatics Symp. (LATIN)"}
@string{LATIN06 = "Proc. 7th" # LATIN}


% MFCS
@string{MFCS = " Symp. on Mathematical Foundations of Computer Science (MFCS)"}
@string{MFCS81 = "Proc. 10th" # MFCS}
@string{MFCS89 = "Proc. 14th" # MFCS}
@string{MFCS90 = "Proc. 15th" # MFCS}
@string{MFCS91 = "Proc. 16th" # MFCS}
@string{MFCS92 = "Proc. 17th" # MFCS}
@string{MFCS93 = "Proc. 18th" # MFCS}
@string{MFCS94 = "Proc. 19th" # MFCS}
@string{MFCS95 = "Proc. 20th" # MFCS}
@string{MFCS96 = "Proc. 21st" # MFCS}
@string{MFCS97 = "Proc. 22nd" # MFCS}
@string{MFCS98 = "Proc. 23rd" # MFCS}
@string{MFCS99 = "Proc. 24th" # MFCS}
@string{MFCS00 = "Proc. 25th" # MFCS}
@string{MFCS01 = "Proc. 26th" # MFCS}
@string{MFCS02 = "Proc. 27th" # MFCS}
@string{MFCS03 = "Proc. 28th" # MFCS}
@string{MFCS04 = "Proc. 29th" # MFCS}
@string{MFCS05 = "Proc. 30th" # MFCS}
@string{MFCS06 = "Proc. 31st" # MFCS}
@string{MFCS07 = "Proc. 32nd" # MFCS}

% PODC
@string{PODC   = " Symp. on Principles of Distributed Computing (PODC)"}
@string{PODC88 = "Proc.  7th" # PODC}
@string{PODC89 = "Proc.  8th" # PODC}
@string{PODC90 = "Proc.  9th" # PODC}
@string{PODC91 = "Proc. 10th" # PODC}
@string{PODC92 = "Proc. 11th" # PODC}
@string{PODC93 = "Proc. 12th" # PODC}
@string{PODC94 = "Proc. 13th" # PODC}
@string{PODC95 = "Proc. 14th" # PODC}
@string{PODC96 = "Proc. 15th" # PODC}
@string{PODC97 = "Proc. 16th" # PODC}
@string{PODC98 = "Proc. 17th" # PODC}
@string{PODC99 = "Proc. 18th" # PODC}
@string{PODC00 = "Proc. 19th" # PODC}

% SODA
@string{SODA   = " Symp. on Discrete Algorithms (SODA)"}
@string{SODA90 = "Proc.  1st" # SODA}
@string{SODA91 = "Proc.  2nd" # SODA}
@string{SODA92 = "Proc.  3rd" # SODA}
@string{SODA93 = "Proc.  4th" # SODA}
@string{SODA94 = "Proc.  5th" # SODA}
@string{SODA95 = "Proc.  6th" # SODA}
@string{SODA96 = "Proc.  7th" # SODA}
@string{SODA97 = "Proc.  8th" # SODA}
@string{SODA98 = "Proc.  9th" # SODA}
@string{SODA99 = "Proc. 10th" # SODA}
@string{SODA00 = "Proc. 11th" # SODA}
@string{SODA01 = "Proc. 12th" # SODA}
@string{SODA02 = "Proc. 13th" # SODA}
@string{SODA03 = "Proc. 14th" # SODA}
@string{SODA04 = "Proc. 15th" # SODA}
@string{SODA05 = "Proc. 16th" # SODA}
@string{SODA06 = "Proc. 17th" # SODA}
@string{SODA07 = "Proc. 18th" # SODA}

% SPAA
@string{SPAA   = " Symp. on Parallel Algorithms and Architectures (SPAA)"}
@string{SPAA89 = "Proc.  1st" # SPAA}
@string{SPAA90 = "Proc.  2nd" # SPAA}
@string{SPAA91 = "Proc.  3rd" # SPAA}
@string{SPAA92 = "Proc.  4th" # SPAA}
@string{SPAA93 = "Proc.  5th" # SPAA}
@string{SPAA94 = "Proc.  6th" # SPAA}
@string{SPAA95 = "Proc.  7th" # SPAA}
@string{SPAA96 = "Proc.  8th" # SPAA}
@string{SPAA97 = "Proc.  9th" # SPAA}
@string{SPAA98 = "Proc. 10th" # SPAA}
@string{SPAA99 = "Proc. 11th" # SPAA}
@string{SPAA00 = "Proc. 12th" # SPAA}
@string{SPAA01 = "Proc. 13th" # SPAA}
@string{SPAA02 = "Proc. 14th" # SPAA}
@string{SPAA03 = "Proc. 15th" # SPAA}
@string{SPAA04 = "Proc. 16th" # SPAA}
@string{SPAA05 = "Proc. 17th" # SPAA}
@string{SPAA06 = "Proc. 18th" # SPAA}
@string{SPAA07 = "Proc. 19th" # SPAA}

%STACS
@string{STACS = " Symp. on Theoretical Aspects of Computer Science (STACS)"}
@string{STACS94 = "Proc.  11th" # STACS}
@string{STACS95 = "Proc.  12th" # STACS}
@string{STACS96 = "Proc.  13th" # STACS}
@string{STACS97 = "Proc.  14th" # STACS}
@string{STACS98 = "Proc.  15th" # STACS}
@string{STACS99 = "Proc.  16th" # STACS}
@string{STACS00 = "Proc.  17th" # STACS}
@string{STACS01 = "Proc.  18th" # STACS}
@string{STACS02 = "Proc.  19th" # STACS}
@string{STACS03 = "Proc.  20th" # STACS}
@string{STACS04 = "Proc.  21st" # STACS}
@string{STACS05 = "Proc.  22nd" # STACS}
@string{STACS06 = "Proc.  23rd" # STACS}
@string{STACS07 = "Proc.  24th" # STACS}

% STOC
@string{STOC   = " Symp. Theory of Computing (STOC)"}
@string{STOC73 = "Proc.  5th" # STOC}
@string{STOC80 = "Proc. 11th" # STOC}
@string{STOC84 = "Proc. 16th" # STOC}
@string{STOC85 = "Proc. 17th" # STOC}
@string{STOC86 = "Proc. 18th" # STOC}
@string{STOC87 = "Proc. 19th" # STOC}
@string{STOC88 = "Proc. 20th" # STOC}
@string{STOC89 = "Proc. 21st" # STOC}
@string{STOC90 = "Proc. 22nd" # STOC}
@string{STOC91 = "Proc. 23rd" # STOC}
@string{STOC92 = "Proc. 24th" # STOC}
@string{STOC93 = "Proc. 25th" # STOC}
@string{STOC94 = "Proc. 26th" # STOC}
@string{STOC95 = "Proc. 27th" # STOC}
@string{STOC96 = "Proc. 28th" # STOC}
@string{STOC97 = "Proc. 29th" # STOC}
@string{STOC98 = "Proc. 30th" # STOC}
@string{STOC99 = "Proc. 31st" # STOC}
@string{STOC00 = "Proc. 32nd" # STOC}
@string{STOC01 = "Proc. 33rd" # STOC}
@string{STOC02 = "Proc. 34th" # STOC}
@string{STOC03 = "Proc. 35th" # STOC}
@string{STOC04 = "Proc. 36th" # STOC}
@string{STOC05 = "Proc. 37th" # STOC}
@string{STOC06 = "Proc. 38th" # STOC}
@string{STOC07 = "Proc. 39th" # STOC}

% SWAT
@string{SWAT   = " Scandinavian Workshop on Algorithm Theory (SWAT)"}
@string{SWAT88 = "Proc.  1st" # SWAT}
@string{SWAT90 = "Proc.  2nd" # SWAT}
@string{SWAT92 = "Proc.  3rd" # SWAT}
@string{SWAT94 = "Proc.  4th" # SWAT}
@string{SWAT96 = "Proc.  5th" # SWAT}
@string{SWAT98 = "Proc.  6th" # SWAT}
@string{SWAT00 = "Proc.  7th" # SWAT}
@string{SWAT02 = "Proc.  8th" # SWAT}
@string{SWAT04 = "Proc.  9th" # SWAT}
@string{SWAT06 = "Proc.  10th" # SWAT}

% WADS
@string{WADS   = " Workshop on Algorithms and Data Structures (WADS)"}
@string{WADS89 = "Proc.  1st" # WADS}
@string{WADS91 = "Proc.  2nd" # WADS}
@string{WADS93 = "Proc.  3rd" # WADS}
@string{WADS95 = "Proc.  4th" # WADS}
@string{WADS97 = "Proc.  5th" # WADS}
@string{WADS99 = "Proc.  6th" # WADS}
@string{WADS01 = "Proc.  7th" # WADS}
@string{WADS03 = "Proc.  8th" # WADS}
@string{WADS05 = "Proc.  9th" # WADS}
@string{WADS07 = "Proc.  10th" # WADS}

% WAOA
@string{WAOA   = "International Workshop in Approximation and Online Algorithms"}
@string{WAOA06 = "Proc.  4th" # WAOA}
@string{WAOA07 = "Proc.  5th" # WAOA}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

@techreport{AbAsGS95,
	AUTHOR = "Atef Abdel-Aziz Abdel-Hamid and Norbert Ascheuer and Martin
                Gr{\"o}tschel and Herbert Schorer",
	TITLE = "Simulation und Optimierung einer PC-Fertigung unter
                Echtzeitbedingungen", 
	INSTITUTION = "Konrad-Zuse-Zentrum f{\"u}r Informationstechnik Berlin",
	YEAR = 1995,
	SERIES = "Preprint",
	NUMBER = "SC 95-4",
	}

@inproceedings{Abraha88,
        AUTHOR = "Karl Abrahamson",
        TITLE = "On achieving consensus using a shared memory",
        BOOKTITLE = PODC88,
	ORGANIZATION = "ACM",
        PAGES = "291-302",
	YEAR = 1988
	}

@book{Abrams83,
	AUTHOR = "Norman Abramson",
	TITLE = "Information Theory and Coding",
	PUBLISHER = "McGraw-Hill",
	YEAR = 1983,
	ADDRESS = "New York"
	}

@inproceedings{AcChNo96,
        AUTHOR = "Dimitris Achlioptas and Marek Chrobak and John Noga",
        TITLE = "Competitive Analysis of Randomized Paging Algorithms",
        BOOKTITLE = ESA96,
        YEAR = 1996,
        PAGES = "419-430",
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "1136"
        }

@article{AcChNo00,
        AUTHOR = "Dimitris Achlioptas and Marek Chrobak and John Noga",
        TITLE = "Competitive Analysis of Randomized Paging Algorithms",
        JOURNAL = tcs,
        YEAR = 2000,
	VOLUME = "234",
        PAGES = "203--218"
	}

@article{AdeLan62,
	AUTHOR = "G. M. {Adel'son-Vel'skii} and E. M. Landis",
	TITLE = "An algorithm for the organization of information",
	JOURNAL = Doklady,
	VOLUME = 3,
	YEAR = 1962,
	PAGES = "1259-1262"
	}

@inproceedings{AgAlCS87,
        AUTHOR = "Alok Aggarwal and Bowen Alpern and Ashok K. Chandra and 
                  Marc Snir",
        TITLE = "A model for hierarchical memory",
        BOOKTITLE = STOC87,
	ORGANIZATION = "ACM",
        YEAR = 1987,
        PAGES = "305-313"
        }

@inproceedings{ABCRSS94,
        AUTHOR = "Alok Aggarwal and Amotz Bar-Noy and Don Coppersmith and
                  R. Ramaswami and Baruch Schieber and Madhu Sudan",
        TITLE = "Efficient Routing and Scheduling Algorithms for
                  Optical Networks",
        BOOKTITLE = SODA95,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 1995,
        PAGES = "412-423"
        }

@inproceedings{AggCha88,
        AUTHOR = "Alok Aggarwal and Ashok K. Chandra",
        TITLE = "Virtual memory algorithms",
        BOOKTITLE = STOC88,
	ORGANIZATION = "ACM",
        YEAR = 1988,
        PAGES = "173-185"
        }

@inproceedings{AgChSn87,
        AUTHOR = "Alok Aggarwal and Ashok K. Chandra and Marc Snir",
        TITLE = "Hierarchical memory with block transfer",
        BOOKTITLE = FOCS87,
	ORGANIZATION = "IEEE",
        YEAR = 1987,
        PAGES = "204-216"
        }

@inproceedings{AFGHIS05,
  author    = {Gagan Aggarwal and Amos Fiat and Andrew V. Goldberg and
               Jason D. Hartline and Nicole Immorlica and Madhu Sudan},
  title     = {Derandomization of auctions},
  booktitle = STOC05,
	ORGANIZATION = "ACM",
  year      = 2005,
  pages     = {619--625},
}

@inproceedings{AgKlRa91,
	AUTHOR = "A. Aggarwal and P. Klein and S. Ravin",
	TITLE = "When trees collide: {An} approximation algorithm for
	         generalized Steiner tree problem on networks",
	BOOKTITLE = STOC91,
	ORGANIZATION = "ACM",
	YEAR = 1991,
	PAGES = "134-144",
	}

@article{AhmBag90,
        AUTHOR = "R.H. Ahmadi and U. Bagchi",
        TITLE = "Lower bounds for single-machine scheduling problems",
        JOURNAL = naval,
        VOLUME = "37",
        YEAR = 1990,
        PAGES = "967-979",
        }

@inproceedings{AiMaRR00,
        AUTHOR =   {W. A. Aiello and Y. Mansour and S. Rajagopolan and A. Rosen},
        TITLE =    {Competitive Queue Policies for Differentiated Services},
        BOOKTITLE =    {Proc. of the IEEE INFOCOM},
        YEAR =     2000,
        PAGES =    {431--440}
        }

@inproceedings{AiOsKR03,
        AUTHOR =   {W. A. Aiello and R. Ostrovsky and E. Kyshilevitz and A. Rosen},
        TITLE =    {Dynamic routing on networks with fixed-size buffers},
        BOOKTITLE =    SODA03,
	ORGANIZATION = "ACM/SIAM",
        YEAR =     2003,
        PAGES =    {771--780}
        }

@inproceedings{AjtADW94,
        AUTHOR = "Miklos Ajtai and James Aspnes and Cynthia Dwork and 
		Orli Waarts",
        TITLE = "A theory of competitive analysis for distributed algorithms.",
        BOOKTITLE = FOCS94,
	ORGANIZATION = "IEEE",
        YEAR = 1994,
        PAGES = "401-411"
        }

@article{AjKoTu84,
        AUTHOR = "Miklos Ajtai and J\'anos Koml\'os and G. Tusn\'ady",
        TITLE = "On optimal matching",
        JOURNAL = Combinatorica,
        VOLUME = "4",
        YEAR = 1984,
        PAGES = "259-264"
        }

@inproceedings{AjMeWa95,
	AUTHOR = "Miklos Ajtai and Nimrod Megiddo and Orli Waarts",
	TITLE = "Improved Algorithms and Analysis for Secretary Problems and
        	Generalizations",
	YEAR = 1995,
	PAGES = "473-482",
	BOOKTITLE = FOCS95,
	ORGANIZATION = "IEEE"
 	}

@inproceedings{Albers93,
        AUTHOR = "Susanne Albers",
        TITLE = "The influence of lookahead in competitive paging algorithms.",
        BOOKTITLE = ESA93,
        YEAR = 1993,
        PAGES = "1-12",
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "726",
	}

@inproceedings{Albers94,
        AUTHOR = "Susanne Albers",
        TITLE = "A competitive analysis of the list update problem with 
		lookahead",
        BOOKTITLE = MFCS94,
        YEAR = 1994,
        PAGES = "201-210",
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "841"
	}

@techreport{Albers94A,
	AUTHOR = "Susanne Albers",
	TITLE = "Improved Randomized On-Line Algorithms for the List Update
                Problem",
	INSTITUTION = "MPI Informatik Saarbr{\"u}cken",
	YEAR = 1994,
	}

@inproceedings{Albers95,
    	AUTHOR = "Susanne Albers",
     	TITLE = "Improved randomized on-line algorithms for the list update
              	problem",
    	BOOKTITLE = SODA95,
	ORGANIZATION = "ACM/SIAM",
     	PAGES = "412-419 ",
     	YEAR = 1995
     	}

@inproceedings{Albers97,
        AUTHOR = "Susanne Albers",
        TITLE = "Better bounds for online scheduling",
        BOOKTITLE = STOC97,
	ORGANIZATION = "ACM",
        YEAR = 1997,
        PAGES = "130-139"
        }

@article{Albers99,
        AUTHOR = "Susanne Albers",
        TITLE = "Better bounds for online scheduling",
        JOURNAL = Sicomp,
        VOLUME = "29",
        YEAR = 1999,
        PAGES = "459--473",
	}


@inproceedings{Albers02,
        AUTHOR = "Susanne Albers",
        TITLE = "On randomized online scheduling",
        BOOKTITLE = STOC02,
	ORGANIZATION = "ACM",
        YEAR = 2002,
        PAGES = "134-143"
        }

@inproceedings{AlChMi98,
        AUTHOR = "Susanne Albers and Moses Charikar
			 and Michael Mitzenmacher",
        TITLE = "Delayed information and action in on-line algorithms",
        BOOKTITLE = FOCS98,
	ORGANIZATION = "IEEE",
        YEAR = 1998,
        PAGES = "71-80"
        }

@inproceedings{AlbHen97,
        AUTHOR = "Susanne Albers and Monika Henzinger",
        TITLE = "Exploring unknown environments",
        BOOKTITLE = STOC97,
	ORGANIZATION = "ACM",
        YEAR = 1997,
        PAGES = "416-425"
        }

@techreport{AlbKog93,
	AUTHOR = "Susanne Albers and Hisashi Koga",
	TITLE = "New On-Line Algorithms for the Page Replication Problem",
	INSTITUTION = "MPI Informatik Saarbr{\"u}cken",
	YEAR = 1993,
	SERIES = "MPI Informatik Berichte"
	}

@inproceedings{AlbMit96,
     	AUTHOR = "Susanne Albers and Michael Mitzenmacher",
     	TITLE = "Average case analyses of list update
              algorithms, with applications to data compression",
     	BOOKTITLE = ICALP96, 
     	YEAR = 1996,
     	PAGES = "514-525",
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "1099",
     	}

@article{AlvoWe95,
     	AUTHOR = "Susanne Albers and Bernhard {von Stengel} and Ralph Werchner",
     	TITLE = "A combined {\sc BIT} and {\sc TIMESTAMP} algorithm 
                 for the list update problem",
     	JOURNAL = ipl,
     	VOLUME = "56",
     	PAGES = "135-139",
     	YEAR = 1995
     	}

@inproceedings{AlArKh99,
        AUTHOR = "Susanne Albers and Sanjeev Arora and Sanjeev Khanna",
        TITLE = "Page replacement for general caching problems",
        BOOKTITLE = SODA99,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 1999,
        PAGES = "31-40",
        }

@inproceedings{AlbSch04,
        AUTHOR = "Susanne Albers and Markus Schmidt",
        TITLE = "On the performance of greedy algorithms in packet buffering",
        BOOKTITLE = STOC04,
	ORGANIZATION = "ACM",
        YEAR = 2004,
        PAGES = "35--44",
        }

@article{AlbFuj07,
 	author = {Susanne Albers and Hiroshi Fujiwara},
 	title = {Energy-efficient Algorithms for Flow Time Minimization},
 	journal = ACMTALG,
 	volume = {3},
 	number = {4},
 	year = {2007},
 	pages = {49}
 }

@article{AlbSch05,
        AUTHOR = "Susanne Albers and Markus Schmidt",
        TITLE = "On the performance of greedy algorithms in packet buffering",
        JOURNAL = sicomp,
        VOLUME = "35",
        NUMBER = "2",
        YEAR = 2005,
        PAGES = "278--304",
        }

@inproceedings{AlToUW97,
        AUTHOR = "Houman Alborzi and Eric Torng and Patchrawat Uthaisombut
                and Stephen Wagner",
        TITLE = "The k-client problem",
        BOOKTITLE = SODA97,
	ORGANIZATION = "ACM/SIAM",
        YEAR =  1997,
        PAGES = "73-82"
        }

@article{Algoet92,
   	AUTHOR = "Paul Algoet",
   	TITLE = "Universal Schemes for Prediction, Gambling and Portfolio
           Selection",
   	JOURNAL = AnnProb,
  	VOLUME = 20,
   	YEAR = 1992,
   	PAGES = "901-941",
	}

@article{AllMun78,
   	AUTHOR = "Brian Allen and Ian Munro",
   	TITLE = "Self-organizing binary search trees",
   	JOURNAL = jacm,
   	VOLUME = "25",
   	YEAR = 1978,
   	PAGES = "526-535",
	}

@inproceedings{AlAuLa05,
  author    = {Luca Allulli and Giorgio Ausiello and Luigi Laura},
  title     = {On the Power of Lookahead in On-Line Vehicle
                 Routing Problems},
  booktitle = COCOON05,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "3595",
  year      = 2005,
  pages     = {728--736},
}

@inproceedings{AlAABN03,
  author    = {Noga Alon and Baruch Awerbuch and Yossi Azar and
               Niv Buchbinder and Joseph Naor},
  title     = {The online set cover problem},
  booktitle = STOC03,
	ORGANIZATION = "ACM",
  year      = 2003,
  pages     = {100--105},
}

@inproceedings{AAABN04,
        AUTHOR = "Noga Alon and Baruch Awerbuch and Yossi Azar and 
	          Niv Buchbinder and Joseph (Seffi) Naor",
        TITLE = "A general approach to online network optimization problems",
        BOOKTITLE = SODA04,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 2004,
	PAGES = "577-586"
        }

@article{AloAza92,
	AUTHOR = "Noga Alon and Yossi Azar",
	TITLE = "On-line Steiner trees in the Euclidean plane",
	JOURNAL = DisComGeo,
	VOLUME = "10",
	YEAR = 1993,
	PAGES = "113-121",
	}

@inproceedings{AlAzWY97,
        AUTHOR = "Noga Alon and Yossi Azar and Gerhard J. Woeginger 
		and Tal Yadid",
        TITLE = "Approximation Schemes for Scheduling",
        BOOKTITLE = SODA97,
	ORGANIZATION = "ACM/SIAM",
        YEAR =  1997,
        PAGES = "493-500"
        }

@inproceedings{AlCSVW96,
        AUTHOR = "Noga Alon and Janos Csirik and Sergey V. Sevastianov 
                  and Arjen P. A. Vestjens and Gerhard J. Woeginger",
        TITLE = "On-line and Off-line Approximation Algorithms for 
                 Vector Covering Problems",
        BOOKTITLE = ESA96,
        YEAR = 1996,
        PAGES = "406-418",
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "1136",
        }

@book{AlErSp92,
        AUTHOR = "Noga Alon and Paul Erd\H{o}s and Joel H. Spencer",
        TITLE = "The Probabilistic Method",
        PUBLISHER = "John Wiley and Sons",
        YEAR = 1992
        }

@article{AlKaRS94,
        AUTHOR = "Noga Alon and Gil Kalai and Moty Ricklin and 
		Larry Stockmeyer",
        TITLE = "Lower bounds on the competitive ratio for mobile user 
		tracking and distributed job scheduling",
        JOURNAL = tcs,
        VOLUME = "130",
        YEAR = 1994,
        PAGES = "175-201",
	}

@inproceedings{AlKaPW92,
	AUTHOR = "Noga Alon and Richard M. Karp and David Peleg and Douglas
                  West",
	TITLE = "A Graph-Theoretic Game and its Applications to the $k$-Server
                  Problem",
	PAGES = "1-10",
	EDITOR = "Lyle A. McGeoch and Daniel D. Sleator",
	VOLUME = "7",
	SERIES = "DIMACS Series in Discrete Mathematics and Theoretical
                  Computer Science",
	BOOKTITLE = "On-line Algorithms",
	YEAR = 1992,
	ORGANIZATION = "AMS/ACM",
	}

@article{AlKaPW95,
        AUTHOR = "Noga Alon and Richard M. Karp and David Peleg and 
		Douglas West",
        TITLE = "A graph-theoretic game and its application to the 
		k-server problem",
        JOURNAL = Sicomp,
        VOLUME = "24",
        YEAR = 1995,
        PAGES = "78-100",
	}

@article{AlAzWY98,
	AUTHOR = "N. Alon and Y. Azar and G. J. Woeginger and T. Yadid",
	TITLE = "Approximation schemes for scheduling on parallel machines",
   	JOURNAL = JOS,
        VOLUME = 1,
	PAGES = "55-66",
	YEAR = 1998
	}

@inproceedings{AlAzGu05,
  title =     "Admission control to minimize rejections and online
                                set cover with repetitions",
  author = "Noga Alon and Yossi Azar and Shai Gutner",
  booktitle =             SPAA05,
  publisher =             "ACM",
  year =    "2005",
  editor =  "Phillip B. Gibbons and Paul G. Spirakis",
  pages =  "238--244"
}

@article{AlReSc93,
        AUTHOR = "Laurent Alonso and Edward M. Reingold and Rene Schott",
        TITLE = "Determining the majority",
     	JOURNAL = ipl,
        VOLUME = "47",
        YEAR = 1993,
        PAGES = "253-255",
        }

@article{AlCaFS92,
        AUTHOR = "Bowen Alpern and Larry Carter 
			and Ephraim Feig and Ted Selker",
        TITLE = "The uniform memory hierarchy model of computation",
        JOURNAL = Algorithmica,
	VOLUME = "12",
	PAGES = "72-109",
        YEAR = 1992
        }

@article{Alpern95,
 	author = {Steve Alpern},
 	title = {The Rendezvous Search Problem},
 	journal = Sicontropt,
 	volume = {33},
 	number = {3},
 	year = {1995},
 	pages = {673--683}
 	}

@book{AlpGal03,
        AUTHOR = "Steve Alpern and Shmuel Gal",
        TITLE = "The Theory of Search Games and Rendezvous",
        YEAR = 2003,
        PUBLISHER = "Kluwer",
        PLACE = "Boston"
      }


@InProceedings{AnMaZh03,
	author = "Nir Andelman and Yishay Mansour and An Zhu",
	title = "Competitive queueing policies in {QoS} switches",
	booktitle = SODA03,
	ORGANIZATION = "ACM/SIAM",
	year = 2003,
	pages = "761--770"
	}

@inproceedings{AndKar96,
        AUTHOR = "Craig Anderson and Anna Karlin",
        TITLE = "Two Adaptive Hybrid Cache Coherency Protocols",
        BOOKTITLE = "Proc. 2nd International Symp. on 
		High-Performance Computer Architecture",
        YEAR = 1996
        }

@article{AnNaWe82,
    	AUTHOR = "Edward J. Anderson and P. Nash and Richard R. Weber",
    	TITLE = "A counterexample to a conjecture on optimal list ordering",
    	JOURNAL = JAppProb,
    	VOLUME = "19",
    	PAGES = "730-732",
    	YEAR = 1982
    	}

@inproceedings{AndWol91,
        AUTHOR = "Richard Anderson and Heather Woll",
        TITLE = "Wait-free parallel algorithms for the union-find problem",
        BOOKTITLE = STOC91,
	ORGANIZATION = "ACM",
        YEAR = 1991,
        PAGES = "370-380",
        }

@article{AnHKRS02,
        author = "Eric J. Anderson and Kris Hildrum and Anna R. Karlin and April Rasala and Michael Saks",
        title = "On List Update and Work Function Algorithms",
        journal = tcs,
        volume = "287",
        number = "2",
        year = "2002",
        pages = "393--418",
    	}

@unpublished{Andrew96,
	AUTHOR = "Matthew Andrews",
	TITLE = "Constant Factor Bounds for On-line Load Balancing on 
		Related Machines",
	NOTE = "Manuscript",
        YEAR = 1996,
	}

@inproceedings{AAFKLL96,
	AUTHOR = "Matthew Andrews and Baruch Awerbuch and Antonio Fern\'andez 
		and Jon Kleinberg and Tom Leighton and Zhiyong Liu",
	TITLE = "Universal Stability Results for Greedy Contention-Resolution 
		Protocols",
	BOOKTITLE = FOCS96,
	ORGANIZATION = "IEEE",
	YEAR = 1996,
	PAGES = "380-389"
	}

@inproceedings{AnGoZh96,
	AUTHOR = "Mathew Andrews and Michel Goemans and Lisa Zhang",
	TITLE = "Improved Bounds for On-line Load Balancing",
	BOOKTITLE = COCOON96,
        PUBLISHER = "Springer",
        SERIES = LNCS,
	VOLUME = "1090",
	YEAR = 1996,
        PAGES = "1-10"
	}

@inproceedings{AnFeGZ01,
        AUTHOR = "Matthew Andrews and Antonio. Fern\'andez and 
	          Ashish Goel and Lisa Zhang",
        TITLE = "Source routing and scheduling in packet networks",
        BOOKTITLE = FOCS01,
	ORGANIZATION = "IEEE",
        YEAR = 2001,
        PAGES = "168-177"
        }

@inproceedings{AndZha04,
        AUTHOR = "Matthew Andrews and Lisa Zhang",
        TITLE = "Routing and scheduling in multihop wireless networks with 
	         time-varying channels",
        BOOKTITLE = SODA04,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 2004,
	PAGES = "1031-1040"
        }

@inproceedings{AnSaMV05,
  author    = {Spyros Angelopoulos and Atish Das Sarma and
               Avner Magen and Anastasios Viglas},
  title     = {On-Line Algorithms for Market Equilibria},
  booktitle = COCOON05,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "3595",
  year      = 2005,
  pages     = {596--607},
}

@inproceedings{AnDoLo07,
  author    = {Spyros Angelopoulos and Reza Dorrigiv and Alejandro L{\'o}pez-Ortiz},
  title     = {On the Separation and Equivalence of Paging Strategies},
  booktitle = SODA07,
  year      = {2007},
  pages     = {229--237}
}

@article{Anglui88,
	AUTHOR = "Dana Angluin",
	TITLE = "Queries and Concept Learning",
	JOURNAL = ML,
	YEAR = 1988,
	VOLUME = 2,
	PAGES = "319-342"
	}

@inproceedings{AnWeZh96,
        AUTHOR = "Dana Angluin and Jeffery Westbrook and Wenhong Zhu",
        TITLE = "Robot Navigation with Range Queries",
        BOOKTITLE = STOC96,
	ORGANIZATION = "ACM",
        YEAR = 1996,
        PAGES = "469-478"
        }

@article{ApoCro91,
        AUTHOR = "Alberto Apostolico and Maxime Crochemore",
        TITLE = "Optimal canonization of all substrings of a string",
        JOURNAL = InfComp,
        VOLUME = "95",
        YEAR = 1991,
        PAGES = "76-95"
	}

@inproceedings{AraSei89,
	AUTHOR = "Cecilia R. Aragon and Raimund G. Seidel",
	TITLE = "Randomized Search Trees",
	BOOKTITLE = FOCS89,
	ORGANIZATION = "IEEE",
	YEAR = 1989,
	PAGES = "540-545"
	}

@inproceedings{ArFrJM95,
        AUTHOR = "Robert Armstrong and Dayne Freitag and Thorsten Joachims 
		and Tom Mitchell",
        TITLE = "WebWatcher: {A} Learning Apprentice for the World Wide Web",
        BOOKTITLE = "AAAI  Spring Symp. on Information Gathering
                from Heterogeneous Distributed Environments",
        YEAR = 1995,
        }

@inproceedings{ArLeMa90,
        AUTHOR = "Sanjeev Arora and Tom Leighton and Bruce Maggs",
        TITLE = "On-line algorithms for path selection in a 
		nonblocking network",
        BOOKTITLE = STOC90,
	ORGANIZATION = "ACM",
        YEAR = 1990,
        PAGES = "149-58"
	}

@article{ArrDeb54,
        AUTHOR = "K.~Arrow and G.~Debreu",
        TITLE = "Existence of an equilibrium for a competitive
                economy",
        JOURNAL = "Econometrica",
        VOLUME = "22",
        YEAR = "1954",
        PAGES = "265--290"
        }

@article{AslDha93,
        AUTHOR = "Javed A. Aslam and Aditi Dhagat",
        TITLE = "On-line algorithms for 2-coloring hypergraphs via chip games",
        JOURNAL = tcs,
        YEAR = 1993,
        VOLUME = "112",
        PAGES = "355-369",
        }

@article{Aslidi90,
        AUTHOR = "Anastasios H. Aslidis",
        TITLE = "Minimization of Overstowage in Containership Operations",
        KEY = "Containership Operations, Recursive Algorithms, Stack,
                Storage, Stowage, Warehouse",
        JOURNAL = OpRes,
        YEAR = 1990,
        VOLUME = 90,
        PAGES = "457-471",
        }

@inproceedings{AsAFPW93,
	AUTHOR = "James Aspnes and Yossi Azar and Amos Fiat and Serge Plotkin 
		and Orli Waarts",
	TITLE = "On-line load balancing with applications to machine
	 	scheduling and virtual circuit routing",
	BOOKTITLE = STOC93,
	ORGANIZATION = "ACM",
	YEAR = 1993,
	PAGES = "623-631",
	}

@article{AsAFPW97,
	AUTHOR = "James Aspnes and Yossi Azar and Amos Fiat and Serge Plotkin 
		and Orli Waarts.",
	TITLE = "On-line load balancing with applications to machine 
		scheduling and virtual circuit routing",
   	JOURNAL = jacm,
	VOLUME = 44,
	PAGES = "486-504",
	YEAR = 1997
	}

@inproceedings{AspWaa96,
        AUTHOR = "James Aspnes and Orli Waarts",
        TITLE = "Modular competitiveness for distributed algorithms",
        BOOKTITLE = STOC96,
	ORGANIZATION = "ACM",
        YEAR = 1996,
        PAGES = "237-246"
        }

@inproceedings{AspHur96,
        AUTHOR = "James Aspnes and William Hurwood",
        TITLE = "Spreading rumors rapidly despite an adversary",
        BOOKTITLE = PODC96,
	ORGANIZATION = "ACM",
        YEAR = 1996,
        PAGES = "143-151"
        }

@PhDThesis{Assman83, 
         AUTHOR = "S. F. Assmann",
         TITLE = "Problems in Discrete Applied Mathematics",
         SCHOOL = "MIT, Cambridge, MA",
         YEAR = 1983,
 	 }

@article{AsJoKL84,
         AUTHOR = "S. F. Assmann and David S. Johnson and Daniel J. Kleitman 
                   and Joseph Y.-T. Leung",
         TITLE = "On a dual version of the one-dimensional bin 
                  packing problem",
         JOURNAL = Jalg,
         VOLUME = "5",
         YEAR = 1984,
         PAGES = "502-525",
         }

@inproceedings{AttRac93,
        AUTHOR = "Hagit Attiya and O. Rachman",
        TITLE = "Atomic snapshots in $O(n \log n)$ operations",
        BOOKTITLE = PODC93,
	ORGANIZATION = "ACM",
        YEAR = 1993,
        PAGES =  "29-40"
        }

@inproceedings{AueCes94,
        AUTHOR = "Peter Auer and Nicolo Cesa-Bianchi",
        TITLE = "On-line learning with malicious noise and the closure 
		algorithm",
        BOOKTITLE = "Proc. 4th International Workshop on Analogical and 
		Inductive Inference: {Algorithmic} Learning Theory",
        YEAR = 1994,
        PAGES = "229-247"
	}

@inproceedings{AuCeFS95,
        AUTHOR = "Peter Auer and Nicolo Cesa-Bianchi and Yoav Freund and
                Robert E. Schapire",
        TITLE = "Gambling in a rigged casino: {The} adversarial multi-armed
                bandit problem",
        YEAR = 1995,
        BOOKTITLE = FOCS95,
	ORGANIZATION = "IEEE",
        PAGES = "322-331"
        }

@inproceedings{Auer00,
        AUTHOR = "Peter Auer",
        TITLE = "Using upper confidence bouunds for online learning",
	BOOKTITLE = FOCS00,
	ORGANIZATION = "IEEE",
        YEAR = 2000,
        PAGES = "270-282"
        }

@article{AuLoMW95,
        AUTHOR = "Peter Auer and Philip M. Long and Wolfgang Maass and 
		Gerhard J. Woeginger",
        TITLE = "On the Complexity of Function Learning",
	JOURNAL = ML,
        VOLUME = "18",
        YEAR = 1995,
        PAGES = "187-230",
        }

@inproceedings{AueWar95,
	AUTHOR = "Peter Auer and Manfred K. Warmuth",
	TITLE = "Tracking the best disjunction",
	BOOKTITLE = FOCS95,
	ORGANIZATION = "IEEE",
	PAGES = "312-321",
	YEAR = 1995
	}

@inproceedings{AuIrSw04,
	AUTHOR = "John Augustine and Sandy Irani and Chaitanya Swamy", 
	TITLE = "Optimal Power-Down Strategies",
	PAGES =  "530-539",
        BOOKTITLE = FOCS04,
	ORGANIZATION = "IEEE",
        YEAR = 2004,
}

@inproceedings{Aumann97,
	AUTHOR = "Yonatan Aumann",
	TITLE = "Efficient Asynchronous Consensus with the Weak
                Adversary Scheduler",
	BOOKTITLE = PODC97,
	ORGANIZATION = "ACM",
	YEAR = 1997,
        PAGES = "209-218"
	}

@inproceedings{AumBen96,
        AUTHOR = "Yonatan Aumann and Michael A. Bender",
        TITLE = "Efficient asynchronous consensus with the value-oblivious
                 adversary scheduler",
        BOOKTITLE = ICALP96,
        YEAR = 1996,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "1099",
        PAGES = "622-633"
        }

@inproceedings{AuFLST94,
        AUTHOR = "Giorgio Ausiello and Esteban Feuerstein and 
		Stefano Leonardi and Leen Stougie and Maurizio Talamo",
        TITLE = "Serving requests with on-line routing",
        BOOKTITLE = SWAT94,
        YEAR = 1994,
        PAGES = "37-48",
        PUBLISHER = "Springer",
        SERIES = LNCS,
	VOLUME = "824",
	}

@inproceedings{AuFLST95,
        AUTHOR = "Giorgio Ausiello and Esteban Feuerstein and 
		Stefano Leonardi and Leen Stougie and Maurizio Talamo",
        TITLE = "Competitive Algorithms for the On-line Traveling Salesman
                Problem",
        BOOKTITLE = WADS95,
        YEAR = 1995,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME= "955",
        PAGES = "206-217"
        }

@article{AuItSN92,
        AUTHOR = "Giorgio Ausiello and Giuseppe F. Italiano and 
		Alberto M. Spaccamela and Umberto Nanni",
        TITLE = "On-line computation of minimal and maximal length paths",
        JOURNAL = tcs,
        VOLUME = "95",
        YEAR = 1992,
        PAGES = "245-261"
	}

@inproceedings{AuBoLa05,
        AUTHOR = "Giorgio Ausiello and Vincenzo Bonifaci
                        and Luigi Laura",
        TITLE = "The on-line asymmetric traveling salesman problem",
        BOOKTITLE = WADS05,
        YEAR = 2005,
        PAGES = "306--317",
        }

@inproceedings{AvAzSg98,
        AUTHOR =  "Adi Avidor and Yossi Azar and Jiri Sgall",
        TITLE = "Ancient and new algorithms for load balancing 
                 in the $L_p$ norm",
        BOOKTITLE = SODA98,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 1998,
        PAGES = "426-435",
        }

@inproceedings{AvAzSg01,
        AUTHOR =  "Adi Avidor and Yossi Azar and Ji\v{r}\'{\i} Sgall",
        TITLE = "Ancient and new algorithms for load balancing 
                 in the $L_p$ norm",
	JOURNAL = "Algorithmica",
	YEAR = 	 2001,
	VOLUME =   29,
	PAGES =  "422--441"
        }

@inproceedings{AvrAza03,
        AUTHOR =  "Nir Avrahami and Yossi Azar",
        TITLE = "Minimizing total flow time and total completion time
		 with immediate dispatching",
        BOOKTITLE = SPAA03,
	ORGANIZATION = "ACM",
        YEAR = 2003,
        PAGES = "11-18",
        }

@techreport{AvrPen93,
	AUTHOR = "Mordecai Avriel and Michal Penn",
	TITLE = "Stowage Planning for Container Ships to Reduce the Number of
                Shifts",
	INSTITUTION = "Faculty of Industrial Engineering and Management, 
		Technion - Israel Institute of Technology",
	YEAR = 1993,
	SERIES = " ",
	}

@techreport{AvPeSh94,
	AUTHOR = "Mordecai Avriel and Michal Penn and Naomi Shpirer",
	TITLE = "Container Ship Stowage Problem: {Complexity} and Applications
                to Coloring of Circle Graphs",
	INSTITUTION = "Faculty of Industrial Engineering and Management, 
		Technion - Israel Institute of Technology",
	YEAR = 1994,
	SERIES = " ",
	}

@article{AweAza95,
        AUTHOR = "Baruch Awerbuch and Yossi Azar",
        TITLE = "Competitive multicast routing",
        JOURNAL = WirelessNet,
        VOLUME = "1",
        YEAR = 1995,
        PAGES = "107-114"
        }

@InProceedings{Awerbu96,
	author = "Baruch Awerbuch",
	title = "Online algorithms for selective multicast: {A} survey",
	booktitle = "1996 Dagstuhl workshop on on-line algorithms",
	year = 1996,
	publisher = "Springer",
	}

@inproceedings{AweAza94,
        AUTHOR = "Baruch Awerbuch and Yossi Azar",
        TITLE = "Local optimization of global objectives: {Competitive}
                  distributed deadlock resolution and resource allocation",
        BOOKTITLE = FOCS94,
	ORGANIZATION = "IEEE",
        YEAR = 1994,
        PAGES = "240-249"
        }

@inproceedings{AwAzBa96,
        AUTHOR =  "Baruch Awerbuch and Yossi Azar and Yair Bartal",
        TITLE = "On-line generalized steiner problem",
        BOOKTITLE = SODA96,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 1996,
        PAGES = "68-74",
        }

@inproceedings{AwAzBV95,
        AUTHOR = "Baruch Awerbuch and Yossi Azar and Avrim Blum 
		and Santosh Vempala",
        TITLE = "Improved approximation guarantees for minimum weight 
		$k$-trees and prize-collecting salesmen",
        YEAR = 1995,
        BOOKTITLE = STOC95,
	ORGANIZATION = "ACM",
        PAGES ="277-283"
        }

@inproceedings{AwAzFi96,
        AUTHOR = "Baruch Awerbuch and Yossi Azar and Amos Fiat",
        TITLE = "Packet Routing via min-cost circuit routing",
        BOOKTITLE = ISTCS96,
	ORGANIZATION = "IEEE",
        YEAR = 1996,
        PAGES = "37-42"
        }

@inproceedings{AwAzFL96,
	AUTHOR = "Baruch Awerbuch and Yossi Azar and Amos Fiat and 
		Tom Leighton",
	TITLE = "Making commitments in the face of uncertainty: {How} to pick a
         winner almost every time",
	YEAR = 1996,
	BOOKTITLE = STOC96,
	ORGANIZATION = "ACM",
	PAGES = "519-530"
 	}

@inproceedings{AwBeBS01,
        AUTHOR = "Baruch Awerbuch and Petra Berenbrink and Andr\'e Brinkmann 
	          and Christian Scheideler",
        TITLE = "Simple routing strategies for adversarial systems",
        BOOKTITLE = FOCS01,
	ORGANIZATION = "IEEE",
        YEAR = 2001,
        PAGES = "158-167"
        }

@inproceedings{AwAFLR96,
        AUTHOR = "Baruch Awerbuch and Yossi Azar and Amos Fiat and 
		Stefano Leonardi and Adi Ros\'{e}n",
        TITLE = "On-line Competitive Algorithms for Call
        Admission in Optical Networks",
        BOOKTITLE = ESA96,
        YEAR = 1996,
        PAGES = "431-444",
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "1136",
        }

@inproceedings{AAGKKV95,
        AUTHOR = "Baruch Awerbuch and Yossi Azar and Edward F. Grove and 
		Ming-Yang Kao and Padmanabhan Krishnan and Jeffrey S. Vitter",
        TITLE = "Load balancing in the $L_p$ norm",
        BOOKTITLE = FOCS95,
	ORGANIZATION = "IEEE",
        YEAR = 1995,
        PAGES = "383-391"
        }

@inproceedings{AwAzPl93,
	AUTHOR = "Baruch Awerbuch and Yossi Azar and Serge Plotkin",
	TITLE = "Throughput-competitive online routing",
	BOOKTITLE = FOCS93,
	ORGANIZATION = "IEEE",
	YEAR = 1993,
	PAGES = "32-40",
	}

@inproceedings{AwAzPW94,
	AUTHOR = "Baruch Awerbuch and Yossi Azar and Serge Plotkin and 
		Orli Waarts",
	TITLE = "Competitive routing of virtual circuits with unknown 
		duration",
	BOOKTITLE = SODA94,
	ORGANIZATION = "ACM/SIAM",
	YEAR = 1994,
	PAGES = "321-327",
	}

@inproceedings{AwBaFi93A,
	AUTHOR = "Baruch Awerbuch and Yair Bartal and Amos Fiat",
	TITLE = "Heat \& Dump: {C}ompetitive On-Line Routing",
	BOOKTITLE = FOCS93,
	ORGANIZATION = "IEEE",
	YEAR = 1993,
	PAGES = "22-31",
	}

@inproceedings{AwBaFi93,
        AUTHOR =  "Baruch Awerbuch and Yair Bartal and Amos Fiat",
        TITLE = "Competitive distributed file allocation",
        BOOKTITLE = STOC93,
	ORGANIZATION = "ACM",
        YEAR = 1993,
        PAGES = "164-173",
        }

@inproceedings{AwBaFi96,
	AUTHOR = "Baruch Awerbuch and Yair Bartal and Amos Fiat",
	TITLE = "Distributed paging for general networks",
	BOOKTITLE = SODA96,
	ORGANIZATION = "ACM/SIAM",
	PAGES = "574-583",
	YEAR = 1996
	}

@inproceedings{AwBaFR94,
        AUTHOR =  "Baruch Awerbuch and Yair Bartal and Amos Fiat and 
		Adi Ros\'en",
        TITLE = "Competitive non-preemptive call control",
        BOOKTITLE = SODA94,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 1994,
        PAGES = "312-320",
        }

@inproceedings{AwBeRS97,
        AUTHOR = "Baruch Awerbuch and Margrit Betke and Ronald Rivest 
		and Mona Singh",
        TITLE = "Piecemeal Graph Learning by a Mobile Robot",
        BOOKTITLE = COLT97,
	ORGANIZATION = "ACM",
        YEAR = 1997,
        PAGES = "321-328",
        }

@inproceedings{AweLei94,
        AUTHOR = "Baruch Awerbuch and Tom Leighton",
        TITLE = "Improved approximation algorithms for the multi-commodity flow
		 problem and local competitive routing in dynamic networks",
        BOOKTITLE = STOC94,
	ORGANIZATION = "ACM",
        YEAR = 1994,
        PAGES = "487-496"
	}

@inproceedings{AwGaLR94,
        AUTHOR = "Baruch Awerbuch and Rainer Gawlick and Tom Leighton 
		and Yuval Rabani",
        TITLE = "On-line admission control and circuit routing for
                  high performance computing and communication",
        BOOKTITLE = FOCS94,
	ORGANIZATION = "IEEE",
        YEAR = 1994,
        PAGES = "412-423"
        }

@inproceedings{AwKuPe92,
        AUTHOR = "Baruch Awerbuch and Shay Kutten and David Peleg",
        TITLE = "Competitive distributed job scheduling",
        BOOKTITLE = STOC92,
	ORGANIZATION = "ACM",
        YEAR = 1992,
        PAGES = "571-580"
	}

@inproceedings{AweSak90,
        AUTHOR = "Baruch Awerbuch and Michael Saks",
        TITLE = "A dining philosophers algorithm with polynomial 
		response time",
        BOOKTITLE = FOCS90,
	ORGANIZATION = "IEEE",
        YEAR = 1990,
        PAGES = "65-74"
	}

@inproceedings{AweSin97,
        AUTHOR =  "Baruch Awerbuch and Tripurari Singh",
        TITLE = "Online Algorithms for Selective Multicast and 
		Maximal Dense Trees",
        BOOKTITLE = STOC97,
	ORGANIZATION = "ACM",
        YEAR = 1997,
        PAGES = "354-362",
        }

@inproceedings{AweKle04,
	AUTHOR = {Baruch Awerbuch and Robert D. Kleinberg},
	TITLE = {Adaptive routing with end-to-end feedback: {D}istributed 
	         learning and geometric approaches},
	BOOKTITLE = STOC04,
	ORGANIZATION = "ACM",
	YEAR = 2004,
	PAGES = {45-53}
}

@inproceedings{AweSin97,
        AUTHOR =  "Baruch Awerbuch and Tripurari Singh",
        TITLE = "Online Algorithms for Selective Multicast and
                Maximal Dense Trees",
        BOOKTITLE = STOC97,
	ORGANIZATION = "ACM",
        YEAR = 1997,
        PAGES = "354-362",
        }

@inproceedings{AwAzLR99,
        AUTHOR =  "Baruch Awerbuch and Yossi Azar 
			and Stefano Leonardi and Oded Regev",
        TITLE = "Minimizing the flow time without migration",
        BOOKTITLE = STOC99,
	ORGANIZATION = "ACM",
        YEAR = 1999,
        PAGES = "198-205",
        }

@article{AwAzLR01,
        AUTHOR =  "Baruch Awerbuch and Yossi Azar 
			and Stefano Leonardi and Oded Regev",
        TITLE = "Minimizing the flow time without migration",
        JOURNAL = Sicomp,
        YEAR = 2001,
	VOLUME = 31,
        PAGES = "1370-1382",
        }

@inproceedings{AwHaKL05,
  author    = {Baruch Awerbuch and Mohammad Taghi Hajiaghayi and
               Robert D. Kleinberg and Tom Leighton},
  title     = {Online client-server load balancing without
                 global information},
  booktitle = SODA05,
	ORGANIZATION = "ACM/SIAM",
  year      = 2005,
  pages     = {197--206},
}

@inproceedings{AwAzEp05,
  author    = {Baruch Awerbuch and Yossi Azar and Amir Epstein},
  title     = {The price of routing unsplittable flow},
  booktitle = STOC05,
	ORGANIZATION = "ACM",
  year      = 2005,
  pages     = {57--66},
}

@inproceedings{ABFFLR96,
	AUTHOR = "Yossi Azar and Yair Bartal and Esteban Feuerstein 
		and Amos Fiat and Stefano Leonardi and Adi Ros{\'e}n",
	TITLE = "On Capital Investment",
	BOOKTITLE = ICALP96,
	YEAR = 1996,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "1099",
        PAGES = "429-441"
 	}

@inproceedings{AzBrKa92,
        AUTHOR = "Yossi Azar and Andrei Broder and Anna Karlin",
        TITLE = "On-line load balancing",
	BOOKTITLE = FOCS92,
	ORGANIZATION = "IEEE",
	YEAR = 1992,
	PAGES = "218-225",
	}

@article{AzBrKa94,
        AUTHOR = "Yossi Azar and Andrei Z. Broder and Anna R. Karlin",
        TITLE = "On-line load balancing",
        JOURNAL = tcs,
        VOLUME = "130",
        YEAR = 1994,
        PAGES = "73-84"
	}

@inproceedings{AzBrMa93,
	AUTHOR = "Yossi Azar and Andrei Broder and Mark Manasse",
	TITLE = "On-line choice of on-line algorithms",
	BOOKTITLE = SODA93,
	ORGANIZATION = "ACM/SIAM",
	YEAR = 1993,
	PAGES = "432-440",
	}

@inproceedings{AzaEps96,
        AUTHOR = "Yossi Azar and Leah Epstein",
        TITLE = "On two dimensional packing",
        BOOKTITLE = SWAT96,
        YEAR = 1996,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "1097",
        }

@inproceedings{AzaEps97,
	AUTHOR = "Yossi Azar and Leah Epstein",
	TITLE = "On-line load balancing of temporary tasks on identical 
		machines",
	BOOKTITLE = ISTCS97,
	ORGANIZATION = "IEEE",
	PAGES = "119-125",
	YEAR = 1997
	}

@article{AzaEps02,
	AUTHOR = "Yossi Azar and Leah Epstein",
        TITLE = "On-line scheduling with precedence constraints",
        JOURNAL = DAM,
        VOLUME = 119,
        YEAR = 2002,
        PAGES = "169-180"
        }

@inproceedings{AzKPPW93,
        AUTHOR = "Yossi Azar and Bala Kalyanasundaram and Serge Plotkin and
                Kirk Pruhs and Orli Waarts",
        TITLE = "Online Load Balancing of Temporary Tasks",
        BOOKTITLE = WADS93,
        YEAR = 1993,
        PAGES = "119-130",
        PUBLISHER = "Springer",
        SERIES = LNCS,
	VOLUME = "709"
        }

@inproceedings{AzNaRo92,
	AUTHOR = "Yossi Azar and Joseph Naor and Raphael Rom",
	TITLE =  "The competitiveness of on-line assignments",
	BOOKTITLE = SODA92,
	ORGANIZATION = "ACM/SIAM",
	YEAR = 1992,	
	PAGES = "203-210",
	}

@article{AzNaRo95,
        AUTHOR = "Yossi Azar and Joseph Naor and Raphael Rom",
        TITLE =  "The competitiveness of on-line assignments",
        JOURNAL = Jalg,
        YEAR = 1995,
        PAGES = "221-237",
	VOLUME= "18",
        }

@incollection{Azar98,
	AUTHOR = "Y. Azar",
	TITLE = "On-Line Load Balancing",
	BOOKTITLE = "Online Algorithms: {The} State of the Art",
	EDITOR = "Amos Fiat and Gergard J. Woeginger",
	PUBLISHER = "Springer",
	YEAR = 1998,
	PAGES = "178-195"
	}

@inproceedings{AzaLit04,
	AUTHOR = "Yossi Azar and Arik Litichevskey", 
	TITLE = "Maximizing Throughput in Multi-queue Switches",
	PAGES =  "53-64",
        BOOKTITLE = ESA04,
        YEAR = 2004,
        PUBLISHER = "Springer",
        SERIES = LNCS,
	VOLUME = 3221
}

@article{AzaReg01,
	AUTHOR = "Yossi Azar and Oded Regev",
	TITLE = "On-line Bin Stretching",
	JOURNAL = TCS,
	VOLUME = 268,
	YEAR = 2001,
	PAGES = "17-41"
	}

@inproceedings{AzaRic03,
        AUTHOR = {Y. Azar and Y. Richter},
        TITLE = {Management of Multi-Queue Switches in {QoS} Networks},
	BOOKTITLE = STOC03,
	ORGANIZATION = "ACM",
	YEAR = 2003,
	PAGES = {82--89}
}

@inproceedings{AzaRic04A,
	AUTHOR = {Y. Azar and Y. Richter},
	TITLE = {The zero-one principle for switching networks},
	BOOKTITLE = STOC04,
	ORGANIZATION = "ACM",
	YEAR = 2004,
	PAGES = {64--71}
}

@inproceedings{AzaRic04B,
	AUTHOR = "Yossi Azar and Yossi Richter", 
	TITLE = "An Improved Algorithm for {CIOQ} Switches",
	PAGES =  "65-76",
        BOOKTITLE = ESA04,
        YEAR = 2004,
        PUBLISHER = "Springer",
        SERIES = LNCS,
	VOLUME = 3221
}

@inproceedings{AzaZac05,
  author    = {Yossi Azar and Rafi Zachut},
  title     = {Packet Routing and Information Gathering in Lines,
                 Rings and Trees.},
  booktitle = ESA05,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "3669",
  year      = 2005,
  pages     = {484--495},
}

%BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB%
	

@inproceedings{BacElY97,
        AUTHOR = "Ran Bachrach and Ran El-Yaniv",
        TITLE = "Online List Accessing Algorithms and Their Applications:
		{Recent} Empirical Evidence",
        BOOKTITLE = SODA97,
	ORGANIZATION = "ACM/SIAM",
        YEAR =  1997,
        PAGES = "53-62"
        }

@inproceedings{BaCuRa88,
        AUTHOR = "Ricardo A. Baeza-Yates and Joseph C. Culberson and 
		Gregory J. E. Rawlins",
        TITLE = "Searching with uncertainty",
        BOOKTITLE = SWAT88,
        YEAR = 1988,
        PAGES = "176-189",
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "318"
	}

@article{BaCuRa93,
        AUTHOR = "Ricardo Baeza-Yates and Joseph Culberson and 
		Gregory Rawlins",
        TITLE = "Searching in the plane",
        JOURNAL = InfComp,
	VOLUME = "106",
	YEAR = 1993,
	PAGES = "234-252",	
        }

@inproceedings{BaeSch94,
	AUTHOR = "Ricardo Baeza-Yates and Rene Schott",
	TITLE = "Parallel Searching in the Plane",
	BOOKTITLE = "Proc. 9th Conference on Shape Recognition and 
		Artificial Intelligence, Paris",
    	YEAR = 1994,
	PAGES = "557-566",
	}

@article{BaeSch95,
        AUTHOR = "Ricardo Baeza-Yates and Rene Schott",
        TITLE = "Parallel searching in the plane",
        JOURNAL = CompGeo,
        VOLUME = "5",
        YEAR = 1995,
        PAGES = "143-154" 
	}

@article{BaDuKM94,
        AUTHOR = "Jean-Claude Bajard and Jean Duprat and Sylvanus Kla and 
		Jean-Michael Muller",
        TITLE = "Some operators for on-line radix-2 computations",
        JOURNAL = JpardisCom,
        VOLUME = "22",
        YEAR = 1994,
        PAGES = "336-345"
	}

@book{Baker74,
        AUTHOR = "K. R. Baker",
        TITLE = "Introduction to sequencing and scheduling",
        PUBLISHER = "Wiley, New York",
        YEAR = 1974,
        }

@article{Baker85,
        AUTHOR = "Brenda S. Baker",
        TITLE = "A new proof for the {F}irst-{F}it Decreasing
                bin-packing algorithm",
        JOURNAL = Jalg,
        VOLUME = "6",
        YEAR = 1985,
        PAGES = "49-70",
        }

@article{BaBrKa81,
         AUTHOR = "Brenda S. Baker and Donna J. Brown and Howard P. Katseff",
         TITLE = "A 5/4 algorithm for two-dimensional packing",
         JOURNAL = Jalg,
         VOLUME = "2",
         YEAR = 1981,
         PAGES = "348-368",
         }

@article{BaBrKa82,
         AUTHOR = "Brenda S. Baker and Donna J. Brown and Howard P. Katseff",
         TITLE = "Lower bounds for two-dimensional packing algorithms",
         JOURNAL = actinf,
         VOLUME = "8",
         YEAR = 1982,
         PAGES = "207-225"
         }

@article{BakCof81,
         AUTHOR = "Brenda S. Baker and Edward G. Coffman",
         TITLE = "A tight asymptotic bound for 
                 {N}ext-{F}it-{D}ecreasing bin-packing",
         JOURNAL = Sialgdis,
         VOLUME = "2",
         YEAR = 1981,
         PAGES = "147-152"
         }

@article{BaCoRi80,
         AUTHOR = "Brenda S. Baker and Edward G. Coffman and Ronald L. Rivest",
         TITLE = "Orthogonal packings in two dimensions",
         JOURNAL = Sicomp,
         VOLUME = "9",
         YEAR = 1980,
         PAGES = "846-855",
         }

@article{BakSch83,
         AUTHOR = "Brenda S. Baker and J. S. Schwartz",
         TITLE = "Shelf algorithms for two-dimensional packing problems",
         JOURNAL = Sicomp,
         VOLUME = "12",
         YEAR = 1983,
         PAGES = "508-525",
         }

@inproceedings{BalShe93,
        AUTHOR = "Ganesh R. Baliga and Anil M. Shende",
        TITLE = "On space bounded server algorithms",
        BOOKTITLE = "Proc. 5th International Conference on Computing 
		and Information",
        YEAR = 1993,
	ORGANIZATION = "IEEE",
        PAGES = "77-81"
	}

@inproceedings{BaBaLT05,
  author    = {Fabien Baille and Evripidis Bampis and
                 Christian Laforest and Nicolas Thibault},
  title     = {On-Line Simultaneous Maximization of the Size and
                 the Weight for Degradable Intervals Schedules},
  booktitle = COCOON05,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "3595",
  year      = 2005,
  pages     = {308-317},
}

@inproceedings{BanDha03,
	AUTHOR = "Nikhil Bansal and K. Dhamdhere",
	TITLE = "Minimizing weighted flow time",
	PAGES = "508-516",
	BOOKTITLE = SODA03,
	YEAR = 2003,
	ORGANIZATION = "ACM/SIAM"
	}

@inproceedings{BaDhKS03,
        AUTHOR = "Nikhil Bansal and K. Dhamdhere and Jochen Konemann and Amitabh Sinha",
        TITLE = "Non-Clairvoyant Scheduling for Mean Slowdown",
        PAGES = "260-270",
        BOOKTITLE = STACS03,
        YEAR = 2003,
        PUBLISHER = "Springer",
        SERIES = LNCS,
	VOLUME = "2607"
        }

@inproceedings{BFKMSS04,
        AUTHOR = "N. Bansal and L. Fleischer and T. Kimbrel
                   and M. Mahdian and B. Schieber and M. Sviridenko",
        TITLE = "Further improvements in competitive guarantees for
	        {QoS} buffering", 
        BOOKTITLE = ICALP04,
	YEAR = 2004,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "3142",
	PAGES = "196-207"
        }

@inproceedings{BanPru03,
	AUTHOR = "Nikhil Bansal and Kirk Pruhs",
	TITLE = "Server scheduling in the {$L_p$} norm: {A}
		rising tide lifts all boats",
	PAGES = "242-250",
	BOOKTITLE = STOC03,
	ORGANIZATION = "ACM",
	YEAR = 2003,
	}

@unpublished{BanPru03a,
	AUTHOR = "Nikhil Bansal and Kirk Pruhs",
	TITLE = "Server scheduling in the weighted {$l_p$} norm",
        NOTE = "Manuscript",
        YEAR = 2003
        }

@inproceedings{BaKiPr04,
	AUTHOR = "Nikhil Bansal and Tracy Kimbrel and Kirk Pruhs", 
	TITLE = "Dynamic Speed Scaling to Manage Energy and Temperature",
	PAGES =  "520-529",
        BOOKTITLE = FOCS04,
	ORGANIZATION = "IEEE",
        YEAR = 2004,
}

@inproceedings{BanPru05,
  author    = {Nikhil Bansal and Kirk Pruhs},
  title     = {Speed Scaling to Manage Temperature},
  booktitle = STACS05,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "3404",
  year      = 2005,
  pages     = {460--471},
}

@inproceedings{BaChKN05,
  author    = {Nikhil Bansal and Moses Charikar and
               Sanjeev Khanna and Joseph Naor},
  title     = {Approximating the average response time
         in broadcast scheduling},
  booktitle = SODA05,
	ORGANIZATION = "ACM/SIAM",
  year      = 2005,
  pages     = {215--221},
}

@inproceedings{BaChPr07,
  	author    = {Nikhil Bansal and Ho-Leung Chan and Kirk Pruhs},
  	title     = {Competitive Algorithms for Due Date Scheduling},
  	booktitle = ICALP07,
  	year      = {2007},
  	pages     = {28--39},
}

@inproceedings{BaPrSt07,
  author    = {Nikhil Bansal and Kirk Pruhs and Clifford Stein},
  title     = {Speed Scaling for Weighted Flow Time},
  booktitle = SODA07,
  year      = {2007},
  pages     = {805--813}
}

@Article{Baptis99,
	author = "Philippe Baptiste",
	title = "Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times",
	journal = JOS,
	year = 1999,
	volume = 2,
	pages = {245--252}
}	

@Article{BaBrKT04,
	author = "P. Baptiste and P.Brucker and S. Knust and V. Timkovsky",
	title = "Ten notes on equal-execution-time scheduling",
	journal = "4OR",
	year = 2004,
	volume = 2,
	pages = "111--127"
}

@inproceedings{BaBeFY92,
	AUTHOR = "Elda Bar-Eli and Piotr Berman and Amos Fiat and Peiyuan Yan",
	TITLE = "Online Navigation in a Room",
	PAGES = "237-249",
	BOOKTITLE = SODA92,
	YEAR = 1992,
	ORGANIZATION = "ACM/SIAM"
	}

@article{BaBeFY94,
	AUTHOR = "Elda Bar-Eli and Piotr Berman and Amos Fiat and Peiyuan Yan",
	TITLE = "Online Navigation in a Room",
         JOURNAL = Jalg,
	YEAR = 1994,
	VOLUME = 17,
	PAGES = "319-341",
	}

@inproceedings{BaCKMS95,
        AUTHOR = "Amotz Bar-Noy and Ran Canetti and Shay Kutten and 
		Yishay Mansour and Baruch Schieber",
        TITLE = "Bandwidth allocation with preemption",
        BOOKTITLE = STOC95,
	ORGANIZATION = "ACM",
        YEAR = 1995,
        PAGES = "616-625"
        }

@InProceedings{BaFrNa99,
	author = "Amotz Bar-Noy and Ari Freund and Joseph Naor",
	title = "On-line load balancing in a hierarchical server topology",
	booktitle = ESA99,
	year = 1999,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "1643",
	pages = "77--88"
	}

@article{BaFrNa01,
	author = "Amotz Bar-Noy and Ari Freund and Joseph Naor",
	title = "On-line load balancing in a hierarchical server topology",
        JOURNAL = Sicomp,
        VOLUME = 31,
        YEAR = 2001,
        PAGES = "527-549",
	}

@article{BaFrNa00,
	author = "Amotz Bar-Noy and Ari Freund and Joseph Naor",
        TITLE = "New algorithms for related machines with temporary jobs",
        JOURNAL = JOS,
        VOLUME = 3,
        YEAR = 2000,
        PAGES = "259-272",
	}

@inproceedings{BaLaTa04,
        AUTHOR = "Amotz Bar-Noy and Richard E. Ladner and Tami Tamir",
        TITLE = "Windows scheduling as a restricted version of Bin Packing",
        BOOKTITLE = SODA04,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 2004,
	PAGES = "224-233"
        }

@inproceedings{BaGuNS99,
        AUTHOR = "A. Bar-Noy and S. Guha and J. Naor and B. Scieber",
        TITLE = "Approximating the throughput of multiple machines 
	         in real-time scheduling",
        BOOKTITLE = STOC99,
	ORGANIZATION = "ACM",
        YEAR = 1999,
        PAGES = "622-631",
        }

@inproceedings{BGKNSS02,
        AUTHOR = "A. Bar-Noy and S. Guha and Y. Katz and J. Naor
                        and B. Schieber and H. Shachnai",
        TITLE = "Throughput maximization of real-time scheduling with batching",
        BOOKTITLE = SODA02,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 2002,
        PAGES = "742-751"
        }

@article{BaHwKK94,
        AUTHOR = "Amotz Bar-Noy and Frank K. Hwang and Ilan Kessler and 
		Shay Kutten",
        TITLE = "A new competitive algorithm for group testing",
        JOURNAL = DAM,
        VOLUME = "52",
        YEAR = 1994,
        PAGES = "29-38",
	}

@article{BaMoNa92,
        AUTHOR = "Amotz Bar-Noy and Rajeev Motwani and Joseph Naor",
        TITLE = "The greedy algorithm is optimal for online edge coloring",
     	JOURNAL = ipl,
        VOLUME = "44",
        YEAR = 1992,
        PAGES = "251-253"
        }

@inproceedings{BarSch91,
        AUTHOR = "Amotz Bar-Noy and Baruch Schieber",
        TITLE = "The {Canadian} traveller problem",
        BOOKTITLE = SODA91,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 1991,
        PAGES = "261-270"
        }

@inproceedings{BaFrLN02,
  AUTHOR =   {A. Bar-Noy and A. Freund and S. Landa and J.Naor},
  TITLE =    {Competitive On-line Switching Policies},
  BOOKTITLE =    SODA02,
  ORGANIZATION = "ACM/SIAM",
  YEAR =     2002,
  PAGES =    {525--534}
}

@inproceedings{BaChOS07,
  		author    = {Amotz Bar-Noy and Panagiotis Cheilaris and
               Svetlana Olonetsky and Shakhar Smorodinsky},
  		title     = {Online Conflict-Free Colorings for Hypergraphs},
  		booktitle = ICALP07,
  		year      = {2007},
  		pages     = {219--230}
}

@phdthesis{Bartal94,
        AUTHOR = "Yair Bartal",
        TITLE = "Competitive analysis of distributed on-line problems -
	         distributed paging",
        SCHOOL= "Tel-Aviv University",
        YEAR = 1994,
        }

@inproceedings{Bartal96,
	AUTHOR = "Yair Bartal",
	TITLE = "Probabilistic Approximation of Metric Spaces and its 
		Algorithmic Applications",
	BOOKTITLE = FOCS96,
	ORGANIZATION = "IEEE",
	YEAR = 1996,
	PAGES = "184-193"
	}

@inproceedings{Bartal98,
        AUTHOR = "Yair Bartal",
        TITLE = "On approximating arbitrary metrics by tree metrics",
        BOOKTITLE = STOC98,
	ORGANIZATION = "ACM",
        YEAR = 1998,
        PAGES = "161-168"
        }

@inproceedings{BaBlBT97,
        AUTHOR = "Yair Bartal and Avrim Blum and Carl Burch and 
		Andrew Tomkins",
        TITLE = "A polylog(n)-competitive algorithm for metrical task systems",
        BOOKTITLE = STOC97,
	ORGANIZATION = "ACM",
        YEAR =  1997,
        PAGES = "711-719"
        }
@inproceedings{BaChIn97,
        AUTHOR = "Yair Bartal and Moses Charikar and Piotr Indyk",
        TITLE = "On Page Migration and Other Related Task Systems",
        BOOKTITLE = SODA97,
	ORGANIZATION = "ACM/SIAM",
        YEAR =  1997,
        PAGES = "43-52"
        }

@inproceedings{BaChLa98,
        AUTHOR = "Yair Bartal and Marek Chrobak and Lawrence L. Larmore",
        TITLE = "A randomized algorithm for two servers on the line",
	BOOKTITLE = esa98,
        PUBLISHER = "Springer",
        SERIES= LNCS,
        YEAR = 1998,
	PAGES = "247-258"
        }

@article{BaChLa00,
        AUTHOR = "Yair Bartal and Marek Chrobak and Lawrence L. Larmore",
        TITLE = "A randomized algorithm for two servers on the line",
        JOURNAL = Infcomp,
        YEAR = 2000,
	VOLUME = "158",
	PAGES = "53-69"
        }

@article{BaChNR02,
         AUTHOR = "Yair Bartal and Marek Chrobak and John Noga
                        and Prabhakar Raghavan",
         TITLE = "More on random walks, electrical networks, and
                        the harmonic $k$-server algorithm",
         JOURNAL = IPL,
         YEAR = 2002,
         VOLUME = "84",
         PAGES = "271-276"
         }

@inproceedings{BaFiLe96,
        AUTHOR = "Yair Bartal and Amos Fiat and Stefano Leonardi",
        TITLE = "Lower bounds for on-line graph problems with
                  application to on-line circuit and optical routing",
        BOOKTITLE = STOC96,
	ORGANIZATION = "ACM",
        YEAR = 1996,
        PAGES = "531-540"
        }

@inproceedings{BaFiKV92,
        AUTHOR = "Yair Bartal and Amos Fiat and Howard Karloff and 
		Rakesh Vohra",
        TITLE = "New algorithms for an ancient scheduling problem",
        BOOKTITLE = STOC92,
	ORGANIZATION = "ACM",
        YEAR =  1992,
        PAGES = "51-58",
        }

@article{BaFiKV95,
        AUTHOR = "Yair Bartal and Amos Fiat and Howard Karloff and 
		Rakesh Vohra",
        TITLE = "New algorithms for an ancient scheduling problem",
        JOURNAL = jcss,
        YEAR =  1995,
        PAGES = "359-366",
	VOLUME= "51",
	}

@inproceedings{BaFiRa92,
        AUTHOR = "Yair Bartal and Amos Fiat and Yuval Rabani",
        TITLE = "Competitive algorithms for distributed data management",
        BOOKTITLE = STOC92,
	ORGANIZATION = "ACM",
        YEAR = 1992,
        PAGES = "39-50",
        }

@article{BarGro00,
	AUTHOR = "Yair Bartal and Edward Grove",
	TITLE = "The harmonic $k$-server algorithm is competitive",
	JOURNAL = jacm,
	VOLUME = "47",
	NUMBER = "1",
	PAGES = "1--15",
	YEAR = "2000"
	}

@article{BaKaRa94,
        AUTHOR = "Yair Bartal and Howard Karloff and Yuval Rabani",
        TITLE = "A better lower bound for on-line scheduling",
     	JOURNAL = ipl,
        VOLUME = "50",
        YEAR = 1994,
        PAGES = "113-116",
        }

@inproceedings{BarLeo97,
	AUTHOR = "Yair Bartal and Stefano Leonardi",
	TITLE = "On-line Routing in All-Optical Networks",
	BOOKTITLE = ICALP97,
        YEAR = 1997,
        PAGES = "516-526",
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "1256",
	}

@inproceedings{BaLMSS96,
        AUTHOR = "Yair Bartal and Stefano Leonardi and Alberto 
		Marchetti-Spaccamela and Jiri Sgall and Leen Stougie",
        TITLE = "Multiprocessor scheduling with rejection",
        BOOKTITLE = SODA96,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 1996,
        PAGES = "95-103",
        }

@article{BaLMSS00,
        AUTHOR = "Yair Bartal and Stefano Leonardi and Alberto 
		Marchetti-Spaccamela and Jiri Sgall and Leen Stougie",
        TITLE = "Multiprocessor scheduling with rejection",
        JOURNAL = Sidma,
        VOLUME = 13,
        YEAR = 2000,
        PAGES = "64-78",
        }

@inproceedings{BarMen04,
        AUTHOR = "Yair Bartal and Manor Mendel",
        TITLE = "Randomized $k$-server algorithms for growth-rate bounded graphs",
        BOOKTITLE = SODA04,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 2004,
	PAGES = "666-671"
        }

@inproceedings{BarMut00,
        AUTHOR = "Yair Bartal and S. Muthukrishnan",
        TITLE = "Minimizing maximum response time in scheduling broadcasts",
        BOOKTITLE = SODA00,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 2000,
        PAGES = "558-559"
        }


@inproceedings{BarRos92,
	AUTHOR = "Yair Bartal and Adi Ros\'en",
	TITLE = "The distributed $k$-server problem --- a competitive
			distributed translator for $k$-server algorithms",
	BOOKTITLE = FOCS92,
	ORGANIZATION = "IEEE",
	YEAR = 1992,	
	PAGES = "344-353",
	}

@inproceedings{BaBoMe01,
	  author    = {Yair Bartal and  B{\'e}la Bollob{\'a}s and Manor Mendel},
	  title     = {A {Ramsey}-type theorem for metric Spaces and its applications
	               for metrical task systems and related problems},
	  booktitle = FOCS01,
	  year      = {2001},
	  pages     = {396-405}
	}

@inproceedings{BCCFJL04,
	AUTHOR = "Yair Bartal and Francis Y. L. Chin and Marek Chrobak
		 and Stanley P. Y. Fung and  Wojciech Jawor and Ron Lavi 
		 and Ji\v{r}\'\i\ Sgall and Tom\'a\v{s} Tich\'y", 
	TITLE = "Online competitive algorithms for maximizing weighted
	        throughput of unit jobs" ,
	PAGES =  "187--198",
        BOOKTITLE = STACS04,
        YEAR = 2004,
        PUBLISHER = "Springer",
        SERIES = LNCS,
	VOLUME = "2996"
}

@article{BarKou04,
        AUTHOR = "Yair Bartal and Elias Koutsoupias",
        TITLE = "On the competitive ratio of the work function
                        algorithm for the $k$-server problem",
        JOURNAL = tcs,
        VOLUME = "324",
        YEAR = 2004,
        PAGES = "337--345",
	}


@article{BaVaZh89,
        AUTHOR = "John J. Bartholdi and John H. vande Vate and J. Zhang",
        TITLE = "Expected performance of the shelf heuristic for
                 two-dimensional packing",
        JOURNAL = orl,
        VOLUME = "8",
        YEAR = 1989,
        PAGES = "11-16",
	}

@inproceedings{BaHaSh94,
        AUTHOR = "Sanjoy K. Baruah and Jayant Haritsa and Nitin Sharma",
        TITLE = "On-line scheduling to maximize task completions",
        BOOKTITLE = "Proc. Real-Time Systems Symp.",
        YEAR = 1994,
        PAGES = "228-236"
	}

@article{BaHaSh01,
        AUTHOR = "Sanjoy K. Baruah and Jayant Haritsa and Nitin Sharma",
        TITLE = "On-line scheduling to maximize task completions",
        JOURNAL = "J. Comb. Math. Comb. Comput.",
        VOLUME = 39,
        YEAR = 2001,
        PAGES = "65-78"
	}

@inproceedings{BarHic96,
        AUTHOR = "Sanjoy K. Baruah and M. E. Hickey",
        TITLE = "Competitive on-line scheduling of imprecise computations",
        BOOKTITLE = "Proc. 29th Hawaii International Conference on 
		System Sciences",
        YEAR = 1996,
        PAGES = "460-468"
	}
	
@article{Baston99,
    	AUTHOR = "V.J.~Baston",
	    TITLE = "Two rendezvous search problems on the line",
        JOURNAL = "Naval Research Logistics",
        VOLUME = "46",
        YEAR = "1999",
        PAGES = "335--340"
 		}

@inproceedings{Becche04,
	AUTHOR = "Luca Becchetti", 
	TITLE = "Modeling Locality: {A} Probabilistic Analysis of {LRU} and {FWF}",
	PAGES =  "98-109",
        BOOKTITLE = ESA04,
        YEAR = 2004,
        PUBLISHER = "Springer",
        SERIES = LNCS,
	VOLUME = 3221
}

@inproceedings{BeFrGo01,
        AUTHOR = "Petra Berenbrink and Tom Friedetzky and Leslie Ann Goldberg",
        TITLE = "The natural work-stealing algorithm is stable",
        BOOKTITLE = FOCS01,
	ORGANIZATION = "IEEE",
        YEAR = 2001,
        PAGES = "178-188"
        }

@inproceedings{BKMRRS91,
        AUTHOR = "Sanjoy Baruah and Gilad Koren and Bud Mishra and 
		Arvind Raghunatan and Louis Roiser and Dennis Shasha",
        TITLE = "On-line scheduling in the presence of overload",
        BOOKTITLE = FOCS91,
	ORGANIZATION = "IEEE",
        YEAR = 1991,
        PAGES = "100-110"
        }

@article{BKMMRR92,
        AUTHOR = "Sanjoy Baruah and Gilad Koren and Decao Mao and Bud Mishra 
		and Arvind Raghunathan and Louis Rosier and Dennis Shasha and 
		Fuxing Wang",
        TITLE = "On the competitiveness of on-line real-time task scheduling",
        JOURNAL = RealTime,
        VOLUME = "4",
        YEAR = 1992,
        PAGES = "125-144"
	}

@inproceedings{BurRos92,
        AUTHOR = "Sanjoy K. Buruah and Lou E. Rosier",
        TITLE = "Limitations concerning on-line scheduling algorithms for 
		overloaded real-time systems",
        BOOKTITLE = "Proc. Workshop Real Time Programming",
        YEAR = 1992,
        PAGES = "123-125"
	}

@inproceedings{BaGrVi95,
        AUTHOR = "Rakesh D. Barve and Edward F. Grove and Jeffrey S. Vitter",
        TITLE = "Application-controlled paging for a shared cache",
        BOOKTITLE = FOCS95,
	ORGANIZATION = "IEEE",
        YEAR = 1995,
        PAGES = "204-213"
	}

@inproceedings{BaKaVV98,
        AUTHOR = "Rakesh D. Barve and Mahesh Kallahalla 
			and Peter J. Varman and Jeffrey S. Vitter",
        TITLE = "Competitive parallel disk prefetching and buffer management",
        BOOKTITLE = "Proceedings of the Fifth Annual Workshop
		 on I/O in Parallel and Distributed Systems (IOPADS)",
        YEAR = 1998,
        PAGES = ""
        }

@inproceedings{BaHNSS02,
        AUTHOR = "R. Bar-Yehuda and M.M. Haldorsson and J. Naor 
                        and H. Shachnai and I. Shapira",
        TITLE = "Scheduling split intervals",
        BOOKTITLE = SODA02,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 2002,
        PAGES = ""
        }


@inproceedings{BayBil90,
        AUTHOR = "Paul Bay and Gianfranco Bilardi",
        TITLE = "Deterministic on-line routing on area-universal networks",
        BOOKTITLE = FOCS90,
	ORGANIZATION = "IEEE",
        YEAR = 1990,
        PAGES = "297-306"
	}

@article{Bean76,
        AUTHOR = "D. Bean",
        TITLE = "Effective coloration",
        JOURNAL = jsl,
        VOLUME = "41",
        YEAR = 1976,
        PAGES = "469-480"
        }

@inproceedings{BecLeo01,
	AUTHOR = "L. Becchetti and S. Leonardi",
        TITLE = "Non-Clairvoyant Scheduling to Minimize the Average Flow Time on Single and Parallel Machines",
        BOOKTITLE = STOC01,
	ORGANIZATION = "ACM",
        YEAR = 2001,
        PAGES = "94-103",
        NOTE ="To appear in JACM"
        }




@unpublished{BeLeMu99,
	AUTHOR = "L. Becchetti and S. Leonardi and S. Muthukrishnan",
	TITLE = "Scheduling to minimize average stretch without migration",
	NOTE = "Manuscript",
        YEAR = 1999,
	}

@inproceedings{BeLeMu00,
	AUTHOR = "L. Becchetti and S. Leonardi and S. Muthukrishnan",
	TITLE = "Scheduling to minimize average stretch without migration",
	BOOKTITLE = SODA00,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 2000,
	PAGES = "548-557"
	}

@inproceedings{BeLeMP01,
	AUTHOR = "Luca Becchetti and Stefano Leonardi and 
		Alberto Marchetti-Spaccamela and Kirk Pruhs",
	TITLE = "Online weighted flow time and deadline scheduling",
	BOOKTITLE = "RANDOM-APPROX",
        PUBLISHER = "Springer",
        SERIES = LNCS,
	VOLUME = "2129",
	YEAR = 2001,
	PAGES = "36-47"
	}

@inproceedings{BeLeMP03,
        AUTHOR = "Luca Becchetti and Stefano Leonardi and
                Alberto Marchetti-Spaccamela and Kirk Pruhs",
        TITLE = "Semi-Clairvoyant Scheduling",
        BOOKTITLE = ESA03,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "2832",
	pages = "67--77",
        YEAR = 2003
        }

@article{Beck64,
        AUTHOR = "A.~Beck",
        TITLE = "On the linear search problem",
        JOURNAL = "Naval Research Logistics Quarterly",
        VOLUME = "2",
        YEAR = "1964",
        PAGES = "221--228"
        }

	
@article{BeiGas91,
        AUTHOR = "Richard Beigel and William I. Gasarch",
        TITLE = "The mapmaker's dilemma",
        JOURNAL = DAM,
        VOLUME = "34",
        YEAR = 1991,
        PAGES = "37-48"
        }

@article{BeiLar00,
	AUTHOR = "Wolfgang Bein and Lawrence L. Larmore",
	TITLE = "Trackless online algorithms for the server problem",
	JOURNAL = ipl,
	VOLUME = "74",
	PAGES = "73--79",
	YEAR = 2000
	}

@unpublished{BeiLar02,
	AUTHOR = "Wolfgang Bein and Lawrence L. Larmore",
	TITLE = "Knowledge state algorithms",
	NOTE = "Unpublished manuscript",
	YEAR = 2002
	}

@inproceedings{BeChLa99,
        AUTHOR = "Wolfgang Bein and Marek Chrobak and Lawrence L. Larmore",
        TITLE = "The 3-server problem in the plane",
	BOOKTITLE = ESA99,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "1643",
        YEAR = 1999,
	PAGES = "301-312"
        }

@article{BeChLa02,
        AUTHOR = "Wolfgang Bein and Marek Chrobak and Lawrence L. Larmore",
        TITLE = "The 3-server problem in the plane",
        JOURNAL = tcs,
        VOLUME = "287",
        YEAR = 2002,
	PAGES = "387--391"
        }

@article{BeFlLa00,
	AUTHOR = "Wolfgang Bein and Rudolph Fleischer and Lawrence L. Larmore",
	TITLE = "Limited bookmark randomized online algorithms
			for the paging problem",
	JOURNAL = ipl,
	VOLUME = "76",
	PAGES = "155--162",
	YEAR = 2000
	}

@inproceedings{BeIwLN05,
  author    = {Wolfgang W. Bein and Kazuo Iwama and
               Lawrence L. Larmore and John Noga},
  title     = {The Delayed $k$-Server Problem},
  booktitle = FCT05,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "3623",
  year      = 2005,
  pages     = {281--292},
}

@article{BeGaPW96,
        AUTHOR = "Jozsef Bekesi and Gabor Galambos and Ulrich Pferschy 
                  and Gerhard J. Woeginger",
        TITLE = "The Fractional Greedy Algorithm for Data Compression",
        JOURNAL = Computing,
        VOLUME = "56",
        YEAR = 1996,
        PAGES = "29-46",
        }
 
 
@article{Belady66,
	AUTHOR = "Laszlo A. Belady",
	TITLE = "A study of replacement algorithms for virtual storage 
		computers",
	JOURNAL = IBMsys,
	VOLUME = "5",
	PAGES = "78-101",
	YEAR = 1966,
	}

@article{BelGup93,
	AUTHOR = "Jim Bell and Gopal Gupta",
	TITLE = "Evaluation of self-adjusting binary search tree techniques",
	JOURNAL = SoftwarePE,
	VOLUME = 23,
	YEAR = 1993,
	PAGES = "369-382",
	}

@article{BelKul93,
	AUTHOR = "Timothy Bell and David Kulp",
	TITLE = "Longest-match string searching for 
                 {Z}iv-{L}empel compression",
	JOURNAL = SoftwarePE,
	VOLUME = 23,
	PAGES = "757-771",
	YEAR =1993,
	}

@article{Bellma55,
	AUTHOR = "Richard Bellman",
	TITLE = "Equipment replacement policy",
	YEAR = 1955,
	JOURNAL = "J. of the SIAM",
	VOLUME = 3,
	PAGES = "133-136"
	}

@article{Bellma63,
        AUTHOR = "Richard Bellman",
        TITLE = "An optimal search problem",
        JOURNAL = "SIAM Review",
        VOLUME = "5",
        YEAR = "1963",
        PAGES = "274"
        }

@article{BenBor94,
	AUTHOR = "Shai Ben-David and Allan Borodin",
	TITLE = "A new measure for the study of on-Line algorithms",
	KEY = "On-line algorithms, Competitive analysis",
	JOURNAL = Algorithmica,
	YEAR = 1994,
	VOLUME = "11",
	PAGES = "73-91",
	}

@inproceedings{BeBKTW90,
        AUTHOR = "Shai Ben-David and Allan Borodin and Richard M. Karp and 
		Gabor Tardos and Avi Widgerson",
        TITLE = "On the power of randomization in on-line algorithms",
        BOOKTITLE = STOC90,
	ORGANIZATION = "ACM",
        YEAR =  1990,
        PAGES = "379-386",
        }

@article{BeBKTW94,
    	AUTHOR = "Shai Ben-David and Allan Borodin and Richard M. Karp and 
		Gabor Tardos and Avi Wigderson",
    	TITLE = "On the power of randomization in on-line algorithms",
	JOURNAL = Algorithmica,
    	VOLUME = "11",
    	PAGES = "2-14",
    	YEAR = 1994
    	}

@inproceedings{BeChMu98,
	AUTHOR = "Michael A. Bender and Soumen Chakrabarti and
		  S. Muthukrishnan",
	TITLE = "Flow and stretch metrics for scheduling continuous
		 job streams",
	BOOKTITLE = SODA98,
	ORGANIZATION = "ACM/SIAM",
	YEAR = "1998",
	PAGES = "270-279"
}

@inproceedings{BeMuRa02,
	AUTHOR = "Michael A. Bender and S. Muthukrishnan and 
		  Rajmohan Rajaraman",
	TITLE = "Improved algorithms for stretch scheduling",
	BOOKTITLE = SODA02,
	ORGANIZATION = "ACM/SIAM",
	YEAR = "2002",
	PAGES = "762-771"
}

@inproceedings{BenSlo94,
        AUTHOR = "Michael A. Bender and Donna K. Slonim",
        TITLE = "The power of team exploration: {Two} robots can learn
		unlabeled directed graphs",
        BOOKTITLE = FOCS94,
	ORGANIZATION = "IEEE",
        YEAR =  1994,
        PAGES = "75-85"
        }

@inproceedings{BeClLe90,
	AUTHOR = "Jon L. Bentley and  Kenneth L. Clarkson and David B. Levine",
	TITLE = "Fast linear expected-time algorithms for computing maxima
		and convex hulls",
	BOOKTITLE = SODA90,
	ORGANIZATION = "ACM/SIAM",
	PAGES = "179-187",
	YEAR = 1990
	}

@inproceedings{BeJoLM83,
        AUTHOR = "Jon L. Bentley and David S. Johnson and Frank T. Leighton
                  and Catherine C. McGeoch",
        TITLE = "An experimental study of bin packing",
        BOOKTITLE = "Proc. 21st Allerton Conf. on Communication,
                  Control, and Computing",
        YEAR = 1983,
        PAGES = "51-60",
        }

@inproceedings{BeJLMM84,
        AUTHOR = "Jon L. Bentley and David S. Johnson and Frank T. Leighton
                  and Catherine C. McGeoch and Lyle A. McGeoch",
        TITLE = "Some unexpected expected behavior results for bin packing",
        BOOKTITLE = STOC84,
	ORGANIZATION = "ACM",
        YEAR = 1984,
        PAGES = "279-288",
        }

@article{BenMcG85,
	AUTHOR = "Jon L. Bentley and Catherine C. McGeoch",
	TITLE = "Amortized analyses of self-organizing sequential 
		search heuristics",
	JOURNAL = cacm,
	VOLUME = "28",
	YEAR = 1985,
	PAGES = "404-411"
	}

@inproceedings{BenSax77,
        AUTHOR = "Jon Bentley and James Saxe",
        TITLE = "An Analysis of Two Heuristics for the Euclidean Traveling
                Salesman Problem",
        BOOKTITLE = "Proc. Allerton Conference on Communication,
                Control, and Computing",
        YEAR = 1980,
        PAGES = "41-49"
        }

@article{BeSlTW86,
    	AUTHOR = "Jon L. Bentley and Daniel Sleator and Robert E. Tarjan 
		and Victor K. Wei",
    	TITLE = "A locally adaptive data compression scheme",
    	JOURNAL = cacm,
    	VOLUME = "29",
    	PAGES = "320-330",
    	YEAR = 1986
    	}

@article{BBCDWW98,
  AUTHOR = {S. Blake and D. Black and M. Carlson and E. Davies and Z. Wang and W. Weiss},
  TITLE = {An architecture for Differentiated Services. {Internet RFC 2475}},
  YEAR = 1998,
}

@inproceedings{BBFKRS96,
        AUTHOR = "Piotr Berman and Avrim Blum and Amos Fiat and 
		Howard Karloff and Adi Ros\'en and Michael Saks",
        TITLE = "Randomized robot navigation algorithms",
        BOOKTITLE = SODA96,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 1996,
        PAGES = "75-84"
        }

@inproceedings{BeChKa97,
	AUTHOR = "Piotr Berman and Moses Charikar and Marek Karpinski",
	TITLE = "On-line load balancing for related machines",
	BOOKTITLE = WADS97,
	YEAR = 1997,
        PAGES = "116-125",
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "1272"
	}

@article{BeChKa00,
	AUTHOR = "Piotr Berman and Moses Charikar and Marek Karpinski",
	TITLE = "On-line load balancing for related machines",
         JOURNAL = Jalg,
         VOLUME = 35,
         YEAR = 2000,
         PAGES = "108-121"
         }

@article{BerCou99,
        AUTHOR = "Piotr Berman and Chris Coulston",
        TITLE = "Speed is More Powerful than Clairvoyance",
         JOURNAL = "Nordic J. Comput.",
         VOLUME = 6,
         NUMBER=2,
         YEAR = 1999,
         PAGES = "181-193"
         }



@inproceedings{BerCou97,
        AUTHOR = "Piotr Berman and Chris Coulston",
        TITLE = "On-line Algorithms for Steiner Tree Problems",
        BOOKTITLE = STOC97,
	ORGANIZATION = "ACM",
        YEAR = 1997,
        PAGES = "344-353"
        }

@inproceedings{BeKaTa90,
        AUTHOR = "Piotr Berman and Howard Karloff and Gabor Tardos",
        TITLE = "A competitive algorithm for three servers",
        BOOKTITLE = SODA90,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 1990,
        PAGES = "280-290"
        } 

@techreport{BerKar94,
        AUTHOR = "Piotr Berman and Marek Karpinski",
        TITLE = "Randomized Navigation to a Wall through Convex Obstacles",
        YEAR = 1994,
        INSTITUTION = "Bonn University",
	NOTE= "Tech. Rep. 85118-CS",
        }

@article{BerDas00,
        AUTHOR = {Piotr Berman and Bhaskar DasGupta},
        TITLE = {Multi-phase algorithms for throughput maximization for 
                        real-time scheduling},
        JOURNAL = {Journal of Combinatirial Optimization},
        VOLUME = {4},
        YEAR = 2000,
        PAGES = {307--323}
        }

@inproceedings{BerDas05,
        AUTHOR = "Piotr Berman and Surajit K. Das",
        TITLE = "On the vehicle routing problem",
        BOOKTITLE = WADS05,
        YEAR = "2005",
        PAGES = "360--371"
	}

@inproceedings{BerDas05b,
  author    = {Piotr Berman and Bhaskar DasGupta},
  title     = {Approximating the Online Set Multicover Problems
                 via Randomized Winnowing.},
  booktitle = WADS05,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "3608",
  year      = 2005,
  pages     = {110--121},
}

@inproceedings{BeGrRa93,
        AUTHOR = "Marshall Bern and Daniel Greene and Arvind Raghunathan",
        TITLE = "On-line algorithms for cache sharing",
        BOOKTITLE = STOC93,
	ORGANIZATION = "ACM",
        YEAR = 1993,
        PAGES = "422-430"
	}

@article{BeGrRS94,
        AUTHOR = "Marshall Bern and Daniel H. Greene and Arvind Raghunathan 
		and Madhu Sudan",
        TITLE = "On-line algorithms for locating checkpoints",
	JOURNAL = Algorithmica,
        VOLUME = "11",
        YEAR = 1994,
        PAGES = "33-52"
	}

@article{BhaMos94,
        AUTHOR = "Neeraj Bhatnagar and Jack Mostow",
        TITLE = "On-line learning from search failures",
	JOURNAL = ML,
        VOLUME = "15",
        YEAR = 1994,
        PAGES = "69-117"
	}

@inproceedings{BieHei05,
  author    = {Marcin Bienkowski and
               Friedhelm Meyer auf der Heide},
  title     = {Page Migration in Dynamic Networks},
  booktitle = MFCS05,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "3618",
  year      = 2005,
  pages     = {1--14},
}

@inproceedings{BiDyKo05,
  author    = {Marcin Bienkowski and Miroslaw Dynia and
               Miroslaw Korzeniowski},
  title     = {Improved Algorithms for Dynamic Page Migration},
  booktitle = STACS05,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "3404",
  year      = 2005,
  pages     = {365--376},
}

@article{Bitner79,
    	AUTHOR = "James R. Bitner",
    	TITLE = "Heuristics that dynamically organize data structures",
         JOURNAL = Sicomp,
    	VOLUME = "8",
    	PAGES = "82-110",
    	YEAR = 1979
    	}

@inproceedings{BlGuWe89,
	AUTHOR = "David Black and Anoop Gupta and Wolf-Dietrich Weber",
	TITLE = "Competitive management of distributed shared memory",
	BOOKTITLE = "Proc. Spring Compcon, IEEE Computer Society",
	YEAR = 1989,
	PAGES = "184-190"
	}

@techreport{BlaSle89,
	AUTHOR = "David L. Black and Daniel D. Sleator",
	TITLE = "Competitive algorithms for replication
		 and migration problems",	
	NUMBER = "CMU-CS-89-201",
	INSTITUTION = "Department of Computer Science, 
	Carnegie-Mellon University",
	YEAR = 1989
	}

@article{Blackw56,
	AUTHOR = "D. Blackwell",
	TITLE = "An Analog of the Minimax Theorem for Vector Payoffs",
	YEAR = 1956,
	JOURNAL = PacifJ,
	VOLUME = 6,
	PAGES = "1-8"
	}

@unpublished{BlVlWo96,
         AUTHOR = "David Blitz and Andre van Vliet and Gerhard J. Woeginger",
         TITLE = "Lower bounds on the asymptotic worst-case ratio of online 
                  bin packing algorithms",
         NOTE = "Unpublished manuscript",
         YEAR = 1996,
        }

@article{Blum92,
	AUTHOR = "Avrim Blum",
	TITLE = "Learning Boolean Functions in an Infinite Attribute Space",
	JOURNAL = ML,
	VOLUME = 9,
	YEAR = 1992,
	PAGES = "373-386"
	}

@article{Blum94,
	AUTHOR = "Avrim Blum",
	TITLE = "Separating Distribution-Free and Mistake-Bound
                 Learning Models over the Boolean Domain",
         JOURNAL = Sicomp,
	PAGES = "990-1000",
	VOLUME = 23,
	YEAR = 1994
	}

@inproceedings{Blum95,
	AUTHOR = "Avrim Blum",
	TITLE = "Empirical support for {W}innow and {W}eighted-{M}ajority
              based algorithms: {Results} on a calendar scheduling domain", 
	BOOKTITLE = "Proc. 12th International Conference on Machine Learning", 
	PAGES = "64-72", 
	YEAR = 1995
	}

@inproceedings{BluBur97,
	AUTHOR = "Avrim Blum and C. Burch",
	TITLE = "On-line learning and the metrical task system problem",
	BOOKTITLE = COLT97,
	ORGANIZATION = "ACM",
	PAGES = "45-53",
	YEAR = 1997
	}

@inproceedings{BluCha93,
         AUTHOR = "Avrim Blum and Prasad Chalasani",
         TITLE = "An on-line algorithm for improving performance in navigation",
         BOOKTITLE = FOCS93,
	ORGANIZATION = "IEEE",
         YEAR = 1993,
         PAGES = "2-11",
         }

@techreport{BCCPRS95,
	AUTHOR = "Avrim Blum and Prasad Chalasani and Don Coppersmith
         and Bill Pulleyblank and Prabhakar Raghavan and Madhu Sudan",
	TITLE = "The minimum latency problem",
	YEAR = 1995,
	INSTITUTION = "IBM",
	}

@inproceedings{BCCPRS94,
        AUTHOR = "Avrim Blum and Prasad Chalasani and Don Coppersmith
         and Bill Pulleyblank and Prabhakar Raghavan and Madhu Sudan",
        TITLE = "The minimum latency problem",
        BOOKTITLE = STOC94,
	ORGANIZATION = "ACM",
	PAGES = "163-171",
        YEAR = 1994,
        }

@article{BiaRic82,
        AUTHOR = "L. Bianco and S. Ricciardelli",
        TITLE = "Scheduling of a single machine to minimize total weight
	         completion time subject to relwase dates",
        JOURNAL = naval,
        VOLUME = "29",
        YEAR = 1982,
        PAGES = "151-167",
        }

@article{BlHeLi95,
	AUTHOR = "Avrim Blum and  Lisa Hellerstein and Nick Littlestone",
	TITLE = "Learning in the presence of finitely or infinitely
                 many irrelevant attributes",
	JOURNAL = jcss,
	VOLUME = 50,
	YEAR = 1995,
	PAGES = "32-40"
	}

@inproceedings{BluKal97,
	AUTHOR = "Avrim Blum and A. Kalai",
	TITLE = "Universal portfolios with and without transaction costs",
	BOOKTITLE = COLT97,
	ORGANIZATION = "ACM",
	PAGES = "309-313",
	YEAR = 1997
	}

@inproceedings{BlKaRS92,
        AUTHOR = "Avrim Blum and Howard Karloff and Yuval Rabani and 
		Michael Saks",
        TITLE = "A decomposition theorem and lower bounds for randomized
               server problems",
        BOOKTITLE =  FOCS92,
	ORGANIZATION = "IEEE",
        YEAR = 1992,
        PAGES = "197-207",
        }

@article{BlKaRS00,
        AUTHOR = "Avrim Blum and Howard Karloff and Yuval Rabani and 
		Michael Saks",
        TITLE = "A decomposition theorem and lower bounds for randomized
               server problems",
        YEAR = 2000,
	JOURNAL = sicomp,
	VOLUME = 30,
        PAGES = "1624-1661",
        }

@unpublished{BluKar96,
        AUTHOR = "Avrim Blum and David Karger",
        TITLE = "An $\tilde{O}(n^{3/14})$-coloring for 3-colorable graphs.",
        NOTE= "Manuscript",
        YEAR = 1996
        }

@inproceedings{BlRaSc92,
	AUTHOR = "Avrim Blum and Prabhakar Raghavan and Baruch Schieber",
	TITLE = "Navigating in Unfamiliar Geometric Terrain",
	EDITOR = "Lyle A. McGeoch and Daniel D. Sleator",
	PAGES = "151-156",
	EDITOR = "Lyle A. McGeoch and Daniel D. Sleator",
	VOLUME = "7",
	SERIES = "DIMACS Series in Discrete Mathematics and Theoretical
                  Computer Science",
	BOOKTITLE = "On-line Algorithms",
	YEAR = 1992,
	ORGANIZATION = "AMS/ACM",
	}

@inproceedings{BlRaSc91A,
        AUTHOR = "Avrim Blum and Prabhakar Raghavan and Baruch Schieber",
        TITLE = "Navigation in unfamiliar terrain",
        BOOKTITLE = STOC91,
	ORGANIZATION = "ACM",
        PAGES = "494-504",
        YEAR = 1991
        }

@article{BlRaSc97,
	AUTHOR = "Avrim Blum and Prabhakar Raghavan and Baruch Schieber",
	TITLE = "Navigating in unfamiliar geometric terrain",
         JOURNAL = Sicomp,
	VOLUME = "26",
	YEAR = 1997,
	PAGES = "110-137"
	}

@inproceedings{BlBuKa99,
        AUTHOR = "Avrim Blum and Carl Burch and Adam Kalai",
        TITLE = "Finely-competitive paging",
	BOOKTITLE = FOCS99,
	ORGANIZATION = "IEEE",
        YEAR = 1999,
        PAGES = "450-458"
        }

@inproceedings{BlKuRW03,
  author    = {Avrim Blum and Vijay Kumar and Atri Rudra and Felix Wu},
  title     = {Online learning in online auctions},
  booktitle = SODA03,
	ORGANIZATION = "ACM/SIAM",
  year      = 2003,
}

@inproceedings{BluHar05,
  author    = {Avrim Blum and Jason D. Hartline},
  title     = {Near-optimal online auctions},
  booktitle = SODA05,
	ORGANIZATION = "ACM/SIAM",
  year      = 2005,
  pages     = {1156--1163},
}

@article{Board92,
        AUTHOR = "Raymond Board",
        TITLE = "The online graph bandwidth problem",
        JOURNAL = InfComp,
        VOLUME = "100",
        YEAR = 1992,
        PAGES = "178-201"
	}

@article{Bodlan91,
	AUTHOR = "Hans L. Bodlaender",
	TITLE = "On the complexity of some coloring games",
	JOURNAL = IntFoun,
	VOLUME = "2",
	YEAR = 1991,
	PAGES = "133-147"
	}

@inproceedings{Bodlan92,
	AUTHOR = "Hans L. Bodlaender",
	TITLE = "Kayles on special classes of graphs --- an application of
	         Sprague-Grundy theory",
	BOOKTITLE = "Proc. 18th Workshop on Graph-Theoretic Concepts
		 in Computer Science (WG)",
	YEAR = 1993,
  	PAGES = "90-102",
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "790",
	}

@article{Bodlan93,
	AUTHOR = "Hans L. Bodlaender",
	TITLE = "Complexity of path-forming games",
	JOURNAL = tcs,
	VOLUME = "110",
	YEAR = 1993,
	PAGES = "215-245"
	}

@article{BodKra92,
	AUTHOR = "Hans L. Bodlaender and Dieter Kratsch",
	TITLE = "The complexity of coloring games on perfect graphs",
	JOURNAL = tcs,
	VOLUME = "106",
	YEAR = 1992,
	PAGES = "309-326"
	}

@article{BoDSTY92,
        AUTHOR = "Jean-Daniel Boissonnat and Olivier Devillers and 
		Rene Schott and Monique Teillaud and Mariette Yvinec",
        TITLE = "Applications of random sampling to online algorithms in 
		computational geometry",
        JOURNAL = DisComGeo,
        VOLUME = "8",
        YEAR = 1992,
        PAGES = "51-71"
	}

@unpublished{BopFlo97,
	AUTHOR = "Ravi Boppana and Aris Floratos",
	TITLE = "Load balancing in the {E}uclidean norm",
	NOTE= "Manuscript",
	YEAR = 1997
	}

@techreport{Borm95,
	AUTHOR = "Karin Borm",
	TITLE = "Entwicklung eines {O}ptimierungsverfahrens zur
                {F}ahrzeug- und {B}etriebshofdisposition",
	INSTITUTION = "Institut f{\"u}r Fabrikbetriebslehre und
                Unternehmensforschung - TU Braunschweig",
	YEAR = 1995,
	SERIES = " ",
	}

@book{BorElY98,
        AUTHOR = "Allan Borodin and Ran El-Yaniv",
        TITLE = "Online Computation and Competitive Analysis",
        PUBLISHER = "Cambridge University Press",
        YEAR = 1998,
        }

@inproceedings{BoIrRS91,
        AUTHOR = "Allan Borodin and Sandy Irani and Prabhakar Raghavan and 
		Baruch Schieber",
        TITLE = "Competitive paging with locality of reference",
        BOOKTITLE = STOC91,
	ORGANIZATION = "ACM",
        YEAR = 1991,
        PAGES = "249-259",
        }

@article{BoIrRS95,
        AUTHOR = "Allan Borodin and Sandy Irani and Prabhakar Raghavan and 
		Baruch Schieber",
        TITLE = "Competitive paging with locality of reference",
        JOURNAL = jcss,
	VOLUME = "50",
	YEAR = 1995,
	PAGES = "244-258" 
        }

@inproceedings{BoKRSW96,
	AUTHOR = "Allan Borodin and Jon Kleinberg and Prabhakar Raghavan 
		and Madhu Sudan and David P. Williamson",
	TITLE = "Adversarial queueing theory",
	BOOKTITLE = STOC96,
	ORGANIZATION = "ACM",
        PAGES = "376-385",
	YEAR = 1996
	}

@inproceedings{BoLiSa87,
        AUTHOR = "Allan Borodin and Nathan Linial and Michael Saks",
        TITLE = "An optimal online algorithm for metrical task systems",
        BOOKTITLE = STOC87,
	ORGANIZATION = "ACM",
        YEAR = 1987,
        PAGES = "373-382"
        }

@article{BoLiSa92,
        AUTHOR = "Allan Borodin and Nathan Linial and Michael Saks",
        TITLE = "An optimal online algorithm for metrical task system",
   	JOURNAL = jacm,
        VOLUME = "39",
        YEAR = 1992,
        PAGES = "745-763"
	}

@inproceedings{BEFKLP05,
  author    = {Joan Boyar and Leah Epstein and Lene M. Favrholdt and
               Jens S. Kohrt and Kim S. Larsen
                  and Morten Monrad Pedersen and Sanne W{\o}hlk},
  title     = {The Maximum Resource Bin Packing Problem},
  booktitle = FCT05,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "3618",
  year      = 2005,
  pages     = {397--408},
}

@inproceedings{BoFaLa05,
  author    = {Joan Boyar and Lene M. Favrholdt and Kim S. Larsen},
  title     = {The relative worst order ratio applied to paging},
  booktitle = SODA05,
	ORGANIZATION = "ACM/SIAM",
  year      = 2005,
  pages     = {718--727},
}

@inproceedings{Breima61,
	AUTHOR = "L. Breiman",
	TITLE = "Optimal Gambling Systems for Favorable Games",
	YEAR = 1961,
	VOLUME = 1,
	PAGES = "65-78",
	BOOKTITLE = "Proc. 4th Berkeley Symp. on Mathematical Statistics 
		and Probability",
	PUBLISHER = "Univ. of California Press, Berkeley"
	}

@article{Bresla92,
        AUTHOR = "Dany Breslauer",
        TITLE = "An on-line string superprimitivity test",
     	JOURNAL = ipl,
        VOLUME = "44",
        YEAR = 1992,
        PAGES = "345-347"
	}

@inproceedings{Bresla96,
        AUTHOR = "Dany Breslauer",
        TITLE = "On competitive on-line paging with lookahead.",
        BOOKTITLE = STACS96,
        PUBLISHER = "Springer",
        SERIES = LNCS,
	VOLUME = "1046",
        YEAR = 1996,
        PAGES = "593-603"
	}

@inproceedings{BrKoVa04,
        AUTHOR = "Carlos Brito and Elias Koutsoupias and Shailesh Vaya",
        TITLE = "Competitive analysis of organization networks or multicast
                 acknowledgement: {H}ow much to wait?",
        BOOKTITLE = SODA04,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 2004,
	PAGES = "627-635"
        }

@book{Brown71,
        AUTHOR = "A. R. Brown",
        TITLE = "Optimum packing and Depletion",
        PUBLISHER = "American Elsevier",
        YEAR = 1971,
        ADDRESS= "New York",
        }

@techreport{Brown79,
        AUTHOR = "Donna J. Brown",
        TITLE = "A lower bound for on-line one-dimensional 
                 bin packing algorithms",       
        NUMBER = "R-864",
        INSTITUTION = "Coordinated Sci. Lab., Urbana, Illinois",
        YEAR = 1979
        }

@article{BrBaKa82,
         AUTHOR = "Donna J. Brown and Brenda S. Baker and Howard P. Katseff",
         TITLE = "Lower bounds for two-dimensional packing algorithms",
         JOURNAL = actinf,
         VOLUME = "8",
         YEAR = 1982,
         PAGES = "207-225",
         }

@article{BruDow85,
         AUTHOR = "John L. Bruno and Peter J. Downey",
         TITLE = "Probabilistic bounds for dual bin packing",
         JOURNAL = actinf,
         VOLUME = "22",
         YEAR = 1985,
         PAGES = "333-345",
         }

@mastersthesis{Brzust92,
         AUTHOR = "John Brzustowski",
         TITLE = "Can you win at TETRIS?",
         SCHOOL = "The University of British Columbia",
         YEAR = 1992,
         }

@inproceedings{BsZhHo94,
        AUTHOR = "Nader H. Bshouty and Zhixiang Chen and Steven Homer",
        TITLE = "On learning discretized geometric concepts",
        BOOKTITLE = FOCS94,
	ORGANIZATION = "IEEE",
        YEAR = 1994,
        PAGES = "54-63"
	}

@inproceedings{BucNao05,
  author    = {Niv Buchbinder and Joseph Naor},
  title     = {Online Primal-Dual Algorithms for Covering and
                         Packing Problems},
  booktitle = ESA05,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "3669",
  year      = 2005,
  pages     = {689--701},
}

@inproceedings{BucNao06,
 author = {Niv Buchbinder and Joseph (Seffit) Naor},
 title = {Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach},
 booktitle = FOCS06,
	ORGANIZATION = "IEEE",
 year = {2006},
 pages = {293--304},
 }

@techreport{Burgie96,
        AUTHOR = "Heide Burgiel",
        TITLE = "How to lose at TETRIS",
        INSTITUTION = "The Geometry Center, Minneapolis, MN",
        YEAR = 1996,
        }

@techreport{Burley93,
        AUTHOR = "William Burley",
        TITLE = "Traversing layered graphs using the work
                function algorithm",
        NUMBER = "CS93-319",
        INSTITUTION = "Department of Computer Science and
                Engineering, University of California at
                San Diego",
        YEAR = 1993
        }

@article{Burley96,
        AUTHOR = "William R. Burley",
        TITLE = "Traversing layered graphs using the work function algorithm",
         JOURNAL = Jalg,
        VOLUME = "20",
        YEAR = 1996,
        PAGES = "479-511"
	}

@techreport{Burley94A,
        AUTHOR = "William Burley",
        TITLE = "Toward an optimal online algorithm for
		layered graph traversal",
        NUMBER = "CS94-382",
        INSTITUTION = "Department of Computer Science and
                Engineering, University of California at
                San Diego",
        YEAR = 1994
        }

@unpublished{Burley94B,
        AUTHOR = "William Burley",
        TITLE = "Exploring-backtracing games and an
			application to layered graph traversal",
	NOTE = "Unpublished manuscript",
        YEAR = 1994,
	}

@inproceedings{BurIra95,
        AUTHOR = "William R. Burley and Sandy Irani",
	TITLE = "On Algorithm Design for Metrical Task Systems",
	BOOKTITLE = SODA95,
	ORGANIZATION = "ACM/SIAM",
	PAGES = "420-429",
	YEAR = 1995
	}

@techreport{BurWhe94,
	AUTHOR = "M. Burrows and D. J. Wheeler",
	TITLE = "A block-sorting lossless data compression algorithm",
	INSTITUTION = "DEC SRC",
	NUMBER = "124",
	YEAR = 1994
	}

@article{BurKin73,
         AUTHOR =  "P. J. Burville and J. F. C. Kingman",
         TITLE = "On a model for storage and search",
         JOURNAL = JAppProb,
         VOLUME = "10",
         PAGES = "697-701",
         YEAR = 1973,
         } 

%CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC%

@article{CaCoFl85,
         AUTHOR = "A. R. Calderbank and Edward G. Coffman and Leopold Flatto",
         TITLE = "Sequencing problems in two-server systems",
         JOURNAL = MOR,
         VOLUME = "10",
         YEAR = 1985,
         PAGES = "585-598"
         }

@inproceedings{CaFeFK96,
	 AUTHOR = "G. Calinescu and C. Fernandes and U. Finkler 
		and Howard Karloff",
	 TITLE = "A Better approximation algorithm for finding 
		planar subgraphs",
         BOOKTITLE = SODA96,
	ORGANIZATION = "ACM/SIAM",
         YEAR = 1996,
         PAGES = "16-25"
         }

@inproceedings{CanIra95,
        AUTHOR = "Ran Canetti and Sandy Irani",
        TITLE = "Bounding the power of preemption in randomized scheduling",
        BOOKTITLE = STOC95,
	ORGANIZATION = "ACM",
        YEAR = 1995,
        PAGES = "616-615"
        }

@inproceedings{CaFeLi94,
        AUTHOR = "Pei Cao and Edward W. Felten and Kai Li",
        TITLE = "Application-controlled file caching policies",
        BOOKTITLE = "Proc. for the Summer USENIX Conference",
        YEAR = 1994,
	}

@techreport{CaoIra97,
        AUTHOR = "Pei Cao and Sandy Irani",
        TITLE = "Cost-Aware {WWW} Proxy Caching Algorithms",
        INSTITUTION = "1343, Dept. of Computer Sciences, 
            University of Wisconsin-Madison",
        YEAR = 1997,
	}

@Article{Carlie81,
	author = "Jacques Carlier",
	title = "Probl{\`e}mes d'ordonnancement {\`a} dur{\'e}es \'egales",
	journal = "QUESTIO",
	year = 1981,
	volume = 5,
	number = 4,
	pages = {219--228}
}

@inproceedings{CaDFGR98,
	author = "R. C\`{a}ceres and F. Douglis and A. Feldmann and
		G. Glass and M. Rabinovich", 
	title = "Web proxy caching: {The} devil is in the details",
	year = 1998,
	booktitle = "Proc. of the ACM SIGMETRICS Workshop on Internet
		 Server Performance" 
	}

@book{Carolu91,
	AUTHOR = "Gabriele Carolus",
	TITLE = "Verfahren zur Optimierung des Rangierbetriebs",
	PUBLISHER = "VDI Verlag D{\"u}sseldorf",
	YEAR = 1991,
	}

@inproceedings{CeFrHW94,
	AUTHOR = "Nicolo Cesa-Bianchi and Yoav Freund and David P. Helmbold 
		and M. Warmuth",
	TITLE = "On-line Prediction and Conversion Strategies",
	BOOKTITLE = "Computational Learning Theory: {Eurocolt} '93",
	YEAR = 1994,
	PAGES = "205-216",
	ISBN = "0 19 853492 2",
	PUBLISHER = "Oxford University Press",
	ADDRESS = "Oxford",
	SERIES = "The Institute of Mathematics and its Applications
                 Conference Series",
	VOLUME = "New Series Number 53",
	}

@inproceedings{CFHHSW93,
	AUTHOR = "Nicolo Cesa-Bianchi and Yoav Freund and David P. Helmbold and
		 David Haussler and Robert E. Schapire and Manfred K. Warmuth",
	TITLE = "How to use Expert Advice",
	BOOKTITLE = STOC93,
	ORGANIZATION = "ACM",
	YEAR = 1993,
	PAGES = "382-391"
	}

@inproceedings{CPSSSW96,
        AUTHOR = "Soumen Chakrabarti and Cynthia A. Phillips and 
		A. S. Schulz and David B. Shmoys and C. Stein and Joel Wein",
        TITLE = "Improved scheduling algorithms for minsum criteria",
	BOOKTITLE = ICALP96,
        YEAR = 1996,
        PAGES = "646-657",
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "1099"
        }

@inproceedings{ChaLam91,
        AUTHOR = "{Kwong-Fai} Chan and {Tak-Wah} Lam",
        TITLE = "An online algorithm for navigating in unknown terrain",
        BOOKTITLE = ISAAC91,
        PAGES = "127-136",
        YEAR = 1991
	}

@inproceedings{ChLaTo04,
        AUTHOR = "{Ho-Leung} Chan and {Tak-Wah} Lam and {Kar-Keung} To",
        TITLE = "Non-migratory online deadline scheduling on multiprocessors",
        BOOKTITLE = SODA04,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 2004,
	PAGES = "970-979"
        }

@inproceedings{ChLaWo05,
  author    = {Wun-Tat Chan and Tak Wah Lam and Prudence W. H. Wong},
  title     = {Dynamic Bin Packing of Unit Fractions Items},
  booktitle = ICALP05,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "3570",
  year      = 2005,
  pages     = {614--626},
}

@inproceedings{ChaZar06,
  	author    = {Timothy M. Chan and Hamid Zarrabi-Zadeh},
  	title     = {A Randomized Algorithm for Online Unit Clustering},
  	booktitle = {WAOA06},
  	year      = {2006},
  	pages     = {121--131}
}

@inproceedings{ChChYZ07,
  author    = {Joseph Wun-Tat Chan and Francis Y. L. Chin and Deshi Ye and Yong Zhang},
  title     = {Online frequency allocation in cellular networks},
  booktitle = SPAA07,
  year      = {2007},
  pages     = {241--249}
}

@inproceedings{ChHaMo98,
        AUTHOR = "Moses Charikar and Dan Halperin and Rajeev Motwani",
	TITLE = "The dynamic servers problem",
	BOOKTITLE = SODA98,
	ORGANIZATION = "ACM/SIAM",
	YEAR = 1998,
	PAGES = "410-419"
	}

@inproceedings{ChChFM97,
        title = "Incremental clustering and dynamic information retrieval",
        author = "M.~Charikar and C.~Chekuri and T.~Feder and R.~Motwani",
        BOOKTITLE = stoc97,
        organization={ACM},
        YEAR = 1997,
        PAGES = "626--635"
}

@article{ChChFM04,
 	author = {Moses Charikar and Chandra Chekuri and Tomas Feder and Rajeev Motwani},
 	title = {Incremental Clustering and  Dynamic Information Retrieval},
 	journal = SICOMP,
 	volume = {33},
 	number = {6},
 	year = {2004},
 	pages = {1417--1440}
}

@article{ChaHof93,
	AUTHOR = "R. Chaudhuri and H. Hoft",
	TITLE = "Splaying a search tree in preorder takes linear time",
	JOURNAL = Sigactnews,
	VOLUME = 24,
	PAGES = "88-93",
	YEAR = 1993,
	}

@article{ChaLam93,
	AUTHOR = "{Kwong-Fai} Chan and Tak Wah Lam", 
	TITLE = "An on-line algorithm for navigating in an
            unknown environment", 
	JOURNAL = IntComGeo,
	VOLUME = 3, 
	YEAR = 1993, 
	PAGES = "227-244"
	}

@inproceedings{ChLaTW01,
        AUTHOR = "Wun-Tao Chan and Tak-Wah Lam and Hing-Fung Ting and Wai-Ha Wong",
        TITLE = "Improved on-line stream merging: {From} a restricted to a general
			setting",
        BOOKTITLE = COCOON01,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = 2108,
        YEAR = 2001,
        PAGES = "432--442"
        }

@inproceedings{ChLaLW05,
  author    = {Wun-Tat Chan and Tak-Wah Lam and Kin-Shing Liu and
               Prudence W. H. Wong},
  title     = {New Resource Augmentation Analysis of the Total Stretch
               of SRPT and SJF in Multiprocessor Scheduling},
  booktitle = MFCS05,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "3618",
  year      = 2005,
  pages     = {236-247},
}

@inproceedings{CCLLMW07,
  author    = {Ho-Leung Chan and Wun-Tat Chan and Tak Wah Lam and
               Lap-Kei Lee and Kin-Sum Mak and Prudence W. H. Wong},
  title     = {Energy efficient online deadline scheduling},
  booktitle = SODA07,
  year      = {2007},
  pages     = {795--804}
}

@article{Chandr92,
        AUTHOR = "B. Chandra",
        TITLE = "Does randomization help in online bin packing?",
     	JOURNAL = ipl,
        VOLUME = "43",
        YEAR = 1992,
        PAGES = "15-19",
        }

@inproceedings{Chandr96,
        AUTHOR = "T. Chandra",
        TITLE = "Polylog randomized wait-free consensus.",
        BOOKTITLE = PODC96,
	ORGANIZATION = "ACM",
        YEAR = 1996,
        PAGES = "166-175"
        }

@article{ChaVis91,
        AUTHOR = "B. Chandra and Sundar Vishwanathan",
        TITLE = "Constructing Reliable Communication Networks of 
		Small Weight",
         JOURNAL = Jalg,
        VOLUME = "18",
        YEAR = 1995,
        PAGES = "159-175",      
        }

@inproceedings{ChRRST89,
	AUTHOR = "Ashok K. Chandra and Prabhakar Raghavan and
		Walter L. Ruzzo and Roman Smolensky and Prasoon Tiwari",
	TITLE = "The electrical resistance of a graph
		captures its commute and cover times",
	BOOKTITLE = STOC89,
	ORGANIZATION = "ACM",
	YEAR = "1989",
	PAGES = "574--586"
	}

@article{ChRRST97,
	AUTHOR = "Ashok K. Chandra and Prabhakar Raghavan and
		Walter L. Ruzzo and Roman Smolensky and Prasoon Tiwari",
	TITLE = "The electrical resistance of a graph
		captures its commute and cover times",
	JOURNAL = CompCompl,
        VOLUME = "6",
	YEAR = "1997",
	PAGES = "312--340"
	}
	

@article{ChWaKa93,
        AUTHOR = "Ee-Chien Chang and Weiguo Wang and Mohan S. Kankanhalli",
        TITLE = "Multidimensional online bin packing: {An} algorithm and 
                 its average-case analysis",
     	JOURNAL = ipl,
        VOLUME = "48",
        YEAR = 1993,
        PAGES = "121-125",
        }

@phdthesis{Chalas94,
        AUTHOR = "P. Chalasani",
        TITLE = "Online performance-improvement algorithms",
        SCHOOL= "CMU",
        YEAR = 1994,
        }

@inproceedings{ChaYap01,
        AUTHOR = "Ee-Chien Chang and Chee Yap",
        TITLE = "Competitive online scheduling with level of service",
        BOOKTITLE = COCOON01,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = 2108,
        YEAR = 2001,
        PAGES = "453--462",
        }

@inproceedings{ChGuTS99,
        AUTHOR =  "M. Charikar and S. Guha and E. Tardos and D. B. Shmoys",
        TITLE = "A constant factor approximation algorithm for 
	         the $k$-median problem",
        BOOKTITLE = STOC99,
	ORGANIZATION = "ACM",
        YEAR = 1999,
        PAGES = "1-10",
        }

@inproceedings{CharGu99,
        AUTHOR =  "M. Charikar and S. Guha",			
        TITLE = "Improved combinatorial algorithms for facility location 
	         and $k$-median problems",
        BOOKTITLE = FOCS99,
	ORGANIZATION = "IEEE",
        YEAR = 1999,
        }

@article{ChLoSS87,
        AUTHOR = "F. Chauny and R. Loulou and S. Sadones and F. Soumis",
        TITLE = "A two-phase heuristic for strip packing: {Algorithm} 
                 and probabilistic analysis",
        JOURNAL = orl,
        VOLUME = "6",
        YEAR = 1987,
        PAGES = "25-33",
        }

@inproceedings{ChGoKK04,
	AUTHOR = {Chandra Chekuri and Ashish Goel and Sanjeev Khanna and Amit Kumar},
	TITLE = {Multi-processor scheduling to minimize flow time with 
	         $\eps$-resource augmentation},
	BOOKTITLE = STOC04,
	ORGANIZATION = "ACM",
	YEAR = 2004,
	PAGES = {363-372}
}

@inproceedings{ChKhSh04,
	AUTHOR = {Chandra Chekuri and Sanjeev Khanna and F. Bruce Shepherd},
	TITLE = {The all-or-nothing multicommodity flow problem},
	BOOKTITLE = STOC04,
	ORGANIZATION = "ACM",
	YEAR = 2004,
	PAGES = {156-165}
}

@inproceedings{ChKhZh01,
	AUTHOR = "Chandra Chekuri and Sanjeev Khanna and An Zhu",
	TITLE = "Algorithms for weighted flow time",
	BOOKTITLE = STOC01,
	ORGANIZATION = "ACM",
	YEAR = 2001,
	PAGES = "84-93"
	}

@unpublished{ChKhKu03,
	AUTHOR = "Chandra Chekuri and Sanjeev Khanna and Amit Kumar",
         TITLE = "Multi-processor scheduling to minimize $l_p$ norms of flow and stretch",
         YEAR = 2003,
         NOTE = "Manuscript"
         }

@inproceedings{ChMoNS97,
        AUTHOR = "Chandra Chekuri and Rajeev Motwani and Balas Natarajan 
		and C. Stein",
        TITLE = "Approximation techniques for average completion time 
		scheduling",
        BOOKTITLE = SODA97,
	ORGANIZATION = "ACM/SIAM",
        YEAR = 1997,
	PAGES = "609-618"
        }

@article{ChMoNS01,
        AUTHOR = "Chandra Chekuri and Rajeev Motwani and Balas Natarajan 
		and C. Stein",
        TITLE = "Approximation techniques for average completion time 
		scheduling",
        JOURNAL = Sicomp,
        VOLUME = "22",
        YEAR = 2001,
        PAGES = "146-166"
	}

@article{ChOoNg93,
	AUTHOR = "Robert P. Cheetham and John B. Oommen and David Ng",
	TITLE = "Adaptive structuring of binary search trees using 
		conditional rotations",
	JOURNAL = IEEEknow,
	VOLUME = 5, 
	YEAR = 1993, 
	PAGES = "695-704"
	}

@inproceedings{ChOsRa01,
        AUTHOR = "Julia Chuzhoy and Rafail Ostrovsky and Yuval Rabani",
        TITLE = "Approximation algorithms for the job interval selection 
	         problem and related scheduling problems",
        BOOKTITLE = FOCS01,
	ORGANIZATION = "IEEE",
        YEAR = 2001,
        PAGES = "348-357"
        }

@article{CheVes98,
	AUTHOR = "Bo Chen and Arjen P. A. Vestjens",
	TITLE = "Scheduling on identical machines: {How} good is {LPT} in an 
		on-line setting?",
        JOURNAL = orl,
	VOLUME= "21",
	PAGES = "165-169", 
	YEAR = 1998
	}

@article{ChVeWo97,
	AUTHOR = "Bo Chen and Arjen P. A. Vestjens and Gerhard J. Woeginger",
	TITLE = "On-line scheduling of two-machine open shops where jobs 
		arrive over time",
	JOURNAL = JOCO,
	VOLUME = "1",
	PAGES = "355-365", 
	YEAR = 1997
	}

@article{ChVlWo94A,
        AUTHOR = "Bo Chen and Andre van Vliet and Gerhard J. Woeginger",
        TITLE = "New Lower and Upper Bounds for On-line Scheduling",
        JOURNAL = orl,
        VOLUME = "16",
        YEAR = 1994,
        PAGES = "221-230",
	}

@article{ChVlWo94B,
        AUTHOR = "Bo Chen and Andre van Vliet and Gerhard J. Woeginger",
        TITLE = "Lower Bounds for Randomized Online Scheduling",
     	JOURNAL = ipl,
        VOLUME = "51",
        YEAR = 1994,
        PAGES = "219-222",
        }

@techreport{ChVlWo94C,
	AUTHOR = "Bo Chen and Andr{\'e} van Vliet and Gerhard J. Woeginger",
	TITLE = "A Lower Bound for Randomized On-line Scheduling Algorithms",
	INSTITUTION = "Christian-Doppler-Laboratorium ``Diskrete Optimierung'',
                  Institu f{\"u}r Mathematik, TU Graz",
	YEAR = 1994,
	SERIES = " ",
	NUMBER = "Report 283, CDLDO-42",
	ADDRESS = "Technische Universit{\"a}t Grazm Steyrergasse 30, A-8010 
		Graz, Austria",
	}

@article{ChVlWo95,
         AUTHOR = "Bo Chen and Andre van Vliet and Gerhard J. Woeginger",
         TITLE = "An Optimal Algorithm for Preemptive On-line Scheduling",
        JOURNAL = orl,
         VOLUME = "18",
         YEAR = 1995,
         PAGES = "127-131"
         }

@incollection{CheWoe95,
         AUTHOR = "Bo Chen and Gerhard J. Woeginger",
         TITLE = "A Study of On-line Scheduling Two-Stage Shops",
         BOOKTITLE = "Minmax Problems and Applications",
         EDITOR = "Ding-Zhu Du and P. M. Pardalos",
         PUBLISHER = "Kluewer",
         YEAR = 1995,
         PAGES = "97-107",
         }         

@incollection{ChPoWo98,
         AUTHOR = "Bo Chen and C. N. Potts and Gerhard J. Woeginger",
         TITLE = "A Review of Machine Scheduling: {Complexity}, Algorithms and
		   Approximability",
         BOOKTITLE = "Handbook of Combinatorial Optimization",
	 VOLUME = 3,
         EDITOR = "Ding-Zhu Du and P. M. Pardalos",
         PUBLISHER = "Kluewer",
         YEAR = 1998,
         PAGES = "21--169"
         }         

@inproceedings{ChKaLW99,
        AUTHOR = "Gen-Huey Chen and Ming-Yang Kao 
			and Yuh-Dauh Lyuu and Hsing-Kuo Wong",
        TITLE = "Optimal buy-and-hold strategies for financial
			markets with bounded daily returns",
	BOOKTITLE = STOC99,
	ORGANIZATION = "ACM",
        YEAR = 1999,
        PAGES = "119-128"
        }

@inproceedings{ChDeSY04,
	AUTHOR = "Ning Chen and Xiaotie Deng and Xiaoming Sun and Andrew Chi-Chih Yao", 
	TITLE = "Dynamic Price Sequence and Incentive Compatibility",
	PAGES =  "320-331",
        BOOKTITLE = ICALP04,
        YEAR = 2004,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "3142"
}

@article{ChMiTh93,
        AUTHOR = "Joseph Cheriyan and Ming-Yang Kao and 
		Ramakrishna Thurimella",
        TITLE = "Scan-first search and sparse certificates: {An} improved 
		parallel algorithm for k-vertex connectivity",
         JOURNAL = Sicomp,
        VOLUME = "22",
        YEAR = 1993,
        PAGES = "157-174"
	}

@inproceedings{ChChYa92,
        AUTHOR = "Been-Chian Chien and Rong-Jaye Chen and Wei-Pang Yang.",
        TITLE = "Competitive analysis of the online algorithms for multiple 
                stacks systems",
        BOOKTITLE = ISAAC92,
        YEAR = 1992,
        PAGES = "78-87",
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "650"
        }

@inproceedings{ChiFun02,
        AUTHOR = {Francis Y. L. Chin and Stanley P. Y. Fung},
        TITLE = {Online scheduling with partial job values and bounded
	        importance ratio}, 
        BOOKTITLE = {Proc. of International Computer Symposium},
        YEAR = 2002,
        PAGES = {787--794}
        }

@inproceedings{ChiFun03a,
        AUTHOR = {Francis Y. L. Chin and Stanley P. Y. Fung},
        TITLE = {Improved competitivness algorithms for online scheduling
                        with partial job values},
        BOOKTITLE = {9th International Computing and Combinatorics Conference},
        YEAR = 2003,
        PAGES = "425--434"
        }

@Article{ChiFun03b,
        AUTHOR = {Francis Y. L. Chin and Stanley P. Y. Fung},
        TITLE = {Online scheduling for partial job values:
                        {Does} timesharing or randomization help?},
        journal = {Algorithmica},
        VOLUME = 37,
        YEAR = 2003,
        PAGES = {149--164}
        }

@article{CCFJST06,
        AUTHOR = "Francis Y. L. Chin and Marek Chrobak
                 and Stanley P. Y. Fung and  Wojciech Jawor
                 and Ji\v{r}\'\i\ Sgall and Tom\'a\v{s} Tich\'y",
        TITLE = "Online competitive algorithms for maximizing weighted
                throughput of unit jobs" ,
        JOURNAL = "Journal of Discrete Algorithms",
        VOLUME = "4",
        PAGES =  "255--276",
        YEAR = 2006,
}

@inproceedings{ChZhZh07,
  author    = {Francis Y. L. Chin and Yong Zhang and Hong Zhu},
  title     = {A 1-Local $13/9$-Competitive Algorithm for Multicoloring Hexagonal Graphs},
  booktitle = {COCOON07},
  year      = {2007},
  pages     = {526--536}
}

@inproceedings{ChZhZh07b,
  author    = {Francis Y. L. Chin and Yong Zhang and Hong Zhu},
  title     = {Online OVSF Code Assignment with Resource Augmentation},
  booktitle = AAIM07,
  year      = {2007},
  pages     = {191--200}
}

@inproceedings{ChTiZh07,
  author    = {Francis Y. L. Chin and Hing-Fung Ting and Yong Zhang},
  title     = {A Constant-Competitive Algorithm for Online OVSF Code Assignment},
  booktitle = ISAAC07,
  year      = {2007},
  pages     = {452--463}
}

@article{ChoSah80,
	AUTHOR = "Yookun Cho and Sartaj Sahni",
	TITLE = "Bounds for list schedules on uniform processors",
         JOURNAL = Sicomp,
	VOLUME = "9",
	PAGES = "91-103",
	YEAR = 1980
	}

@article{ChIsLi94,
	AUTHOR = "Benny Chor and Amos Israeli and Ming Li",
	TITLE = "Wait--Free Consensus Using Asynchronous Hardware.",
	JOURNAL = Sicomp,
	YEAR = 1994,
	VOLUME = 23,
	PAGES = "701-712",
	}

@mastersthesis{Chou94,
	AUTHOR = "A. Chou",
	TITLE = "Optimal Trading Strategies vs. a Statistical Adversary",
	YEAR = 1994,
	SCHOOL = "Massachusetts Institute of Technology"
	}

@inproceedings{ChCEKL95,
	AUTHOR = "A. Chou and Jeremy Cooperstock and Ran El-Yaniv and 
		Michael Klugerman and Tom Leighton",
	TITLE = "The statistical adversary allows optimal money-making trading
        	strategies",
	YEAR = 1995,
	BOOKTITLE = SODA95,
	ORGANIZATION = "ACM/SIAM"
	}

@book{ChRoSi71,
	AUTHOR = "Y. S. Chow and H. Robbins and D. Siegmund",
	TITLE = "The Theory of Optimal Stopping",
	YEAR = 1971,
	PUBLISHER = "Dover Publications, Inc."
	}

@unpublished{ChShSi95,
        AUTHOR = "A. Chou and A. Shrivastava and R. Sidney",
        TITLE = "On the Power of Magnitude",
        NOTE = toappear,
        }

@inproceedings{ChrKou05a,
  author    = {George Christodoulou and Elias Koutsoupias},
  title     = {On the Price of Anarchy and Stability of
         Correlated Equilibria of Linear Congestion Games},
  booktitle = ESA05,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "3669",
  year      = 2005,
  pages     = {59--70},
}

@inproceedings{ChrKou05b,
  author    = {George Christodoulou and Elias Koutsoupias},
  title     = {The price of anarchy of finite congestion games},
  booktitle = STOC05,
	ORGANIZATION = "ACM",
  year      = 2005,
  pages     = {67--73},
}

@inproceedings{ChJaST04A,
	AUTHOR = "Marek Chrobak and  Wojciech Jawor
		 and Ji\v{r}\'\i\ Sgall and Tom\'a\v{s} Tich\'y", 
	TITLE = "Improved online algorithms for buffer management in
		  {QoS} switches",
	PAGES =  "204--215",
        BOOKTITLE = ESA04,
        YEAR = 2004,
        PUBLISHER = "Springer",
        SERIES = LNCS,
	VOLUME = 3221
}

@inproceedings{ChJaST04B,
	AUTHOR = "Marek Chrobak and  Wojciech Jawor
		 and Ji\v{r}\'\i\ Sgall and Tom\'a\v{s} Tich\'y", 
	TITLE = "Online Scheduling of Equal-Length Jobs: 
		  {Randomization} and Restarts Help",
	PAGES =  "358-370",
        BOOKTITLE = ICALP04,
        YEAR = 2004,
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "3142"
}

@article{ChDJKK06,
        AUTHOR = {Marek Chrobak and Christoph D{\"u}rr and
                Wojciech Jawor and {\L}ukasz Kowalik and Maciej Kurowski},
        TITLE = {A note on scheduling equal-length jobs to maximize throughput},
        JOURNAL = JOS,
        YEAR = 2006,
        VOLUME = "9",
        PAGES = "71--73"
        }

@article{ChKaPV91,
        AUTHOR = "Marek Chrobak and Howard Karloff and Tom H. Payne and 
		Sundar Vishwanathan",
        TITLE = "New results on server problems",
        JOURNAL = Sidma,
        VOLUME = "4",
        YEAR = 1991,
        PAGES = "172-181",
        }

@article{ChrLar91A,
        AUTHOR = "Marek Chrobak and Lawrence L. Larmore",
        TITLE = "An optimal online algorithm for $k$ servers on trees",
         JOURNAL = Sicomp,
        VOLUME = "20",
        YEAR = 1991,
        PAGES = "144-148"
        }

@article{ChrLar91B,
        AUTHOR = "Marek Chrobak and Lawrence L. Larmore",
        TITLE = "A new approach to the server problem",
        JOURNAL = Sidma,
        VOLUME = "4",
        YEAR = 1991,
        PAGES = "323-328"
        }

@article{ChrLar91C,
        AUTHOR = "Marek Chrobak and Lawrence L. Larmore",
        TITLE = "On fast algorithms for two servers",
         JOURNAL = Jalg,
        VOLUME = "12",
        YEAR = 1991,
        PAGES = "607-614"
        }
       
@article{ChrLar91D,
        AUTHOR = "Marek Chrobak and Lawrence L. Larmore",
        TITLE = "A note on the server problem and a benevolent adversary",
     	JOURNAL = ipl,
        VOLUME = "38",
        YEAR = 1991,
        PAGES = "173-175"
        }

@article{ChrLar92A,
        AUTHOR = "Marek Chrobak and Lawrence L. Larmore",
        TITLE = "{HARMONIC} is three-competitive for two servers",
        JOURNAL = tcs,
        VOLUME = "98",
        YEAR = 1992,
        PAGES = "339-346"
        }

@inproceedings{ChrLar92B,
        AUTHOR = "Marek Chrobak and Lawrence L. Larmore",
        TITLE = "The server problem and on-line games",
        PAGES = "11-64",
	EDITOR = "Lyle A. McGeoch and Daniel D. Sleator",
	VOLUME = "7",
	SERIES = "DIMACS Series in Discrete Mathematics and Theoretical
                  Computer Science",
	BOOKTITLE = "On-line Algorithms",
	YEAR = 1992,
	ORGANIZATION = "AMS/ACM",
        }

@article{ChrLar92C,
         AUTHOR = "Marek Chrobak and Lawrence L. Larmore",
         TITLE = "Generosity helps or an 11-competitive algorithm
                 for three servers",
         JOURNAL = Jalg,
	 VOLUME = "16",
	 YEAR = 1994,
	 PAGES = "234-263",
         }

@techreport{ChrLar92D,
         AUTHOR = "Marek Chrobak and Lawrence L. Larmore",
         TITLE = "Metrical Service Systems: {Deterministic} Strategies",
	 NUMBER = "UCR-CS-93-1",
	 INSTITUTION = "Department of Computer Science, University of
	 	California at Riverside",
         YEAR = 1992
         }

@unpublished{ChrLar92E,
         AUTHOR = "Marek Chrobak and Lawrence L. Larmore",
         TITLE = "Metrical Service Systems: {Randomized} strategies",
         YEAR = 1992,
         NOTE = "Manuscript",
         }

@inproceedings{ChLaRW93,
        AUTHOR = "Marek Chrobak and Lawrence L. Larmore and Nick Reingold and 
		Jeffery Westbrook",
        TITLE = "Page migration algorithms using work functions",
        BOOKTITLE = ISAAC93,
        YEAR = 1993,
        PAGES = "406-415",
        PUBLISHER = "Springer",
        SERIES = LNCS,
        VOLUME = "762"
	}

@article{ChLaRW97,
        AUTHOR = "Marek Chrobak and Lawrence L. Larmore and Nick Reingold
				and Jeffery Westbrook",
        TITLE = "Page migration algorithms using work functions",
        JOURNAL = JAlg,
        VOLUME = "24",
        NUMBER = "1",
        YEAR = "1997",
        PAGES = "124-157"
        }

@article{ChLaLR97,
        AUTHOR = "Marek Chrobak and Lawrence L. Larmore and Carsten Lund and 
		Nick Reingold",
        TITLE = "A better lower bound on the competitive ratio of
		the randomized 2-server problem",
	JOURNAL = IPL,
        VOLUME = "63",
        YEAR = "1997",
        PAGES = "79-83"
        } 

@inproceedings{ChrNog98,
        AUTHOR = "Marek Chrobak and John Noga",
	TITLE = "\mbox{\sc LRU} is better than \mbox{\sc FIFO}",
        BOOKTITLE = SODA98,
	ORGANIZATION = "ACM/SIAM",
        PAGES = "78-81",
	YEAR = 1998
	}

@inproceedings{ChrNog98A,
        AUTHOR = "Marek Chrobak and John Noga",
        TITLE = "Competitive algorithms for multilevel caching and
		relaxed list update",
        BOOKTITLE = SODA98,
	ORGANIZATION = "ACM/SIAM",
        PAGES = "87-96",
        YEAR = 1998
        }

@incollection{ChrLar98,
	AUTHOR = "Marek Chrobak and Lawrence L. Larmore",
	TITLE = "Metrical task systems, the server problem,
			and the work function algorithm",
        BOOKTITLE = "Online Algorithms: {The} State o