
% 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
% marek, Jan. 24, 2009
% lyan,  Thu Jun 11 10:09:12 PDT 2009
% marek Wed Jun 30 17:35:35 PDT 2010 -- incorporated Jiri's update from Jan. 2009
% jiri, Jul 1-8, 2010
% marek, July 12, 2010
% jiri, Nov 10, 2010
% jiri, Nov 22, 2010


% 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{CongrNum     = {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{TOCS         = {Theory Comput. Syst.} }
@STRING{TOPLAS       = {ACM Transactions on Programming Languages and Systems} }
@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. 3rd" # AAIM}


% COCOON
@string{COCOON    = " Annual International Computing and Combinatorics Conf. (COCOON)"}
@string{COCOON95    = "Proc. 1st" # COCOON}
@string{COCOON96    = "Proc. 2nd" # 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. 13th" # ESA}
@string{ESA06  = "Proc. 14th" # ESA}
@string{ESA07  = "Proc. 15th" # ESA}
@string{ESA08  = "Proc. 16th" # ESA}
@string{ESA09  = "Proc. 17th" # 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}
@string{FOCS08 = "Proc. 49th" # FOCS}
@string{FOCS09 = "Proc. 50th" # FOCS}
@string{FOCS10 = "Proc. 51th" # 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{ISAAC06 = "Proc. 17th" # 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}
@string{SODA08 = "Proc. 19th" # 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}
@string{STACS08 = "Proc.  25th" # STACS}
@string{STACS09 = "Proc.  26th" # 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}
@string{STOC08 = "Proc. 40th" # 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},
 	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",
        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{AlAABN04,
        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{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"
}

@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"
        }

@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{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",
	}

@inproceedings{AlLSWH08,
        author    = {Noga Alon and
                     Eyal Lubetzky and
                     Uri Stav and
                     Amit Weinstein and
                     Avinatan Hassidim},
        title     = {Broadcasting with Side Information},
        booktitle = FOCS08,
	organization = "IEEE",
        year      = {2008},
        pages     = {823-832}
        }

@inproceedings{AloNus08,
        author    = {Noga Alon and
                     Asaf Nussboim},
        title     = {k-Wise Independent Random Graphs},
        booktitle = FOCS08,
        year      = {2008},
        pages     = {813-822}
        }

@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},
 	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{AmiNor08,
        author    = {Amihood Amir and
                     Igor Nor},
        title     = {Real-time indexing over fixed finite alphabets},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year      = {2008},
        pages     = {1086-1095}
        }

@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",
        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{AsSaYi08,
        author    = {James Aspnes and
                     Muli Safra and
                     Yitong Yin},
        title     = {Ranged hash functions and the price of churn},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year      = {2008},
        pages     = {1066-1075}
        }

@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 = " ",
	}


@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"
        }

@article{AweAza95,
        author = "Baruch Awerbuch and Yossi Azar",
        title = "Competitive multicast routing",
        journal = WirelessNet,
        volume = "1",
        year = 1995,
        pages = "107-114"
        }

@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{AwAzKh08,
        author    = {Baruch Awerbuch and
                     Yossi Azar and
                     Rohit Khandekar},
        title     = {Fast load balancing via bounded best response},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year      = {2008},
        pages     = {314-322},
        }

@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{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"
	}


@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},
}

@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{BaBuNa08,
        author    = {Nikhil Bansal and
                     Niv Buchbinder and
                     Joseph Naor},
        title     = {Randomized competitive algorithms for generalized caching},
        booktitle = STOC08,
	organization = "ACM",
        year      = {2008},
        pages     = {235-244}
        }

@inproceedings{BanDha03,
	author = "Nikhil Bansal and K. Dhamdhere",
	title = "Minimizing weighted flow time",
	pages = "508-516",
	booktitle = SODA03,
	year = 2003,
	organization = "ACM/SIAM"
	}

@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{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{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{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{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{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"
}

@article{BapSch03,
	author = "P. Baptiste and B. Schieber",
	title = "A note on scheduling tall/small multiprocessor tasks
		with unit processing time to minimize maximum tardiness",
   	journal = JOS,
        volume = 6,
	pages = "395--404",
	year = 2003
	}

@inproceedings{BaIsWe08,
        author    = {Omer Barkol and
                     Yuval Ishai and
                     Enav Weinreb},
        title     = {Communication in the presence of replication},
        booktitle = STOC08,
	organization = "ACM",
        year      = {2008},
        pages     = {661-670}
        }


@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{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,
	  organization = "IEEE",
	  year      = {2001},
	  pages     = {396-405}
	}

@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{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"
}

@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",
	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",
        }

@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",
	}

@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",
	}

@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{BarRos92,
        author = "Sanjoy K. Baruah 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"
	}

@inproceedings{BeaHuy08,
        author    = {Paul Beame and
                     Dang-Trinh Huynh-Ngoc},
        title     = {On the Value of Multiple Read/Write
                  Streams for Approximating Frequency
                  Moments},
        booktitle = FOCS08,
	organization = "IEEE",
        year      = {2008},
        pages     = {499-508}
        }

@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,
         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"
	}

@inproceedings{BhGrRa08,
        author    = {Nayantara Bhatnagar and
                     Sam Greenberg and
                     Dana Randall},
        title     = {Sampling stable marriages: why spouse-swapping won't work},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year      = {2008},
        pages     = {1223-1232}
        }

@article{BhaMos94,
        author = "Neeraj Bhatnagar and Jack Mostow",
        title = "On-line learning from search failures",
	journal = ML,
        volume = "15",
        year = 1994,
        pages = "69-117"
	}

@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",
        }

@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},
}

@inproceedings{BiVrSV08,
        author    = {Sushil Bikhchandani and
                     Sven de Vries and
                     James Schummer and
                     Rakesh V. Vohra},
        title     = {Ascending auctions for integral (poly)matroids with concave
                     nondecreasing separable values},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year      = {2008},
        pages     = {864-873},
        }

@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"
	}

@inproceedings{BCGRCK08,
        author    = {Guy E. Blelloch and
                     Rezaul Alam Chowdhury and
                     Phillip B. Gibbons and
                     Vijaya Ramachandran and
                     Shimin Chen and
                     Michael Kozuch},
        title     = {Provably good multicore cache performance for divide-and-conquer
                     algorithms},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year      = {2008},
        pages     = {501-510},
        }

@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,
        }

@inproceedings{BlHaLR08,
  author    = {Avrim Blum and
               MohammadTaghi Hajiaghayi and
               Katrina Ligett and
               Aaron Roth},
  title     = {Regret minimization and the price of total anarchy},
  booktitle = STOC08,
	organization = "ACM",
  year      = {2008},
  pages     = {373-382}
  }

@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
	}

@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{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",
        }

@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"
        }

@inproceedings{BKKMUV08,
        author    = {Andrei Z. Broder and
                     Adam Kirsch and
                     Ravi Kumar and
                     Michael Mitzenmacher and
                     Eli Upfal and
                     Sergei Vassilvitskii},
        title     = {The hiring problem and Lake Wobegon strategies},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year      = {2008},
        pages     = {1184-1193}
        }

@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{BuKLMS08,
        author    = {Niv Buchbinder and
                     Tracy Kimbrel and
                     Retsef Levi and
                     Konstantin Makarychev and
                     Maxim Sviridenko},
        title     = {Online make-to-order joint replenishment model: primal dual
                     competitive algorithms},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year      = {2008},
        pages     = {952-961}
        }

@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%

@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"
	}

@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,
	}

@inproceedings{Caragiannis08,
  author    = {Ioannis Caragiannis},
  title     = {Better bounds for online load balancing on unrelated machines},
  booktitle = SODA08,
	organization = "ACM/SIAM",
  year      = 2008,
  pages     = {972-981}
}

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

@inproceedings{CaFlHK08,
        author    = {Matthew Cary and
                     Abraham D. Flaxman and
                     Jason D. Hartline and
                     Anna R. Karlin},
        title     = {Auctions for structured procurement},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year      = {2008},
        pages     = {304-313},
      }


@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{ChJaPa08,
        author    = {Amit Chakrabarti and
                     T. S. Jayram and
                     Mihai Patrascu},
        title     = {Tight lower bounds for selection in randomly ordered streams},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year      = {2008},
        pages     = {720-729},
        }

@inproceedings{ChCoMc08,
        author    = {Amit Chakrabarti and
                     Graham Cormode and
                     Andrew McGregor},
        title     = {Robust lower bounds for communication and stream computation},
        booktitle = STOC08,
	organization = "ACM",
        year      = {2008},
        pages     = {641-650}
        }

@inproceedings{ChaGoe08,
        author    = {Deeparnab Chakrabarty and
                     Gagan Goel},
        title     = {On the Approximability of Budgeted Allocations and Improved
                     Lower Bounds for Submodular Welfare Maximization and GAP},
        booktitle = FOCS08,
	organization = "IEEE",
        year      = {2008},
        pages     = {687-696}
        }

@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},
    publisher = "Springer",
    series = LNCS,
    volume = "4368",
  	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{ChCYZZ06,
    author = {Joseph Wun-Tat Chan and Francis Y. L. Chin and Deshi Ye and Yong Zhang and Hong Zhu},
    title = {Frequency Allocation Problem for Linear Cellular Networks},
    booktitle = ISAAC06,
    publisher = "Springer",
    series = LNCS,
    volume = "4288",
    year = {2006},
    pages = {61--70}
}

@inproceedings{ChErGK08,
        author    = {Jessica Chang and
                     Thomas Erlebach and
                     Renars Gailis and
                     Samir Khuller},
        title     = {Broadcast scheduling: algorithms and complexity},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year      = {2008},
        pages     = {473-482},
        }

@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},
 	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{CheMel08,
  author    = {Prasad Chebolu and
               P{\'a}ll Melsted},
  title     = {PageRank and the random surfer model},
  booktitle = SODA08,
	organization = "ACM/SIAM",
  year      = {2008},
  pages     = {1010-1018}
}

@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"
	}

@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"
         }

@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",
         }

@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{Chen08,
  author    = {Ning Chen},
  title     = {On the approximability of influence in social networks},
  booktitle = SODA08,
	organization = "ACM/SIAM",
  year      = {2008},
  pages     = {1029-1037}
}

@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{CheSwa08,
        author    = {Maurice Cheung and
                     Chaitanya Swamy},
        title     = {Approximation Algorithms for
                  Single-minded Envy-free
                  Profit-maximization Problems with Limited
                  Supply},
        booktitle = FOCS08,
	organization = "IEEE",
        year      = {2008},
        pages     = {35-44}
        }

@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,
  publisher = "Springer",
  series = LNCS,
  volume = "4598",
  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},
  publisher = "Springer",
  series = LNCS,
  volume = "4508",
  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},
  publisher = "Springer",
  series = LNCS,
  volume = "4835",
  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},
}

@article{ChHuSg09,
        author = "Marek Chrobak and Mathilde Hurand and Ji\v{r}\'{\i} Sgall",
        title = "Fast algorithms for testing fault-tolerance of
	        sequenced jobs with deadlines",
   	journal = JOS,
	volume = 12,
	pages = "501--515",
	year = 2009
	}

@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",
        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 of the Art",
        editor = "Amos Fiat and Gerhard J. Woeginger",
        publisher = "Springer",
        year = "1998",
	pages = "74-94"
        }

@article{ChrSlu88,
        author = "Marek Chrobak and Maciej \'Slusarek",
        title = "On some packing problems relating to {Dynamical Storage
		Allocation}",
        journal = RAIROinf,
        volume = "22",
        year = 1988,
        pages = "487-499"
        }

@inproceedings{ChrSga00b,
        author = "Marek Chrobak and Ji{\v{r}}{\'\i} Sgall",
        title = "The weighted 2-server problem",
        year = "2000",
	booktitle = STACS00,
        publisher = "Springer",
        series = LNCS,
	volume = "1770",
	pages = "593--604"
        }

@article{ChrSga04,
        author = "Marek Chrobak and Ji{\v{r}}{\'\i} Sgall",
        title = "The weighted 2-server problem",
	journal = TCS,
	volume = "324",
	year = 2004,
	pages = "289--312"
        }

@article{ChrSga00a,
        author = "Marek Chrobak and Ji{\v{r}}{\'\i} Sgall",
        title = "A simple analysis of the harmonic algorithm
			for two servers",
	journal = IPL,
	volume = "75",
	year = 2000,
	pages = "75--77"
        }

@article{ChKoNo03,
        author = "Marek Chrobak and Elias Koutsoupias and John Noga",
        title = "More on randomized on-line algorithms for caching",
        journal = TCS,
        volume = "290",
        year = 2003,
        pages = "1997--2008",
        }

@inproceedings{CCINSW01,
	author = "Marek Chrobak and Janos Csirik and
	 Csanad Imreh and John Noga and Jiri Sgall and Gerhard Woeginger",
	title = "The buffer minimization problem for multiprocessor scheduling with conflicts",
	booktitle = ICALP01,
        publisher = "Springer",
        series = LNCS,
        volume = "2076",
	year = 2001,
	pages = "862--874"
	}

@inproceedings{CENSST02,
	author = "Marek Chrobak and Leah Epstein and John Noga
		and Jiri Sgall and Rob van Stee and Tom{\'a}{\v{s}} Tich{\'y}
		and Nodari Vakhania",
	title = "Preemptive scheduling of tasks with hard deadlines",
	booktitle = ICALP02,
        publisher = "Springer",
        series = LNCS,
        volume = "2380",
	year = 2002,
        pages = "800--811"
	}

@Article{CENSST03,
	author = "Marek Chrobak and Leah Epstein and John Noga
		and Jiri Sgall and Rob van Stee and Tom{\'a}{\v{s}} Tich{\'y}
		and Nodari Vakhania",
	title = "Preemptive scheduling of tasks with hard deadlines",
	journal = JCSS,
	year = 2003,
	volume = 67,
	pages = "183-197"
}

@inproceedings{ChKeYo05,
        author = "Marek Chrobak and Claire Kenyon and Neal Young",
        title = "The reverse greedy algorithm for the k-median problem",
        booktitle = COCOON05,
        publisher = "Springer",
        series = LNCS,
        volume = "3595",
        year = 2005,
        pages = "654--660",
        }

@article{ChKeYo06,
        author = "Marek Chrobak and Claire Kenyon and Neal Young",
        title = "The reverse greedy algorithm for the k-median problem",
        journal = IPL,
        volume = "97",
        year = 2006,
        pages = "68--72",
        }

@article{Chroba03,
        author = "Marek Chrobak",
        title = "The CNN Problem",
        pages = "69--77",
        journal = SigactNews,
        year = 2003
        }

@article{Chroba04,
 	author = {Marek Chrobak},
 	title = {A Princess Swimming in the Fog Looking for a Monster Cow},
 	journal = SigactNews,
 	volume = {35},
 	year = {2004},
 	pages = {74--78}
 }

@inproceedings{ChKeNY06,
        author = "Marek Chrobak and Claire Kenyon and
                 John Noga and Neal Young",
        title = "Online medians via online bidding",
        booktitle = LATIN06,
        series = LNCS,
        volume = 3887,
        year = 2006,
        pages = "311-322"
        }

@article{ChrKen06,
        author = "Marek Chrobak and Claire Kenyon",
        title = "Competitiveness via Doubling",
        pages = "115--126",
        journal = SigactNews,
        year = 2006
       }

@article{ChGaJo82,
        author = "Fan R. K. Chung and Michael R. Garey and David S. Johnson",
        title = "On packing two-dimensional bins",
        journal = Sialgdis,
        volume = "3",
        year = 1982,
        pages = "66-76",
        }

@article{ChGrSa89,
	author = "Fan R. K. Chung and Ronald L. Graham and Michael E. Saks",
	title = "A dynamic location problem for graphs",
        journal = Combinatorica,
	year = 1989,
	volume = "9",
	pages = "111-131"
	}

@inproceedings{ChHaSe85,
    	author = "Fan R. K. Chung and D. J. Hajela and P. D. Seymour",
    	title = "Self-organizing sequential search and
                 {H}ilbert's inequality",
    	booktitle = STOC85,
	organization = "ACM",
    	pages = "217-223",
    	year = 1985
    	}

@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"
        }

@book{Coffma76,
        author = "Edward G. Coffman",
        title = "Computer and Job-Shop Scheduling Theory",
        publisher = "John Wiley",
        year = 1976,
        }

@incollection{Coffma82,
        author = "Edward G. Coffman",
        title = "An introduction to proof techniques for packing and
                 sequencing algorithms",
        booktitle = "Deterministis and Stochastic Scheduling",
        editor = "M. A. H. Demster et al",
        publisher = "Reidel Publishing Co.",
        address = "Amsterdam",
        year = 1982,
        pages = "245-270",
        }

@article{Coffma83,
        author = "Edward G. Coffman",
        title = "An introduction to combinatorial models of dynamic
                 storage allocation",
        journal = SiamRev,
        volume = "25",
        year = 1983,
        pages = "311-325",
        }

@inproceedings{CCGJMS91,
        author = "Edward G. Coffman and Costas A. Courcoubetis and
		Michael R. Garey and David S. Johnson and Lyle A. McGeogh and
		Peter W. Shor and Richard R. Weber and Mihalis Yannakakis",
        title = "Fundamental discrepancies between average-case analyses
                 under discrete and continuous distributions - a bin
                 packing case study",
        booktitle = STOC91,
	organization = "ACM",
        year = 1991,
        pages = "230-240",
        }

@article{CoGaJo83,
        author = "Edward G. Coffman and Michael R. Garey and David S. Johnson",
        title = "Dynamic bin packing",
         journal = Sicomp,
        volume = "12",
        year = 1983,
        pages = "227-258",
        }

@incollection{CoGaJo97,
	author = "Edward G. Coffman and Michael R. Garey and David S. Johnson",
        title = "Approximation algorithms for bin packing: {A} survey",
        booktitle = "Approximation algorithms",
        editor = "D. Hochbaum",
	publisher = "PWS Publishing Company",
        year = 1997
        }

@article{CoGaJT80,
        author = "Edward G. Coffman and Michael R. Garey and David S. Johnson
                  and Robert E. Tarjan",
        title = "Performance bounds for level oriented two-dimensional
                 packing algorithms",
         journal = Sicomp,
        volume = "9",
        year = 1980,
        pages = "808-826",
        }

@article{CofGil84,
        author = "Edward G. Coffman and E. N. Gilbert",
        title = "Dynamic, {F}irst {F}it packings in two- or
                 more dimensions",
        journal = InfCont,
        volume = "61",
        year = 1984,
        pages = "1-14",
	}

@article{CoHoSY80,
        author = "Edward G. Coffman and Micha Hofri and Kimming So and
		Andrew Chi-Chi Yao",
        title = "A stochastic model of bin packing",
        journal = InfCont,
        volume = "44",
        year = 1980,
        pages = "105-115",
        }

@inproceedings{CoJoSW93,
        author = "Edward G. Coffman and David S. Johnson and Peter W. Shor and
                  Richard R. Weber",
        title = "Markov chains, computer proofs, and
                 {B}est {F}it packing",
        booktitle = STOC93,
	organization = "ACM",
        year = 1993,
        pages = "412-421",
        }

@unpublished{CoJoSW95,
        author = "Edward G. Coffman and David S. Johnson and Peter W. Shor and
                  Richard R. Weber",
        title = "Bin packing with discrete item sizes, part II:
                 {Average} case behaviour of {F}irst {F}it",
        note = "Unpublished manuscript",
        year = 1996,
        }

@book{CofLue91,
        author = "Edward G. Coffman and George S. Lueker",
        title = "Probabilistic analysis of Packing and Partitioning
                 Algorithms",
        publisher = "John Wiley",
        year = 1991,
        address = "New York",
        }

@article{CoLuKa88,
        author = "Edward G. Coffman and George S. Lueker and
		Rinnooy Kan, Alexander H. G.",
        title = "Asymptotic methods in the probabilistic analysis of
                 sequencing and packing heuristics",
        journal = MgtSci,
        volume = "34",
        year = 1988,
        pages = "266-290",
        }

@article{CofSho91,
        author = "Edward G. Coffman and Peter W. Shor",
        title = "A simple Proof of the ${O(sqrt(nlog^3/4))}$ up-right
                 matching bound",
        journal = Sidma,
        volume = "4",
        year = 1991,
        pages = "48-57",
        }

@article{CofSho93,
        author = "Edward G. Coffman and Peter W. Shor",
        title = "Packing in two dimensions: {Asymptotic} average-case
                 analysis of algorithms",
	journal = Algorithmica,
        volume = "9",
        year = 1993,
        pages = "253-277",
        }

@article{CoSoHY80,
        author = "Edward G. Coffman and Kimming So and Micha Hofri and
		Andrew Chi-Chi Yao",
        title = "A stochastic model of bin packing",
        journal = InfCont,
        volume = "44",
        year = 1980,
        pages = "105-115",
        }

@article{CohFre96,
	author = "David Cohen and Michael L. Fredman",
	title = "Weighted binary trees for concurrent searching",
         journal = JAlg,
	volume = 20,
	pages = "87-112",
	year = 1996,
	}

@inproceedings{CohKap99,
        author = "Edith Cohen and Haim Kaplan",
        title = "Exploiting regularities in web traffic patterns
		for cache replacement",
	booktitle = STOC99,
	organization = "ACM",
        pages = "109-118",
        year = 1999,
        }

@inproceedings{CoKaZw99,
        author = "Edith Cohen and Haim Kaplan and Uri Zwick",
        title = "Connection caching",
        booktitle = STOC99,
	organization = "ACM",
        pages = "612-621",
        year = 1999,
        }

@inproceedings{CohKap99b,
        author = "Edith Cohen and Haim Kaplan",
        title = "LP-based analysis of greedy-dual-size",
        booktitle = SODA99,
	organization = "ACM/SIAM",
        pages = "879-880",
        year = 1999,
        }

@techreport{Cole89,
	author = "Richard Cole",
	title = "On the dynamic finger conjecture for splay trees. Part 2:
        	{Finger} searching",
	institution = "Courant Institute, NYU",
	number = 472,
	year = 1989
	}

@inproceedings{Cole90,
	author = "Richard Cole",
	title = "On the dynamic finger conjecture for splay trees",
	booktitle = STOC90,
	organization = "ACM",
	year = 1990,
	pages = "8-17"
	}

@inproceedings{ColFle08,
        author    = {Richard Cole and
                     Lisa Fleischer},
        title     = {Fast-converging tatonnement algorithms for one-time and
                     ongoing market problems},
        booktitle = STOC08,
	organization = "ACM",
        year      = {2008},
        pages     = {315-324}
        }

@inproceedings{ColHar92,
        author = "Richard Cole and Ramesh Hariharan",
        title = "Tighter bounds on the exact complexity of string matching",
        booktitle = FOCS92,
	organization = "IEEE",
        year = 1992,
        pages = "600-609"
	}

@inproceedings{CoHaPZ93,
        author = "Richard Cole and Ramesh Hariharan and Michael S. Paterson
		and Uri Zwick",
        title = "Which patterns are hard to find? (String matching)",
        booktitle = ISTCS93,
	organization = "IEEE",
        year = 1993,
        pages = "59-68"
	}

@article{CoHaPZ95,
        author = "Richard Cole and Ramesh Hariharan and Michael Paterson
		and Uri Zwick",
        title = "Tighter lower bounds on the exact complexity of string
		matching",
         journal = Sicomp,
        volume = "24",
        year = 1995,
        pages = "30-45"
	}

@techreport{CoMiSS89,
	author = "Richard Cole and Bud Mishra and Jeanette Schmidt
		and A. Siegel",
	title = "On the dynamic finger conjecture for splay trees. Part 1:
	        {Splay} sorting $\log n$-block sequences",
	institution = "Courant Institute, NYU",
	number = 471,
	year = 1989
	}

@inproceedings{ColRag90,
        author = "Richard Cole and Arvind Raghunathan",
        title = "Online algorithms for finger searching",
        booktitle = FOCS90,
	organization = "IEEE",
        year = 1990,
        pages = "480-489"
	}

@inproceedings{CoGaGi90,
        author = "Livio Colussi and Zvi Galil and Raffaele Giancarlo",
        title = "On the exact complexity of string matching",
        booktitle = FOCS90,
	organization = "IEEE",
        year = 1990,
        pages = "135-144"
	}
@inproceedings{CoDoRS90,
        author = "Don Coppersmith and Peter G. Doyle and Prabhakar Raghavan
		and Marc Snir",
        title = "Random walks on weighted graphs and applications to
		online algorithms",
        booktitle = STOC90,
	organization = "ACM",
        year = 1990,
        pages = "369-378"
	}

@article{CoDoRS93,
        author = "Don Coppersmith and Peter G. Doyle and Prabhakar Raghavan
		and Marc Snir",
        title = "Random walks on weighted graphs and applications to on-line
		algorithms",
   	journal = JACM,
        volume = "40",
        year = 1993,
        pages = "421-453"
	}

@article{CopRag89,
         author = "Don Coppersmith and Prabhakar Raghavan",
         title = "Multidimensional online bin packing: {Algorithms} and
                  worst case analysis",
        journal = ORL,
         volume = "8",
         year = 1989,
         pages = "17-20",
         }

@book{CoLeRi90,
        author = "Thomas Cormen and Charles Leiserson and Ronald Rivest",
        title = "Introduction to Algorithms",
        publisher = "McGraw-Hill",
        address = "New York, NY",
        year = 1990
	}

@inproceedings{CoMuYi08,
  author    = {Graham Cormode and
               S. Muthukrishnan and
               Ke Yi},
  title     = {Algorithms for distributed functional monitoring},
  booktitle = SODA08,
	organization = "ACM/SIAM",
  year      = {2008},
  pages     = {1076-1085}
}

@inproceedings{CoMePo08,
        author    = {Aaron Cote and
                     Adam Meyerson and
                     Laura J. Poplawski},
        title     = {Randomized k-server on hierarchical binary trees},
        booktitle = STOC08,
	organization = "ACM",
        year      = {2008},
        pages     = {227-234}
        }

@article{CouWeb86,
         author = "Costas Courcoubetis and Richard R. Weber",
         title = "Necessary and sufficient conditions for stability of
                  a bin packing system",
         journal = JAppProb,
         volume = "23",
         year = 1986,
         pages = "989-999",
         }

@article{CouWeb90,
         author = "Costas Courcoubetis and Richard R. Weber",
         title = "Stability of online packing with random arrivals and
                  long-run average constraints",
         journal = PEngInf,
         volume = "4",
         year = 1990,
         pages = "447-460",
         }

@article{Cover91,
	author = "Thomas M. Cover",
	title = "Universal Portfolios",
	year = 1991,
	journal = MathFinance,
	volume = 1,
	pages = "1-29",
	}

@article{CovGlu86,
	author = "Thomas M. Cover and D. H. Gluss",
	title = "Empirical {Bayes} Stock Market Portfolios",
	year = 1986,
	journal = AdvAppMat,
	volume = 7,
	pages = "170-181"
	}

@article{CovOrd96,
	author = "Thomas M. Cover and E. Ordentlich",
	title = "Universal Portfolios with Side Information",
	year = 1996,
	journal = IEEEinfo,
	volume = 42,
	}

@book{CovTho91,
	author = "Thomas M. Cover and J. A. Thomas",
	title = "Elements of Information Theory",
	year = 1991,
	publisher = "John Wiley \& Sons, Inc."
	}

@book{CoxRub85,
	author = "J. Cox and M. Rubinstein",
	title = "Options Markets",
	year = 1985,
	publisher = "Prentice Hall, Inc."
	}

@techreport{Crane72,
	author = "C. A. Crane",
	title = "Linear lists and priority queues as balanced binary trees",
	institution = "Dept. of Computer Science, Stanford University",
	number = "STAN-CS-72-259",
	year = 1972
	}

@article{CraSpi95,
	author = "Y. Crama and F. C. R. Spieksma",
	title = "Scheduling jobs of equal length: {Complexity}, facets, and
	         computational results",
        booktitle = "Integer programming and combinatorial optimization (IPCO)",
	publisher = "Springer",
        series = LNCS,
	volume = "920",
	year = 1995,
	pages = "277-291",
	address = "Berlin"
	}

@article{Csirik86,
         author = "Janos Csirik",
         title = "Bin-packing as a random walk:
                  {A} note on {K}noedels paper",
        journal = ORL,
         volume = "5",
         year = 1986,
         pages = "161-163.",
        }

@article{Csirik89,
         author = "Janos Csirik",
         title = "An online algorithm for variable-sized bin packing",
         journal = ActInf,
         volume = "26",
         year = 1989,
         pages = "697-709",
        }

@article{Csirik93,
        author = "Janos Csirik",
        title = "The parametric behaviour of the {F}irst {F}it
                Decreasing bin-packing algorithm",
         journal = JAlg,
        volume = "15",
        year = 1993,
        pages = "1-28",
        }

@article{CsiFre90,
         author = "Janos Csirik and J. B. G. Frenk",
         title = "A dual version of bin packing",
         journal = AlgReview,
         volume = "1",
         year = 1990,
         pages = "87-95",
        }

@article{CsFFGR86,
        author = "Janos Csirik and J. B. G. Frenk and Alan M. Frieze and
                  Gabor Galambos and  Rinnooy Kan, A. H. G.",
        title = "A probabilistic analysis of the {N}ext {F}it
                 {D}ecreasing bin-packing heuristic",
        journal = ORL,
        volume = "5",
        year = 1986,
        pages = "233-236",
        }

@article{CsFrGR91,
         author = "Janos Csirik and J. B. G. Frenk and Gabor Galambos and
                    Rinnooy Kan, A. H. G.",
         title = "Probabilistic analysis of algorithms for dual
                  bin packing problems",
         journal = JAlg,
         volume = "12",
         year = 1991,
         pages = "189-203",
        }

@article{CsFrLa93,
        author = "Janos Csirik and J. B. G. Frenk and M. Labbe",
        title = "Two dimensional rectangle packing: {On} line methods
                 and results",
        journal = DAM,
        volume = "45",
        year = 1993,
        pages = "197-204",
        }

@article{CsiGal86,
         author = "Janos Csirik and Gabor Galambos",
         title = "An {O(n)} bin packing algorithm for uniformly
                  distributed data",
         journal = Computing,
         volume = "36",
         year = 1986,
         pages = "313-319",
        }

@article{CsiGal87,
         author = "Janos Csirik and Gabor Galambos",
         title = "On the expected behaviour of the {NF} algorithm for
                  a dual bin packing problem",
         journal = ActCyb,
         volume = "8",
         year = 1987,
         pages = "5-9",
        }

@inproceedings{CsGaTu84,
        author = "Janos Csirik and Gabor Galambos and Gyorgy Tu\'ran",
        title = "A lower bound on online algorithms for decreasing lists",
        booktitle = "Proc. of EURO VI",
        year = 1984,
        }

@article{CsiImr89,
        author = "Janos Csirik and B. Imreh",
        title = "On the worst-case performance of the {NkF} bin packing
                 heuristic",
        journal = ActCyb,
        volume = "9",
        year = 1989,
        pages = "89-105",
        }

@inproceedings{CsiJoh91,
        author = "Janos Csirik and David S. Johnson",
        title = "Bounded space on-line bin packing: {Best} is
                 better than first",
        booktitle = SODA91,
	organization = "ACM/SIAM",
        year = 1991,
        pages = "309-319",
        }

@article{CsiMat86,
        author = "Janos Csirik and E. M\'at\'e",
        title = "The probabilistic behaviour of the {NFD} bin-packing
                heuristic",
        journal = ActCyb,
        volume = "7",
        year = 1986,
        pages = "241-246",
        }

@article{CsiTot88,
        author = "Janos Csirik and V. Totik",
        title = "Online algorithms for a dual version of bin packing",
        journal = DAM,
        volume = "21",
        year = 1988,
        pages = "163-167",
        }

@article{CsiVli93,
        author = "Janos Csirik and Andre van Vliet",
        title = "An online algorithm for multidimensional bin packing",
        journal = ORL,
        volume = "13",
        year = 1993,
        pages = "149-158",
        }

@article{CsiWoe97,
        author = "Janos Csirik and Gerhard J. Woeginger",
        title = "Shelf Algorithms for On-line Strip Packing",
     	journal = IPL,
        volume = "63",
        year = 1997,
        pages = "171-175"
        }

%DDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD%

@inproceedings{DaImIK93,
        author = "Yang Dai and Hiroshi Imai and Kazuo Iwano and Naoki Katoh",
        title = "How to treat delete requests in semi-online problems",
        booktitle = ISAAC93,
        year = 1993,
        pages = "48-57",
        publisher = "Springer",
        series = LNCS,
        volume = "762"
	}

@inproceedings{dAMaNa91,
        author = "Fabrizio d'Amore and Alberto Marchetti-Spaccamela and
		Umberto Nanni",
        title = "Competitive algorithms for the weighted list update problem",
        booktitle = WADS91,
        year = 1991,
        pages = "240-248",
        publisher = "Springer",
        series = LNCS,
	volume = "519"
	}

@inproceedings{DaChDe95,
        author = "Pallab Dasgupta and P. P. Chakrabarti and S. C. DeSarkar",
        title = "A near optimal algorithm for the extended cow-path problem
		in the presence of relative errors",
        booktitle = "Proc. 15th Conference Foundations of Software
		Technology and Theoretical Computer Science (FST&TCS)",
	publisher = "Springer",
        series = LNCS,
	volume = "1026",
        year = 1995,
        pages = "22-36"
	}

@inproceedings{DaHiSc95,
	author = "A. Datta and C. Hipke and Sven Schuierer",
	title = "Competitive searching in polygons ---
                 Beyond generalized streets",
        booktitle = ISAAC95,
	year = 1995,
	pages = "32-41",
        publisher = "Springer",
        series = LNCS,
        volume = "1004"
	}

@inproceedings{DatIck94,
	author = "Amitava Datta and Christian Icking",
	title = "Competitive searching in a generalized street",
        booktitle = "Proc. 10th Symp. on Computational Geometry",
	year = 1994,
	pages = "175-182"
	}

@article{DavJaf81,
        author = "Ernest Davis and Jeffrey M. Jaffe",
        title = "Algorithms for scheduling tasks on unrelated processors",
   	journal = JACM,
        volume = "28",
        year = 1981,
        pages = "721-736"
        }

@misc{DeFeGa04,
  author = {Erik D. Demaine and Sandor P. Fekete and Shmuel Gal},
  title = {Online Searching with Turn Cost},
  url = {http://www.citebase.org/abstract?id=oai:arXiv.org:cs/0406045},
  year = 2004
}

@inproceedings{DeKoSo05,
  author    = {Marc Demange and Bernard Kouakou and {\'E}ric Soutif},
  title     = {On-Line Computation and Maximum-Weighted Hereditary
                         Subgraph Problems},
  booktitle = ISAAC05,
        publisher = "Springer",
        series = LNCS,
        volume = "3827",
  year      = 2005,
  pages     = {433--442},
}

@inproceedings{DenDym96,
        author = "Xiaotie Deng and Patrick Dymond",
        title = "On multiprocessor system scheduling",
        booktitle = SPAA96,
	organization = "ACM",
        year = 1996,
        pages = "82-88"
        }

@Article{DenDym98,
        author = "Xiaotie Deng and Patrick Dymond",
        title = "On multiprocessor system scheduling",
  journal =      JOCO,
  year =         1998,
  volume =       1,
  pages =        "377--392"
}

@inproceedings{DeGuBL96,
        author = "Xiaotie Deng and Nian Gu and Tim Brecht and Kai Cheng Lu",
        title = "Preemptive scheduling of parallel jobs on multiprocessors",
        booktitle = SODA96,
	organization = "ACM/SIAM",
        year = 1996,
        pages = "159-167",
        }

@article{DeGuBL00,
        author = "Xiaotie Deng and Nian Gu and Tim Brecht and Kai Cheng Lu",
        title = "Preemptive scheduling of parallel jobs on multiprocessors",
        journal = Sicomp,
        volume = 30,
        year = 2000,
        pages = "145-160"
	}

@inproceedings{DeKaPa91,
	author = "Xiaotie Deng and Tiko Kameda and Christos Papadimitriou",
	title = "How to learn an unknown environment",
	booktitle = FOCS91,
	organization = "IEEE",
	year = 1991,
	pages = "298-303"
	}

@inproceedings{DenKou93,
	author = "Xiaotie Deng and Elias Koutsoupias",
	title = "Competitive implementations of parallel programs",
	booktitle = SODA93,
	organization = "ACM/SIAM",
	year = 1993,
	pages = "455-461"
	}

@article{DeKoMa99,
        author = "Xiaotie Deng and Elias Koutsoupias and P. MacKenzie",
        title = "Competitive implementation of parallel programs",
	journal = Algorithmica,
        volume = 23,
        year = 1999,
        pages = "14-30"
        }

@inproceedings{DenMah91,
	author = "Xiaotie Deng and Sanjeev Mahajan",
	title = "Infinite games, randomization, computability, and
                 applications to online problems",
	booktitle = STOC91,
	organization = "ACM",
	year = 1991,
	pages = "289-298"
	}

@article{DenMah91A,
        author = "Xiaotie Deng and Sanjeev Mahajan",
        title = "Server problems and resistive spaces",
     	journal = IPL,
        volume = "37",
        year = 1991,
        pages = "193-196"
	}

@inproceedings{DenMir93,
        author = "Xiaotie Deng and A. Mirzaian",
        title = "Robot mapping: {F}oot-prints vs tokens",
        booktitle = ISAAC93,
        year = 1993,
        pages = "353-362",
        publisher = "Springer",
        series = LNCS,
        volume = "762"
	}

@inproceedings{DenPap90,
        author = "Xiaotie Deng and Christos Papadimitriou",
        title = "Exploring an unknown graph",
        booktitle = FOCS90,
	organization = "IEEE",
        year = 1990,
        pages = "355-361"
        }

@inproceedings{DenPap92,
         author = "Xiaotie Deng and Christos H. Papadimitriou",
         title = "Competitive distributed decision making",
         booktitle = "International Federation for Infomation Processing, A-12",
         year = 1992,
         pages = "250-256"
         }

@article{Dennin80,
        author = "Peter J. Denning",
        title = "Working Sets Past and Present",
        journal = IEEEsoft,
        volume = "6",
        year = 1980,
        pages = "64-84"
        }

@incollection{Derman63,
	author = "C. Derman",
	editor = "Richard Bellman",
	title = "On Optimal Replacement Rules when Changes of the State are
		{Markovian}",
	year = 1963,
	booktitle = "Mathematical Optimization Techniques",
	publisher = "University of California Press,"
	}

@article{DerMok89,
        author = "Michael Dertouzos and Aloysius Mok",
        title = "Multiprocessor Online Scheduling of Hard-Real-Time Tasks",
        journal = IEEEsoft,
        volume = "15",
        year = 1989,
        pages = "1497-1506"
        }

% this reference is suspicious
@article{DerMok97,
        author = "Michael Dertouzos and Aloysius Mok",
        title = "Multiprocessor on-line scheduling with release dates",
        journal = IEEEsoft,
        volume = "15",
        year = 1997,
        pages = "1497-1506"
        }

@inproceedings{DeMaWe88,
	author = "Alfredo DeSantis and George Markowsky and Mark Wegman",
	title = "Learning Probabilistic Prediction Functions",
	booktitle = FOCS88,
	organization = "IEEE",
	pages = "110-119",
	year = 1988
	}

@inproceedings{DevKan08,
        author    = {Nikhil R. Devanur and
                     Ravi Kannan},
        title     = {Market Equilibria in Polynomial Time for Fixed Number of
                     Goods or Agents},
        booktitle = FOCS08,
	organization = "IEEE",
        year      = 2008,
        pages     = {45-53}
        }

@inproceedings{DhDoDR08,
        author    = {Peerapong Dhangwatnotai and
                     Shahar Dobzinski and
                     Shaddin Dughmi and
                     Tim Roughgarden},
        title     = {Truthful Approximation Schemes for Single-Parameter Agents},
        booktitle = FOCS08,
	organization = "IEEE",
        year      = {2008},
        pages     = {15-24}
        }

@inproceedings{DiBTam90,
        author = "Guseppe Di Battista and Roberto Tamassia",
        title = "On-line graph algorithms with {SPQR}-trees",
	booktitle = ICALP90,
        year = 1990,
        pages = "598-611",
        publisher = "Springer",
        series = LNCS,
        volume = "443"
	}

@inproceedings{DiSeZh94,
        author = "Paul F. Dietz and Joel I. Seiferas and Ju Zhang.",
        title = "A tight lower found for on-line monotonic list labeling",
        booktitle = SWAT94,
        year = 1994,
        pages = "131-142",
        publisher = "Springer",
        series = LNCS,
	volume = "824"
	}

@inproceedings{DinZha06,
        author = "Jihuan Ding and Guochuan Zhang",
        title = "Online scheduling with hard deadlines on parallel machines",
        booktitle = AAIM06,
        year = 2006,
        pages = "32-42",
        publisher = "Springer",
        series = LNCS,
        volume = "4041"
	}

@inproceedings{Dinitz93,
        author = "Efim Dinitz",
        title = "Maintaining the 4-edge-connected components of a graph
		on-line",
        booktitle = ISTCS93,
	organization = "IEEE",
        year = 1993,
        pages = "88-97"
	}

@techreport{DjPaZa94A,
	author = "Hristo N. Djidjev and Grammati E. Pantziou and
		Chistos D. Zaroliagis",
	title = "On-line and Dynamic Shortest Paths through Graph
                Decompositions",
	institution = "MPI Informatik Saarbr{\"u}cken",
	year = 1994,
	series = "MPI Informatik Berichte"
	}

@techreport{DjPaZa94B,
	author = "Hristo N. Djidjev and Grammati E. Pantziou and
		Chistos D. Zaroliagis",
	title = "On-line and Dynamic Algorithms for Shortest Path Problems",
	institution = "MPI Informatik Saarbr{\"u}cken",
	year = 1994,
	series = "MPI Informatik Berichte",
	key = "Shortest path, dynamic algorithm, planar digraph, outerplanar
                  graph"
	}

@article{Dobson84,
        author = "G. Dobson",
        title = "Scheduling independent tasks on uniform processors",
        journal = Sicomp,
        volume = 13,
        pages = "705-716",
        year = 1984
        }

@inproceedings{DoLaNi08,
        author    = {Shahar Dobzinski and
                     Ron Lavi and
                     Noam Nisan},
        title     = {Multi-unit Auctions with Budget Limits},
        booktitle = FOCS08,
	organization = "IEEE",
        year      = {2008},
        pages     = {260-269}
        }

@inproceedings{DoFrSa08,
  author    = {Benjamin Doerr and
               Tobias Friedrich and
               Thomas Sauerwald},
  title     = {Quasirandom rumor spreading},
  booktitle = SODA08,
	organization = "ACM/SIAM",
  year      = {2008},
  pages     = {773-781}
}

@article{DorLop05,
        author = "Reza Dorrigiv and Alejandro L{\'o}pez-Ortiz",
        title = "A Survey of Performance Measures for On-line Algorithms",
        journal = SigactNews,
        volume = {36},
        pages = "67--81",
        year = {2005}
        }

@inproceedings{DoKrBe95,
        author = "Fred Douglis and Padmanabhan Krishnan and Brian Bershad",
        title = "Adaptive Disk Spin-down Policies for Mobile Computers",
        booktitle = "Proc. 2nd USENIX Symp. on Mobile and Location-Independent
		Computing",
        year = 1995
        }

@inproceedings{DoLoMu07,
  author    = {Reza Dorrigiv and Alejandro L{\'o}pez-Ortiz and J. Ian Munro},
  title     = {On the Relative Dominance of Paging Algorithms},
  booktitle = ISAAC07,
  year      = {2007},
  publisher = "Springer",
  series = LNCS,
  volume = "4835",
  pages     = {488--499}
}


@inproceedings{DoNiSc05,
  author    = {Shahar Dobzinski and Noam Nisan and Michael Schapira},
  title     = {Approximation algorithms for combinatorial
                 auctions with complement-free bidders},
  booktitle = STOC05,
	organization = "ACM",
  year      = 2005,
  pages     = {610--618},
}

@article{DosaHe04,
	author = "G. D{\'o}sa and Y. He",
	title =" Semi-Online Algorithms for Parallel Machine Scheduling Problems",
	journal = Computing,
	volume = 72,
	year = 2004,
	pages = "355-363",
	}


@InProceedings{DosEps09,
	author = "Gy{\"o}rgy D{\'o}sa and Leah Epstein",
	title = "Preemptive online scheduling with reordering",
	booktitle = ESA09,
        publisher = "Springer",
        series = LNCS,
        volume = "5757",
	year = 2009,
	pages = "456--467",
	}

@article{DowFos82,
	author = "Lawrence W. Dowdy and Derrell V. Foster",
	title = "Comparative models of the file assignment problem",
	journal = ACMcomsur,
	volume = "14",
	year = 1982,
	pages = "287-313"
	}

@article{Du04,
	author = "Donglei Du",
	title = "Optimal preemptive semi-online scheduling on two uniform processors",
	journal = IPL,
	volume = 92,
	year = 2004,
	pages = "219--223",
	}



@article{Du05,
	author = "Donglei Du",
	title = "Randomized On-Line Scheduling Similar Jobs to Minimize Makespan on Two Identical Processors",
     	journal = "Acta Mathematicae Applicatae Sinica",
	publisher = "Springer",
	pages = "485-488",
	year = 2005
}

@inproceedings{DuHwan92,
	author = "Ding-Zhu Du and Frank K. Hwang",
	title = "Competitive Group Testing",
	pages = "125-134",
	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{DuPark94,
        author = "Ding-Zhu Du and Haesun Park",
        title = "On competitive group testing",
         journal = Sicomp,
        volume = "23",
        year = 1994,
        pages = "1019-1025"
	}

@inproceedings{DuRoWh95,
        author = "G. Dudek and K. Romanik and Sue Whitesides",
        title = "Localizing a robot with minimum travel",
        pages = "437-446",
        booktitle = SODA95,
	organization = "ACM/SIAM",
        year = 1995
        }

@book{DunGra82,
	author = "J. Dugundji and A. Granas",
	title = "Fixed point theory",
	publisher = "Polish Scientific Publishers",
	year = 1982
	}

@inproceedings{DurHur06,
	author = "Christoph D{\"u}rr and Mathilde Hurand",
	title = "Finding Total Unimodularity
	      in Optimization Problems Solved by Linear Programs",
	pages =  "53-64",
        booktitle = ESA06,
        year = 2006,
        publisher = "Springer",
        series = LNCS,
	volume = 4168
}

@inproceedings{DuKaMR08,
  author    = {Chinmoy Dutta and
               Yashodhan Kanoria and
               D. Manjunath and
               Jaikumar Radhakrishnan},
  title     = {A tight lower bound for parity in noisy communication networks},
  booktitle = SODA08,
	organization = "ACM/SIAM",
  year      = {2008},
  pages     = {1056-1065}
}

%EEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEE%


@inproceedings{Ebenle09,
        author = "Tom\'a\v{s} Ebenlendr",
        title = "Semi-Online Preemptive Scheduling:
	         {Study} of Special Cases",
        booktitle = "Proc. 8th Int.\ Conf. on Parallel Processing and
  Applied Mathematics (PPAM 2009)",
        publisher = "Springer",
        series = LNCS,
        volume = "???",
        pages = "???",
        year = "2010",
note=toappear
	}

@inproceedings{EbeSga04,
        author = "Tom\'a\v{s} Ebenlendr and Ji\v{r}\'{\i} Sgall",
        title = "Optimal and online preemptive scheduling
                 on uniformly related machines",
	pages =  "199--210",
        booktitle = STACS04,
        year = 2004,
        publisher = "Springer",
        series = LNCS,
	volume = "2996"
	}

@article{EbeSga09A,
        author = "Tom\'a\v{s} Ebenlendr and Ji\v{r}\'{\i} Sgall",
        title = "Optimal and online preemptive scheduling
                 on uniformly related machines",
   	journal = JOS,
	volume = 12,
	pages = "517--527",
	year = 2009
	}

@inproceedings{EbeSga09B,
        author = "Tom\'a\v{s} Ebenlendr and Ji\v{r}\'{\i} Sgall",
	title = "Semi-Online Preemptive Scheduling: {One} Algorithm for All Variants.",
	booktitle = STACS09,
	publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
	series    = {LIPIcs},
	volume    = {3},
	pages = "346-360",
	year = 2009
}

@article{EbeSga10,
        author = "Tom\'a\v{s} Ebenlendr and Ji\v{r}\'{\i} Sgall",
	title =  "Semi-Online Preemptive Scheduling: {One} Algorithm for All Variants.",
	journal = toappin # TOCS,
	year = 2010,
        note = "A special issue of selected papers from STACS09."
}


@inproceedings{EbJaSg06,
        author = "Tom\'a\v{s} Ebenlendr  and Wojciech Jawor and
                  Ji\v{r}\'{\i} Sgall",
        title = "Preemptive online scheduling:
                {O}ptimal algorithms for all speeds",
        booktitle = ESA06,
        publisher = "Springer",
        series = LNCS,
        volume = "4168",
        pages = "327-339",
        year = "2006",
	}

@article{EbJaSg09,
        author = "Tom\'a\v{s} Ebenlendr  and Wojciech Jawor and
                  Ji\v{r}\'{\i} Sgall",
        title = "Preemptive online scheduling:
                {O}ptimal algorithms for all speeds",
        journal = "Algorithmica",
        volume = "53",
        pages = "504-522",
        year = "2009",
	}

@inproceedings{EbKrSg08,
        author    = {Tom{\'a}{\v s} Ebenlendr and
                     Marek Kr{\v c}{\'a}l and
                     Ji{\v r}{\'\i} Sgall},
        title     = {Graph balancing: {A} special case of scheduling unrelated
                     parallel machines},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year      = {2008},
        pages     = {483-490},
        }

@inproceedings{EdChBD97,
        author = "Jeff Edmonds and Donald Chinn and Tim Brecht
		and Xiaotie Deng",
        title = "Non-clairvoyant multiprocessor scheduling of jobs with
		changing execution characteristics",
        booktitle = STOC97,
	organization = "ACM",
        year = 1997,
        pages = "120-129"
        }

@inproceedings{EdDaDy03,
        author = "Jeff Edmonds and Suprakash Datta and Patrick W. Dymond",
        title = "TCP is competitive against a limited adversary",
        booktitle = SPAA03,
	organization = "ACM",
        year = 2003,
        pages = "174-183"
        }



@article{EdChBD03,
        author = "Jeff Edmonds and Donald Chinn and Tim Brecht
		and Xiaotie Deng",
        title = "Non-clairvoyant multiprocessor scheduling of jobs with
		changing execution characteristics",
   	journal = JOS,
	volume = 6,
	pages = "231-250",
	year = 2003
	}

@inproceedings{Edmond99,
        author = "Jeff Edmonds",
        title = "Scheduling in the dark",
        booktitle = STOC99,
	organization = "ACM",
        year = 1999,
        pages = "179-188"
        }



@article{Edmond00,
        author = "Jeff Edmonds",
        title = "Scheduling in the dark",
        journal = TCS,
        volume = 235,
        pages = "109-141",
        year = 2000
        }


@article{EdmPru03,
        author = "Jeff Edmonds and Kirk Pruhs",
        title = "Multicast pull scheduling: {W}hen fairness is fine",
        journal = Algorithmica,
        volume = 36,
        pages = "315-330",
        year = 2003
        }

@inproceedings{EdmPru04,
        author = "Jeff Edmonds and Kirk Pruhs",
        title = "A maiden analysis of {L}ongest {W}ait {F}irst",
        booktitle = SODA04,
	organization = "ACM/SIAM",
        year = 2004,
	pages = "818-827"
        }

@inproceedings{EggKat89,
        author = "S. J. Eggers and R. H. Katz",
        title = "Evaluating the performance of four snooping cache coherency
		protocols",
        year = 1989,
        booktitle = "Proc. 16th International Symp. on Computer Architecture (ISCA)",
	organization = "IEEE"
        }

@inproceedings{ElsSau08,
        author    = {Robert Els{\"a}sser and Thomas Sauerwald},
        title     = {The power of memory in randomized broadcasting},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year      = {2008},
        pages     = {218-227},
        }

@unpublished{ElYani96,
	author = "Ran El-Yaniv",
	title = "On the Decision Theoretic Foundations of the
		Competitive Ratio",
	note = "Unpublished manuscript",
	year = 1996,
	}

@unpublished{ElYani96A,
    	author = "Ran El-Yaniv",
    	title = "There are infinitely many competitive-optimal online
            list accessing algorithms",
    	note = "Manuscript",
    	year = 1996
    	}

@inproceedings{ElFiKT92,
	author = "Ran El-Yaniv and Amos Fiat and Richard M. Karp and G. Turpin",
	title = "Competitive Analysis of Financial Games",
	year = 1992,
	pages = "327-333",
	booktitle = FOCS92,
	organization = "IEEE"
	}

@unpublished{ElKaLi93,
	author = "Ran El-Yaniv and R. Kaniel and Nathan Linial",
	title = "On the Equipment Rental Problem",
	note = "To be published",
	year = 1993,
	}

@inproceedings{ElYKar93,
        author = "Ran El-Yaniv and Richard M. Karp",
        title = "The Mortgage Problem",
        booktitle = ISTCS93,
	organization = "IEEE",
        year = 1993,
	pages = "304-312",
        note = "Submitted to Mathematics of Operations Research",
        }

@article{ElYKar97,
        author = "Ran El-Yaniv and Richard M. Karp",
        title = "Nearly Optimal Competitive Online Replacement Policies",
        year = 1997,
        journal = MOR,
	volume = 22,
	pages = "814-839",
        }

@article{ElYKle95,
        author = "Ran El-Yaniv and J. Kleinberg",
        title = "Geometric two-server algorithms",
     	journal = IPL,
        volume = "53",
        year = 1995,
        pages = "355-358"
	}

@article{Elias75,
        author = "P. Elias",
        title = "Universal codeword sets and the representation of
                 the integers",
        journal = IEEEinfo,
        volume = "21",
        pages = "194-203",
        year = 1975
        }

@inproceedings{EmeJut91,
        author = "E. A. Emerson and C. S. Jutla",
        title = "Tree automata, mu-calculus and determinacy",
        booktitle = FOCS91,
	organization = "IEEE",
        year = 1991,
        pages = "368-377"
	}

@inproceedings{EngWes05,
  author    = {Matthias Englert and Matthias Westerman},
  title     = {Reordering buffer management for non-uniform
                        cost models},
  booktitle = ICALP05,
        publisher = "Springer",
        series = LNCS,
        volume = "3570",
  year      = 2005,
  pages     = {627--638}
}

@inproceedings{EngWes07,
  author    = {Matthias Englert and Matthias Westerman},
  title     = {Considering Suppressed Packets Improves Buffer
                Management in {QoS} Switches},
  booktitle = SODA07,
	organization = "ACM/SIAM",
  year      = {2007},
  pages     = {209--218}
}

@inproceedings{EnOzWe08,
        author    = {Matthias Englert and
                     Deniz {\"O}zmen and
                     Matthias Westermann},
        title     = {The Power of Reordering for Online
                  Minimum Makespan Scheduling},
        booktitle = FOCS08,
	organization = "IEEE",
        year      = {2008},
        pages     = {603-612}
        }

@article{Epstei00,
         author = "Leah Epstein",
         title = "A note on on-line scheduling with precedence constraints
	         on identical machines",
         journal = IPL,
         volume = 76,
         year = 2000,
         pages = "149-153",
         }

@article{Epstei01A,
        author = "Leah Epstein",
        title = "Optimal preemptive scheduling on uniform processors with
	      non-decreasing speed ratios.",
        journal = ORL,
        volume = 29,
        pages = "93-98",
        year = 2001
        }

@inproceedings{Epstei01B,
        author = "Leah Epstein",
        title = "On-line variable sized covering",
        booktitle = COCOON01,
        publisher = "Springer",
        series = LNCS,
	volume = 2108,
        year = 2001,
        pages = "463--472",
        }

@article{Epstei03,
        author = "Leah Epstein",
        title = "Bin stretching revisited",
        journal = ActInf,
        volume = 39,
        pages = "97-117",
        year = 2003
        }

@inproceedings{Epstei05,
  author    = {Leah Epstein},
  title     = {Online Bin Packing with Cardinality Constraints},
  booktitle = ESA05,
        publisher = "Springer",
        series = LNCS,
        volume = "3669",
  year      = 2005,
  pages     = {604--615},
}

@inproceedings{EpImSt02,
        author = "Leah Epstein and Csanad Imreh and Rob van Stee",
        title = "More on weighted servers or {FIFO} is better than {LRU}",
        booktitle = MFCS02,
        publisher = "Springer",
	series = LNCS,
	volume = "2420",
        year = 2002,
        pages = "257--268"
        }

@article{EpImSt03,
        author = "Leah Epstein and Csanad Imreh and Rob van Stee",
        title = "More on weighted servers or {FIFO} is better than {LRU}",
        year = 2003,
	journal = TCS,
	volume = 306,
        pages = "305--317"
        }

@inproceedings{EpsFav02A,
        author = "Leah Epstein and Lene M. Favrholdt",
        title = "Optimal non-preemptive semi-online scheduling on two
	        related machines",
        booktitle = MFCS02,
        publisher = "Springer",
	series = LNCS,
	volume = "2420",
        year = 2002,
        pages = "245-256"
        }

@article{EpsFav02B,
        author = "Leah Epstein and Lene M. Favrholdt",
        title = "Optimal preemptive semi-online scheduling to minimize
	        makespan on two	related machines",
        journal = ORL,
        volume = 30,
        pages = "269-275",
        year = 2002
        }

@inproceedings{EpNSSW99,
        author = "Leah Epstein and John Noga and Steven S. Seiden and
		Ji{\v{r}}{\'\i} Sgall and Gerhard J. Woeginger",
        title = "Randomized on-line scheduling for two uniform machines",
	booktitle = SODA99,
	organization = "ACM/SIAM",
	pages = "317-326",
	year = 1999
        }

@article{EpNSSW01,
        author = "Leah Epstein and John Noga and Steven S. Seiden and
		Ji{\v{r}}{\'\i} Sgall and Gerhard J. Woeginger",
        title = "Randomized on-line scheduling for two uniform machines",
   	journal = JOS,
	volume = 4,
	pages = "71-92",
	year = 2001
	}

@InProceedings{EpsSga99,
	author = "Leah Epstein and Ji{\v{r}}{\'\i} Sgall",
	title = "Approximation schemes for scheduling on
                  uniformly related and identical parallel machines",
	booktitle = ESA99,
        publisher = "Springer",
        series = LNCS,
        volume = "1643",
	year = 1999,
	pages = "151--162"
	}

@article{EpsSga00,
	author = "Leah Epstein and Ji{\v{r}}{\'\i} Sgall",
	title = "A lower bound for on-line scheduling
                  on uniformly related machines",
	journal = ORL,
	volume = 26,
	year = 2000,
	pages = "17--22"
	}

@inproceedings{EpsSte01,
        author = "Leah Epstein and Rob van Stee",
        title = "Lower bounds for on-line single-machine scheduling",
        booktitle = MFCS01,
        publisher = "Springer",
	series = LNCS,
	volume = "2136",
        year = 2001,
        pages = "338--350"
        }

@article{EpsSte03,
        author = "Leah Epstein and Rob van Stee",
        title = "Lower bounds for on-line single-machine scheduling",
        journal = TCS,
        year = 2003,
	volume = 299,
        pages = "439--450"
	}

@article{EpsSte04A,
        author = "Leah Epstein and Rob van Stee",
        title = "Buffer management problems",
        journal = SigactNews,
        year = 2004,
	volume = 35,
        pages = "58--66"
	}

@inproceedings{EpsSte04B,
        author = "Leah Epstein and Rob van Stee",
        title = "Optimal online bounded space multidimensional packing",
        booktitle = SODA04,
	organization = "ACM/SIAM",
        year = 2004,
	pages = "214-223"
        }

@inproceedings{EpsSte04C,
	author = "Leah Epstein and Rob van Stee",
	title = "On Variable-Sized Multidimensional Packing",
	pages =  "287-298",
        booktitle = ESA04,
        year = 2004,
        publisher = "Springer",
        series = LNCS,
	volume = 3221
}

@inproceedings{EpsLev05a,
  author    = {Leah Epstein and Meital Levy},
  title     = {Online Interval Coloring and Variants},
  booktitle = ICALP05,
        publisher = "Springer",
        series = LNCS,
        volume = "3570",
  year      = 2005,
  pages     = {602-613},
}

@inproceedings{EpsLev05b,
  author    = {Leah Epstein and Meital Levy},
  title     = {Online Interval Coloring with Packing Constraints},
  booktitle = MFCS05,
        publisher = "Springer",
        series = LNCS,
        volume = "3618",
  year      = 2005,
  pages     = {295-307},
}

@article{EpstYe07,
	author = "Leah Epstein and Deshi Ye",
	title = "Semi-online scheduling with ``end of sequence'' information",
	journal = JOCO,
	volume = "14",
	pages = "45-61",
	year = 2007
	}

@article{ErcLan88,
	author = "M. D. Ercegovac and T. Lang",
	title = "On-line scheme for computing rotation factors",
        journal = JpardisCom,
	volume = "5",
	year = 1988,
	pages = "209-227"
	}

@article{Erdos66,
        author = "Paul Erd\H{o}s and A. Hajnal",
        title = "On chromatic numbers of graphs and set systems",
        journal = ActMatSciHun,
        volume = "17",
        pages = "61-99",
        year = 1966,
        }

@inproceedings{ErgJow08,
        author    = {Funda Erg{\"u}n and
                     Hossein Jowhari},
        title     = {On distance to monotonicity and longest increasing subsequence
                     of a data stream},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year      = {2008},
        pages     = {730-736},
        }

@techreport{ErlSpi02,
        author = {T. Erlebach and F.C.R. Spieksman},
        title = {Interval selection: {A}pplications, algorithms and lower bounds},
        institution = {Computer Engineering and Networks Laboratory, ETH},
        year = 2002,
        MONTH = {October},
        number = {TIK-Report 152}
        }

@inproceedings{EJMNSW04,
        author = "Thomas Erlebach and Riko Jacob and Mat{\'u}s Mihal{\'a}k and
                  Marc Nunkesser and G{\'a}bor Szab{\'o} and Peter Widmayer",
        title = "An Algorithmic View on {OVSF} Code Assignment",
	pages =  "270-281",
        booktitle = STACS04,
        year = 2004,
        publisher = "Springer",
        series = LNCS,
	volume = "2996"
	}

@inproceedings{Estivi93,
        author = "V. Estivill-Castro",
        title = "The design of competitive algorithms via genetic algorithms",
        booktitle = "Proc. 5th Int. Conference on Computing and Information (ICCI)",
        year = 1993,
	organization = "IEEE",
        pages = "305-309"
	}

@inproceedings{EstShe91,
        author = "V. Estivill-Castro and M. Sherk",
        title = "Competitiveness and response time in on-line algorithms",
        booktitle = ISAAC91,
        year = 1991,
        pages = "284-293"
	}

@inproceedings{EveMon89,
        author = "Shimon Even and B. Monien",
        title = "On the number of rounds needed to disseminate information",
        booktitle = SPAA89,
	organization = "ACM",
        year = 1989,
        pages = "318-327"
	}


%FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF%

@article{FaGaKe96,
        author = "Ulrich Faigle and Renate Garbe and Walter Kern",
        title = "Randomized online algorithms for maximizing busy time
                 interval scheduling",
        journal = Computing,
        volume = "56",
        year = 1996,
        pages = "95-104"
        }

@article{FaKeTu89,
        author = "Ulrich Faigle and Walter Kern and Gyorgy Tur\'an",
        title = "On the performane of online algorithms for
                 partition problems",
        journal = ActCyb,
        volume = "9",
        year = 1989,
        pages = "107-119"
        }

@article{FaiNaw95,
        author = "Ulrich Faigle and Wim M. Nawijn",
        title = "Note on scheduling intervals on-line",
        journal = DAM,
        volume = "58",
        year = 1995,
        pages = "13-17"
        }

@inproceedings{FaRaTa03,
        author = {Jittat Fakcharoenphol and Satish Rao and Kunal Talwar},
        title = {A tight bound on approximating arbitrary metrics by tree metrics},
        booktitle = STOC03,
	organization = "ACM",
        year = {2003},
        pages = {448--455}
        }

@article{FaRaTa04,
        author = {Jittat Fakcharoenphol and Satish Rao and Kunal Talwar},
        title = {A tight bound on approximating arbitrary metrics by tree metrics},
        journal = JCSS,
        volume = {69},
        year = {2004},
        pages = {485--497},
        }

@inproceedings{FarLib98,
        author = "Martin Farach and Vincenzo Liberatore",
        title = "On local register allocation",
        booktitle = SODA98,
	organization = "ACM/SIAM",
        year =  1998,
        pages = "564-573",
        }

@article{FeMeGu92,
        author = "M. Feder and N. Merhav and M. Gutman",
        title = "Universal Prediction of individual sequences",
        journal = IEEEinfo,
        volume = 38,
        pages = "1258-1270",
        year = 1992
        }

@inproceedings{FeKaST93,
	author = "A. Feldmann and Ming-Yang Kao and Ji{\v{r}}{\'\i} Sgall and
		Shang-Hua Teng",
	title = "Optimal Online Scheduling of Parallel Jobs with Dependencies",
	booktitle = STOC93,
	organization = "ACM",
	year =  1993,
	pages = "642-651",
        organization = "ACM",
	}

@Article{FeKaST98,
  author =       "Anja Feldmann and Ming-Yang Kao and Ji{\v{r}}{\'\i} Sgall
                  and Shang-Hua Teng",
  title =        "Optimal Online Scheduling of Parallel Jobs with
                  Dependencies",
  journal =      JOCO,
  year =         1998,
  volume =       1,
  pages =        "393--411"
}

@techreport{FeMSST95,
        author = "Anja Feldmann and Bruce Maggs and Ji{\v{r}}{\'\i} Sgall and
                Daniel Sleator and Andrew Tomkins",
        title = "Competitive analysis of call admission algorithms
                that allow delay",
        institution = "Carnegie-Mellon University",
        year = 1995,
        number = "CMU-CS-95-102"
        }

@inproceedings{FeSgTe91,
        author = "Anja Feldmann and Ji{\v{r}}{\'\i} Sgall and Shang-Hua Teng",
        title = "Dynamic Scheduling on Parallel Machines",
        pages = "111-120",
        booktitle = FOCS91,
        year = 1991,
        organization = "IEEE",
        }

@article{FeSgTe94,
        author = "Anja Feldmann and Ji{\v{r}}{\'\i} Sgall and Shang-Hua Teng",
        title = "Dynamic Scheduling on Parallel Machines",
        journal = TCS,
        year = 1994,
	volume = "130",
	pages = "49-72",
        }

@book{Feller50,
	author = "W. Feller",
	title = "An introduction to probability theory and its applications",
	publisher = "John Wiley and Sons",
	year = 1950,
	}

@book{Feller70,
        author = "W. Feller",
        title = "An Introduction to Probability Theory
                and its Application, Vol. 1 ",
	publisher = "John Wiley and Sons",
        year = 1970,
        address = "New York",
        }

@book{Feller71,
        author = "W. Feller",
        title = "An Introduction to Probability Theory
                and its Application, Vol. 2",
	publisher = "John Wiley and Sons",
        year = 1970,
        address = "New York",
        }

@unpublished{Felsne96,
        author = "S. Felsner",
        title = "On-line chain partitions of orders",
        note = "To appear in" # TCS,
        }

@phdthesis{Feuers95,
        author = "Esteban Feuerstein",
        title = "On-line paging of Structured Data and
                 Multi-threaded Paging",
        school = "University of Rome",
        year = 1995,
        }

@inproceedings{FeuStr96,
        author = "Esteban Feuerstein and A. Strejilevich de Loma",
        title = "On multi-threaded paging",
        booktitle = ISAAC96,
        year = 1996,
        pages = "417-426",
        publisher = "Springer",
        series = LNCS,
        volume = "1178"
	}

@unpublished{FeSeSt99,
        author = "Esteban Feuerstein and Steve S. Seiden
                        and Alejandro Strejlevich de Loma",
        title = "The related server problem",
        year = 1999,
        note = "Unpublished manuscript"
        }

@inproceedings{FFKRRV91,
        author = "Amos Fiat and D. Foster and Howard Karloff and Yuval Rabani
                 and Yiftach Ravid and Sundar Vishwanathan",
        title =  "Competitive algorithms for layered graph traversal",
        booktitle =  FOCS91,
	organization = "IEEE",
        year =  1991,
        pages = "288-297"
        }

@article{FKLMSY91,
        author = "Amos Fiat and Richard Karp and Michael Luby and
		Lyle A. McGeoch and Daniel Sleator and Neal E. Young",
        title = "Competitive paging algorithms",
         journal = JAlg,
        volume = "12",
        year = 1991,
        pages = "685-699"
        }

@inproceedings{FiaKar95,
        author = "Amos Fiat and Anna Karlin",
        title = "Randomized and Multipointer Paging with Locality of
		Reference",
        booktitle = STOC95,
	organization = "ACM",
        year = 1995,
        pages = "626-634"
	}
@inproceedings{FLMMPS05,
  author    = {Amos Fiat and Meital Levy and
               Jir\'{\i} Matousek and Elchanan Mossel and
               J{\'a}nos Pach and Micha Sharir and
               Shakhar Smorodinsky and Uli Wagner and Emo Welzl},
  title     = {Online conflict-free coloring for intervals},
  booktitle = SODA05,
	organization = "ACM/SIAM",
  year      = 2005,
  pages     = {545--554},
}

@inproceedings{FiMaNa08,
        author    = {Amos Fiat and
                     Yishay Mansour and
                     Uri Nadav},
        title     = {Competitive queue management for latency sensitive packets},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year      = {2008},
        pages     = {228-237},
        }

@inproceedings{FiaMen97,
	author = "Amos Fiat and M. Mendel",
	title = "Truly online paging with locality of reference",
	booktitle = FOCS97,
	organization = "IEEE",
	year =  1997,
	pages = "326-335"
	}

@inproceedings{FiRaRa90,
        author = "Amos Fiat and Yuval Rabani and Yiftach Ravid",
        title = "Competitive $k$-server algorithms",
        booktitle = FOCS90,
	organization = "IEEE",
        year =  1990,
        pages = "454-463"
        }

@article{FiRaRa94,
        author = "Amos Fiat and Yuval Rabani and Yiftach Ravid",
        title = "Competitive k-server algorithms",
        journal = JCSS,
        volume = "48",
        year = 1994,
        pages = "410-428"
	}

@unpublished{FiRaRS91,
         author = "Amos Fiat and Yuval Rabani and Yiftach Ravid and
		Baruch Schieber",
         title = "A deterministic $O(k^3)$-competitive algorithm
        		for the circle",
         note = "Manuscript",
         year = 1991,
         }

@article{FiRaRS94,
        author = "Amos Fiat and Yuval Rabani and Yiftach Ravid and
		Baruch Schieber",
        title = "A deterministic $O(k^3)$-competitive k-server algorithm
		for the circle",
	journal = Algorithmica,
        volume = "11",
        year = 1994,
        pages = "572-578"
	}

@article{FiaRic94,
        author = "Amos Fiat and Moty Ricklin",
	title = "Competitive Algorithms for the Weighted Server Problem",
        journal = TCS,
	volume = "130",
	year = 1994,
	pages = "85-99"
	}

@inproceedings{FiaRos97,
        author = "Amos Fiat and Ziv Rosen",
        title = "Experimental Studies of Access Graph Based Heuristics:
		{B}eating the {LRU} Standard?",
        booktitle = SODA97,
	organization = "ACM/SIAM",
        year =  1997,
        pages = "63-72"
        }

@book{FiaWoe98,
	editor = "Amos Fiat and Gerhard J. Woeginger",
	title = "Online Algorithms: {The} State of the Art",
	publisher = "Springer",
	year = "1998"
	}

@article{FiaWoe99,
        author = "Amos Fiat and Gerhard J. Woeginger",
        title = "On-line scheduling on a single machine: {M}inimizing
		the total completion time",
        journal = ActInf,
        volume = 36,
        year = 1999,
        pages = "287-293"
        }

@inproceedings{FisSto73,
	author = "M. J. Fischer and L. J. Stockmeyer",
	title = "Fast On-line integer multiplication",
	booktitle = STOC73,
	organization = "ACM",
	year = 1973,
	pages = "67-72"
	}

@article{Fisher88,
        author = "D. C. Fisher",
        title = "{N}ext-{F}it packs a list and its reverse into the same
                 number of bins",
        journal = ORL,
        volume = "7",
        year = 1988,
        pages = "291-293",
        }

@article{FlGaTh92,
	author = "P. Flajolet and D. Gardy and L. Thimonier",
	title = "Birthday Paradox, Coupon Collectors, Caching Algorithms and
		Self-Organizing Search",
        journal = DAM,
	year = 1992,
	volume = "39",
	pages = "207-229"
	}

@inproceedings{FlKaMc05,
  author    = {Abraham Flaxman and Adam Tauman Kalai and
               H. Brendan McMahan},
  title     = {Online convex optimization in the bandit setting:
                 {G}radient descent without a gradient},
  booktitle = SODA05,
	organization = "ACM/SIAM",
  year      = 2005,
  pages     = {385--394},
}

@article{FleWah00,
	author = "Rudolph Fleischer and Michaela Wahl",
	title = "On-line scheduling revisited",
   	journal = JOS,
	volume = 3,
	pages = "343-353",
	year = 2000
	}

@inproceedings{FKKKKK07,
	  author    = {Michal Forisek and Branislav Katreniak and
	               Jana Katreniakov{\'a} and Rastislav Kralovic and
	               Richard Kr{\'a}lovic and Vladim\'{\i}r Koutn{\'y} and
	               Dana Pardubsk{\'a} and Tomas Plachetka and Branislav Rovan},
	  title     = {Online Bandwidth Allocation},
	  booktitle = ESA07,
	  year      = {2007},
	  pages     = {546--557}
	}

@article{FosVoh89,
         author = "D. P. Foster and R. V. Vohra",
         title = "Probabilistic analysis of a heuristic for the dual bin
                  packing problem",
         journal = IPL,
         volume = "31",
         year = 1989,
         pages = "287-290",
         }

@article{FosVoh93,
	author = "D.P. Foster and R.V. Vohra",
	title = "A randomization rule for selecting forecasts",
        journal = OpRes,
	volume = 41,
	pages = "704-709",
	year = 1993
	}

@article{Fotaki06,
	 author = {Dimitris Fotakis},
	 title = {Incremental algorithms for facility location and k-Median},
	 journal = TCS,
	 volume = {361},
	 year = {2006},
	 pages = {275--313}
	 }

@inproceedings{FraKro05,
  author    = {Gereon Frahling and Jens Krokowski},
  title     = {Online Occlusion Culling},
  booktitle = ESA05,
        publisher = "Springer",
        series = LNCS,
        volume = "3669",
  year      = 2005,
  pages     = {758--769},
}

@article{FraWag74,
         author = "P. A. Franaszek and T. J. Wagner",
         title = "Some distribution-free aspects of paging performance",
   	journal = JACM,
         volume = "21",
         year = 1974,
         pages = "31-39",
         }

@incollection{Frank90,
         author = "A. Frank",
         title = "Packing paths, cuts, and circuits --- a survey",
         booktitle = "Paths, Flows, and VLSI-Layout",
         publisher = "Springer",
         year = 1990,
         editor = "B. Korte and L. Lov\'asz and H.J. Proemel and A. Schrijver",
         pages = "49-100"
         }

@article{Freder80,
         author = "Greg N. Frederickson",
         title = "Probabilistic analysis for simple one- and two-dimensional
                  bin packing algorithms",
     	journal = IPL,
         volume = "11",
         year = 1980,
         pages = "156-161",
         }

@article{Freder84,
	author = "Greg N. Frederickson",
	title = "Self-organizing heuristics for implicit data structures",
         journal = Sicomp,
	volume = 13,
	year = 1984,
	pages = "277-291",
	}

@article{Freder85,
        author = "Greg N. Frederickson",
        title = "Data structures for on-line updating of minimum spanning
		trees with applications",
         journal = Sicomp,
        volume = "14",
        year = 1985,
        pages = "781-798"
	}


@article{FreSri87,
	author = "Greg N. Frederickson and M. A. Srinivas",
	title = "On-line updating of solutions to a class of matroid
		intersection problems",
        journal = InfComp,
	volume = "74",
	year = 1987,
	pages = "113-139"
	}

@inproceedings{FrJoMO94,
        author = "M. L. Fredman and David S. Johnson and  Lyle A. McGeoch
                and G. Ostheimer",
	title = "Data structures for traveling salesman",
	booktitle = SODA94,
	organization = "ACM/SIAM",
	pages = "145-154",
	year = 1994,
	organization = "ACM",
	}

@article{Freema83,
	author = "P. R. Freeman",
	title = "The Secretary Problem and its Extensions",
	year = 1983,
	journal = "International Statistical Review",
	volume = 51,
	pages = "189-206"
	}

@techreport{Frenk87,
        author = "J. B. G. Frenk",
        title = "On Banach Algebras, Renewal Measures and
                 Regenerative Processes",
        number = "Tract No. 38",
        institution = "CWI",
        year = 1987,
        }

@inproceedings{Freund96,
	author = "Yoav Freund",
	title = "Predicting a Binary Sequence almost as well as the
                Optimal Biased Coin",
	booktitle = COLT96,
	organization = "ACM",
	pages = "89-98",
	year = 1996
	}

@inproceedings{FreSch96,
	author = "Yoav Freund and Robert Schapire",
	title = "Game Theory, On-Line Prediction and Boosting",
	booktitle = COLT96,
	organization = "ACM",
	pages = "325-332",
	year = 1996
	}

@inproceedings{FrScSW97,
        author = "Yoav Freund and Robert Schapire and Yoram Singer
		and Manfred Warmuth",
        title = "Using and combining predictors that specialize",
        booktitle = STOC97,
	organization = "ACM",
        year = 1997,
        pages = "334-343"
        }

@inproceedings{FrKaNi08,
  author    = {Ehud Friedgut and
               Gil Kalai and
               Noam Nisan},
  title     = {Elections Can be Manipulated Often},
  booktitle = FOCS08,
	organization = "IEEE",
  year      = {2008},
  pages     = {243-249}
  }

@unpublished{FriLin92,
        author = "J. Friedman and Nathan Linial",
        title = "On convex body chasing",
        note = "Manuscript",
        year = 1992,
        }

@article{FriLin93,
        author = "J. Friedman and Nathan Linial",
        title = "On convex body chasing",
        journal = DisComGeo,
        volume = "9",
        year = 1993,
        pages = "293-321"
	}


@article{Friese87,
        author = "D. K. Friesen",
        title = "Tighter bounds for {LPT} scheduling on uniform processors",
        journal = Sicomp,
        volume = 16,
        pages = "554-560",
        year = 1987
        }

@article{FriLan84,
        author = "D. K. Friesen and M. A. Langston",
        title = "A storage-size selection problem",
     	journal = IPL,
        volume = "18",
        year = 1984,
        pages = "295-296",
        }

@article{FriLan86,
        author = "D. K. Friesen and M. A. Langston",
        title = "Variable sized bin packing",
         journal = Sicomp,
        volume = "15",
        year = 1986,
        pages = "222-230",
        }

@inproceedings{FukKim78A,
	author = "H. Fukushima and M. Kimura",
	title = "Self-organizing binary search tree with counting field",
	booktitle = "Proc. International Conference on Cybernetics
		and Society",
	publisher = "IEEE",
	address = "New York, NY, USA",
	pages = "1498-1502",
	year = 1978,
	}

@article{FukKim78B,
        author = "H. Fukushima and M. Kimura",
	title = "Expected costs in some types of self-organizing binary
		search tree",
	journal = "Record of Electrical and Communication Engineering
		Conversazione Tohoku University",
	volume = 52,
	year = 1983,
	pages = "18-26",
	}

@article{Fukush84,
	author = "H. Fukushima",
	title = "Expected costs in some classes of binary search trees",
	journal = JInfOptSci,
	volume = 5,
	year = 1984,
	pages = "183-197",
	}

@inproceedings{FuPoZh07,
	  author    = {Stanley P. Y. Fung and Chung Keung Poon and Feifeng Zheng},
	  title     = {Online Interval Scheduling: Randomized and Multiprocessor Cases},
	  booktitle = COCOON07,
  publisher = "Springer",
  series = LNCS,
  volume = "4598",
	  year      = {2007},
	  pages     = {176--186}
	}

%GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG%


@inproceedings{GaLuMT05,
  author    = {Martin Gairing and Thomas L{\"u}cking and
               Burkhard Monien and Karsten Tiemann},
  title     = {Nash Equilibria, the Price of Anarchy and the
         Fully Mixed Nash Equilibrium Conjecture},
  booktitle = ICALP05,
        publisher = "Springer",
        series = LNCS,
        volume = "3570",
  year      = 2005,
  pages     = {51--65},
}

@book{Gal80,
        author = "Shmuel Gal",
        title = "Search Games",
        publisher = "Academic Press",
        year = 1980
	}

@article{Galamb86,
        author = "Gabor Galambos",
        title = "Parametric lower bounds for online bin packing",
        journal = Sialgdis,
        volume = "7",
        year = 1986,
        pages = "362-367",
        }

@article{Galamb88,
        author = "Gabor Galambos",
        title = "Notes on {Lee's} harmonic fit algorithm",
        journal = "Annales Univ. Sci. Budapest., Sect. Comp.",
        volume = "9",
        year = 1988,
        pages = "121-126",
        }

@article{Galamb91,
        author = "Gabor Galambos",
        title = "A 1.6 lower bound for the two-dimensional online
                 rectangle bin packing",
        journal = ActCyb,
        volume = "10",
        year = 1991,
        pages = "21-24",
        }

@article{GalFre93,
        author = "Gabor Galambos and J. B. G. Frenk",
        title = "A simple proof of {Liang's} lower bound for online bin
                 packing and the extension to the parametric case",
        journal = DAM,
        volume = "41",
        year = 1993,
        pages = "173-178",
	}

@article{GaKeWo94,
        author = "Gabor Galambos and H. Kellerer and Gerhard J. Woeginger",
        title = "A lower bound for online vector packing algorithms",
        journal = ActCyb,
        volume = "10",
        year = 1994,
        pages = "23-34",
        }

@article{GalVli94,
        author = "Gabor Galambos and Andre van Vliet",
        title = "Lower bounds for 1-, 2-, and 3-dimensional online
                 bin packing algorithms",
        journal = Computing,
        volume = "52",
        year = 1994,
        pages = "281-297",
        }

@article{GalWoe93A,
        author = "Gabor Galambos and Gerhard J. Woeginger",
        title = "Repacking helps in bounded space online bin packing",
        journal = Computing,
        volume = "49",
        year = 1993,
        pages = "329-338",
        }

@article{GalWoe93B,
        author = "Gabor Galambos and Gerhard J. Woeginger",
        title = "An On-Line Scheduling Heuristic with Better
                 Worst Case Ratio than {Graham's} List Scheduling",
         journal = Sicomp,
        volume = "22",
        year = 1993,
        pages = "349-355",
        }

@article{GalWoe95,
        author = "Gabor Galambos and Gerhard J. Woeginger",
        title = "Online bin packing - a restricted survey",
        journal = ZOR,
        volume = "42",
        year = 1995,
        pages = "25-45"
        }

@article{GalIta93,
        author = "Zvi Galil and G. F. Italiano",
        title = "Maintaining the 3-edge connected components of a graph
		online",
         journal = Sicomp,
        volume = "22",
        year = 1993,
        pages = "11-28"
	}

@book{Gallag68,
        author = "R. G. Gallager",
        title = "Information Theory and Reliable Communication",
	publisher = "John Wiley and Sons",
        address = "New York",
        year = 1968,
        }

@article{GaRiSa82,
        author = "F. Galvin and I. Rival and B. Sands",
        title = "A {Ramsey-type} theorem for traceable graphs",
        journal = JCTB,
        volume = "33",
        year = 1982,
        pages = "7-16"
        }

@inproceedings{GaPoTa90,
        author = "G. Gambosi and A. Postiglione and M. Talamo",
        title = "New algorithms for on-line bin packing",
        booktitle = "Proc. 1st Italian Conference on Algorithms and
                 Complexity",
        year = 1990,
        }

@inproceedings{GamSeg07,
  author    = {Iftah Gamzu and Danny Segev},
  title     = {Improved Online Algorithms for the Sorting Buffer Problem},
  booktitle = STACS07,
  year      = {2007},
  pages     = {658--669}
}

@inproceedings{GaKhPS02,
  author    = {Rajiv Gandhi and Samir Khuller and
               Srinivasan Parthasarathy and Aravind Srinivasan},
  title     = {Dependent Rounding in Bipartite Graphs},
  booktitle = FOCS02,
	organization = "IEEE",
  year      = 2002,
  pages     = {323--332},
}

@inproceedings{GarGop92,
        author = "Juan A. Garay and I. S. Gopal",
        title = "Call preemption in communications networks",
        booktitle = "Proc. INFOCOM '92",
	organization = "IEEE",
        year = 1992,
        pages = "1043-1050"
        }
@inproceedings{GaGKMY93,
        author = "Juan A. Garay and I. S. Gopal and Shay Kutten and
		Yishay Mansour and M. Yung",
        title = "Efficient on-line call control algorithms",
        booktitle = ISTCS93,
	organization = "IEEE",
        year = 1993,
        pages = "285-293"
        }

@article{GarGra75,
        author = "Michael R. Garey and Ronald L. Graham",
        title = "Bounds on multiprocessor scheduling with
                 resource constraints",
         journal = Sicomp,
        volume = "4",
        year = 1975,
        pages = "187-200",
        }

@article{GaGrJY76,
        author = "Michael R. Garey and Ronald L. Graham and David S. Johnson
		and A. C. C. Yao",
        title = "Resource Constrained Scheduling as Generalized Bin Packing",
        journal = JCTA,
        volume = "21",
        year = 1976,
        pages = "257-298",
        }

@book{GarJoh79,
        author = "Michael R. Garey and David S. Johnson",
        title = "Computers and Intractability: {A} Guide to the theory of
                        of NP-Completeness",
        publisher = "Freeman and Company",
        year = 1979,
        address = "San Francisco",
        }

@incollection{GarJoh81,
        author = "Michael R. Garey and David S. Johnson",
        title = "Approximation algorithms for bin packing problems
                 - A survey",
        booktitle = "Analysis and Design of Algorithms in Combinatorial
                     Optimization",
        editor = "G. Ausiello and M. Lucertini",
        publisher = "Springer",
        address = "New York",
        year = 1981,
        pages = "147-172",
        }

@Article{GaJoST81,
	author = "M.R. Garey and D.S. Johnson and B.B. Simons and R.E. Tarjan",
	title = "Scheduling Unit-Time tasks with arbitrary release times and deadlines",
	journal = Sicomp,
	year = 1981,
	volume = 10,
	pages = {256--269}
}

@inproceedings{GaGuLS08,
  author    = {Naveen Garg and
               Anupam Gupta and
               Stefano Leonardi and
               Piotr Sankowski},
  title     = {Stochastic analyses for online combinatorial optimization
               problems},
  booktitle = SODA08,
	organization = "ACM/SIAM",
  year      = {2008},
  pages     = {942-951}
}

@inproceedings{GarHoc94,
        author = "N. Garg and Dorit Hochbaum",
        title = "An $0(logk)$ approximation algorithm for the $k$ minimum
		spanning tree problem in the plane",
        booktitle = STOC94,
	organization = "ACM",
        year = 1994,
	pages = "432-438",
        }

@inproceedings{Gamarn98,
        author = "David Gamarnik",
        title = "Stability of adversarial queues via fluid models",
        booktitle = FOCS98,
	organization = "IEEE",
        year = 1998,
	pages = "60-70",
        }


@techreport{GaKaPR94,
        author = "R. Gawlick and A. Kamath and Serge Plotkin and
		K. Ramakrishnan",
        title = "Routing and Admission Control of Virtual Circuits in
                  General Topology Networks",
        institution = "AT\&T Bell Laboratories",
        number = "BL011212-940819-19TM",
        year = 1994
        }

@techreport{GaKaPR95,
        author = "R. Gawlick and  A. Kamath and Serge Plotkin and
		K. Ramakrishnan",
        title = "Routing and Admission Control in General Topology Networks",
        institution = "Stanford Technical Report",
        number = "STAN-CS-TR-95-1548",
	year = 1995
	}

@article{Gazmur85,
         author = "P. G. Gazmuri",
         title = "Probabilistic analysis of machine scheduling",
         journal = MOR,
         volume = "10",
         year = 1985,
         pages = "328-339"
         }

@inproceedings{Gergov96,
        author = "J. Gergov",
        title = "Approximation algorithms for dynamic storage allocation",
        booktitle = ESA96,
        year = 1996,
        pages = "52-61",
        publisher = "Springer",
        series = LNCS,
        volume = "1136",
        }

@inproceedings{GerKut97,
        author = "O. Gerstel and Shay Kutten",
        title = "Dynamic wavelength allocation in {WDM} ring networks",
        booktitle = "Proc. ICC '97",
        year = 1997,
        pages = ""
        }

@inproceedings{GeSaRa96,
        author = "O. Gerstel and G.H. Sasaki and R. Ramaswami",
        title = "Dynamic channel assignment for {WDM} optical networks
                        with little or no wavelength conversion",
        booktitle = "Proc. 34th Allerton Conference on Communication,
		Control, and Computing",
        year = 1996,
        pages = ""
	}

@inproceedings{GhoMah08,
  author    = {Arpita Ghosh and
               Mohammad Mahdian},
  title     = {Charity auctions on social networks},
  booktitle = SODA08,
	organization = "ACM/SIAM",
  year      = {2008},
  pages     = {1019-1028}
}

@inproceedings{Godfre08,
        author    = {Brighten Godfrey},
        title     = {Balls and bins with structure: balanced allocations on hypergraphs},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year      = {2008},
        pages     = {511-517},
        }

@inproceedings{GoHePl98,
        author = "A. Goel and M. R. Henzinger and Serge Plotkin",
        title = "Online throughput-competitive algorithms for
                  multicast routing and admission control",
        booktitle = SODA98,
	organization = "ACM/SIAM",
        year = 1998,
        pages = "97-106"
        }

@inproceedings{GoHePT99,
        author = "A. Goel and M. R. Henzinger
			 and Serge Plotkin and Eva Tardos",
        title = "Scheduling data transfers in a network
			and the set scheduling problem",
        booktitle = STOC99,
	organization = "ACM",
        year = 1999,
        pages = "189-197"
        }

@inproceedings{GoeMeh08,
  author    = {Gagan Goel and
               Aranyak Mehta},
  title     = {Online budgeted matching in random input models with applications
               to Adwords},
  booktitle = SODA08,
	organization = "ACM/SIAM",
  year      = {2008},
  pages     = {982-991}
}

@inproceedings{GoeNaz08,
  author    = {Ashish Goel and
               Hamid Nazerzadeh},
  title     = {Price based protocols for fair resource allocation: convergence
               time analysis and extension to Leontief utilities},
  booktitle = SODA08,
	organization = "ACM/SIAM",
  year      = {2008},
  pages     = {1145-1153}
}

@incollection{GoeWil97,
        author = "M. X. Goemans and D. P.  Williamson",
        title = "The primal-dual method for approximation algorithms and
		its application to network design problems",
        booktitle = "Approximation Algorithms for NP-hard Problems",
	editor = "D. S. Hochbaum",
	publisher = "PWS Publishing Company",
        pages = "144-186",
        year = 1997
        }

@inproceedings{Goeman97,
	author = "Michel X. Goemans",
	title = "Improved approximation algorithms for scheduling with
		release dates",
	booktitle = SODA97,
	organization = "ACM/SIAM",
	pages = "591-598",
	year = 1997
	}

@inproceedings{GoeKle96,
        title = "An improved approximation ratio for the minimum
                 latency problem",
        author = " M.~Goemans and J.~Kleinberg",
        booktitle = SODA96,
        organization={ACM/SIAM},
        year = 1996,
        pages = {152--158}
        }

@article{GoeKle98,
        title = "An improved approximation ratio for the minimum
                 latency problem",
        author = " M.~Goemans and J.~Kleinberg",
        journal = "Mathematical Programming",
        year = 1998,
        volume = "82",
        pages = {111--124}
        }

@article{GoQSSW02,
        author = "Michel X. Goemans and Maurice Queyranne and
	       Andreas S. Schulz and Martin Skutella and Yaoguang Wang",
        title = "Multiprocessor scheduling with rejection",
        journal = Sidma,
        volume = 15,
        year = 2002,
        pages = "165-192"
        }

@article{GoWeWi96,
        author = "M. X. Goemans and J. Wein and D. P. Williamson",
        title = "Randomized algorithms for improved preemptive scheduling",
        year = 1996
        }


@article{GoLeVo87,
        author = "B.L. Golden and L. Levy and R. Vohra",
        title = "The orienteering problem",
        journal = Naval,
        volume = "34",
        year = 1987,
        pages = "307-318",
        }

@article{GoPaSu00,
        author = "Sally A. Goldman and Jyoti Parwatikar and Subhash Suri",
        title = "Online Scheduling with Hard Deadlines",
      	journal = JAlg,
	volume = 34,
	pages = "370-389",
	year = 2000
        }

@inproceedings{Goldwa99,
        author = "Michael H. Goldwasser",
        title = "Patience is a virtue: {The} effect of slack on the
			competitiveness for admission control",
        booktitle = SODA99,
	organization = "ACM/SIAM",
        pages = "396-405",
        year = 1999
        }

@article{Goldwa03,
        author = "Michael H. Goldwasser",
        title = "Patience is a virtue: {The} effect of slack on the
			competitiveness for admission control",
      	journal = JOS,
	volume = 6,
	pages = "183-211",
	year = 2003
        }

@inproceedings{GolPed06,
        author = "Michael H. Goldwasser and Mark Pedigo",
        title = "Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines",
        booktitle = SWAT06,
        year = 2006,
        pages = "113-123",
        publisher = "Springer",
        series = LNCS,
        volume = "4059"
	}

@techreport{Golin90,
        author = "M. J. Golin",
        title = "PhD thesis",
        institution = "Department of Computer Science, Princeton University",
        number = "CS-TR-266-90",
        year = 1990
        }

@inproceedings{GoHaKS04,
        author = "Andrew V. Goldberg and Jason D. Hartline and Anna R. Karlin and Michael E. Saks",
        title = "A Lower Bound on the Competitive Ratio of Truthful Auctions",
	pages =  "644-655",
        booktitle = STACS04,
        year = 2004,
        publisher = "Springer",
        series = LNCS,
	volume = "2996"
	}

@inproceedings{GoMuSu79,
     	author = "G. H. Gonnet and J. I. Munro and H. Suwanda",
     	title = "Towards self-organizing linear search",
     	booktitle = FOCS79,
	organization = "IEEE",
     	pages = "169-174",
     	year = 1979
     	}

@inproceedings{Gonzal92,
	author = "Teofilo F. Gonzales",
	title = "The On-line d-Dimensional Dictionary Problem",
	pages = "376-385",
	booktitle = SODA92,
	organization = "ACM/SIAM",
	year = 1992,
	}

@article{GonJoh80,
	author = "Teofilo F. Gonzales and D. B. Johnson",
	title = "A new algorithm for preemptive scheduling of trees",
   	journal = JACM,
	volume = "27",
	pages = "287-312",
	year = 1980
	}

@Article{GonSah78,
  author = 	 "Teofilo F. Gonzales and Sartaj Sahni",
  title = 	 "Preemptive Scheduling of Uniform Processor Systems",
  journal = 	 JACM,
  year = 	 1978,
  volume =       25,
  pages = 	 "92--101"
}

@inproceedings{GoHaKL08,
        author    = {S. Dov Gordon and
                     Carmit Hazay and
                     Jonathan Katz and
                     Yehuda Lindell},
        title     = {Complete fairness in secure two-party computation},
        booktitle = STOC08,
	organization = "ACM",
        year      = {2008},
        pages     = {413-422}
        }

@article{Graham66,
        author = "Ronald L. Graham",
        title = "Bounds for certain multiprocessing anomalies",
        journal = "Bell System Technical J.",
        volume = "45",
        year = 1966,
        pages = "1563-1581",
        }

@article{Graham69,
	author = "Ronald L. Graham",
	title = "Bounds on multiprocessing timing anomalies",
	journal= Siappmat,
	volume = "17",
	pages = "263-269",
	year = 1969,
	}

@article{GraHel85,
        author = "Ronald Graham and P. Hell",
        title = "On the history of the minimum spanning tree problem",
        journal = "Annals of the History of Computing",
        volume = "7",
        year = 1985,
        pages = "43-57"
        }

@article{GrLaLK79,
        author = "R.L. Graham and E.L. Lawler and J.K. Lenstra and A.H.G. Rinnooy Kan",
        title = "Optimization and approximation in deterministic sequencing and
                 scheduling: {A} survey",
        journal = "Ann. Discrete Math",
        volume = 5,
        pages = "287--326",
        year = 1979
}

@book{GrKnPa94,
        author = "Ronald L. Graham and Donald E. Knuth and Oren Patashnik",
        title = "Concrete Mathematics",
        publisher = "Addison-Wesley",
        address = "Reading, MA",
        edition = "2nd",
        year = 1994
        }

@book{Green92,
        author = "P.E. Green",
        title = "Fiber-Optic Communication Networks",
        publisher = "Prentice Hall",
        year = 1992,
        }

@inproceedings{GriKar97,
        author = "Dima Grigoriev and Marek Karpinski",
        title = "Randomized $\Omega(n^2)$ Lower Bound for Knapsack",
        booktitle = STOC97,
	organization = "ACM",
        year = 1997,
        pages = "76-85"
        }

@inproceedings{GrRaVW95,
     	author = "D. Grinberg and S. Rajagopalan and R. Venkatesan
		and V. K. Wei",
     	title = "Splay trees for data compression",
     	booktitle = SODA95,
	organization = "ACM/SIAM",
     	pages = "522-530",
     	year = 1995
     	}

@article{Groeme82,
        author = "H. Groemer",
        title = "Covering and packing properties of bounded sequences of
                  convex sets",
        journal = "Mathematika",
        volume = "29",
        year = 1982,
        pages = "18-31",
        }

@techreport{GroLoe95,
	author = "Martin Gr{\"o}tschel and Andreas L{\"o}bel",
	title = "Ein mathematisches {M}odell zur {L}{\"o}sung des
                {F}ahrzeug-{U}mlaufplanungs-{P}roblems",
	institution = "Konrad-Zuse-Institut Berlin",
	year = 1995,
	series = " ",
	}

@inproceedings{Grove91,
        author = "Edward Grove",
        title = "The harmonic $k$-server algorithm is competitive",
        booktitle = STOC91,
	organization = "ACM",
        year = 1991,
        pages = "260-266"
        }

@inproceedings{Grove95,
        author = "Edward F. Grove",
        title = "Online binpacking with lookahead",
        booktitle = SODA95,
	organization = "ACM/SIAM",
        year = 1995,
        pages = "430-436",
        }

@inproceedings{GrKaKV95,
        author = "Edward Grove and Ming-Yang Kao and P. Krishnan and
		Jeffrey Vitter",
        title = "Online Perfect Matching and Mobile Computing",
        booktitle = WADS95,
        year = 1995,
        publisher = "Springer",
        series = LNCS,
        volume = "955",
        }

@article{Gwangs94,
	author = "Rhee Gwangsoo",
	title = "An approximation algorithm for the reversible shortest
		common superstring problem",
	journal = "J. of the Korea Information Science Society",
	volume = 21,
	pages = "1261-1268",
	year = 1994,
	}

@inproceedings{GuMoRa92,
        author =  "L. J. Guibas and Rajeev Motwani and Prabhakar Raghavan",
        title = "The robot localization problem in two dimensions",
        booktitle = SODA92,
	organization = "ACM/SIAM",
        year = 1992,
        pages = "259-268"
        }

@inproceedings{GHKKKM05,
  author    = {Venkatesan Guruswami and Jason D. Hartline and
               Anna R. Karlin and David Kempe and Claire Kenyon and
               Frank McSherry},
  title     = {On profit-maximizing envy-free pricing},
  booktitle = SODA05,
	organization = "ACM/SIAM",
  year      = 2005,
  pages     = {1164--1173},
}

@article{Gyarfa75,
        author = "A. Gy\'{a}rf\'{a}s",
        title = "On {Ramsey} covering numbers",
        journal = CollBolyai,
	volume = 10,
        year = 1975,
        pages = "217-227"
        }

@article{Gyarfa85,
        author = "A. Gy\'{a}rf\'{a}s",
        title = "Problems from the world surrounding perfect graphs",
        journal= "Zastowania Matematyki Applicationes Mathemacticae",
        volume = "19",
        year = 1985,
        pages = "413-441"
	}

@article{GyaLel88,
	author = "A. Gy\'{a}rf\'{a}s and J. Lehel",
	title = "On-line and first-fit colorings of graphs",
	journal = JoGraTh,
	volume = "12",
	year = 1988,
	pages = "217-227"
	}

@article{GyaLel91,
        author = "A. Gy\'{a}rf\'{a}s and J. Lehel",
        title = "Effective on-line coloring of {$P_5$-free} graphs",
        journal = Combinatorica,
        volume = "11",
        year = 1991,
        pages = "181-184"
	}

@article{GySzTu80,
        author = "A. Gy\'{a}rf\'{a}s and E. Szemer\'edi and Z. Tuza",
        title = "Induced subtrees in graphs of large chromatic number",
        journal= DM,
        volume = "30",
        year = 1980,
        pages = "235-244"
	}

%HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH%

@inproceedings{Hajek01,
        author =  "B. Hajek",
        title = "On the competitiveness of online scheduling of unit-length
                        packets with hard deadlines in slotted time",
        booktitle = "Conference in Information Sciences and Systems",
        year = 2001,
        pages = "434--438",
       }

@inproceedings{HaKlLR05,
  author    = {Mohammad Taghi Hajiaghayi and Robert D. Kleinberg and
               Tom Leighton and Harald R{\"a}cke},
  title     = {Oblivious routing on node-capacitated and
                 directed graphs},
  booktitle = SODA05,
	organization = "ACM/SIAM",
  year      = 2005,
  pages     = {782--790},
}

@inproceedings{HaKlPa04,
  author    = {Mohammad Taghi Hajiaghayi and Robert D. Kleinberg and
               David C. Parkes},
  title     = {Adaptive Limited-Supply Online Auctions},
  booktitle = {Proc. ACM Conference on Electronic Commerce (EC)},
  year      = 2004,
  pages     = {71--80},
}

@inproceedings{HaKlLe07,
  	author    = {Mohammad Taghi Hajiaghayi and Robert Kleinberg and Tom Leighton},
  	title     = {Semi-Oblivious Routing: {Lower} Bounds},
  	booktitle = SODA07,
  	year      = {2007},
  	pages     = {929--938}
}

@inproceedings{HaHNRR08,
        author = {Prahladh Harsha and Thomas P. Hayes and Hariharan Narayanan and Harald R\"{a}cke and Jaikumar Radhakrishnan},
        title = {Minimizing average latency in oblivious routing},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year = {2008},
        pages = {200--207},
}

@article{Halfin89,
         author = "S. Halfin",
         title = "{N}ext {F}it bin packing with random piece sizes",
         journal = JAppProb,
         volume = "26",
         year = 1989,
         pages = "503-511",
         }

@article{HaScSW97,
         author = "Leslie A. Hall and Andreas S. Schulz and David B. Shmoys
		and Joel Wein",
         title = "Scheduling to minimize average completion time: {O}ff-line
		and on-line approximation algorithms",
         journal = MOR,
         volume = "22",
         year = 1997,
         pages = "513-544",
         }

@inproceedings{HalShm89,
        author =  "Leslie Hall and David Shmoys",
        title = "Approximation schemes for constrained scheduling problems",
        booktitle = FOCS89,
	organization = "IEEE",
        year = 1989,
        pages = "134-139",
        }

@inproceedings{HaShWe96,
        author =  "Leslie Hall and David Shmoys and Joel Wein",
        title = "Scheduling to minimize average completion time:
        {O}ff-line and on-line algorithms",
        booktitle = SODA96,
	organization = "ACM/SIAM",
        year = 1996,
        pages = "142-151"
        }

@phdthesis{Halldo91,
	author = "M. Halld{\'o}rsson",
	title = "Frugal Algorithms for the Independent Set and Graph
                 Coloring Problems",
	school = "Rutgers University",
	year = 1991
	}

@inproceedings{Halldo92,
	author = "M. M. Halld{\'o}rsson",
	title = "Parallel and on-line graph coloring algorithms",
        booktitle = ISAAC92,
	year = 1992,
	pages = "61-70",
        publisher = "Springer",
        series = LNCS,
        volume = "650"
	}

@inproceedings{HalSze92,
	author = "M. M. Halld{\'o}rsson and M. Szegedy",
	title = "Lower bounds on on-line graph coloring",
	booktitle = SODA92,
	organization = "ACM/SIAM",
	year = 1992,
	pages = "211-216"
	}

@article{HalSze94,
        author = "M. M. Halldorsson and M. Szegedy",
        title = "Lower bounds for on-line graph coloring",
        journal = TCS,
        volume = "130",
        year = 1994,
        pages = "163-174"
	}

@inproceedings{HaDuVZ07,
	  author    = {Qiaoming Han and Donglei Du and Juan Vera and Luis F. Zuluaga},
	  title     = {Improved Bounds for the Symmetric Rendezvous Value on the Line},
	  booktitle = SODA07,
	  year      = {2007},
	  pages     = {69--78}
	}

@book{HaLiPo67,
         author = "G. H. Hardy and J. E. Littlewood and G. Polya",
         title = "Inequalities",
         publisher = "Cambridge University Press",
         address = "Cambridge, England",
         year = 1967,
         }

@unpublished{HarMas96,
	author = "S. Hart and A. Mas-Colell",
	title = "Correlated Learning",
	note = "Unpublished manuscript",
	year = 1996,
	}

@article{HarPot83,
        author = "A.M.A Hariri and C.N. Potts",
        title = "An algorithm for single machine sequencing with release
	         times to minimize total weighted completion time",
        journal = DAM,
        volume = "5",
        year = 1983,
        pages = "99-109",
	}

@inproceedings{HaNeOn08,
        author    = {Nicholas J. A. Harvey and
                     Jelani Nelson and
                     Krzysztof Onak},
        title     = {Sketching and Streaming Entropy via Approximation Theory},
        booktitle = FOCS08,
	organization = "IEEE",
        year      = {2008},
        pages     = {489-498}
        }

@article{HeDosa05,
	author = {Yong He and Gy{\"o}rgy D{\'o}sa},
	title = "Semi-online scheduling jobs with tightly-grouped processing times on three identical machines",
	journal = DAM,
	volume = 150,
	year = 2005,
	pages = "140--159",
	}

@article{HeJian04A,
	author    = {Yong He and Yiwei Jiang},
	title     = "Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines",
	journal = ActInf,
	volume = "40",
	pages     = {367-383},
	year      = 2004,
}

@article{HeJian04B,
	author    = {Yong He and Yiwei Jiang},
	title     = "Preemptive semi-online scheduling with tightly-grouped processing times",
	journal = "J.~Comput. Sci. Technol.",
	volume = "19",
	pages     = {733-739},
	year      = 2004,
}

@inproceedings{HeJian05,
  author    = {Yong He and Yiwei Jiang},
  title     = {Preemptive Semi-online Scheduling on Parallel Machines with
               Inexact Partial Information.},
  booktitle = ISAAC05,
        publisher = "Springer",
        series = LNCS,
        volume = "3827",
  year      = 2005,
  pages     = {422-432},
}

@article{HeZhan99,
	author = "Yong He and Guochuan Zhang",
	title = "Semi on-line scheduling on two identical machines",
	journal = Computing,
	volume = 62,
	year = 1999,
	pages = "179-187",
	}

@article{Hebrar91,
        author = "J.-J.-J. Hebrard",
        title = "An algorithm for distinguishing efficiently bit-strings
		by their subsequences",
        journal = TCS,
        volume = "82",
        year = 1991,
        pages = "35-49"
	}

@inproceedings{HeSlWa89,
	author = "D. Helmbold and R. Sloan and M. K. Warmuth",
	title = "Learning Nested Differences of Intersection-Closed
                 Concept Classes",
	booktitle = COLT89,
        publisher = "Morgan Kaufman",
	year = 1989,
	pages = "41-56"
	}

@article{HeSlWa90,
	author = "D. Helmbold and R. Sloan and M. K. Warmuth",
	title = "Learning Nested Differences of Intersection Closed
                 Concept Classes",
	journal = ML,
	volume = "5",
	pages = "165-196",
	year = 1990
	}

@article{Hendri73,
        author = "W. J. Hendricks",
        title = "An extension of a theorem concerning an intersting
             {Markov} chain",
        journal = JAppProb,
        volume = "10",
        pages = "886-890",
        year = 1973
        }

@article{Hendri76,
     	author = "W. J. Hendricks",
     	title = "An account of self-organizing systems",
         journal = Sicomp,
     	volume = "5",
     	pages = "715-723",
     	year = 1976
     	}

@article{Herlih91,
        author = "Maurice Herlihy",
        title = "Wait-free synchronization",
        journal = TOPLAS,
        volume = 13,
	year = 1991,
        pages = "124-149"
	}

@article{HeCoWS94,
        author = "M. C. Herbordt and J. C. Corbett and C. C. Weems and
		J. Spalding",
        title = "Practical algorithms for online routing on fixed and
		reconfigurable meshes",
        journal = JpardisCom,
        volume = "20",
        year = 1994,
        pages = "341-356"
	}

@article{HesHir85,
     	author = "J. H. Hester and D. S. Hirschberg",
     	title = "Self-organizing linear search",
     	journal = ACMcomsur,
     	volume = "17",
     	pages  = "295-312",
     	year = 1985
     	}

@book{Hochba97,
        EDITOR= "Dorit Hochbaum",
        title = "Approximation Algorithms for NP-hard Problems",
        publisher = "PWS Publishing Company",
        year = 1997
        }

@article{HocShm87,
	author = "Dorit S. Hochbaum and David B. Shmoys",
	title = "Using Dual Approximation Algorithms for Scheduling
               Problems:  {T}heoretical and Practical Results",
   	journal = JACM,
	volume = "34",
	year = 1987,
	pages = "144-162"
	}
@article{HocShm88,
	author = "Dorit S. Hochbaum and David Shmoys",
	title = "A Polynomial Approximation Scheme for Scheduling on
		Uniform Processors: {U}sing the Dual Approximation Approach",
         journal = Sicomp,
	volume = "17",
	year = 1988
	}

@article{Hoffma82,
        author = "U. Hoffman",
        title = "A class of simple stochastic online bin packing algorithms",
        journal = Computing,
        volume = "29",
        year = 1982,
        pages = "227-239",
        }

@inproceedings{HoIcKK97,
        author =  "F. Hoffmann and C. Icking and R. Klein and K. Kriegel",
        title = "A competitive strategy for learning a polygon",
        booktitle = SODA97,
	organization = "ACM/SIAM",
        year = 1997,
        pages = "166-174",
        }

@article{Hofri80,
        author = "Micha Hofri",
        title = "Two-dimensional packing: {E}xpected performance of
                 simple level algorithms",
        journal = InfCont,
        volume = "45",
        year = 1980,
        pages = "1-17",
        }

@article{Hofri84,
        author = "Micha Hofri",
        title = "A probabilistic analysis of the {N}ext-{F}it bin
                 packing algorithm",
         journal = JAlg,
        volume = "5",
        year = 1984,
        pages = "547-556",
        }

@book{Hofri87,
        author = "Micha Hofri",
        title = "Probabilistic analysis of algorithms",
        publisher = "Springer",
        year = 1987,
        address = "New York",
        }

@article{HofKah86,
        author = "Micha Hofri and S. Kahmi",
        title = "A stochastic analysis of the {NFD} bin
                 packing algorithm",
         journal = JAlg,
        volume = "7",
        year = 1986,
        pages = "489-509",
        }

@article{HonLeu92,
        author = "K. S. Hong and J. Y.-T. Leung",
        title = "On-line scheduling of real-time tasks",
        journal = IEEEcomp,
        year = 1992,
	volume = "41",
	pages = "1326-1331"
        }

@article{HoPoWo00,
        author = "Han Hoogeveen and Chris N. Potts and Gerhard J. Woeginger",
        title = "On-line scheduling on a single machine: {Maximizing}
	        the number of early jobs",
   	journal = ORL,
	volume = 27,
	pages = "193-196",
	year = 2000
	}

@inproceedings{HooVes96,
        author = "J. A. Hoogeveen and Arjen P. A. Vestjens",
	title = "Optimal on-line algorithms for single-machine scheduling",
	booktitle = "Proc. 5th Conf. Integer Programming and Combinatorial
		Optimization (IPCO)",
        publisher = "Springer",
        series = LNCS,
	volume = "1084",
	year = 1996,
	pages = "404-414"
	}

@Article{HoLaSe77,
	author = "E. Horwath and E. C. Lam and R. Sethi",
	title = "A Level Algorithm for Preemptive Scheduling",
	journal = JACM,
	year = 1977,
	volume = 24,
	pages = "32--43"
}

@article{HowVen95,
        author = "R. R. Howell and M. K. Venkatrao",
        title = "On non-preemptive scheduling of recurring tasks using
		inserted idle times",
        journal = InfComp,
        volume = "117",
        year = 1995,
        pages = "50-62"
	}

@inproceedings{Hoylan88,
        author = "S. O. Hoyland",
        title = "Bin-packing in 1.5 dimensions",
        booktitle = SWAT88,
        year = 1988,
        publisher = "Springer",
        series = LNCS,
	volume = "318"
        }

@article{HuChHw94,
        author = "X. D. Hu and P. D. Chen and F. K. Hwang",
        title = "A new competitive algorithm for the counterfeit coin problem",
     	journal = IPL,
        volume = "51",
        year = 1994,
        pages = "213-218"
	}

@inproceedings{HuiMar92,
        author = "L. Chi Kwong Hui and C. U. Martel",
        title = "On efficient unsuccessful search",
        booktitle = SODA92,
	organization = "ACM/SIAM",
        year = 1992,
        pages = "217-227"
	}

@inproceedings{HuiMar93A,
        author = "L. Chi Kwong Hui and C. U. Martel",
        title = "Randomized competitive algorithms for successful and
		unsuccessful search on self-adjusting linear lists",
        booktitle = ISAAC93,
        year = 1993,
        pages = "426-435",
        publisher = "Springer",
        series = LNCS,
        volume = "762"
	}

@article{HuiMar93,
        author = "L. C. K. Hui and C. Martel",
        title = "Unsuccessful search in self-adjusting data structures",
         journal = JAlg,
        volume = "15",
        year = 1993,
        pages = "477-481"
	}

@inproceedings{HuiMar94,
        author = "Lucas Chi Kwong Hui and C. U. Martel",
        title = "Analyzing deletions in competitive self-adjusting linear
		list algorithms",
        booktitle = ISAAC94,
        year = 1994,
        pages = "433-441",
        publisher = "Springer",
        series = LNCS,
        volume = "834"
	}

@book{Hull93,
	author = "J. Hull",
	title = "Options, Futures, and other Derivative Securities",
	year = 1993,
	publisher = "Prentice Hall, Inc."
	}

@article{HuLoST87,
        author = "C. A. J. Hurkens and Laszlo Lovasz and A. Schrijver and
                  E. Tardos",
        title = "How to tidy up your set-sytem?",
        journal = CollBolyai,
        volume = "52",
        year = 1987,
        pages = "309-313",
        }

%IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII%

@inproceedings{IbJiWa91,
        author = "Oscar H. Ibarra and Tao Jiang and Hui Wang.",
        title = "Some results concerning 2-D online tessellation acceptors
		and 2-D alternating finite automata",
        booktitle = MFCS91,
        year = 1991,
        pages = "221-230",
        publisher = "Springer",
        series = LNCS,
        volume = "520"
	}

@inproceedings{IckKle95,
	author = "Christian Icking and Rolf Klein",
	title = "Searching for the kernel of a polygon- A
            competitive strategy",
	booktitle = "Proc. 11th Symp. on Computational Geometry",
	year = 1995,
	pages = "258-266"
	}

@inproceedings{IcKlMa93,
	author = "Christian Icking and Rolf Klein and Lihong Ma",
	title = "How to look around a corner",
        booktitle = "Proc. 5th Canadian Conference on Computational
                     Geometry",
	year = 1993,
	pages = "443-448"
	}

@unpublished{IduSch92,
        author = "R. Idury and A. Schaffer",
        title = "A Better Lower Bound for On-Line Bottleneck Matching",
        note= "Manuscript",
        year = 1992,
        }

@article{ImaWax91,
        author = "M. Imase and B. M. Waxman",
        title = "Dynamic Steiner tree problem",
        journal = Sidma,
        volume = "4",
        year = 1991,
        pages = "369-384"
        }

@article{InTaVo85,
        author = "K. Inoue and I. Takanami and R. Vollmar",
        title = "Alternating on-line Turing machines with only universal
		states and small space bounds",
        journal = TCS,
        volume = "41",
        year = 1985,
        pages = "331-339"
	}

@article{Irani90,
	author = "Sandy Irani",
	title = "Coloring inductive graphs on-line",
	journal = Algorithmica,
	volume = "11",
	year = 1994,
	pages = "53-72",
	}

@article{Irani91,
        author = "Sandy Irani",
        title = "Two results on the list update problem",
     	journal = IPL,
	volume = "38",
	year = 1991,
	pages = "301-306"
        }

@unpublished{Irani96,
     	author = "Sandy Irani",
     	title = "Corrected version of the SPLIT algorithm",
     	note = "Manscript",
     	year = 1996
     	}

@inproceedings{Irani97,
        author = "Sandy Irani",
        title = "Page Replacement with Multi-Size Pages and
		Applications to Web Caching",
        booktitle = STOC97,
	organization = "ACM",
        year = 1997,
        pages = "701-710"
        }

@inproceedings{IrKaPh92,
        author = "Sandy Irani and Anna Karlin and Steven Phillips",
        title = "Strongly competitive algorithms for paging
  		   with locality of reference",
        booktitle = SODA92,
	organization = "ACM/SIAM",
        year = 1992,
	pages = "228-236"
        }

@incollection{IraKar97,
        author = "Sandy Irani and Anna Karlin",
        title = "Online computation",
        booktitle = "Approximation Algorithms for NP-complete Problems",
	publisher = "PWS Publishing Company",
	editor = "D.S. Hochbaum",
        year = 1997,
        pages = "521-559"
        }

@article{IrKaPh96,
        author = "Sandy Irani and Anna R. Karlin and Steven Phillips",
        title = "Strongly competitive algorithms for paging with locality of
		reference",
         journal = Sicomp,
        year = 1996,
        volume = "25",
        pages = "477-497"
	}

@inproceedings{IraLeu96,
        author = "Sandy Irani and Vitus Leung",
        title = "Scheduling with conflicts, and applications to traffic
        signal control",
        booktitle = SODA96,
	organization = "ACM/SIAM",
        year = 1996,
        pages = "85-94"
        }

@inproceedings{IraLeu97,
        author = "Sandy Irani and Vitus Leung",
        title = "Probabilistic analysis for scheduling with conflicts",
        booktitle = SODA97,
	organization = "ACM/SIAM",
        year =  1997,
        pages = "286-295"
        }

@inproceedings{IraRab93,
	author = "Sandy Irani and Yuval Rabani",
	title = "On the value of information in coordination games",
	booktitle = FOCS93,
	organization = "IEEE",
	year = 1993,
	pages = "12-31"
	}

@article{IraRab96,
	author = "Sandy Irani and Yuval Rabani",
	title = "On the Value of Coordination in Distributed Decision Making",
         journal = Sicomp,
	volume = "25",
	pages = "498-519",
	year = 1996
	}

@unpublished{IraRam94,
        author = "Sandy Irani and D. Ramanathan",
        title = "The Problem of Renting versus Buying",
        note = "Unpublished manuscript",
        year = 1994,
        }

@inproceedings{IrReSW91,
        author = "Sandy Irani and Nick Reingold and Daniel Sleator and
		Jeffery Westbrook",
        title = "Randomized competitive algorithms for the list update problem",
        booktitle = SODA91,
	organization = "ACM/SIAM",
        year = 1991,
	pages = "251-260"
	}

@article{IraRub91,
       author = "Sandy Irani and R. Rubinfeld",
       title = "A competitive 2-server algorithm",
     	journal = IPL,
        volume = "39",
        year = 1991,
        pages = "85-91"
        }

@unpublished{IraSei95A,
	author = "Sandy Irani and Steve S. Seiden",
	title = "An Almost Optimal Algorithm for Uniform Task Systems",
	note = "Unpublished manuscript",
	year = 1995,
	}

@inproceedings{IraSei95,
        author = "Sandy Irani and Steve S. Seiden",
        title = "Randomized algorithms for metrical task systems",
        booktitle = WADS95,
        year = 1995,
        pages = "159-170",
        publisher = "Springer",
        series = LNCS,
        volume = "955",
        }

@article{IraSei98,
        author = "Sandy Irani and Steven S. Seiden",
	title = "Randomized Algorithms for Metrical Task Systems",
        journal = TCS,
	year = 1998,
	volume = "194",
	pages = "163-182"
	}

@article{Irani02,
        author = "Sandy Irani",
        title = "Page replacement with multi-size pages and
                applications to web caching",
        journal = Algorithmica,
        volume = "33",
        year = "2002",
        pages = "384--409"
        }

@article{IraPru05,
        author = "Sandy Irani and Kirk Pruhs",
        title = "Algorithmic problems in power management",
        journal = SigactNews,
        volume = "36",
        year = "2005",
        pages = "63--76"
        }

@article{Isbell57,
        author = "J.R.~Isbell",
        title = "An optimal search pattern",
        journal = "Naval Research Logistics Quarterly",
        volume = "4",
        year = "1957",
        pages = "357--358"
        }

@article{ItInTa89,
	author = "A. Ito and K. Inoue and I. Takanami",
	title = "Deterministic two-dimensional on-line tessellation
		acceptors are equivalent to two-way two-dimensional
		alternating finite automata through 180 degrees-rotation",
        journal = TCS,
	volume = "66",
	year = 1989,
	pages = "273-287"
	}

@inproceedings{IvkLlo93,
        author = "Z. Ivkovic and E. Lloyd",
        title = "Fully dynamic algorithms for bin packing:
                 {B}eing myopic helps",
        booktitle = ESA93,
        year = 1993,
        pages = "224-235",
        publisher = "Springer",
        series = LNCS,
        volume = "726",
        }

@article{IvkLlo96,
        author = "Z. Ivkovic and E. Lloyd",
        title = "A fundamental restriction on fully dynamic maintenance
		of bin packing",
     	journal = IPL,
        volume = "59",
        year = 1996,
        pages = "229-232",
        }

@techreport{IvkLlo94,
        author = "Z. Ivkovic and E. Lloyd",
        title = "Partially dynamic bin packing can be solved within
                 1+eps in (amortized) polylogaritmic time",
        institution = "Dept. Comp. and Inf. Sc.,
                 University of Delaware, Newark",
        year = 1994,
        }

%JJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJ%

@techreport{Jackso55,
	author = "J.R. Jackson",
	title = "Scheduling a production line to minimize maximum tardiness",
	number = "43",
	institution = "Management Science Research Project,
		    Univ. of California, Los Angeles, U.S.A.",
	year = "1955"
}

@article{Jamshi92,
	author = "F. Jamshidian",
	title = "Asymptotically Optimal Portfolios",
	year = 1992,
	journal = MathFinance,
	volume = 2,
	pages = "131-150",
	}

@article{JaNiPo99,
  author = {V. Jacobson and K. Nicholas and K. Poduri},
  title = {An expedited forwarding {PHB}. {Internet RFC 2598}},
  year = 1999,
}

@inproceedings{Janard91,
        author = "R. Janardan",
        title = "On maintaining the width and diameter of a planar
		point-set online",
        booktitle = ISAAC91,
        year = 1991,
        pages = "137-149"
	}

@article{JaKrNS00,
 	author = {Jeanette Janssen and Danny Krizanc and Lata Narayanan and Sunil Shende},
 	title = {Distributed online frequency assignment in cellular networks},
 	journal = JAlg,
 	volume = {36},
 	year = {2000},
 	pages = {119--151}
 }

@article{JanLas94A,
        author = "J. Januszewski and M. Lassak",
        title = "Online covering the unit cube by cubes",
        journal = DisComGeo,
        volume = "12",
        year = 1994,
        pages = "433-438",
        }

@article{JanLas94B,
        author = "J. Januszewski and M. Lassak",
        title = "Online covering by boxes and by covex bodies",
        journal = "Bull. Pol. Acad. Math.",
        volume = "42",
        year = 1994,
        pages = "69-76",
        }

@article{JanLas95A,
        author = "J. Januszewski and M. Lassak",
        title = "Online covering the unit square by squares and
                 the three-dimensional unit cube by cubes",
        journal = "Demonstratio Math.",
        volume = "28",
        year = 1995,
        pages = "143-149",
        }

@article{JanLas95B,
        author = "J. Januszewski and M. Lassak",
        title = "Efficient on-line covering of large cubes by convex
                 bodies of at most unit diameters",
        journal = "Bull. Pol. Acad. Math.",
        volume = "43",
        year = 1995,
        pages = "305-315",
        }

@unpublished{JanLas96,
        author = "J. Januszewski and M. Lassak",
        title = "Online packing the unit cube by cubes",
        note = "Manuscript, University of Bydgoszcz, Poland",
        year = 1996,
        }

@article{JaLaRW96,
        author = "J. Januszewski and M. Lassak and G. Rote
                  and Gerhard J. Woeginger",
        title = "Online q-adic covering by the method of the n-th
                 segment and its application to online covering by cubes",
        journal = "Contributions to Algebra and Geometry",
        volume = "37",
        year = 1996,
        pages = "51-65",
        }

@inproceedings{JaChDu06,
        author = "W. Jawor and M. Chrobak and C. D{\"u}rr",
        title = "Competitive analysis of scheduling
                algorithms for aggregated links",
        booktitle = LATIN06,
        series = LNCS,
        volume = "3887",
        pages = "617--628",
        year = "2006"
        }

@inproceedings{JeRaBa95,
        author = "S. R. Jernigan and S. Ramaswamy and K. S. Barber",
        title = "On-line scheduling using a distributed simulation technique
		for intelligent manufacturing systems",
        booktitle = "Proc. International Conference on Systems, Man and
		Cybernetics. Intelligent Systems for the 21st Century",
        year = 1995,
        pages = "2159-2164"
	}

@article{Jeurin94,
        author = "J. Jeuring",
        title = "The derivation of on-line algorithms, with an application
		to finding palindromes",
        journal = Algorithmica,
        volume = "11",
        year = 1994,
        pages = "146-184"
	}


@article{JiIbHu94,
        author = "Tao Jiang and O. H. Ibarra and Hui Wang.",
        title = "Some results concerning 2-D on-line tessellation
		acceptors and 2-D alternating finite automata",
        journal = TCS,
        volume = "125",
        year = 1994,
        pages = "243-257"
	}

@article{JianHe07,
	author    = "Yiwei Jiang and Yong He",
	title	  = "Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information",
	journal	  = ActInf,
	volume	  = "44",
	pages	  = "571-590",
	year	  = 2007
}

@article{Johans95,
        author = "P. Johansen",
        title = "On-line string matching with feedback",
        journal = TCS,
        volume = "141",
        year = 1995,
        pages = "53-67"
        }

@phdthesis{Johnso73,
        author = "David S. Johnson",
        title = "Near-optimal bin packing algorithms",
        year = 1973,
        school = "MIT, Cambridge, MA",
        }

@article{Johnso74,
        author = "David S. Johnson",
        title = "Fast algorithms for bin packing",
        journal = JCSS,
        volume = "8",
        year = 1974,
        pages = "272-314",
        }

@article{JoDUGG74,
        author = "David S. Johnson and A. Demers and J. D. Ullman and
                 Michael R. Garey and Ronald L. Graham",
        title = "Worst-case performance bounds for simple
                 one-dimensional packing algorithms",
         journal = Sicomp,
        volume = "3",
        year = 1974,
        pages = "256-278",
        }

@article{Jones88,
	author = "Douglas W. Jones",
	title = "Application Of Splay Trees To Data Compression",
	journal = CACM,
	volume = 31,
	year = 1988,
	pages = "996-1007"
	}

%KKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKK%

@inproceedings{KalPru92A,
	author = "Bala Kalyanasundaram and Kirk Pruhs",
	title = "Visual searching and mapping",
	editor = "Lyle A. McGeoch and Daniel D. Sleator",
	volume = 7,
	series = "DIMACS Series in Discrete Mathematics and Theoretical
                 Computer Science",
	pages = "157-162",
	booktitle = "On-line Algorithms",
	year = 1992,
	organization = "AMS/ACM",
	}

@inproceedings{KalPru92B,
        author = "Bala Kalyanasundaram and Kirk Pruhs",
        title = "A competitive analysis of nearest neighbor based algorithms
		for searching unknown scenes",
        booktitle = STOC92,
	organization = "ACM",
        year = 1992,
        pages = "147-157"
	}

@article{KalPru93A,
        author = "Bala Kalyanasundaram and Kirk Pruhs",
        title = "Constructing competitive tours from local information",
        journal = TCS,
        volume = "130",
        year = 1994,
        pages = "125-138",
        }

@article{KalPru93B,
        author = "Bala Kalyanasundaram and Kirk Pruhs",
        title = "A competitive analysis of algorithms for searching
		unknown scenes",
        journal = CompGeo,
        volume = "3",
        year = 1993,
        pages = "139-155",
        }

@article{KalPru93C,
        author = "Bala Kalyanasundaram and Kirk Pruhs",
        title = "Online weighted matching",
         journal = JAlg,
        volume = "14",
        year = 1993,
        pages = "478-488",
        }

@inproceedings{KalPru94,
        author = "Bala Kalyanasundaram and Kirk Pruhs",
        title = "Fault-tolerant scheduling",
        booktitle = STOC94,
	organization = "ACM",
        year = 1994,
        pages = "115-124",
        }

@inproceedings{KalPru95A,
        author = "Bala Kalyanasundaram and Kirk Pruhs",
        title = "The online transportation problem",
        booktitle = ESA95,
        year = 1995,
        pages = "484-493",
        publisher = "Springer",
        series= LNCS,
        volume = "979",
        }

@inproceedings{KalPru95B,
        author = "Bala Kalyanasundaram and Kirk Pruhs",
        title = "Speed is as powerful as clairvoyance",
        booktitle = FOCS95,
	organization = "IEEE",
        year = 1995,
        pages = "214-221",
        }

@unpublished{KalPru96,
        author = "Bala Kalyanasundaram and Kirk Pruhs",
        title = "An optimal deterministic algorithm for online b-matching",
        note= "Manuscript",
        year = 1996,
        }

@inproceedings{KalPru97,
	author = "Bala Kalyanasundaram and Kirk R. Pruhs",
	title = "Fault-tolerant real-time scheduling",
	booktitle = ESA97,
	year = 1997,
	pages = "296-307",
        publisher = "Springer",
        series= LNCS,
        volume = "1284",
	}

@inproceedings{KalPru97b,
        author = "Bala Kalyanasundaram and Kirk R. Pruhs",
        title = "Minimizing flow time nonclairvoyantly",
        booktitle = FOCS97,
	organization = "IEEE",
        year = 1997,
        pages = "345-352",
        }

@inproceedings{KalPru98,
        author = "Bala Kalyanasundaram and Kirk Pruhs",
        title = "Maximizing job completions online",
        booktitle = ESA98,
        publisher = "Springer",
        series = LNCS,
        volume = "1461",
        year = 1998,
        pages = "235--245"
	}

@article{KalPru00,
        author = "Bala Kalyanasundaram and Kirk Pruhs",
        title = "Speed is as powerful as clairvoyance",
        journal = JACM,
	volume = "47",
        year = 2000,
        pages = "214--221"
	}

@article{KalPru00b,
	author = "Bala Kalyanasundaram and Kirk R. Pruhs",
	title = "Fault-tolerant real-time scheduling",
	journal = Algorithmica,
        volume = 28,
        year = 2000,
        pages = "125-144"
        }

@article{KalPru00c,
        author = "Bala Kalyanasundaram and Kirk Pruhs",
        title = "An optimal deterministic algorithm
                for online b-matching",
        journal = TCS,
	volume = "233",
        year = "2000",
        pages = "319--325"
	}

@article{KalPru03,
        author = "Bala Kalyanasundaram and Kirk Pruhs",
        title = "Minimizing flow time nonclairvoyantly",
        journal = JACM,
        volume = "50",
        year = 2003,
        pages = "551-567"
        }

@article{KalPru03b,
        author = "Bala Kalyanasundaram and Kirk Pruhs",
        title = "Maximizing job completions online",
        journal = JAlg,
        volume = "49",
        pages = "63--85",
	year = 2003
}


@inproceedings{KaPrVe00,
  author    = {Bala Kalyanasundaram and
               Kirk Pruhs and Mahendran Velauthapillai},
  title     = {Scheduling Broadcasts in Wireless Networks.},
  booktitle = ESA00,
        publisher = "Springer",
        series = LNCS,
        volume = "1879",
  year      = 2000,
  pages     = {290--301},
}

@article{KaPrVe01,
        author = "Bala Kalyanasundaram and Kirk R. Pruhs and Mahe Velauthapillai",
        title = "Scheduling broadcasts in wireless networks",
        journal = JOS,
        volume = 4,
        year = 2001,
        pages = "339-354"
        }

@inproceedings{KaPaPl96,
        author = "A. Kamath and O. Palmon and Serge Plotkin",
        title = "Routing and admission control in general topology networks
		with poisson arrivals",
        booktitle = SODA96,
	organization = "ACM/SIAM",
        year = 1996,
        pages = "269-278"
        }

@article{KanRos80,
     	author = "Y. C. Kan and S. M. Ross",
     	title = "Optimal list orders under partial memory constraints",
        journal = JAppProb,
     	volume = "17",
     	pages = "1004-1015",
     	year = 1980
     	}

@inproceedings{KaTaDC91,
	author = "A. Kanevsky and Roberto Tamassia and Guseppe Di Battista and
		J. Chen",
	title = "On-line maintenance of the four-connected components of a
                 graph",
	booktitle = FOCS91,
	organization = "IEEE",
	year = 1991,
	pages = "793-801"
	}

@inproceedings{KaMaSY94,
	author = "Ming-Yang Kao and Y. Ma and M. Sipser and Y. Yin",
	title = "Optimal constructions of hybrid algorithms",
	booktitle = SODA94,
	organization = "ACM/SIAM",
	year = 1994,
	pages = "372-381"
	}

@article{KaMaSY98,
	author = "Ming-Yang Kao and Y. Ma and M. Sipser and Y. Yin",
	title = "Optimal constructions of hybrid algorithms",
        journal = JAlg,
        volume = 29,
        year = 1998,
        pages = "142-164"
	}

@inproceedings{KaReTa93,
	author = "Ming-Yang Kao and J. H. Reif and Stephen R. Tate",
	title = "Searching in an unknown environment:
	         {An} optimal randomized algorithm for the cow-path problem",
	booktitle = SODA93,
	organization = "ACM/SIAM",
	year = 1993,
	pages = "441-447"
	}

@article{KaReTa96,
        author = "Ming-Yang Kao and J. H. Reif and Stephen R. Tate",
        title = "Searching in an unknown environment: {An} optimal randomized
		algorithm for the cow-path problem",
        journal = InfComp,
        volume = "131",
        year = 1996,
        pages = "63-79"
	}

@article{KaoTat91,
	author = "Ming-Yang Kao and Stephen R. Tate",
	title = "Online matching with blocked input",
     	journal = IPL,
	year = 1991,
	volume = "38",
	pages = "113-116"
	}

@inproceedings{KaoTat97,
        author = "Ming-Yang Kao and Stephen R. Tate",
        title = "On-line difference maximization",
        booktitle = SODA97,
	organization = "ACM/SIAM",
        year =  1997,
        pages = "175-182"
        }

@inproceedings{KaKKSS08,
        author    = {Bruce M. Kapron and
                     David Kempe and
                     Valerie King and
                     Jared Saia and
                     Vishal Sanwalani},
        title     = {Fast asynchronous byzantine agreement and leader election
                     with full information},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year      = {2008},
        pages     = {1038-1047}
        }

@inproceedings{KaPhTo94,
	author = "D. R. Karger and Steven J. Phillips and E. Torng",
	title = "A better algorithm for an ancient scheduling problem",
	booktitle = SODA94,
	organization = "ACM/SIAM",
	year = 1994,
	pages = "132-140"
	}

@article{KaPhTo96,
	author = "D. R. Karger and Steven J. Phillips and E. Torng",
	title = "A better algorithm for an ancient scheduling problem",
         journal = JAlg,
	volume = "20",
	pages = "400-430",
	year = 1996
	}

@incollection{KaStWe97,
	author = "D. Karger and C. Stein and Joel Wein",
	title = "Scheduling algorithms",
	booktitle = "Handbook of Algorithms and Theory of Computation",
	editor = "M. J. Atallah",
	publisher = "CRC Press",
	year = 1997
	}

@inproceedings{KaLiMO91,
        author = "Anna Karlin and K. Li and Mark Manasse and Susan Owicki",
        title = "Empirical studies of competitive spinning for shared memory
                multiprocessors",
        booktitle = "Proc. 13th ACM Symp. on Operating Systems Principles",
        year = 1991
        }

@inproceedings{KaMaMO90,
        author = "Anna Karlin and Mark Manasse and Lyle McGeoch and
		Susan Owicki",
        title = "Randomized competitive algorithms for non-uniform problems",
        booktitle = SODA90,
	organization = "ACM/SIAM",
        year = 1990,
        pages = "301-309"
        }

@article{KaMaMO94,
        author = "Anna Karlin and Mark Manasse and Lyle McGeoch and
		Susan Owicki",
        title = "Competitive randomized algorithms for nonuniform problems",
	journal = Algorithmica,
        volume = "11",
        year = 1994,
        pages = "542-571"
        }

@article{KaMaRS88,
        author = "Anna Karlin and Mark Manasse and Larry Rudolph and
		Daniel Sleator",
        title = "Competitive snoopy caching",
        journal= Algorithmica,
        volume = "3",
        year = 1988,
        pages = "79-119"
        }

@inproceedings{KaPhRa92,
        author = "Anna Karlin and Steven Phillips and Prabhakar Raghavan",
        title = "Markov paging",
        booktitle = FOCS92,
	organization = "IEEE",
        year = 1992,
	pages = "208-217"
	}

@incollection{Karlin98,
	author = "Anna Karlin",
	title = "On the performance on competitive algorithms in practice",
        booktitle = "Online Algorithms: {The} State of the Art",
        editor = "Amos Fiat and Gerhard J. Woeginger",
        publisher = "Springer",
        year = "1998",
	pages = "373-382"
        }

@inproceedings{KaRaRa91,
       author = "H. Karloff and Yuval Rabani and Yiftach Ravid",
       title = "Lower bounds for randomized k-server problem and
              motion planning algorithms",
       booktitle = STOC91,
	organization = "ACM",
       year = 1991,
       pages = "278-288"
       }

@article{KaRaRa94,
        author = "H. Karloff and Yuval Rabani and Yiftach Ravid",
        title = "Lower bounds for randomized k-server and motion-planning
		algorithms",
         journal = Sicomp,
        volume = "23",
        year = 1994,
        pages = "293-312"
	}

@inproceedings{Karmar82,
        author = "N. Karmarkar",
        title = "Probabilistic analysis of some bin packing algorithms",
        booktitle = FOCS82,
	organization = "IEEE",
        year = 1982,
        pages = "107-118"
        }

@inproceedings{KaLuMa84,
        author = "Richard M Karp and Michael Luby and A. Marchetti-Spaccamela",
        title = "Probabilistic analysis of multi-dimensional binpacking
                 problems",
        booktitle = STOC84,
	organization = "ACM",
        year = 1984,
        pages = "289-298",
        }

@misc{KaOsRa93,
	author = "Richard M. Karp and R. Ostrovski and Yuval Rabani",
	note = "Personal communication",
	year = 1993,
	}

@inproceedings{Karp92,
        author = "R. M. Karp",
        title = "On-line algorithms versus off-line algorithms: {How} much
	         is it worth to know the future?",
        booktitle = "World Computer Congress",
	year = 1992
	}

@inproceedings{KaVaVa90,
        author = "Richard M. Karp and U. V. Vazirani and V. V. Vazirani",
        title = "An Optimal Algorithm for On-Line Bipartite Matching",
        booktitle = STOC90,
	organization = "ACM",
        year = 1990,
        pages = "352-358"
        }

@inproceedings{KatBod05,
  author    = {Irit Katriel and Hans L. Bodlaender},
  title     = {Online topological ordering},
  booktitle = SODA05,
	organization = "ACM/SIAM",
  year      = 2005,
  pages     = {443--450},
}

@inproceedings{KeTaWo96,
	author = "H. Keller and T. Tautenhahn and Gerhard J. Woeginger",
	title = "Approximability and nonapproximability results for
		minimizing total flow time on a single machine",
	booktitle = STOC96,
	organization = "ACM",
  	pages = "418-426",
	year = 1996,
	}

@article{KeTaWo98,
	author = "H. Keller and T. Tautenhahn and Gerhard J. Woeginger",
	title = "Approximability and nonapproximability results for
		minimizing total flow time on a single machine",
        journal= Sicomp,
	volume = 28,
        year = 1998,
        pages = "1155-1166"
        }

@article{KeKoST97,
	author = "H. Kellerer and V. Kotov and M. G. Speranza and Z. Tuza",
	title = "Semi on-line algorithms for the partition problem",
        journal = ORL,
	volume = 21,
	pages = "235-242",
	year = 1997
	}

@inproceedings{Kenyon96,
        author =  "C. Kenyon",
        title = "Best-Fit bin-packing with random order",
        booktitle = SODA96,
	organization = "ACM/SIAM",
        year = 1996,
        pages = "359-364"
        }

@inproceedings{KeRaSi96,
        author =  "C. Kenyon and Yuval Rabani and A. Sinclair",
        title = "Biased random walks, Lyapunov functions, and stochastic
	analysis of Best Fit bin packing",
        booktitle = SODA96,
	organization = "ACM/SIAM",
        year = 1996,
        pages = "351-358"
        }

@inproceedings{Kearns93,
	author = "M. Kearns",
	title = "Efficient noise-tolerant learning from statistical queries",
	booktitle = STOC93,
	organization = "ACM",
	year = 1993,
	pages = "392-401"
	}

@inproceedings{KeLiPV87,
	author = "M. Kearns and M. Li and L. Pitt and L. Valiant",
	title = "On the Learnability of Boolean Formulae",
	booktitle = STOC87,
	organization = "ACM",
	year = 1987,
	pages = "285-295"
	}

@article{KeScSe94,
	author = "M. Kearns and R. Schapire and L. Sellie",
	title = "Toward efficient agnostic learning",
	journal = ML,
	volume = "17",
	pages = "115-142",
	year = 1994
	}

@techreport{KeLPRS94,
        author = "S. Keshav and Carsten Lund and Steven Phillips and
		Nick Reingold and H. Saran",
        title = "An Empirical Evaluation of Virtual Circuit Holding Time
		Policies in IP-over-ATM Networks",
        number = "Technical Memorandum 39199-11",
        institution = "AT\&T Bell Laboratories",
        year = 1994
        }

@inproceedings{KLMPSS01,
	author = "A. Kesselman and Zvi Lotker and Yishay Mansour and
		Boaz Patt-Shamir and Baruch Schieber and Maxim Sviridenko",
	title = "Buffer overflow management in {QoS} switches",
	booktitle = STOC01,
	organization = "ACM",
	year = 2001,
	pages = "520--529",
	}

@article{KLMPSS04,
	author = "A. Kesselman and Zvi Lotker and Yishay Mansour and
		Boaz Patt-Shamir and Baruch Schieber and Maxim Sviridenko",
	title = "Buffer overflow management in {QoS} switches",
	journal = Sicomp,
	volume = 33,
	pages = "563-583",
	year = 2004
	}

@InProceedings{KesMan01,
  author =   {Alexander Kesselman and Yishay Mansour},
  title =    {Loss-bounded Analysis for Differentiated Services},
  booktitle =    SODA01,
  organization = "ACM/SIAM",
  pages =    {591--600},
  year =     2001
}

@InProceedings{KeMaSt03,
        author = {Alexander Kesselman and Yishay Mansour
                 and Rob van Stee},
        title = {Improved Competitive Guarantees for {QoS} Buffering},
        booktitle = ESA03,
        publisher = "Springer",
        series = LNCS,
        volume = "2832",
        pages = {361--372},
        year =   2003
}

@article{KeMaSt05,
        author = {Alexander Kesselman and Yishay Mansour
                 and Rob van Stee},
        title = {Improved Competitive Guarantees for {QoS} Buffering},
        journal = Algorithmica,
        volume = "43",
        pages = {63--80},
        year =   2005
}

@inproceedings{Khanna98,
	author = "Sanjeev Khanna and Vincenzo Liberatore",
	title = "Broadcast disk paging",
	booktitle = STOC98,
	organization = "ACM",
        year = 1998,
        pages = "634-643",
        }

@inproceedings{KhMiVa91,
	author = "Samir Khuller and S. G. Mitchell and V. V. Vazirani",
	title = "On-line algorithms for weighted bipartite matching
	         and stable marriages",
	booktitle = ICALP91,
  	year = 1991,
  	pages = "728-738",
        publisher = "Springer",
        series = LNCS,
        volume = "510",
	}

@article{KhMiVa94,
        author = "Samir Khuller and S. G. Mitchell and V. V. Vazirani",
        title = "On-line algorithms for weighted bipartite matching and
		stable marriages",
        journal = TCS,
        volume = "127",
        year = 1994,
        pages = "255-267"
	}

@unpublished{Kierst96,
        author = "H. A. Kierstead",
        title = "On-line coloring $k$-colorable graphs",
	note= "To appear in {\em Israel J. of Math.}"
        }

@article{Kiears81,
	author = "H. A. Kierstead",
	title = "An effective version of {Dilworth's} theorem",
	journal = TAMS,
	volume = "268",
	year = 1981,
	pages = "63-77"
	}

@article{Kiears81A,
        author = "H. A. Kierstead",
        title = "Recursive colorings of highly recursive graphs",
        journal = CanadJM,
        volume = "33",
        year = 1981,
        pages = "1279-1290"
        }

@article{Kiears83,
        author = "H. A. Kierstead",
        title = "An effective version of {Hall's} theorem",
        journal = PAMS,
        volume = "88",
        year = 1983,
        pages = "124-128"
        }

@article{Kierst88,
	author = " H. A. Kierstead",
	title = " The linearity of first-fit coloring of interval graphs",
        journal = Sidma,
	volume = "1",
	year = 1988,
	pages = "526-530"
	}

@article{Kierst91,
        author = "H. A. Kierstead",
        title = "A polynomial time approximation algorithm for dynamic
                storage allocation",
        journal = DAM,
        volume = "88",
        year = 1991,
        pages = "231-237",
        }

@unpublished{KieKol96,
	author = "H. A. Kierstead and K. Kolossa",
	title = "On-line coloring of perfect graphs",
	note= "To appear in {\em Combinatorica}"
	}

@article{KiePen90,
        author = "H. A. Kierstead and S. G. Penrice",
        title = "Recent results on a conjecture of {Gy\'arf\'as}",
        journal = CongrNum,
        volume = "79",
        year = 1990,
        pages = "182-186"
        }

@article{KiePen94,
        author = "H. A. Kierstead and S. G. Penrice",
        title = "Radius two trees specify $\chi$-bounded classes",
	journal = JoGraTh,
        volume = "18",
        year = 1994,
        pages = "119-129"
        }

@article{KiPeTr94,
        author = "H. A. Kierstead and S. G. Penrice and William T. Trotter",
        title = "On-line graph coloring and recursive graph theory",
        journal = Sidma,
        volume = "7",
        year = 1994,
        pages = "72-89"
        }

@article{KiPeTr95,
        author = "H. A. Kierstead and S. G. Penrice and William T. Trotter",
        title = "First-fit and on-line coloring of graphs which do not
		induce {$P_5$}",
        journal = Sidma,
        volume = "8",
        year = 1995,
        pages = "485-498"
        }

@article{KirQin95,
        author = "H. A. Kierstead and J. Qin",
        title = "Coloring interval graphs with {First-Fit}",
        journal = Sidma,
        volume = "8",
        year = 1995,
        pages = "47-57"
        }

@article{KieTro81,
        author = "H. A. Kierstead and William T. Trotter",
        title = "An extremal problem in recursive combinatorics",
        journal = CongrNum,
        volume = "33",
        year = 1981,
        pages = "143-153"
        }

@inproceedings{KieTro92,
	author = "H. A. Kierstead and William T. Trotter",
	title = "On-line Graph Coloring",
	editor = "Lyle A. McGeoch and Daniel D. Sleator",
	volume = 7,
	series = "DIMACS Series in Discrete Mathematics and Theoretical
                Computer Science",
	pages = "85-92",
	booktitle = "On-line Algorithms",
	year = 1992,
	organization = "AMS/ACM",
	}

@incollection{KieTro93,
	author = "H. A. Kierstead and William T. Trotter",
	title = "Planar graph coloring with an uncooperative partner",
	booktitle = "Planar Graphs",
	publisher = "Amer. Math. Soc. series in Discrete Mathematics
	             and Theoretical Computer Science, vol. 9",
	editor = "William T. Trotter",
	year = 1993,
	pages = "85-93"
	}

@article{KiEdLS62,
        author = "T. Kilburn and D. Edwards and M. Lanigan and F. Sumner",
        title = "One-level storage system",
        journal = "IRE Transactions Elect. Computers",
        volume = "37",
        year = 1962,
        pages = "223-235"
        }

@inproceedings{KimChw01,
        author = "Jae-Hoon Kim and Kyung-Yong Chwa",
        title = "Online deadline scheduling on multiple resources",
        booktitle = COCOON01,
        publisher = "Springer",
        series = LNCS,
        volume = 2108,
        year = 2001,
        pages = "443--452",
        }

@article{KimLon95,
        author = "D. Kimber and P. M. Long",
        title = "On-line learning of smooth functions of a single variable",
        journal = TCS,
        volume = "148",
        year = 1995,
        pages = "141-156"
	}

@techreport{Kimbre04,
        author = "Tracy Kimbrel",
        title = "A simple proof of the 2-competitiveness of the
                        greedy FIFO buffering algorithm",
        institution = "IBM Research",
        number = "RC23272",
        year = "2004"
	}

@inproceedings{KiScSv04,
        author = "Tracy Kimbrel and Baruch Schieber and Maxim Sviridenko",
        title = "Minimizing migrations in fair multiprocessor scheduling of
	         persistent tasks",
        booktitle = SODA04,
	organization = "ACM/SIAM",
        year = 2004,
	pages = "982-991"
        }

@article{KinLan88,
        author = "N. G. Kinnersley and M. A. Langston",
        title = "Online variable-sized bin packing",
        journal = DAM,
        volume = "22",
        year = 1988,
        pages = "143-148",
        }

@article{Klein92,
        author = "R. Klein",
        title = "Walking an unknown street with bounded detour",
        journal = CompGeo,
        volume = "1",
        year = 1992,
        pages = "325-351",
        }

@inproceedings{Kleinb94,
	author = "J. M. Kleinberg",
	title = "On-line search in a simple polygon",
	booktitle = SODA94,
	organization = "ACM/SIAM",
	year = 1994,
	pages = "8-15"
	}

@inproceedings{Kleinb94A,
        author = "J. M. Kleinberg",
        title = "The localization problem for mobile robots",
        booktitle = FOCS94,
	organization = "IEEE",
        year = 1994,
        pages = "521-531"
        }

@article{Kleinb94B,
        author = "J. M. Kleinberg",
        title = "A lower bound for two-server balancing algorithms",
     	journal = IPL,
        volume = "52",
        year = 1994,
        pages = "39-43"
	}


@inproceedings{Kleinb05,
  author    = {Robert D. Kleinberg},
  title     = {A multiple-choice secretary algorithm with applications
               to online auctions},
  booktitle = SODA05,
	organization = "ACM/SIAM",
  year      = 2005,
  pages     = {630--631},
}

@inproceedings{KlMoRV97,
        author = "J. Kleinberg and R. Motwani and P. Raghavan
			and S. Venkatasubramanian",
        title = "Storage management for evolving databases",
        booktitle = FOCS97,
	organization = "IEEE",
        year = 1997,
        pages = "353-362"
        }

@inproceedings{KleRub96,
        author = "J. Kleinberg and R. Rubenfield",
        title = "Short paths in expander graphs",
        booktitle = FOCS96,
	organization = "IEEE",
        year = 1996,
        pages = "86-95"
        }

@inproceedings{KleTar95,
        author = "J. Kleinberg and Eva Tardos",
        title = "Disjoint paths in densely embedded graphs",
        booktitle = FOCS95,
	organization = "IEEE",
        year = 1995,
        pages = "52-61"
        }

@inproceedings{KleTar08,
        author    = {Jon M. Kleinberg and
                     {\'E}va Tardos},
        title     = {Balanced outcomes in social exchange networks},
        booktitle = STOC08,
	organization = "ACM",
        year      = {2008},
        pages     = {295-304}
        }

@article{Kloste92,
	author = "William F. Klostermeyer",
	title = "Optimizing searching with self-adjusting trees",
	journal = JInfOptSci,
	volume = 13,
	pages = "85-95",
	year = 1992,
        }

@article{Kloste95,
        author = "W. F. Klostermeyer",
        title = "On-line scheduling with optimal worst-case response time",
	journal = JInfOptSci,
        volume = "16",
        year = 1995,
        pages = "449-60"
	}

@inproceedings{Knoede81,
        author = "W. Knoedel",
        title = "A bin packing algorithm with complexity O(nlogn) and
                 performance 1 in the stochastic limit",
        booktitle = MFCS81,
        year = 1981,
        pages = "369-378",
        publisher = "Springer",
        series = LNCS,
        volume = "118"
        }

@article{Knoede83,
        author = "W. Knoedel",
        title = "Ueber das mittlere {V}erhalten von online
                 {P}ackungsalgorithmen",
        journal = "EIK",
        volume = "19",
        year = 1983,
        pages = "427-433",
        }

@article{Knuth71,
 	author = "Donald E. Knuth",
 	title = "Optimum binary search trees",
        journal = ActInf,
 	year = 1971,
 	pages = "14-25"
 	}

@book{Knuth2,
	author = "Donald E. Knuth",
	title = "The {A}rt of {C}omputer {P}rogramming; Volume 2:
              {S}eminumerical Algorithms",
	publisher = "Addison-{W}esley",
	year = 1968,
	edition = "1st"
	}

@book{Knuth73,
        author = "Donald E. Knuth",
        title = "The Art of Computer Programming, Sorting and Searching",
        volume = 3,
        publisher = "Addison-Wesley",
        address = "Reading, MA",
        year = 1973
	}

@inproceedings{KoMiOk07,
	 author = {Koji Kobayashi and Shuichi Miyazaki and Yasuo Okabe},
	 title = {A Tight Bound on Online Buffer Management for Two-Port Shared-Memory Switches},
	 booktitle = SPAA07,
	 year = {2007},
	 pages = {358--364}
}

@inproceedings{Koga93,
        author = "H. Koga",
        title = "Randomized on-line algorithms for the page replication
		problem",
        booktitle = ISAAC93,
        year = 1993,
        pages = "436-445",
        publisher = "Springer",
        series = LNCS,
        volume = "762"
	}


@inproceedings{KoLaNT01,
        author = "Chiu-Yuen Koo and Tak-Wah Lam and Tsuen-Wan Ngan and Kar-Keung To",
        title = "On-line scheduling with tight deadlines",
        booktitle = MFCS01,
        publisher = "Springer",
        series = LNCS,
	volume = "2136",
        year = 2001,
	pages = "464--473"
        }

@inproceedings{KorSha92,
        author = "G. Koren and D. Shasha",
        title = " ${D}^{over}$ an optimal on-line scheduling algorithm for
		overloaded real-time systems",
        booktitle = "Real-Time Systems Symp.",
        year = 1992,
        pages = "290-299"
	}

@article{KorSha95,
        author = "G. Koren and D. Shasha",
        title = " $D^{over}$: {An} optimal on-line scheduling algorithm for
		overloaded uniprocessor real-time systems",
         journal = Sicomp,
        volume = "24",
        year = 1995,
        pages = "318-339"
	}

@article{KorSha94,
        author = "G. Koren and D. Shasha",
        title = "MOCA: {A} multiprocessor on-line competitive algorithm
		for real-time system scheduling",
        journal = TCS,
        volume = "128",
        year = 1994,
        pages = "75-97"
	}

@inproceedings{KoShHu93,
        author = "G. Koren and D. Shasha and S.-C. Huang",
        title = "MOCA: {A} multiprocessor on-line competitive algorithm
		for real-time system scheduling",
        booktitle = "Proc. Real-Time Systems Symp.",
        year = 1993,
        pages = "172-181",
	}

@article{KorMat88,
	author = "P. Kornerup and D. W. Matula",
	title = "An on-line arithmetic unit for bit-pipelined rational
		arithmetic",
        journal = JpardisCom,
	volume = "5",
	year = 1988,
	pages = "310-330"
	}

@article{KouMar77,
         author = "L. T. Kou and G. Markowsky",
         title = "Multidimensional bin packing algorithms",
         journal = IBMres,
         volume = "21",
         year = 1977,
         pages = "443-448",
         }

@inproceedings{KoPlRa99,
        author = "Madhukar R. Korupolu and C. Greg Plaxton
				and Rajmohan Rajamaran",
        title = "Placement algorithms for hierarchical cooparative caching",
        booktitle = SODA99,
	organization = "ACM/SIAM",
	pages = "586-595",
        year = 1999
        }

@inproceedings{KouPap94A,
	author = "Elias Koutsoupias and Christos Papadimitriou",
	title = "On the $k$-server conjecture",
	booktitle = STOC94,
	organization = "ACM",
	year = 1994,
	pages = "507-511",
	}

@article{KouPap95A,
        author = "Elias Koutsoupias and Christos Papadimitriou",
        title = "On the $k$-server conjecture",
   	journal = JACM,
        year = 1995,
        volume = 42,
        pages = "971-983",
        }

@inproceedings{KouPap94B,
	author = "Elias Koutsoupias and Christos Papadimitriou",
 	title = "Beyond competitive analysis",
 	booktitle = FOCS94,
	organization = "IEEE",
 	year = 1994,
 	pages = "394-400"
 	}

@inproceedings{KouPap99,
	author = "Elias Koutsoupias and Christos Papadimitriou",
 	title = "Worst-case equilibria",
 	booktitle = STACS99,
	publisher = "Springer",
        series = LNCS,
 	year = 1999,
 	pages = "404--413"
 	}

@article{KouPap00,
        author = "Elias Koutsoupias and Christos Papadimitriou",
        title = "Beyond competitive analysis",
        journal= Sicomp,
	volume = "30",
        year = 2000,
        pages = "300--317"
        }

@article{KouPap96,
        author = "Elias Koutsoupias and Christos Papadimitriou",
        title = "The 2-evader problem",
     	journal = IPL,
        volume = "57",
        year = 1996,
        pages = "249-252"
        }

@inproceedings{KouTay00,
        author = "Elias Koutsoupias and David Taylor",
        title = "The {\mbox{\sc CNN}} problem and other $k$-server variants",
        year = 2000,
	booktitle = STACS00,
	publisher = "Springer",
        series = LNCS,
	volume = "1770",
	pages = "581--592"
        }

@phdthesis{Koutso94,
        author = "Elias Koutsoupias",
        title = "On-line algorithms and the $k$-server conjuncture",
        year = 1994,
        school = "University of California, San Diego, CA",
        }

@inproceedings{Koutso99,
        author = "Elias Koutsoupias",
        title = "Weak adversaries for the $k$-server problem",
	booktitle = FOCS99,
	organization = "IEEE",
        year = 1999,
        pages = "444--449"
        }

@article{KrLaVo87,
        author = "K. Krause and Lawrence L. Larmore and D. J. Volper",
        title = "Packing items from a triangular distribution",
     	journal = IPL,
        volume = "25",
        year = 1987,
        pages = "351-361",
        }

@inproceedings{KriVit94,
        author = "P. Krishnan and Jeffrey S. Vitter",
        title = "Optimal prediction for prefetching in the worst case",
        booktitle = SODA94,
	organization = "ACM/SIAM",
        year = 1994,
        pages = "392-401"
        }

@inproceedings{KrPaPS01,
        author = "Sven O. Krumke and Willem E. de Paepe and
                Diana Poensgen and Leen Stougie",
        title = "News from the online traveling repairman",
        booktitle = MFCS01,
        publisher = "Springer",
	series = LNCS,
	volume = "2136",
        year = 2001,
        pages = "487--499",
        }

@inproceedings{Kuhn53,
        author = "H. Kuhn",
        title = "Extensive games and the problem of information",
        booktitle = "Contributions to the Theory of Games",
 	editor = "H. Kuhn and A. Tucker",
     	publisher = "Princeton University Press",
        year = 1953,
        pages = "193-216"
        }

@article{KulWoo82,
	author = "K. Kulik II and D. Wood",
	title = "A note on some tree similarity measures",
     	journal = IPL,
	volume = "15",
	year = 1982,
	pages = "39-42"
	}

@article{Kuperb94,
        author = "W. Kuperberg",
        title = "Online covering a cube by a sequence of cubes",
        journal = DisComGeo,
        volume = "12",
        year = 1994,
        pages = "83-90",
        }

%LLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL%

@inproceedings{Laber04,
        author = "Eduardo Sany Laber",
        title = "A Randomized Competitive Algorithm for Evaluating Priced {AND/OR} Trees",
	pages =  "501-512",
        booktitle = STACS04,
        year = 2004,
        publisher = "Springer",
        series = LNCS,
	volume = "2996"
	}

@incollection{LaLaLR84,
	author = "J. Labetoulle and E. L. Lawler and J. K. Lenstra and
		 Rinnooy Kan, A. H. G.",
	title = "Preemptive scheduling of uniform machines subject to
		release dates",
	editor = "W. R. Pulleyblank",
	booktitle = "Progress in Combinatorial Optimization",
	pages = "245-261",
	publisher = "Academic Press",
	year = 1984
	}

@article{LaSuYu81,
        author = "K. Lam and M.K. Sui and C.T. Yu",
        title = "A generalized counter scheme",
        journal = TCS,
        volume = "16",
        pages = "271-278",
        year = 1981
        }

@inproceedings{LamTo99,
        author = "Tak-Wah Lam and Ker-Keung To",
    	title = "Trade-offs between speed and processor in hard-deadline scheduling",
	booktitle = SODA99,
	organization = "ACM/SIAM",
        year = 1999,
        pages = "623--632"
        }

@inproceedings{LamTo01,
        author = "Tak-Wah Lam and Ker-Keung To",
    	title = "Performance guarantee for online deadline scheduling in the
                        presence of overload",
	booktitle = SODA01,
	organization = "ACM/SIAM",
        year = 2001,
        pages = "755--764"
        }

@inproceedings{LaNgTo01,
        author = "Tak-Wah Lam and Tsuen-Wan Ngan and Ker-Keung To",
        title = "On the speed requirement for optimal deadline
		scheduling in overloaded systems",
        booktitle = "Proc. 15th International Parallel and
			Distributed Processing Symposium",
        year = 2001,
        pages = "202"
        }

@inproceedings{LaLeTW07,
  author    = {Tak Wah Lam and Lap-Kei Lee and Isaac K. K. To and Prudence W. H. Wong},
  title     = {Energy Efficient Deadline Scheduling in Two Processor Systems},
  booktitle = ISAAC07,
  year      = {2007},
  pages     = {476--487}
}

@inproceedings{LarSch90,
	author = "Lawrence L. Larmore and Baruch Schieber",
	title = "On-Line Dynamic Programming with Applications to the
		Prediction of {RNA} Secondary Structure",
	booktitle = SODA90,
	organization = "ACM/SIAM",
	year = 1990,
	pages = "503-512"
	}

@article{LarSch91,
        author = "Lawrence L. Larmore and Baruch Schieber",
        title = "On-line dynamic programming with applications to the
		prediction of RNA secondary structure",
         journal = JAlg,
        volume = "12",
        year = 1991,
        pages = "490-515"
	}

@article{Lassak95,
        author = "M. Lassak",
        title = "Online covering a box by cubes",
        journal = "Contributions to Algebra and Geometry",
        volume = "36",
        year = 1995,
        pages = "1-7",
        }

@article{LasZha91,
        author = "M. Lassak and J. Zhang",
        title = "An on-line potato-sack theorem",
        journal = DisComGeo,
        volume = "6",
        year = 1991,
        pages = "1-7",
        }

@inproceedings{LavNis05,
  author    = {Ron Lavi and Noam Nisan},
  title     = {Online ascending auctions for gradually expiring items},
  booktitle = SODA05,
	organization = "ACM/SIAM",
  year      = 2005,
  pages     = {1146--1155},
}

@incollection{LaLeRS93,
	author = "E. L. Lawler and J. K. Lenstra and  Rinnooy Kan, A. H. G.
		and D. B. Shmoys",
	title = "Sequencing and scheduling: {A}lgorithms and complexity",
	editor = "S. C. Graves and  Rinnooy Kan, A. H. G. and P. Zipkin",
	booktitle = "Handbooks in Operations Research and Management
		Science, Vol. 4: {L}ogistics of Production and Inventory",
	pages = "445-552",
	publisher = "North-Holland",
	year = 1993
	}

@article{LeeLee85,
        author = "C. C. Lee and D. T. Lee",
        title = "A simple online bin packing algorithm",
   	journal = JACM,
        volume = "32",
        year = 1985,
        pages = "562-572",
        }

@techreport{LeeLee87,
        author = "C. C. Lee and D. T. Lee",
        title = "Robust online bin packing algorithms",
        number = "83-03-FC-02",
        institution = "Department of Electrical Engineering and Computer
            Science, Northwestern University, Evanston, IL",
        year = 1987,
        }

@inproceedings{Lee94,
        author = "Suk Kyoon Lee",
        title = "On-line multiprocessor scheduling algorithms for real-time
		tasks",
        booktitle = "Proc. Region 10's 9th International Conference.
		Theme: {F}rontiers of Computer Technology",
        year = 1994,
        pages = "607-611"
	}

@inproceedings{LeeYan92,
        author = "D. Lee and Mihalis Yannakakis",
        title = "Online minimization of transition systems",
        booktitle = STOC92,
	organization = "ACM",
        year = 1992,
        pages = "264-274"
	}

@book{Leeuwe90,
        editor = "Jan van Leeuwen",
        title = "Handbook of theoretical computer science, Vol A,
                 Algorithms and Complexity",
        publisher = "The MIT Press",
        year = 1990,
        }

@article{LeMaRR94,
        author = "Frank T. Leighton and Bruce M. Maggs and A. G. Ranade and
		S. B. Rao",
        title = "Randomized routing and sorting on fixed-connection networks",
         journal = JAlg,
        volume = "17",
        year = 1994,
        pages = "157-205"
	}

 @inproceedings{LMPSTT91,
        author = "Tom Leighton and F. Makedon  and Serge Plotkin and C. Stein
		and E. Tardos and S. Tragoudas",
        title = "Fast approximation algorithms for multicommodity flow
                 problems",
        booktitle = STOC91,
	organization = "ACM",
        year = 1991,
        pages = "101-111"
        }

@inproceedings{LeiSch91,
        author = "Tom Leighton and E. J. Schwabe",
        title = "Efficient algorithms for dynamic allocation of distributed
		memory",
        booktitle = FOCS91,
	organization = "IEEE",
        year = 1991,
        pages = "470-479"
	}

@article{LeiSho89,
        author = "Frank T. Leighton and Peter Shor",
        title = "Tight bounds for minimax grid matching with applications
                to the average case analysis of algorithms",
        journal = Combinatorica,
        volume = "9",
        year = 1989,
        pages = "161-187",
        }

@article{LeMaRa94,
        author = "F. T. Leighton and B. M. Maggs and S. B. Rao",
        title = "Packet routing and job-scheduling in $O(congestion+dilation)$
	         steps",
        journal = Combinatorica,
        volume = "14",
        year = 1994,
        pages = "167-186"
        }

@article{LeShTa90,
	author = "J. K. Lenstra and D. B. Shmoys and Eva Tardos",
	title = "Approximation algorithms for scheduling unrelated parallel
	machines",
	journal = MathProg,
	volume = "46",
	pages = "259-271",
	year = 1990
	}

@techreport{LenKan88,
        author = "J. K. Lenstra and  Rinnooy Kan, A. H. G.",
        title = "An introduction to multiprocessor scheduling",
        institution = "CWI, Amstrdam",
        year = 1988,
        }

@inproceedings{LeLoWa08,
  author    = {Christoph Lenzen and
               Thomas Locher and
               Roger Wattenhofer},
  title     = {Clock Synchronization with Bounded Global and Local Skew},
  booktitle = FOCS08,
	organization = "IEEE",
  year      = {2008},
  pages     = {509-518}
  }

@incollection{Leonar03,
        author = "Stefano Leonardi",
	title="A simpler proof of preemptive flow-time approximation",
	booktitle="Approximation and On-line Algorithms",
	series="Lecture Notes in Computer Science",
	publisher="Springer",
	year="2003"
}

@inproceedings{LeoMar95,
        author = "Stefano Leonardi and Alberto Marchetti-Spaccamela",
        title = "On-line resource management with applications to
                  routing and scheduling",
	booktitle = ICALP95,
        year = 1995,
        pages = "303-314",
        publisher = "Springer",
        series = LNCS,
        volume = "944",
        }

@article{LeoMar99,
        author = "Stefano Leonardi and Alberto Marchetti-Spaccamela",
        title = "On-line resource management with applications to
                  routing and scheduling",
	journal = Algorithmica,
	year = 1999,
	volume = 24,
	pages = "29-49",
	}


@inproceedings{LeMaPR98,
	author = "Stefano Leonardi and Alberto Marchetti-Spaccamela and
		A. Presciutti and Adi Ros\`en",
        title = "On-line randomized call-control revisited",
        booktitle = SODA98,
	organization = "ACM/SIAM",
        year = 1998,
        pages = "323-332"
        }

@inproceedings{LeoRaz97,
        author = "Stefano Leonardi and Danny Raz",
        title = "Approximating Total Flow Time on Parallel Machines",
        booktitle = STOC97,
	organization = "ACM",
        year = 1997,
        pages = "110-119"
        }

@article{LeuWei95,
        author = "J. Y. T. Leung and W. D. Wei",
        title = "Tighter bounds on a heuristic for a partition problem",
        journal = IPL,
        year = 1995,
	volume = "56",
        pages = "51-57"
	}

@article{LevMir77,
	author = "D. Levhari and L. J. Mirman",
	title = "Saving and Uncertainty with an Uncertain Horizon",
	year = 1977,
	journal = "J. of Political Economy",
	volume = 85,
	pages = "265-281"
	}

@inproceedings{LeScZo08,
        author    = {Hagay Levin and
                     Michael Schapira and
                     Aviv Zohar},
        title     = {Interdomain routing and games},
        booktitle = STOC08,
	organization = "ACM",
        year      = {2008},
        pages     = {57-66}
        }

@book{Leviti94,
        author = "Evgenij S.\ Levitin",
        title = "Perturbation Theory in Mathematical Programming
			and its Applications",
        publisher = "John Wiley \& Sons",
        year = 1994
        }

@article{LiChen90,
        author = "K. Li and K. H. Cheng",
        title = "Generalized {F}irst-{F}it algorithms in two and
                 three dimensions",
	journal = IntFoun,
        volume = "2",
        year = 1990,
        pages = "131-150",
	}

@article{LiChen92,
        author = "K. Li and K. H. Cheng",
        title = "Heuristic algorithms for online packing in three dimensions",
         journal = JAlg,
        volume = "13",
        year = 1992,
        pages = "589-605",
        }

@inproceedings{LiShi95,
        author = "Rongheng Li and Lijie Shi",
        title = "An on-line algorithm for some uniform processor scheduling",
        booktitle = COCOON95,
        year = 1995,
	publisher = "Springer",
        series = LNCS,
	volume = "959",
        pages = "627-632"
	}

@inproceedings{LiZhCa89,
	author = "Tao Li and Wei Zhao and N. Carter",
	title = "A {VLSI} architecture for on-line scheduler in
                real-time systems",
	booktitle = "Proc. International Conference Computing and Information (ICCI)",
	organization = "IEEE",
	year = 1989,
	pages = "201-206"
	}

@inproceedings{LiSeSt05,
  author =   {Fei Li and Jay Sethuraman and Clifford Stein},
  title =    {An Optimal Online Algorithm for Packet Scheduling with Agreeable Deadlines},
  booktitle = SODA05,
	organization = "ACM/SIAM",
  pages =    {801--802},
  year =     2005
}

@inproceedings{LiSeSt07,
  author =   {Fei Li and Jay Sethuraman and Clifford Stein},
  title =    {Better Online Buffer Management},
  booktitle = SODA07,
	organization = "ACM/SIAM",
 	pages = {199--208},
  year =   { 2007}
}

@article{Liang80,
        author = "F. M. Liang",
        title = "A lower bound for online bin packing",
     	journal = IPL,
        volume = "10",
        year = 1980,
        pages = "76-79",
        }

@article{Liao92,
	author = "Andrew M. Liao",
	title = "Three priority queue applications revisited",
	journal = Algorithmica,
	year = 1992,
	volume = 7,
	pages = "415-427",
	}

@inproceedings{Libera00,
	author = "Vincenzo Liberatore",
	title = "Scheduling jobs before shut-down",
	booktitle = SWAT00,
	publisher = "Springer",
        series = LNCS,
	volume = "1851",
	PAGE = "175-188",
	year = "2000"
	}

@inproceedings{LiNaRW06,
        author = "G.~Lin and C.~Nagarajan and R.~Rajaraman and D.~Williamson",
        title = "A General Approach for Incremental Approximation and Hierarchical Clustering",
        booktitle = SODA06,
	organization = "ACM/SIAM",
        pages = "1147-1156",
        year = "2006"
        }

@article{LipMcC76,
	author = "S. A. Lippman and J. J. McCall",
	title = "The Economics of Job Search: {A} Survey",
	year = 1976,
	journal = "Economic Inquiry",
	volume = "XIV",
	pages = "155-189",
	}

@incollection{LipMcC81,
	author = "S. A. Lippman and J. J. McCall",
	editor = "K. J. Arrow and M. D. Intriligator",
	title = "The Economics of Uncertainty: {S}elected Topics and
		Probabilistic Methods",
	year = 1981,
	volume = 1,
	pages = "211-284",
	booktitle = "Handbook of Mathematical Economics",
	publisher = "North-Holland",
	chapter = 6
	}

@inproceedings{LipTom94,
	author = "R. J. Lipton and A. Tomkins",
	title = "Online interval scheduling",
	booktitle = SODA94,
	organization = "ACM/SIAM",
	year = 1994,
	pages = "302-311"
	}

@article{Little88,
	author = "N. Littlestone",
	title = "Learning Quickly When Irrelevant Attributes Abound:
                {A} New Linear-threshold Algorithm",
	journal = ML,
	volume = 2,
	pages = "285-318",
	year = 1988
	}

@unpublished{Little89,
	author = "N. Littlestone",
	title = "A mistake-bound version of {R}ivest's decision-list
		algorithm",
	note = "Personal communication",
	year = 1989
	}

@inproceedings{Little91,
	author = "N. Littlestone",
	title = "Redundant noisy attributes, attribute errors, and
                linear-threshold learning using winnow",
	booktitle = COLT91,
	address = "Santa Cruz, California",
	publisher = "Morgan Kaufmann",
	year = 1991,
	pages = "147-156"
	}

@inproceedings{LiLoWa91,
	author = "N. Littlestone and P. M. Long and M. K. Warmuth",
	title = "On-line learning of linear functions",
	booktitle = STOC91,
	organization = "ACM",
	year = 1991,
	pages = "465-475",
	}

@article{LitWar94,
	author = "N. Littlestone and M. K. Warmuth",
	title = "The Weighted Majority Algorithm",
        journal = InfComp,
	volume = 108,
	pages = "212-261",
	year = 1994
	}

@inproceedings{LonTha93,
        author = "D. D. E. Long and M. N. Thakur",
        title = "Scheduling real-time disk transfers for continuous
		media applications",
        booktitle = "Proc. 12th Symp. on Mass Storage Systems. Putting
		all that Data to Work",
        year = 1993,
        pages = "227-232"
	}

@inproceedings{LopSch95,
	author = "A. Lopez-Ortiz and S. Schuierer",
	title = "Going home through an unknown street",
	booktitle = WADS95,
	year = 1995,
	pages = "135-146",
        publisher = "Springer",
        series = LNCS,
        volume = "955",
	}

@article{LouLug92,
        author = "M. C. Loui and D. R. Luginbuhl",
        title = "Optimal online simulations of tree machines by random
		access machines",
         journal = Sicomp,
        volume = "21",
        year = 1992,
        pages = "959-971"
	}

@inbook{Lovasz93,
        author = "Laszlo Lov{\'a}sz",
	title = "Problem 13.13",
        booktitle = "Combinatorial Problems and Exercises",
        year = 1993,
        pages = "319-325",
        publisher = "Akad\'emiai Kiad\'o, Budapest",
        }

@article{LoSaTr89,
    	author = "Laszlo Lov{\'a}sz and Michael Saks and William T. Trotter",
    	title = "An on-line graph coloring algorithm with sublinear
    		performance ratio",
    	journal = DM,
    	volume = "75",
    	year = 1989,
    	pages = "319-325"
	}

@Article{LLSCCZ91,
        author =   {Jane W. S. Liu and Kwei-Jay Lin and Wei-Kuan Shih
                    and Albert Chuang-shi Yu and Jen-Yao Chung and Wei Zhao},
        title =    {Algorithms for Scheduling Imprecise Computations},
        journal =  {IEEE Computer},
        year =     {1991},
        volume =   {24},
        pages =    {58--68},
        }

@inproceedings{LiuAdl04,
	author = "Junning Liu and Micah Adler",
	title = "Load Balancing in Hypercubic Distributed Hash Tables with
                 Heterogeneous Processors",
	pages =  "496-507",
        booktitle = ESA04,
        year = 2004,
        publisher = "Springer",
        series = LNCS,
	volume = 3221
}

@InProceedings{LotSha01,
        author =   {Z. Lotker and B. Patt-Shamir},
        title =    {Nearly Optimal {FIFO} Buffer Management for {D}iff{S}erv},
        booktitle =    {In Proc. of the 21st Symp. on Principles of
	        Distributed Computing},
	organization = "ACM",
        pages =    {134--143},
        year =     2002
        }

@inproceedings{LuJiZh94,
        author = "Tao Lu and Pei-Fa Jia and Bo Zhang",
        title = "On-line opportunistic scheduling in multirobot assembly
		system",
        booktitle = "Proc. 2nd Asian Conference on Robotics and Its
		Applications",
        year = 1994,
        pages = "608-611",
	}

@inproceedings{LuNaOr94,
	author = "Michael Luby and J. Naor and A. Orda",
	title = "Tight bounds for dynamic storage allocation",
	booktitle = SODA94,
	organization = "ACM/SIAM",
	year = 1994,
	pages = "724-732"
	}

@article{Lucas87,
	author = "Joan M. Lucas",
	title = "The rotation graph of binary trees is Hamiltonian",
         journal = JAlg,
	volume = 8,
	year = 1987,
	pages = "503-535",
	}

@techreport{Lucas88A,
	author = "Joan M. Lucas",
	title = "Arbitrary splitting in splay trees",
	institution = "Rutgers University",
	number = "DCS-TR-234",
	year = 1988
	}

@techreport{Lucas88B,
	author = "Joan M. Lucas",
	title = "Canonical forms for competitive binary search tree
		algorithms",
	institution = "Rutgers University",
	number = "DCS-TR-250",
	year = 1988
	}

@inproceedings{Lucas92,
	author = "Joan M. Lucas",
	title = "On the Competitiveness of Splay Trees: {R}elations to the
                  Union-Find Problem",
	editor = "Lyle A. McGeoch and Daniel D. Sleator",
	volume = 7,
	series = "DIMACS Series in Discrete Mathematics and Theoretical
                  Computer Science",
	pages = "95-124",
	booktitle = "On-line Algorithms",
	year = 1992,
	organization = "AMS/ACM",
	}

@article{LucPag89,
	author = "F. Luccio and L. Pagli",
	title = "On the upper bound on the rotation distance of binary trees",
     	journal = IPL,
	volume = 31,
	year = 1989,
	pages = "57-60",
	}

@techreport{LudTiw93,
	author = "W. Ludwig and P. Tiwari",
	title = "The power of choice in scheduling parallel tasks",
	institution = "University of Wisconsin, Madison",
	year = 1993,
	number = "TR1190",
	}

@techreport{Lueker82,
         author = "G. S. Lueker",
         title = "An average-case analysis of bin packing with uniformly
                  distributed item sizes",
         number = "181",
         institution = "Dept. Information and Computer Science, University
                   of California at Irvine",
         year = 1982,
         }

@inproceedings{Lueker83,
         author = "G. S. Lueker",
         title = "Bin-packing with items uniformly distributed over
                  intervals [a,b]",
         booktitle = FOCS83,
	organization = "IEEE",
         year = 1983,
         pages = "289-297",
         }

@article{LumSte86,
        author = "V. J. Lumelsky and A. A. Stepanov",
        title = "Dynamic path planning for a mobile automaton with limited
		information on the environment",
        journal = IEEEauto,
        volume = "AC-31",
        year = 1986,
        pages = "1058-1063"
        }

@article{LumSte87,
        author = "V. J. Lumelsky and A. A. Stepanov",
        title = "Path-planning strategies for a point mobile automaton
                 moving amidst unknown obstacles of arbitrary shape",
        journal = Algorithmica,
        volume = "2",
        year = 1987,
        pages = "403-430",
        }

@inproceedings{LuPhRe94,
        author = "Carsten Lund and Steven Phillips and Nick Reingold",
        title = "IP over connection-oriented networks and
 		distributional paging",
        booktitle = FOCS94,
	organization = "IEEE",
        year = 1994,
        pages = "424-435"
	}

@inproceedings{LunRei94,
        author = "Carsten Lund and Nick Reingold",
        title = "Linear programs for randomized on-line algorithms",
 	booktitle = SODA94,
	organization = "ACM/SIAM",
        year = 1994,
	pages = "382-391",
        }

@inproceedings{LuReWY94,
        author = "Carsten Lund and Nick Reingold and Jeffery Westbrook
		and Dicky Yan",
        title = "On-line Distributed Data Management",
        booktitle = ESA94,
        year = 1994,
        pages = "202-214",
        publisher = "Springer",
        series= LNCS,
        volume = "855",
        }


@article{LuSiSt03,
	author = "X. Lu and R. A. Sitters and L. Stougie",
	title = "A class of on-line scheduling algorithms to minimize
		total completion time",
        journal = ORL,
	volume = 31,
	pages = "232-236",
	year = 2003
	}

%MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM%

@InProceedings{Manzin99,
	author = "Giovanni Manzini",
	title = "Efficient algorithms for in-line symbol ranking compression",
	booktitle = ESA99,
	year = 1999,
        publisher = "Springer",
        series = LNCS,
        volume = "1643",
	pages = "277--288"
	}

@inproceedings{Marco08,
        author    = {Gianluca De Marco},
        title     = {Distributed broadcast in unknown radio networks},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year      = {2008},
        pages     = {208-217},
        }

@article{MaPlot97,
        author = "Y. Ma and Serge Plotkin",
        title = "Improved lower bounds for load balancing of tasks
                  with unknown duration",
     	journal = IPL,
        volume = "62",
        year = 1997,
        pages = "31-34"
        }

@article{Makine87,
	author = "Erkki Makinen",
  	title = "On Top-Down Splaying",
        journal = "{BIT}",
	volume = 27,
	year = 1987,
	pages = "330-339"
	}

@article{Makine88,
        author = "Erkki Makinen",
	title = "On the rotation distance of binary trees",
     	journal = IPL,
	volume = 26,
	year = 1988,
	pages = "271-272",
	}

@inproceedings{MaMcSl88,
        author = "Mark Manasse and Lyle A. McGeoch and Daniel Sleator",
        title = "Competitive algorithms for online problems",
        booktitle = STOC88,
	organization = "ACM",
	year = 1988,
	pages  = "322-333"
	}

@article{MaMcSl90,
        author = "Mark Manasse and Lyle A. McGeoch and Daniel Sleator",
        title = "Competitive algorithms for server problems",
         journal = JAlg,
        volume = "11",
        year = 1990,
        pages = "208-230"
	}

@article{ManRos72,
	author = "A. B. Manaster and J. G. Rosenstein",
	title = "Effective matchmaking (recursion theoretic aspects of a
		theorem of {Philip} {Hall})",
	journal = PLond,
	volume = "25",
	year = 1972,
	pages = "615-654"
	}

@article{ManRos73,
	author = "A. B. Manaster and J. G. Rosenstein",
	title = "Effective matchmaking and $k$-chromatic graphs",
	journal = PAMS,
	volume = "39",
	year = 1973,
	pages = "371-378"
	}

@article{ManMye93,
        author = "U. Manber and G. Myers",
        title = "Suffix arrays: {A} new method for on-line string searches",
         journal = Sicomp,
        volume = "22",
        year = 1993,
        pages = "935-948"
	}

@article{ManSch92,
        author = "Yishay Mansour and Baruch Schieber",
        title = "The intractability of bounded protocols for online sequence
		transmission over nonFIFO channels",
   	journal = JACM,
        volume = "39",
        year = 1992,
        pages = "783-99"
	}

@inproceedings{MaPaLa00,
        author = "Yishay Mansour and Boaz Patt-Shamir and Ofer Lapid",
        title = "Optimal smoothing schedules for real-time streams",
        booktitle = PODC00,
	organization = "ACM",
        year = 2000,
        pages = "21--29"
        }

@article{Mao93A,
        author = "W. Mao",
        title = "Tight worst-case performance bounds for {Next-k-Fit}
                 bin packing",
         journal = Sicomp,
        volume = "22",
        year = 1993,
        pages = "46-56",
        }

@article{Mao93B,
         author = "W. Mao",
         title = "{Best-k-Fit} bin packing.",
         journal = Computing,
         volume = "50",
         year = 1993,
         pages = "265-270",
         }

@inproceedings{MaKiRi95,
        author = "Weizhen Mao and R. K. Kincaid and A. Rifkin",
        title = "On-line algorithms for a single machine scheduling problem",
        booktitle = "Impact of Emerging Technologies on Computer Science
		and Operations Research",
        year = 1995,
        pages = "157-173"
	}

@inproceedings{ManPat98,
        author = "Yishay Mansour and Boaz Patt-Shamir",
        title = "Jitter control in {QoS} networks",
        booktitle = FOCS98,
	organization = "IEEE",
        year = 1998,
        pages = "50-59"
        }

@inproceedings{MaHuRa93,
        author = "M. V. Marathe and H. B. Hunt III and S. S. Ravi",
        title = "Efficient approximation algorithms for domatic partition
		and on-line coloring of circular arc graphs",
        booktitle = "Proc. 5th International Conference on Computing and
		Information (ICCI)",
	organization = "IEEE",
        year = 1993,
        pages = "26-30"
	}

@inproceedings{MarVer87,
	author = "Alberto Marchetti-Spaccamela and Carlo Vercellis",
	title = "Efficient on-line algorithms for the knapsack problem",
	booktitle = ICALP87,
	year = 1987,
	pages = "445-456",
        publisher = "Springer",
	series = LNCS,
	volume = 267,
	}

@article{MarVer95,
	author = "Alberto Marchetti-Spaccamela and Carlo Vercellis",
	title = "Stochastic on-line knapsack problems",
	journal = MathProg,
	year = 1995,
	volume = 68,
	pages = "73-104",
	}

@inproceedings{MarSpo07,
	 author = {Martin Marciniszyn and Reto Sp\"{o}hel},
	 title = {Online Vertex Colorings of Random Graphs without Monochromatic Subgraphs},
	 booktitle = SODA07,
		organization = "ACM/SIAM",
	 year = {2007},
	 pages = {486--493}
	}

@article{Martel91,
	author = "Chip Martel",
	title = "Self-adjusting multi-way search trees",
	journal = IPL,
	volume = 38,
	pages = "135-141",
	year = 1991,
	}

@inproceedings{MasSve08,
        author    = {Monaldo Mastrolilli and
                     Ola Svensson},
        title     = {(Acyclic) JobShops are Hard to Approximate},
        booktitle = FOCS08,
	organization = "IEEE",
        year      = {2008},
        pages     = {583-592}
        }

@article{Matous89,
	author = "J. Matousek",
	title = "On-line computation of convolutions",
     	journal = IPL,
	volume = "32",
	year = 1989,
	pages = "15-16"
	}

@inproceedings{Matsum92,
        author = "T. Matsumoto",
        title = "Competitive analysis of the {R}ound {R}obin algorithm",
        booktitle = ISAAC92,
        year = 1992,
        pages = "71-77",
        publisher = "Springer",
        series = LNCS,
        volume = "650"
	}

@article{MayWer95,
        author = "E. W. Mayr and R. Werchner",
        title = "Optimal routing of parentheses on the hypercube",
        journal = JpardisCom,
        volume = "26",
        year = 1995,
        pages = "181-192"
	}

@article{McCabe65,
        author = "J. McCabe",
        title = "On serial files with relocatable records",
        journal = OpRes,
        volume = "12",
        pages = "609-618",
        year = 1965,
        }

@inproceedings{MccTor04,
	author = "Jason McCullough and Eric Torng",
	title = "{SRPT} optimally uses faster machines to minimize flow time",
	booktitle = SODA04,
	organization = "ACM/SIAM",
        year = 2004,
	pages = "350-358"
	}

@article{McGSle91,
        author = "Lyle McGeoch and Daniel Sleator",
        title = "A strongly competitive randomized paging algorithm",
        journal = Algorithmica,
	volume = "6",
	year = 1991,
	pages = "816-825"
	}

@proceedings{McGSle92,
	title = "On-line Algorithms",
	year = 1991,
	editor = "Lyle A. McGeoch and Daniel D. Sleator",
	volume = 7,
	series = "DIMACS Series in Discrete Mathematics and Theoretical
                  Computer Science",
	organization = "AMS/ACM",
	month = "February",
	language = "english"
	}

@article{MeHGJP88,
	author = "Nimrod Megiddo and S. L. Hakimi and Michael R. Garey
		and David S. Johnson and Christos H. Papadimitriou",
	title = "The complexity of searching a graph",
   	journal = JACM,
	volume = "35",
	year = 1988,
  	pages = "18-44"
	}

@article{Mehlho75,
	author = "Kurt Mehlhorn",
	title = "Nearly Optimal Binary Search Trees",
        journal = ActInf,
	year = 1975,
	volume = 5,
	pages = "287-295",
	}

@article{Mehlho79,
	author = "Kurt Mehlhorn",
	title = "Dynamic Binary Search",
	journal = Sicomp,
	year = 1979,
	volume = 8,
	pages = "175-198",
	}

@book{Mehlho84,
        author = "Kurt Mehlhorn",
        title = "Data Structures and Algorithms",
        note = "(3 volumes)",
        publisher = "Springer",
        address = "New York",
        year = 1984
	}

@inproceedings{MeSaVV05,
  author    = {Aranyak Mehta and Amin Saberi and
               Umesh V. Vazirani and Vijay V. Vazirani},
  title     = {AdWords and Generalized On-line Matching},
  booktitle = FOCS05,
	organization = "IEEE",
  year      = 2005,
  pages     = {264--273},
}

@article{MeiIga94,
	author = "A. Mei and Y. Igarashi",
	title = "Efficient strategies for robot navigation
            in unknown environment",
     	journal = IPL,
        volume = "52",
        year = 1994,
        pages = "51-56"
	}

@article{MeiMos68,
         author = "A. Meir and L. Moser",
         title = "On packing of squares and cubes",
         journal = JCT,
         volume = "5",
         year = 1968,
         pages = "126-134",
         }

@article{Melkma87,
        author = "A. A. Melkman",
        title = "On-line construction of the convex hull of a simple polyline",
     	journal = IPL,
        volume = "25",
        year = 1987,
        pages = "11-12"
        }

@inproceedings{MerFed92,
	author = "N. Merhav and M. Feder",
	title = "Universal sequential learning and decisions from
                individual data sequences",
	booktitle = COLT92,
	organization = "ACM",
	year = 1992,
	pages = "413-427",
	}

@incollection{Merton81,
	author = "R. C. Merton",
	editor = "K. J. Arrow and M. D. Intriligator",
	title = "On the Microeconomic Theory of Investment Under Uncertainty",
	year = 1981,
	volume = 2,
	pages = "601-669",
	booktitle = "Handbook of Mathematical Economics",
	publisher = "North-Holland",
	chapter = 13
	}

@inproceedings{MetPla00,
        author = "Ramgopal R Mettu and C. Greg Plaxton",
        title = "The online median problem",
	booktitle = FOCS00,
	organization = "IEEE",
        year = 2000,
        pages = "339-348"
        }

@article{MetPla03,
        author = "Ramgopal R. Mettu and C. Greg Plaxton",
        title = "The online median problem",
        journal = Sicomp,
        volume = "32",
        year = "2003",
        pages = "816--832"
        }

@inproceedings{Meyers01,
        author = "A. Meyerson",
        title = "Online facility location",
        booktitle = FOCS01,
	organization = "IEEE",
        year = 2001,
        pages = "426-433"
        }

@inproceedings{Meyers05,
  author    = {Adam Meyerson},
  title     = {The Parking Permit Problem.},
  booktitle = FOCS05,
	organization = "IEEE",
  year      = 2005,
  pages     = {274--284},
}

@inproceedings{MiKaRa95,
        author = "M. Mihail and C. Kaklamanis and S. Rao",
        title = "Efficient access to optical bandwidth",
        booktitle = FOCS95,
	organization = "IEEE",
        year = 1995,
        pages = "548-557"
        }

@article{MiOrVo97,
	author = "P. Mireault and J. B. Orlin and R. V. Vohra",
	title = "A parametric worst case analysis of the {LPT}
	         Heuristic for two uniform machines",
	year = 1997,
	journal = OpRes,
	volume = 45,
	pages = "116-125"
	}

@article{Mirman71,
	author = "L. J. Mirman",
	title = "Uncertainty and Optimal Consumption Decisions",
	year = 1971,
	journal = "Econometrica",
	volume = 39,
	pages = "179-185"
	}

@inproceedings{MiNaSe08,
        author    = {Ilya Mironov and
                     Moni Naor and
                     Gil Segev},
        title     = {Sketching in adversarial environments},
        booktitle = STOC08,
	organization = "ACM",
        year      = {2008},
        pages     = {651-660}
        }

@inproceedings{Mitzen97,
        author = "Michael Mitzenmacher",
        title = "How useful is old information?",
        booktitle = PODC97,
	organization = "ACM",
        year = 1997,
        pages = "83-91"
        }

@article{MiyErl04,
 author = {Hiroyuki Miyazawa and Thomas Erlebach},
 title = {An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem},
 journal = {J. of Scheduling},
 volume = {7},
 year = {2004},
 pages = {293--311}
 }

@article{MoEdPe93,
        author = "A. Moffat and G. Eddy and O. Petersson",
        title = "Splaysort: {F}ast, versatile, practical",
        journal = "Australian Computer Science Communications",
        volume = 15,
        pages = "595-604",
        year = 1993,
        }

@inproceedings{MofPor89,
	author = "A. Moffat and Graham Port",
	title = "A fast algorithm for melding splay trees",
	booktitle = WADS89,
	year = 1989,
	pages = "450-459",
        publisher = "Springer",
        series = LNCS,
	volume = "382"
	}

@inproceedings{MoPhTo93,
	author = "Rajeev Motwani and Steven Phillips and Eric Torng",
	title = "Non-clairvoyant scheduling",
	booktitle = SODA93,
	organization = "ACM/SIAM",
	year = 1993,
	pages = "422-431"
	}

@article{MoPhTo94,
	author = "Rajeev Motwani and Steven Phillips and Eric Torng",
	title = "Non-clairvoyant scheduling",
        journal = TCS,
	volume = "130",
	pages = "17-47",
	year = 1994
	}

@inproceedings{MotTho04,
        author = "Rajeev Motwani and Dilys Thomas",
        title = "Caching queues in memory buffers",
        booktitle = SODA04,
	organization = "ACM/SIAM",
        year = 2004,
	pages = "541-549"
        }

@book{MotRag97,
        author = "Rajeev Motwani and Prabhakar Raghavan",
        title = "Randomized Algorithms",
        publisher = "Cambridge University Press",
        year = 1997
        }

@unpublished{MoSaTo94,
	author = "Rajeev Motwani and V. Saraswat and Eric Torng",
	title =  "Online scheduling with lookahead: {M}ultipass assembly lines",
	year = 1994,
	note = "Manuscript"
	}

@inproceedings{MuYaYu05,
  author    = {Kamesh Munagala and Jun Yang and Hai Yu},
  title     = {Online View Maintenance Under a Response-Time
                         Constraint},
  booktitle = ESA05,
        publisher = "Springer",
        series = LNCS,
        volume = "3669",
  year      = 2005,
  pages     = {677--688},
}

@article{Murgol87,
        author = "F. D. Murgolo",
        title = "An efficient approximation scheme for variable-sized
		bin packing",
        journal = Sicomp,
        volume = "16",
        year = 1987,
        pages = "149-161",
        }

@inproceedings{MuRaSG99,
        author = "S. Muthukrishnan and R. Rajaraman and A. Shaheen
                  and J. E. Gehrke",
        title = "Online scheduling to minimize avarage strech",
	booktitle = FOCS99,
	organization = "IEEE",
        year = 1999,
        pages = "433-443"
        }


%NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN%


@article{NarSch02,
        author = "Edwin Naroska and Uwe Schwiegelshohn",
        title = "On an on-line scheduling problem for parallel jobs",
     	journal = IPL,
        volume = 81,
        year = 2002,
        pages = "297-304"
	}

@inproceedings{Naraya04,
  author    = {N. S. Narayanaswamy},
  title     = {Dynamic Storage Allocation and On-Line Colouring Interval
               Graphs},
  booktitle = COCOON04,
        publisher = "Springer",
        series = LNCS,
        volume = "3106",
  year      = 2004,
  pages     = {329-338},
}

@article{McNaug59,
	author = "R. McNaughton",
	title = "Scheduling with deadlines and loss functions",
	journal = "Management Sci.",
	volume = 6,
	year = 1959,
	pages = "1--12"
	}

%OOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO%

@article{OnMaWe84,
         author = "H. L. Ong and M. J. Magazine and T. S. Wee",
         title = "Probabilistic analysis of bin packing heuristics",
         journal = OpRes,
         volume = "5",
         year = 1984,
         pages = "983-998",
        }

@techreport{OoIyRK86,
        author = "B. J. Oommen and S. S. Iyengar and S. V. Rao and R. L.
                  Kashyap",
        title = "Robot Navigation in Unknown Terrains Using Learned
                 Visibility Graphs. {P}art {I}: {The} Disjoint Convex
                 Obstacle Case",
        number = "SCS-TR-86",
        institution = "School of Computer Science, Carleton University",
        year = 1986,
        }

@inproceedings{OrdCov96,
	author = "E. Ordentlich and T. M. Cover",
	title = "On-line Portfolio Selection",
	year = 1996,
	booktitle = COLT96,
	organization = "ACM",
	pages = "310-313"
	}

@inproceedings{OrVeUl95,
	author = "Oriolo, G. and Vendittelli, M. and Ulivi, G.",
	title = "On-line map building and navigation for autonomous mobile
		robots",
	booktitle = "Proc. 1995 International Conference on Robotics and
		Automation",
	year = 1995,
	pages = "2900-2906"
	}

@inproceedings{OstRab97,
	author = "R. Ostrovsky and Yuval Rabani",
	title = "Universal $O({\rm congenstion}+{\rm dilation}+
	     \log^{1+\epsilon}N$) Local Contro l Packet Switching Algorithms",
	booktitle = STOC97,
	organization = "ACM",
	year = 1997,
	pages = "644-653"
	}

%PPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPP%

@book{Papadi94,
        author = "Christos Papadimitriou",
        title = "Computational Complexity",
        publisher = "Addison Wesley",
        PLACE = "Reading, MA",
        year = "1994"
        }

@inproceedings{PapYan89,
        author = "Christos H. Papadimitriou and Mihalis Yannakakis",
        title = "Shortest paths without a map",
	booktitle = ICALP89,
        year = 1989,
  	pages = "610-620",
        publisher = "Springer",
        series = LNCS,
        volume = "372",
        }

@article{PapYan91,
        author = "Christos H. Papadimitriou and Mihalis Yannakakis",
        title = "Shortest paths without a map",
        journal = TCS,
        year = 1991,
        volume = 84,
        pages = "127-150"
        }

@inproceedings{PapYan91b,
        author = "Christos H. Papadimitriou and Mihalis Yannakakis",
        title = "On the value of information in distributed decision making",
        booktitle = PODC91,
	organization = "ACM",
        year = 1991,
        pages = "61-64",
        }

@inproceedings{PapYan93,
        author = "Christos H. Papadimitriou and Mihalis Yannakakis",
        title = "Linear Programming without the Matrix",
        booktitle = STOC93,
	organization = "ACM",
        year = 1993,
        pages = "121-129"
	}

@inproceedings{Papado94,
        author = "C. V. Papadopoulos",
        title = "A dynamic algorithm for online scheduling of parallel
		processes",
        booktitle = "Proc. 6th European Conference on Parallel
                Architectures and Languages",
        year = 1994,
        pages = "601-610"
	}
@inproceedings{PatRaj94,
        author = "B. Patt-Shamir and S. Rajsbaum",
        title = "A theory of clock synchronization",
        booktitle = STOC94,
	organization = "ACM",
        year = 1994,
        pages = "810-819"
        }

@article{Pedrot94,
        author = "A. Pedrotti",
        title = "Analysis of a list-update strategy",
     	journal = IPL,
        volume = "52",
        year = 1994,
        pages = "115-121"
	}

@article{Penric95,
	author = "Stephen G. Penrice",
	title = "On-line algroithms for ordered sets and comparability
                graphs",
        journal = DAM,
	year = 1995,
	volume = 60,
	pages = "319-329",
	}

@inproceedings{PeRaVa04,
        author = "Sriram V. Pemmaraju and Rajiv Raman and Kasturi Varadarajan",
        title = "Buffer minimization using max-coloring",
        booktitle = SODA04,
	organization = "ACM/SIAM",
        year = 2004,
	pages = "562-571"
        }

@book{Petrov75,
        author = "V. V. Petrov",
        title = "Sums of Independent Random Variables",
        publisher = "Springer",
        year = 1975,
        address = "Berlin"
        }

@article{Pflug90,
        author = "G. Ch. Pflug",
        title = "On-line optimization of simulated Markovian processes",
        journal = MOR,
        volume = "15",
        year = 1990,
        pages = "381-395"
	}

@phdthesis{Philli93,
	author = "Steven J. Phillips",
	title = "Theory and Applications of Online Algorithms",
	school = "Department of Computer Science, Stanford University",
	year = 1993,
	}

@inproceedings{PhStTW97,
        author = "Cynthia Phillips and Cliff Stein and Eric Torng
		and Joel Wein",
        title = "Optimal Time-Critical Scheduling Via Resource Augmentation",
        booktitle = STOC97,
	organization = "ACM",
        year = 1997,
        pages = "140-149"
        }

@article{PhStTW02,
        author = "Cynthia Phillips and Cliff Stein and Eric Torng
		and Joel Wein",
        title = "Optimal Time-Critical Scheduling Via Resource Augmentation",
        journal = Algorithmica,
        year = 2002,
        pages = "163-200"
        }

@article{PhStWe98,
	author = "Cynthia Philips and Cliff Stein and Joel Wein",
	title = "Minimizing average completion time in the presence of
		release dates",
	journal = MathProg,
	volume = 82,
	pages = "199-224",
	year = 1998
	}

@inproceedings{PhiWes93,
	author = "Steven Phillips and Jeffery Westbrook",
	title = "On-line load balancing and network flow",
	booktitle = STOC93,
	organization = "ACM",
	year = 1993,
	pages = "402-411"
	}

@article{Plotki95,
	author = "Serge Plotkin",
        title = "Competitive routing in ATM networks",
        journal = IEEEcomm,
        volume = "",
        year = 1995,
        pages = "1128-1136",
        }

@unpublished{PlotMa98,
	author = "Serge Plotkin and Y. Ma",
	title = "An improved lower bound for load balancing of tasks with
		unknown duration",
	note = "Manuscript",
        year = 1998,
	}

@article{Prodin85,
         author = "H. Prodinger",
         title = "Einige {B}emerkungen zu einer {A}rbeit von
            {W.} {K}noedel ueber das mittlere {V}erhalten von
            online {P}ackungsalgorithmen",
         journal = "EIK",
         volume = "21",
         year = 1985,
         pages = "3-7",
         }

@article{Pruhs94,
	author = "Kirk R. Pruhs",
	title = "Average case scalable on-line algorithms for fault
                  replacement",
     	journal = IPL,
	year = 1994,
	volume = 52,
	pages = "131-136",
	}

@inproceedings{PruUth02,
        author = "Kirk Pruhs and Patchrawat Uthaisombut",
        title = "A Comparison of Multicast Pull Models",
        booktitle = ESA02,
        publisher = "Springer",
        series = LNCS,
        volume = "2461",
        pages = "808-819",
        year = 2002
        }

@inproceedings{PrHoHe88,
        author = "S. Przybylski and S. Horowitz and M. Henessy",
        title = "Performance tradeoffs in cache design",
        booktitle = "Proc. 15th International Symp. on Computer Architecture (ISCA)",
	organization = "IEEE",
        pages = "290-298",
        year = 1988
        }

@book{Przyby90,
        author = "S. Przybylski",
        title = "Cache and Memory Hierarchy Design:
                {A} Performance-Directed Approach",
        publisher = "Morgan Kaufmann",
        PLACE = "San Mateo, CA",
        year = 1990
        }

%QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ%

%RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR%

@inproceedings{RabTar96,
	author = "Yuval Rabani and Eva Tardos",
	title = "Distributed packet switching in arbitrary networks",
	booktitle = STOC96,
	organization = "ACM",
	year = 1996,
	pages = "366-367"
	}

@inproceedings{Racke02,
  author = "H. Racke",
  title = "Minimizing congestion in general networks",
  booktitle = FOCS02,
	organization = "IEEE",
  year = "2002",
  pages = "43--52",
}

@inproceedings{RaSoWe02,
	author = "H.~R{\"{a}}cke and C.~Sohler and M.~Westermann",
	title = "Online scheduling for sorting buffers",
	booktitle = ESA02,
	publisher = "Springer",
    series = LNCS,
    volume = "2461",
	year = 2002,
	pages = "820--832",
        }

@inproceedings{RacRos05,
  author    = {Harald R{\"a}cke and Adi Ros{\'e}n},
  title     = {Distributed online call control on general networks},
  booktitle = SODA05,
	organization = "ACM/SIAM",
  year      = 2005,
  pages     = {791--800},
}

@incollection{Raghav92,
	author = "Prabhakar Raghavan",
	title = "A statistical adversary for on-line algorithms",
	pages = "79-83",
	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{RagSni89,
      	author = "Prabhakar Raghavan and Marc Snir",
      	title = "Memory versus randomization in online algorithms",
	booktitle = ICALP89,
      	year = 1989,
      	pages = "687-703",
        publisher = "Springer",
        series = LNCS,
        volume = "372",
        }

@article{RagSni94,
	author = "Prabhakar Raghavan and Marc Snir",
	title = "Memory versus randomization in on-line algorithms",
	journal = IBMres,
	volume = "38",
        ISSUE = "6",
	year = 1994,
        pages = "683--707"
	}

@inproceedings{RagUpf94,
        author = "Prabhakar Raghavan and E. Upfal",
        title = "Efficient routing in all-optical networks",
        booktitle = STOC94,
	organization = "ACM",
        year = 1994,
        pages = "133-143"
        }

@article{RamRep94,
	author = "G. Ramalingam and Thomas Reps",
	title = "On competitive on-line algorithms for the dynamic
              priority-ordering problem",
     	journal = IPL,
	year = 1994,
	volume = 51,
	pages = "155-161",
	}

@article{Ramana89,
         author = "P. Ramanan",
         title = "Average case analysis of the {S}mart {N}ext
                  {F}it algorithm",
     	journal = IPL,
         volume = "31",
         year = 1989,
         pages = "221-225",
         }

@article{RaBrLL89,
         author = "P. Ramanan and D. J. Brown and C. C. Lee and D. T. Lee",
         title = "Online bin packing in linear time",
         journal = JAlg,
         volume = "10",
         year = 1989,
         pages = "305-326",
         }

@article{RamTsu89,
         author = "P. Ramanan and K. Tsuga",
         title = "Average case analysis of the modified harmonic algorithm",
         journal = Algorithmica,
         volume = "4",
         year = 1989,
         pages = "519-533",
         }

@inproceedings{Ramesh93,
	author = "H. Ramesh",
	title = "On traversing layered graphs on-line",
	booktitle = SODA93,
	organization = "ACM/SIAM",
	year = 1993,
	pages = "412-421"
	}

@article{Ramesh95,
        author = "H. Ramesh",
        title = "On traversing layered graphs on-line",
         journal = JAlg,
        volume = "18",
        year = 1995,
        pages = "480-512"
	}

@inproceedings{RamLeh93,
        author = "S. Ramos-Thuel and J. P. Lehoczky",
        title = "On-line scheduling of hard deadline aperiodic tasks in
		fixed-priority systems",
        booktitle = "Proc. Real-Time Systems Symp.",
        year = 1993,
        pages = "160-171"
	}

@article{RaSaHS92,
         author = "S. Rao and P. Sadayappan and F. Hwang and Peter Shor",
         title = "The Rectilinear Steiner Arborescence Problem",
         journal = Algorithmica,
         year = 1992,
         pages = "277-288",
         }

@techreport{ReiWes90A,
        author = "Nick Reingold and Jeffery Westbrook",
        title = "Randomized algorithms for the list update problem",
        institution = "Department of Computer Science, Yale University",
        number = "YALEU/DCS/TR-804",
        year = 1990
        }

@techreport{ReiWes90B,
        author = "Nick Reingold and Jeffery Westbrook",
        title = "Optimum off-line algorithms for the list update problem",
        institution = "Yale University",
        year = 1990,
        number = "YALEU/DCS/TR-805"
        }

@article{ReWeSl93,
        author = "Nick Reingold and Jeffery Westbrook and Daniel D. Sleator",
        title = "Randomized Algorithms for the List Update Problem",
	journal = Algorithmica,
        year = 1994,
        volume = "11",
        pages = "15-32"
        }

@article{ReWeSl94,
     	author = "Nick Reingold and Jeffery Westbrook and Daniel D. Sleator",
     	title = "Randomized competitive algorithms for the list update problem",
     	journal = Algorithmica,
     	volume = "11",
     	pages = "15-32",
     	year = 1994
     	}

@article{ReyWar87,
        author = "Rey, C. and Ward, R.",
        title = "On determining the on-line minimax linear fit to a
		discrete point set in the plane",
     	journal = IPL,
        volume = "24",
        year = 1987,
        pages = "97-101"
	}

@article{Reynie96,
        author = "D. J. Reyniers",
        title = "Coordinated search for an object hidden on the line",
        journal = EJOR,
        volume = "95",
        year = 1996,
        pages = "663-670"
	}

@article{RheTal89A,
        author = "W. T. Rhee and M. Talagrand",
        title = "The complete convergence of Best Fit Decreasing",
        journal = Sicomp,
        volume = "18",
        year = 1989,
        pages = "909-918",
        }

@article{RheTal89B,
        author = "W. T. Rhee and M. Talagrand",
        title = "The complete convergence of First Fit Decreasing",
        journal = Sicomp,
        volume = "18",
        year = 1989,
        pages = "919-938",
        }

@article{RheTal93A,
        author = "W. T. Rhee and M. Talagrand",
        title = "On line bin packing with items of random size",
        journal = MOR,
        volume = "18",
        year = 1993,
        pages = "438-445",
        }

@article{RheTal93B,
        author = "W. T. Rhee and M. Talagrand",
        title = "On line bin packing with items of random sizes --- II",
        journal = Sicomp,
        volume = "22",
        year = 1993,
        pages = "1251-1256",
        }

@article{RheTal93C,
         author = "W. T. Rhee and M. Talagrand",
         title = "Dual bin packing of items of random size",
	 journal = MathProg,
         volume = "58",
         year = 1993,
         pages = "229-242",
         }

@article{Richey91,
         author = "M. B. Richey",
         title = "Improved bounds for harmonic-based bin packing algorithms",
         journal = DAM,
         volume = "34",
         year = 1991,
         pages = "203-227",
         }

@article{Rivest76,
     	author = "Ronald Rivest",
     	title = "On self-organizing sequential search heuristics",
     	journal = CACM,
     	volume = "19",
     	pages = "63-67",
     	year = 1976
     	}

@article{Rivest87,
	author = "Ronald L. Rivest",
	title = "Learning Decision Lists",
	journal = ML,
	year = 1987,
	volume = 2,
	pages = "229-246"
	}

@inproceedings{Robbin51,
	author = "H. Robbins",
	title = "Asymptotically Subminimax solutions of compound
                statistical decision problems",
	booktitle = "Proc. 2nd Berkeley Symp. Math. Statist. Prob.",
	pages = "131-148",
	year = 1951
	}

@inproceedings{RobSch08,
        author    = {Julien Robert and
                     Nicolas Schabanel},
        title     = {Non-clairvoyant scheduling with precedence constraints},
        booktitle = SODA08,
	organization = "ACM/SIAM",
        year      = {2008},
        pages     = {491-500},
        }

@article{Robson71,
        author = "J. M. Robson",
        title = "An estimate of the store size necessary for
                 Dynamic Storage Allocation",
   	journal = JACM,
        volume = "18",
        year = 1971,
        pages = "416-423",
        }

@article{Robson74,
        author = "J. M. Robson",
        title = "Bounds for some functions concerning
                 Dynamic Storage Allocation",
   	journal = JACM,
        volume = "21",
        year = 1974,
        pages = "491-499",
        }

@article{Robson77,
        author = "J. M. Robson",
        title = "Worst case fragmentation of first-fit and best-fit
                 storage allocation strategies",
        journal = "The Computer J.",
        volume = "20",
        year = 1977,
        pages = "242-244",
        }

@article{RosSha81,
	author = "D. B. Rosenfield and R. D. Shapiro",
	title = "Optimal Price Search with {Bayesian} Extensions",
	year = 1981,
	journal = "J. Economic Theory"
	}

@article{RoStLe77,
        author = "D. Rosenkrantz and R. Stearns and P. Lewis",
        title = "An Analysis of Several Heuristics for the
                Traveling Salesman Problem",
         journal = Sicomp,
        volume = "6",
        year = 1977,
        pages = "563-581",
        }

@article{Rothch74,
	author = "M. Rothschild",
	title = "Searching for the lowest price when the distribution
		of prices is unknown",
	year = 1974,
	journal = "J. Political Economy",
	volume = 82,
	pages = "689-711"
	}

@article{RouTar02,
	author = "Tim Roughgarden and {\'E}va Tardos",
	title = "How bad is selfish routing?",
	year = 2002,
	journal = JACM,
	volume = "49",
	pages = "236--259"
        }

@inproceedings{Roughg05,
  author    = {Tim Roughgarden},
  title     = {Selfish routing with atomic players},
  booktitle = SODA05,
	organization = "ACM/SIAM",
  year      = 2005,
  pages     = {1184--1185},
}

@book{Roughg05b,
  author    = {Tim Roughgarden},
  title     = {Selfish routing and the price of anarchy},
  year      = 2005,
  publisher = {The MIT Press}
}

@inproceedings{RuhSch05,
  author    = {Stefan R{\"u}hrup and Christian Schindelhauer},
  title     = {Online Routing in Faulty Meshes with Sub-linear
                 Comparative Time and Traffic Ratio},
  booktitle = ESA05,
        publisher = "Springer",
        series = LNCS,
        volume = "3669",
  year      = 2005,
  pages     = {23--34},
}

@phdthesis{Rudin01,
	author = "Rudin, III, John F.",
	title = "Improved Bound for the Online Scheduling Problem",
	school = "The University of Texas at Dallas",
	year = 2001
	}

@article{RudCha03,
	author = "Rudin, III, John F. and R. Chandrasekaran",
	title = "Improved Bound for the Online Scheduling Problem",
        journal = Sicomp,
        volume = "32",
        year = 2003,
        pages = "717--735",
	}

%SSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS%

@article{SahCho79,
	author = "S. Sahni and Y. Cho",
	title = "Nearly on line scheduling of a uniform processor system
		with release times",
         journal = Sicomp,
	volume = "8",
	pages = "275-285",
	year = 1979
	}

@inproceedings{SaShWo91,
        author = "Michael Saks and Nir Shavit and Heather Woll",
        title = "Optimal Time Randomized Consensus ---
                 Making Resilient Algorithms Fast in Practice",
        booktitle = SODA91,
	organization = "ACM/SIAM",
        year = 1991,
	pages = "351-362"
	}

@article{SakWer91,
        author = "Michael E. Saks and M. Werman",
        title = "On computing majority by comparisons",
        journal = Combinatorica,
        volume = "11",
        year = 1991,
        pages = "383-387",
        }

@inproceedings{SaSiSk04,
	author = "Peter Sanders and Naveen Sivadasan and Martin Skutella",
	title = "Online Scheduling with Bounded Migration",
	pages =  "1111-1122",
        booktitle = ICALP04,
        year = 2004,
        publisher = "Springer",
        series = LNCS,
        volume = "3142"
}

@article{Savche81,
	author = "L. A. Savchenko",
	title = "General self-organizing sequential search procedure",
	journal = PrCoSoft,
	volume = 7,
	year = 1981,
	pages = "282-285",
	}

@incollection{Scarf63,
        author = "H. E. Scarf",
        editor = "H. E. Scarf and D. M. Gilford and M. W. Shelly",
        title = "A Survey of Analytic Techniques in Inventory Theory",
        year = 1963,
        pages = "185-225",
        booktitle = "Multistage Inventory Models and Techniques",
        publisher = "Stanford University Press",
        chapter = 7
        }

@article{SchDau67,
     	author = "G. Schay Jr. and F. W. Dauer",
     	title = "A probabilistic model of a self-organizing file system",
	journal= Siappmat,
     	volume = "15",
     	pages = "874-888",
     	year = 1967,
     	}

@inproceedings{SchSiv04,
        author = "Guido Sch{\"a}fer and Naveen Sivadasan",
        title = "Topology Matters: {S}moothed Competitiveness of Metrical Task Systems.",
	pages =  "489--500",
        booktitle = STACS04,
        year = 2004,
        publisher = "Springer",
        series = LNCS,
	volume = "2996"
	}

@article{SchDub89,
	author = "C. Scheurich and M. Dubois",
	title = "Dynamic page migration in multiprocessors with distributed
		 global memory",
	journal = IEEEcomp,
	volume = "38",
        year = 1989,
	pages = "1154-1163"
	}

@article{Schmer80,
        author = "J. H. Schmerl",
        title = "Recursive colorings of graphs",
        journal = CanadJM,
        volume = "32",
        year = 1980,
        pages = "821-830"
        }

@inproceedings{Schmid05,
  author    = {Markus Schmidt},
  title     = {Packet Buffering: {R}andomization Beats
                 Deterministic Algorithms},
  booktitle = STACS05,
        publisher = "Springer",
        series = LNCS,
        volume = "3404",
  year      = 2005,
  pages     = {293-304},
}

@article{Schoev93,
	author = "B. Schoevmakers",
	title = "Systematic analysis of splaying",
     	journal = IPL,
	year = 1993,
	volume = 45,
	pages = "41-50",
	}

@techreport{SchSku96,
	author = "Andreas S. Schulz and Martin Skutella",
	title = "Scheduling-{LP}s bear probabilities: {R}andomized
		approximations for min-sum criteria",
	number = "533/1996",
	institution = "Department of Mathematics, Technical University
		of Berlin, Berlin, Germany",
	year = 1996
	}

@inproceedings{SchSku97,
	author = "Andreas S. Schulz and Martin Skutella",
	title = "Scheduling-{LP}s bear probabilities",
	booktitle = ESA97,
	year = 1997,
	pages = "416-429",
        publisher = "Springer",
        series= LNCS,
        volume = "1284",
	}

@inproceedings{SchSmi92,
	author = "Christian Schwarz and Michiel Smid",
	title = "An O(n log n log log n) Algorithm for the On-line Closest
                  Pair Problem",
	pages = "280-285",
	booktitle = SODA92,
	organization = "ACM/SIAM",
	year = 1992
	}

@article{ScSmSn94,
        author = "Christian Schwarz and Michiel Smid and J. Snoeyink",
        title = "An optimal algorithm for the on-line closest-pair problem",
	journal = Algorithmica,
        volume = "12",
        year = 1994,
        pages = "18-29"
	}

@article{Schoem93,
	author = "Berry Schoemakers",
	title = "Systematic analysis of splaying",
     	journal = IPL,
	year = 1993,
	volume = 45,
	pages = "41-50",
	}

@phdthesis{Seiden97A,
	author = "Steve S. Seiden",
	title = "Randomization in On-line Computation",
	school = "University of California, Irvine",
	year = 1997
	}

@inproceedings{Seiden97B,
	author = "Steve S. Seiden",
	title = "Randomized algorithms for that ancient scheduling problem",
	booktitle = WADS97,
	year = 1997,
        pages = "210-223",
        publisher = "Springer",
        series = LNCS,
        volume = "1272"
	}

@techreport{Seiden97C,
	author = "Steve S. Seiden",
        title = "Randomized preemptive online interval scheduling",
        number = "Woe-08",
        institution = "TU-Graz",
        year = 1997,
        }

@techreport{Seiden97D,
	author = "Steve S. Seiden",
	title = "More multiprocessor scheduling with rejection",
        number = "Woe-16",
        institution = "TU-Graz",
        year = 1997,
        }

@article{Seiden99A,
	author = "Steve S. Seiden",
	title = "Unfair problems and randomized algorithms for metrical
			task systems",
	journal = InfComp,
	volume = "148",
	year = 1999,
	pages = "219-240"
	}

@article{Seiden99B,
        author = "Steve S. Seiden",
        title = "Randomized online scheduling with delivery times",
	journal = JOCO,
	volume = 3,
	year = 1999,
	pages = "399--416"
	}

@article{Seiden00,
	author = "Steve S. Seiden",
	title = "Randomized online multiprocessor scheduling",
	journal = "Algorithmica",
	volume = "28",
	year = 2000,
	pages = "173-216"
	}

@article{Seiden01,
        author = "Steve S. Seiden",
	title = "Preemptive multiprocessor scheduling with rejection",
	journal = TCS,
	volume = 262,
	year = 2001,
	pages = "437--458"
	}

@article{Seiden03,
	author = "Steve Seiden",
	title = "Barely random algorithms for multiprocessor scheduling",
   	journal = JOS,
	volume = 6,
	pages = "309-334",
	year = 2003
	}

@TechReport{SeSgWo98,
  author =       "Steve Seiden and Ji{\v{r}}{\'\i} Sgall
		 and Gerhard J. Woeginger",
  title =        "Semi-Online Scheduling with Decreasing Job Sizes",
  institution =  "Charles University, Prague",
  year =         1998,
  number =       "KAM-DIMATIA Series 98-410"
}

@article{SeSgWo00,
  author =       "Steve Seiden and Ji{\v{r}}{\'\i} Sgall
		 and Gerhard J. Woeginger",
  title =        "Semi-Online Scheduling with Decreasing Job Sizes",
   	journal = ORL,
	volume = 27,
	pages = "215-221",
	year = 2000
	}

@article{Sevcik94,
        author = "K. Sevcik",
        title = "Application scheduling and processor allocation in
	         multiprogrammed parallel processing systems",
        journal = "Performance Evaluation",
        year = 1994,
	volume = "19",
        pages = "107-140"
	}

@phdthesis{Sgall94A,
	author = "Ji{\v{r}}{\'\i} Sgall",
	title = "On-line scheduling on parallel machines",
	school = "Technical Report CMU-CS-94-144, Carnegie-Mellon
	          University, Pittsburgh, PA, U.S.A.",
	year = 1994,
	}

@inproceedings{Sgall94B,
	author = "Ji{\v{r}}{\'\i} Sgall",
	title = "On-line scheduling of parallel jobs",
	booktitle = MFCS94,
	year = 1994,
	pages = "159-176",
        publisher = "Springer",
        series = LNCS,
	volume = "841",
	}

@article{Sgall96,
	author = "Ji{\v{r}}{\'\i} Sgall",
	title = "Randomized on-line scheduling of parallel jobs",
         journal = JAlg,
	volume = "21",
	pages = "149-175",
	year = 1996
	}

@inproceedings{Sgall95B,
	author = "Ji{\v{r}}{\'\i} Sgall",
	title = "Randomized on-line scheduling of parallel jobs",
        booktitle = ISTCS95,
	organization = "IEEE",
        year = 1995,
        pages = "241-250"
	}

@article{Sgall97,
	author = "Ji{\v{r}}{\'\i} Sgall",
	title = "A lower bound for randomized on-line multiprocessor scheduling",
     	journal = IPL,
	volume = "63",
	pages = "51-55",
	year = 1997
	}

@incollection{Sgall98,
	author =       "Ji{\v{r}}{\'\i} Sgall",
	title =        "On-Line Scheduling",
	booktitle =     "Online Algorithms: {The} State of the Art",
	editor = "Amos Fiat and Gerhard J. Woeginger",
	publisher = "Springer",
	year = 1998,
	pages = "196-231"
	}

@inproceedings{ShTaWo02,
        author = "H. Shachnai and T. Tamir and G. J. Woeginger",
        title = "Minimizing Makespan and Preemption Costs on a System of
		Uniform Machines",
        booktitle = ESA02,
        publisher = "Springer",
        series = LNCS,
        volume = "2461",
        pages = "859-871",
        year = 2002
        }

@article{ShTaWo05,
        author = "H. Shachnai and T. Tamir and G. J. Woeginger",
        title = "Minimizing Makespan and Preemption Costs on a System of
		Uniform Machines",
     	journal = Algorithmica,
        volume = 42,
        year = 2005,
        pages = "309--334"
	}

@inproceedings{ShGoSR08,
  author    = {Bhavani Shankar and
               Prasant Gopal and
               Kannan Srinathan and
               C. Pandu Rangan},
  title     = {Unconditionally reliable message transmission in directed
               networks},
  booktitle = SODA08,
	organization = "ACM/SIAM",
  year      = {2008},
  pages     = {1048-1055}
}

@article{Shapir77,
        author = "S. D. Shapiro",
        title = "Performance of heuristic bin packing algorithms with
                 segments of random length",
        journal = InfCont,
        volume = "35",
        year = 1977,
        pages = "146-148"
        }

@article{SheTun72,
        author = "G. Shedler and C. Tung",
        title = "Locality in Page Reference Strings",
         journal = Sicomp,
        volume = "1",
        year = 1972,
        pages = "218-241"
        }

@inproceedings{SheNag89,
        author = "C. N. Shen and G. Nagy",
        title = "Autonomous navigation to provide long distance surface
		traverses for Mars rover sample return mission problems",
        booktitle = "Proc. IEEE Symp. on Intelligent Control",
        year = 1989,
        pages = "362-367"
        }

@article{Sherk95,
	author = "M. Sherk",
	title = "Self-adjusting k-ary search trees",
         journal = JAlg,
	volume = 19,
	pages = "25-44",
	year = 1995,
	}

@incollection{SheWei93,
	author = "E. Sheshinski and Y. Weiss",
	editor = "E. Sheshinski and Y. Weiss",
	title = "Optimum Pricing Policy under Stochastic Inflation",
	year = 1993,
	booktitle = "Optimal Pricing, Inflation and the Cost of
	Price Adjustment",
	publisher = "The MIT Press"
	}

@inproceedings{ShiLiu92,
        author = "W.-K. Shih and J. W. S. Liu",
        title = "On-line scheduling of imprecise computations to
		minimize error",
        booktitle = "Real-Time Systems Symp.",
        year = 1992,
        pages = "280-289"
	}

@article{Shilli92,
	author = "A. G. Shilling",
	title = "Market Timing: {B}etter than a Buy-and-Hold Strategy",
	year = 1992,
	journal = "Financial Analysts J.",
	pages = "46-50",
	}

@inproceedings{ShTaAa97,
        author = "David Shmoys and Eva Tardos and Karen Aardal",
        title = "Approximation Algorithms for facility location problems",
        booktitle = STOC97,
	organization = "ACM",
        year = 1997,
        pages = "265-274"
        }

@inproceedings{ShWeWi92,
	author = "David B. Shmoys and Joel Wein and David P. Williamson",
	title = "Scheduling Parallel Machines On-line",
	pages = "163-166",
	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{ShWeWi95,
	author = "David B. Shmoys and Joel Wein and D. P. Williamson",
	title = "Scheduling parallel machines on-line",
         journal = Sicomp,
	volume = "24",
	pages = "1313-1331",
	year = 1995
	}

@article{Shor86,
         author = "Peter W. Shor",
         title = "The average-case analysis of some online algorithms
                  for bin packing",
         journal = Combinatorica,
         volume = "6",
         year = 1986,
         pages = "179-200",
         }

@inproceedings{Shor91,
         author = "Peter W. Shor",
         title = "How to pack better than {B}est-{F}it: {T}ight bounds for
                  average-case on-line bin packing",
         booktitle = FOCS91,
	organization = "IEEE",
         year = 1991,
         pages = "752-759"
         }

@article{Shtark87,
	author = "J. Shtarkov",
	title = "Universal sequential coding of single measures",
	journal = "Problems of Information Transmission",
	pages = "175-185",
	year = 1987
	}

@article{Sikkel93,
        author = "K. Sikkel",
        title = "Parallel on-line parsing in constant time per word",
        journal = TCS,
        volume = "120",
        year = 1993,
        pages = "303-310"
	}

@InProceedings{Simons78,
	author = "B. Simons",
	title = "A Fast Algorithm for Single Processor Scheduling",
	booktitle = FOCS78,
	organization = "IEEE",
	pages = "246--252",
	year = 1978
}


@article{SipLin90,
        author = "H. J. Sips and Hai Xiang Lin",
        title = "A new model for on-line arithmetic with an application to
		the reciprocal calculation",
        journal = JpardisCom,
        volume = "8",
        year = 1990,
        pages = "218-230"
	}

@inproceedings{SiStPa03,
	author = "Ren{\'e} Sitters and Leen Stougie and Willem E. de
	Paepe",
	title = "A competitive algorithm for the general 2-server
	problem",
	booktitle = ICALP03,
	year = 2003,
        publisher = "Springer",
        series = LNCS,
        volume = "2719",
	pages = "624--636"
	}

@article{Sleato80,
         author = "Daniel D. K. D. B. Sleator",
         title = "A 2.5 times optimal algorithm for packing in two dimensions",
     	 journal = IPL,
         volume = "10",
         year = 1980,
         pages = "37-40",
         }

@article{SleTar85,
     	author = "Daniel Sleator and Robert E. Tarjan",
     	title = "Amortized efficiency of list update and paging rules",
	journal = CACM,
     	volume = "28",
     	year = 1985,
     	pages = "202-208"
      	}

@article{SleTar85A,
	author = "Daniel D. Sleator and Robert Endre Tarjan",
	title = "Self-adjusting Binary Search Trees",
   	journal = JACM,
	volume = 32,
	year = 1985,
	pages = "652-686"
	}

@inproceedings{SlTaTh86,
	author = "Daniel D. Sleator and Robert E. Tarjan
		and William P.Thurston",
	title = "Rotation distance, triangulations, and hyperbolic geometry",
	booktitle = STOC86,
	organization = "ACM",
	year = 1986,
	pages = "122-135"
	}

@inproceedings{Slusar89,
	author = "M. \'Slusarek",
	title = "A coloring algorithm for interval graphs",
	booktitle = MFCS89,
	year = 1989,
	pages = "471-480",
        publisher = "Springer",
        series = LNCS,
        volume = "379",
	}

@article{Slusar95,
        author = " M. \'Slusarek",
        title = "Optimal On-line Coloring of Circular Arc Graphs",
        journal = RAIROinf,
        volume = "29",
        year = 1995,
        pages = "423-429"
        }

@article{Smid95,
        author = "Michiel Smid",
        title = "Dynamic rectangular point location, with an application
		to the closest pair problem",
        journal = InfComp,
        volume = "116",
        year = 1995,
        pages = "1-9"
	}

@article{Smith81A,
        author = "A. J. Smith",
        title = "Analysis of long term file reference patterns for
		application to file migration algorithms",
        journal = IEEEsoft,
	volume = "SE-7",
        year = 1981,
        pages = "403-417",
        }

@article{Smith81B,
        author = "A. J. Smith",
        title = "Long term file migration: {D}evelopment and
		evaluation of algorithms",
        journal = CACM,
	volume = "24",
        year = 1981,
        pages = "521-532",
        }

@article{Smith82,
        author = "A. J. Smith",
        title = "Cache memories",
     	journal = ACMcomsur,
        volume = "14",
        year = 1982,
        pages = "6-27",
        }

@inproceedings{Smith85,
        author = "A. J. Smith",
        title = "Cache evaluation and the impact of workload choice",
        booktitle = "Proc. 12th International Symp. on Computer Architecture (ISCA)",
	organization = "IEEE",
        pages = "64-73",
        year = 1985
        }

@article{Smith86,
        author = "A. J. Smith",
        title = "Bibliography and Readings on {\sc CPU} Cache memories
                and related topics",
        journal = "Computer Architecture News",
        volume = "14",
        year = 1986,
        pages = "22-42"
        }

@book{Spirn77,
        author = "J. R. Spirn",
        title = "Program Behavior: {M}odels and Measurements",
        publisher = "Elsevier Computer Science Library",
	PLACE = "Elsevier, Amsterdam",
        year = 1977
        }

@inproceedings{SouSte04,
        author = "Alexander Souza and Angelika Steger",
        title = "The Expected Competitive Ratio for Weighted Completion Time Scheduling",
	pages =  "620-631",
        booktitle = STACS04,
        year = 2004,
        publisher = "Springer",
        series = LNCS,
	volume = "2996"
	}

@article{Steinb97,
	author = "A. Steinberg",
	title = "A strip-packing algorithm with absolute performance bound 2",
         journal = Sicomp,
	volume = "26",
	pages = "401-409",
	year = 1997
	}

@inbook{StoLuc89,
        author = "N. L. Stokey and R. E. Lucas, Jr.",
        title = "Recursive Methods in Economic Dynamics",
        year = 1989,
        pages = "389-413",
        publisher = "Harvard University Press",
        chapter = 13
        }

@article{StoVes02,
	author = "Leen Stougie and Arjen P. A. Vestjens",
	title = "Randomized on-line scheduling: {How} low can't you go?",
        journal = ORL,
	volume = 30,
	pages = "89-96",
	year = 2002
	}

@inproceedings{Streji97,
        author = "A. Strejilevich de Loma",
        title = "New Results on Fair Multi-threaded Paging",
        booktitle = "Proc. 1st Argentine Workshop on Theoretical Informatics",
        year = 1997,
        pages = "111-122"
        }

@inproceedings{Sundar89,
	author = "R. Sundar",
	title = "Twists, turns, cascades, deque conjecture, and scanning
		theorem",
	booktitle = FOCS89,
	organization = "IEEE",
	year = 1989,
	pages = "555-559"
	}

@techreport{Sundar89A,
	author = "R. Sundar",
	title = "Twists, turns, cascades, deque conjecture, and scanning theorem",
	INSTITUTION= "Courant Institute, New York University",
	year = 1989,
	NUMBER= "427",
	}

@inbook{Sumner81,
        author = "D. P. Sumner",
        title = "Subtrees of a graph and chromatic number",
	booktitle = "The Theory and Applications of Graphs",
        year = 1981,
        pages = "557-576",
        publisher = "John Wiley \& Sons"
        }

%TTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT%

@article{Takaok86,
        author = "T. Takaoka",
        title = "An on-line pattern matching algorithm",
     	journal = IPL,
        volume = "22",
        year = 1986,
        pages = "329-330"
	}

@article{TanCao06,
	author = "Z. Y. Tan and S. J. Cao",
	title = "Semi-online Machine Covering on Two Uniform Machines with Known Total Size",
	journal = Computing,
	volume = 78,
	year = 2006,
	pages = "369-378",
	}

@article {TanHe01,
	author = "Zhiyi Tan and Yong He",
	title = "Semi-on-line scheduling with ordinal data on two uniform machines",
	journal = ORL,
	volume = 28,
	year = 2001,
	pages = "221-231",
	}

@article {TanHe02,
	author = "Zhiyi Tan and Yong He",
  title = "Semi-on-line problems on two identical machines with combined partial information",
  journal = ORL,
  volume = "30",
  year = "2002",
  pages = "408-414"
}

@inproceedings{TanHe05,
  author    = {Zhiyi Tan and Yong He},
  title     = {Semi-online Problems on Identical Machines with Inexact
               Partial Information},
  booktitle = COCOON05,
        publisher = "Springer",
        series = LNCS,
        volume = "3595",
  year      = 2005,
  pages     = {297-307}
}

@article{TanHe07,
	author = "Zhiyi Tan and Yong He",
	title = "Semi-online scheduling problems on two identical machines with inexact partial information",
	journal = TCS,
	volume = 377,
	year = 2007,
	pages = "110-125",
	}

@book{Tarjan83,
     	author = "Robert E. Tarjan",
     	title = "Data Structures and Network Algorithms",
     	publisher = "SIAM, Philadelphia",
     	year = 1983
     	}

@article{Tarjan85A,
    	author = "Robert E. Tarjan",
    	title = "Amortized computational complexity",
        journal = Sialgdis,
    	volume = "6",
    	pages = "306-318",
    	year = 1985
    	}

@article{Tarjan85B,
	author = "Robert E. Tarjan",
	title = "Sequential access in splay trees takes linear time",
        journal = Combinatorica,
	volume = 5,
	year = 1985,
	pages = "367-378"
	}

@article{Teia93,
     	author = "Boris Teia",
     	title = "A lower bound for randomized list update algorithms",
     	journal = IPL,
     	volume = "47",
     	pages = "5-9",
     	year = 1993
     	}

@article{Tenenb78,
    	author = "A. Tenenbaum",
    	title = "Simulations of dynamic sequential search algorithms",
    	journal = CACM,
    	volume = "21",
    	pages = "790-79",
    	year = 1978
    	}

@article{TenNem82,
    	author = "A. M. Tenenbaum and R. M. Nemes",
    	title = "Two spectra of self-organizing sequential search",
         journal = Sicomp,
    	volume = "11",
    	pages = "557-566",
    	year = 1982
    	}

@inproceedings{Tetali94,
        author = "P. Tetali",
        title = "Design of on-line algorithms using hitting times",
        booktitle = SODA94,
	organization = "ACM/SIAM",
        year = 1994,
        pages = "402-410"
        }

@article{Tichy03,
        author = "Tom{\'a}{\v{s}} Tich{\'y}",
        title = "Randomized on-line scheduling on 3 processors",
        journal = ORL,
        year = 2004,
	volume = 32,
	pages = "152-158"
	}

@inproceedings{Torng95,
        author = "Eric Torng",
        title = "A unified analysis of paging and caching",
        booktitle = FOCS95,
	organization = "IEEE",
        year = 1995,
        pages = "194-203"
	}

@article{TsaTan93,
        author = "Ying Teh Tsai and Chuan Yi Tang",
        title = "The competitiveness of randomized algorithms for on-line
		Steiner tree and on-line spanning tree problems",
     	journal = IPL,
        volume = "48",
        year = 1993,
        pages = "177-182"
	}

@article{TsTaCh94,
        author = "Y. Tsai and C. Tang and Y. Chen",
        title = "Average Performance of a Greedy Algorithm for the
                On-line Minimum Matching Problem on Euclidean Space",
     	journal = IPL,
        volume = "51",
        year = 1994,
        pages = "275-282",
        }

@article{Turan84,
        author = "G. Turan",
        title = "On the greedy algorithm for an edge partitioning problem",
        journal = CollBolyai,
        volume = "44",
        year = 1984,
        pages = "405-423",
        }

@inproceedings{TLWFTG94,
        author = "J. Turek and W. Ludwig and J. L. Wolf and L. Fleischer and
	          P. Tiwari and J. Glaskow and U.Schwiegelshohn and P. S. Yu",
        title = "Scheduling parallelizable tasks to minimize average response
	         time",
        booktitle = SPAA94,
	organization = "ACM",
        pages = "200-209",
	year = 1994
	}

@article{Turner89,
	author = "J. S. Turner",
	title = "Approximation algorithms for the shortest common
		superstring problem",
        journal = InfComp,
	volume = 83,
	pages = "1-20",
	year = 1989,
	}

%UUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU%

@article{Ukkone95,
        author = "E. Ukkonen",
        title = "On-line construction of suffix trees",
     	journal = Algorithmica,
        volume = "14",
        year = 1995,
        pages = "249-260"
	}

%VVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVV%

@article{Valian84,
	author = "L. G. Valiant",
	title = "A Theory of the Learnable",
	journal = CACM,
	year = 1984,
	volume = 27,
	pages = "1134-1142",
	}


@book{Vazira01,
	author = "Vijay V. Vazirani",
	title = "Approximation algorithms",
	publisher = "Springer",
	year = 2001,
}

@article{Venkat93,
        author = "S. S. Venkatesh",
        title = "Directed drift: {A} new linear threshold algorithm for
		learning binary weights online",
        journal = JCSS,
        volume = "46",
        year = 1993,
        pages = "198-217"
	}

@techreport{Vestje94,
	author = "Arjen P. A. Vestjens",
        title = "Scheduling uniform machines on-line requires
		nondecreasing speed ratios",
	number = "Memorandum COSOR 94-35",
	institution = "Eindhoven University of Technology",
        year = 1994,
	}

@article{Vestje98,
	author = "Arjen P. A. Vestjens",
        title = "Scheduling uniform machines on-line requires
		nondecreasing speed ratios",
	journal = MathProg,
	volume = "82",
	pages = "225-234",
	year = 1998
	}

@phdthesis{Vestje97,
	author = "Arjen P. A. Vestjens",
        title = "On-line Machine Scheduling",
	school = "Eindhoven University of Technology, The Netherlands",
	year = 1997
	}

@inproceedings{Vishwa90,
        author = "Sundar Vishwanathan",
        title = "Randomized on-line graph coloring",
        booktitle = FOCS90,
	organization = "IEEE",
        year = 1990,
        pages = "121-130"
        }

@article{Vishwa92,
	author = "Sundar Vishwanathan",
	title = "Randomized on-line graph coloring",
         journal = JAlg,
	year = 1992,
	volume = "13",
	pages = "657-669"
	}

@techreport{Vitter86,
    	author = "Jeffrey S. Vitter",
    	title = "Two papers on dynamic Huffman codes",
    	number = "CS-85-13",
    	institution = "Brown University Computer Science, Providence. R.I.",
    	year = 1986
    	}

@article{Vliet92,
        author = "Andre van Vliet",
        title = "An improved lower bound for online bin packing algorithms",
     	journal = IPL,
        volume = "43",
        year = 1992,
        pages = "277-284",
	}

@phdthesis{Vliet95,
        author = "Andre van Vliet",
        title = "Lower and upper bounds for online bin packing and
                 scheduling heuristics",
        school = "Erasmus University, Rotterdam, The Netherlands",
        year = 1995,
        }

@article{Vliet96,
         author = "Andre Van Vliet",
         title = "On the asymptotic worst case behaviour of harmonic fit",
         journal = JAlg,
         volume = "20",
         year = 1996,
         pages = "113-136",
         }

@book{VonMor44,
        author = "John {von Neumann} and Oskar Morgenstern",
        year = 1944,
        title = "Theory of games and economic behavior",
        publisher = "Princeton University Press",
        edition = "1st"
	}

@inproceedings{Vovk90,
	author = "V. Vovk",
	title = "Aggregating strategies",
	booktitle = COLT90,
	publisher = "Morgan Kaufmann",
	year = 1990,
	pages = "371-383"
	}

@inproceedings{Vovk95,
	author = "V. G. Vovk",
	title = "A game of prediction with expert advice",
	booktitle = COLT95,
	organization = "ACM",
	year = 1995,
	pages = "51-60",
	}

%WWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWW%

@article{WanChe92,
	author = "Q. Wang and K. H. Cheng",
        title = "A heuristic of scheduling parallel tasks and its analysis",
         journal = Sicomp,
	volume = "21",
        pages = "281-294",
        year = 1992
	}

@Article{WenDu98,
  author =       "Jianjun Wen and Donglei Du",
  title =        "Preemptive On-Line Scheduling for Two Uniform Processors",
  journal =      ORL,
  year =         1998,
  volume =       23,
  pages =        "113--116"
}

@inproceedings{Westbr92,
        author = "Jeffery Westbrook",
        title = "Randomized algorithms for multiprocessor page migration",
        pages = "135-150",
	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{Westbr94,
        author = "Jeffery Westbrook",
        title = "Randomized algorithms for multiprocessor page migration",
         journal = Sicomp,
        volume = "23",
        year = 1994,
        pages = "951-965"
	}

@inproceedings{Westbr95,
	author = "Jeffery Westbrook",
	title = "Load balancing for response time",
	booktitle = ESA95,
	year = 1995,
	pages = "355-368",
        publisher = "Springer",
        series= LNCS,
        volume = "979",
	}

@article{WesTar92,
        author = "Jeffery Westbrook and Robert E. Tarjan",
        title = "Maintaining bridge-connected and biconnected components
		on-line",
	journal = Algorithmica,
        volume = "7",
        year = 1992,
        pages = "433-464"
	}

@inproceedings{WesYan93,
	author = "Jeffery Westbrook and Dicky C. K. Yan",
	title = "Lazy and Greedy: {O}n-Line Algorithms for Steiner Problems",
	booktitle = WADS93,
	year = 1993,
        publisher = "Springer",
        series = LNCS,
	volume = "709"
	}

@inproceedings{WesYan93A,
        author = "Jeffery Westbrook and Dicky C. K. Yan",
        title = "Greedy algorithms for the on-line Steiner tree and
		generalized Steiner problems",
        booktitle = WADS93,
        year = 1993,
        pages = "621-633",
        publisher = "Springer",
        series = LNCS,
	volume = "709"
	}

@article{WesYan95,
        author = "Jeffery Westbrook and Dicky Yan",
        title = "Linear Bounds for On-line Steiner Problems",
     	journal = IPL,
        volume = "55",
        year = 1995,
        pages = "59-63",
        }

@inproceedings{Wilber86,
	author = "Robert Wilber",
	title = "Lower bounds for accessing binary search trees with
		rotations",
	booktitle = FOCS86,
	organization = "IEEE",
	year = 1986,
	pages = "61-69"
	}

@article{Wilber76,
	author = "Robert Wilber",
	title = "Lower bounds for accessing binary search trees with
		rotations",
        journal = Sicomp,
	volume = 18,
	year = 1989,
	pages = "56-67",
	}

@inproceedings{Wilfon97,
        author = "Gordon Wilfong",
        title = "On-line algorithms for compressing planar curves",
        booktitle = SODA97,
	organization = "ACM/SIAM",
        year =  1997,
        pages = "158-165"
        }

@article{Witsen76,
        author = "H. S. Witsenhausen",
        title = "On {W}oodall's interval problem",
        journal = JCTA,
        volume = "21",
        year = 1976,
        pages = "222-229",
        }

@unpublished{WitBel,
        author = "I. H. Witten and T. Bell",
        title = "The {Calgary/Canterbury} text compression corpus",
        note = "Anonymous ftp from ftp.cpsc.ucalgary.ca
              /pub/text.compression/corpus/text.compression.corpus.tar.Z."
        }

@article{Woegin93,
        author = "Gerhard J. Woeginger",
        title = "Improved space for bounded-space online bin packing",
        journal = Sidma,
        volume = "6",
        year = 1993,
        pages = "575-581",
        }

@article{Woegin94,
        author = "Gerhard J. Woeginger",
        title = "On-line Scheduling of Jobs with fixed Start and End Times",
        journal = TCS,
        volume = "130",
        year = 1994,
        pages = "5-16",
        }

@Article{Woegin00,
  author = 	 "Gerhard J. Woeginger",
  title = 	 "A Comment on Scheduling on Uniform Machines under
		  Chain-Type Precedence Constraints",
  journal = 	 ORL,
  year = 	 2000,
  volume =       26,
  pages = 	 "107--109"
}

@techreport{Wolfso90,
        author = "O. Wolfson",
        title = "A distributed algorithm for adaptive replication data",
        number = "CUCS-057-90",
        institution = "Department of Computer Science, Columbia University",
        year = 1990
        }

@article{Woodal74,
        author = "D. R. Woodall",
        title = "The bay restaurant - a linear storage problem",
        journal = AMM,
        volume = "81",
        year = 1974,
        pages = "240-246",
        }

@inproceedings{Woodal74A,
        author = "D. R. Woodall",
        title = "Problem no. 4, combinatorics",
        booktitle = "Proc. British Combinatorial Conference",
        year = 1973,
        pages = "",
        publisher = "Cambridge University Press"
        }

%XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX%

@article{Xu92,
        author = "J. Xu",
        title = "Online multiversion database concurrency control",
        journal = ActInf,
        volume = "29",
        year = 1992,
        pages = "121-160"
	}

%YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY%

@article{Yamani95,
        author = "K. Yamanishi",
        title = "A loss bound model for on-line stochastic prediction
		algorithms",
        journal = InfComp,
        volume = "119",
        year = 1995,
        pages = "39-54"
	}

@article{Yao80A,
        author = "A. C. C. Yao",
        title = "New algorithms for bin packing",
	journal = JACM,
        volume = "27",
        year = 1980,
        pages = "207-227",
        }

@inproceedings{Yao77,
        author = "A. C. C. Yao",
        title = "Probabilistic computations: {Towards} a unified
		measure of complexity",
        booktitle = FOCS77,
	organization = "IEEE",
        year = 1977,
	pages = "222-227"
	}

@inproceedings{YaDeSh95,
	author = "F. Yao and A. Demers and S. Shenker",
	title = "A scheduling model for reduced {CPU} Energy",
	year = 1995,
	pages = "374-384",
	booktitle = FOCS95,
	organization = "IEEE"
 	}

@inproceedings{YeBoro07,
  author    = {Yuli Ye and Allan Borodin},
  title     = {Priority Algorithms for the Subset-Sum Problem},
  booktitle = COCOON07,
  publisher = "Springer",
  series = LNCS,
  volume = "4598",
  year      = {2007},
  pages     = {504--514},
}

@article{YeZhan07,
         author = "Deshi Ye and Guochuan Zhang",
         title = "Maximizing the throughput of parallel jobs on hypercubes",
         journal = IPL,
         year = 2007,
         volume = "102",
         pages = "259-263"
         }

@inproceedings{YooYou95,
        author = "Seong-Moo Yoo and Hee Yong Youn",
        title = "An on-line scheduling and allocation scheme for real-time
		tasks in 2D meshes",
        booktitle = "Proc. 7th Symp. on Parallel and Distributed Processing",
        year = 1995,
        pages = "630-637"
	}

@inproceedings{Young91A,
        author = "Neal E. Young",
        title = "On-line caching as cache size varies",
        booktitle = SODA91,
	organization = "ACM/SIAM",
        pages = "241-250",
        year = 1991,
        }

@PhDThesis{Young91B,
         author = "Neal Young",
         title = "Competitive paging and dual-guided on-line weighted
			caching and matching algorithms",
         school = "Department of Computer Science, Princeton University",
         year = 1991,
         }

@techreport{Young91C,
	author = "Neal E.  Young",
	title = "Dual-guided on-line weighted caching and
                 matching algorithms",
	number = "Tech. Report CS-TR-348-91",
	institution = "Comp. Sci. Dept., Princeton University",
	year = 1991,
	}

@article{Young94,
	author = "Neal E. Young",
	title = "The k-server dual and loose competitiveness for paging",
	journal = Algorithmica,
	year = 1994,
        volume = "11",
        pages = "525-541",
note = "Preliminary version appeared in SODA'91 titled ``On-Line Caching as Cache Size Varies''"
	}

@inproceedings{Young98,
        author = "Neal E. Young",
        title = "On-Line File Caching",
        booktitle = SODA98,
	organization = "ACM/SIAM",
        year = 1998,
        pages = "82-86"
        }

@inproceedings{Young98A,
	author = "Neal E. Young",
	title = "Bounding the Diffuse Adversary",
	booktitle = SODA98,
	organization = "ACM/SIAM",
	year = 1998,
	pages = "420-425"
	}

@article{Young00,
	author = "Neal E. Young",
	title = "On-line paging against adversarially biased random inputs",
	journal = JAlg,
	volume = 37,
	year = 2000,
	pages = "218--235",
note = {Preliminary version in SODA'98 titled ``Bounding the Diffuse Adversary''},
	}

@article{Young02,
        author = "Neal E. Young",
        title = "On-Line File Caching",
        journal = "Algorithmica",
        volume = "33",
        year = "2002",
        pages = "371--383"
        }

@article{YubMiy80,
	author = "T. Yuba and M. Miyakawa",
	title = "Performance studies of optimum sequence trees and
		self-organizing sequence trees",
	journal = "Transactions of the Institute of Electronics and
		Communication Engineers of Japan",
	volume = "E63",
	year = 1980,
	pages = "629-630",
	}

%ZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ%

@article{Zajice08,
  author =	 "Ond\v{r}ej Zaj\'{\i}\v{c}ek",
  title = 	 "A Note on Scheduling Parallel Unit Jobs on Hypercubes",
  institution =  "Charles University, Prague",
  journal = IntFoun,
  volume = 20,
  pages = "341--349",
  year =	 2009,
}

@inproceedings{ZarCha07,
  author    = {Hamid Zarrabi-Zadeh and Timothy M. Chan},
  title     = {An Improved Algorithm for Online Unit Clustering},
  booktitle = COCOON07,
  publisher = "Springer",
  series = LNCS,
  volume = "4598",
  year      = {2007},
  pages     = {383--393},
}

@techreport{Zhang94,
        author = "G. Zhang",
        title = "A tight worst-case performance bound for {AFB}-k",
        number = "015",
        institution = "Institute of Applied Mathematics,
           Academia Sinica, Beijing, China",
        year = 1994
        }

@article{Zhang96,
        author = "G. Zhang",
        title = "Worst-case analysis of the {FFH} algorithm for online
                 variable-sized bin packing",
        journal = Computing,
        volume = "56",
        year = 1996,
        pages = "165-172",
        }

@article{ZhanYe99,
         author = "Guochuan Zhang and Deshi Ye",
         title = "A note on on-line scheduling with partial information",
         journal = "Computers \& Mathematics with Applications",
         year = 1999,
         volume = "44",
         pages = "539-543"
         }

@inproceedings{Zinkev03,
	author = "M. Zinkevich",
	title = "Online convex programming and generalized
                        infinitesimal gradient ascent",
	booktitle = "Proc. 12th Int. Conference on
                        Machine Learning",
	year = "2003",
	pages = "928--936"
	}


