% 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{CongNum = {Congr. Numer.} } @STRING{DisComGeo = {Discrete Comput. Geom.} } @STRING{DAM = {Discrete Appl. Math.} } @STRING{DM = {Discrete Math.} } @STRING{Doklady = {Soviet Mathematics Doklady} } @STRING{EJOR = {European J. Oper. Res.} } @STRING{IBMres = {IBM J. Res. Dev.} } @STRING{IBMsys = {IBM Syst. J.} } @STRING{IEEEauto = {IEEE Trans. Automat. Control} } @STRING{IEEEcomm = {IEEE Trans. Commun.} } @STRING{IEEEcomp = {IEEE Trans. Comput.} } @STRING{IEEEinfo = {IEEE Trans. Inf. Theory} } @STRING{IEEEknow = {IEEE Trans. Knowl. Data Eng.} } @STRING{IEEEsoft = {IEEE Trans. Softw. Eng.} } @STRING{InfComp = {Inform. and Comput.} } @STRING{InfCont = {Inform. and Control} } @STRING{INFORMS = {INFORMS J. Comput.} } @STRING{IntComGeo = {Int. J. of Comput. Geom. Appl.} } @STRING{IntFoun = {Int. J. on Found. Comput. Sci.} } @STRING{IPL = {Inform. Process. Lett.} } @STRING{JACM = {J. ACM} } @STRING{JAlg = {J. Algorithms} } @STRING{JAppProb = {J. Appl. Probab.} } @STRING{JCSS = {J. Comput. Systems Sci.} } @STRING{JCT = {J. Combin. Theory} } @STRING{JCTA = {J. Combin. Theory Ser. A} } @STRING{JCTB = {J. Combin. Theory Ser. B} } @STRING{JDA = {J. Discrete Algorithms} } @STRING{JInfOptSci = {J. Information and Optimization Sciences} } @STRING{JOCO = {J. Comb. Optim.} } @STRING{JoGraTh = {J. Graph Theory} } @STRING{JOS = {J. Sched.} } @STRING{JpardisCom = {J. Parallel Distrib. Comput.} } @STRING{JSL = {J. of Symbolic Logic} } @STRING{MathFinance = {Math. Finance} } @STRING{MathProg = {Math. Program.} } @STRING{MgtSci = {Manage. Sci.} } @STRING{ML = {Mach. Learn.} } @STRING{MOR = {Math. Oper. Res.} } @STRING{MST = {Math. Syst. Theory} } @STRING{Naval = {Naval Res. Logist.} } @STRING{OpRes = {Oper. Res.} } @STRING{ORL = {Oper. Res. Lett.} } @STRING{ORSAJComp = {ORSA J. Comput.} } @STRING{PacifJ = {Pacific J. Math.} } @STRING{PEngInf = {Probab Engrg. Inform. Sci.} } @STRING{PLond = {Proc. London Math. Soc.} }, @STRING{PAMS = {Proc. AMS} }, @STRING{PrCoSoft = {Program. Comput. Software} } @STRING{RAIROinf = {RAIRO Inform. Theor. Appl.} } @STRING{RAIROopr = {RAIRO Oper. Res.} } @STRING{RealTime = {Real Time Syst.} } @STRING{SiamRev = {SIAM Rev.} } @STRING{Sialgdis = {SIAM J. on Algebraic and Discrete Methods} } @STRING{Siappmat = {SIAM J. Appl. Math.} } @STRING{Sicomp = {SIAM J. Comput.} } @STRING{Sidma = {SIAM J. Discrete Math.} } @STRING{Sicontropt = {SIAM J. Control Optim.} } @STRING{Siopt = {SIAM J. Optim.} } @STRING{Sigactnews = {SIGACT News} } @STRING{SoftwarePE = {Softw. Pract. Exper.} } @STRING{TAMS = {Trans. AMS} }, @STRING{TOCS = {Theory Comput. Syst.} } @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{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{AweSin97, AUTHOR = "Baruch Awerbuch and Tripurari Singh", TITLE = "Online Algorithms for Selective Multicast and Maximal Dense Trees", BOOKTITLE = STOC97, ORGANIZATION = "ACM", YEAR = 1997, PAGES = "354-362", } @inproceedings{AwAzLR99, AUTHOR = "Baruch Awerbuch and Yossi Azar and Stefano Leonardi and Oded Regev", TITLE = "Minimizing the flow time without migration", BOOKTITLE = STOC99, ORGANIZATION = "ACM", YEAR = 1999, PAGES = "198-205", } @article{AwAzLR01, AUTHOR = "Baruch Awerbuch and Yossi Azar and Stefano Leonardi and Oded Regev", TITLE = "Minimizing the flow time without migration", JOURNAL = Sicomp, YEAR = 2001, VOLUME = 31, PAGES = "1370-1382", } @inproceedings{AwHaKL05, author = {Baruch Awerbuch and Mohammad Taghi Hajiaghayi and Robert D. Kleinberg and Tom Leighton}, title = {Online client-server load balancing without global information}, booktitle = SODA05, ORGANIZATION = "ACM/SIAM", year = 2005, pages = {197--206}, } @inproceedings{AwAzEp05, author = {Baruch Awerbuch and Yossi Azar and Amir Epstein}, title = {The price of routing unsplittable flow}, booktitle = STOC05, ORGANIZATION = "ACM", year = 2005, pages = {57--66}, } @inproceedings{ABFFLR96, AUTHOR = "Yossi Azar and Yair Bartal and Esteban Feuerstein and Amos Fiat and Stefano Leonardi and Adi Ros{\'e}n", TITLE = "On Capital Investment", BOOKTITLE = ICALP96, YEAR = 1996, PUBLISHER = "Springer", SERIES = LNCS, VOLUME = "1099", PAGES = "429-441" } @inproceedings{AzBrKa92, AUTHOR = "Yossi Azar and Andrei Broder and Anna Karlin", TITLE = "On-line load balancing", BOOKTITLE = FOCS92, ORGANIZATION = "IEEE", YEAR = 1992, PAGES = "218-225", } @article{AzBrKa94, AUTHOR = "Yossi Azar and Andrei Z. Broder and Anna R. Karlin", TITLE = "On-line load balancing", JOURNAL = tcs, VOLUME = "130", YEAR = 1994, PAGES = "73-84" } @inproceedings{AzBrMa93, AUTHOR = "Yossi Azar and Andrei Broder and Mark Manasse", TITLE = "On-line choice of on-line algorithms", BOOKTITLE = SODA93, ORGANIZATION = "ACM/SIAM", YEAR = 1993, PAGES = "432-440", } @inproceedings{AzaEps96, AUTHOR = "Yossi Azar and Leah Epstein", TITLE = "On two dimensional packing", BOOKTITLE = SWAT96, YEAR = 1996, PUBLISHER = "Springer", SERIES = LNCS, VOLUME = "1097", } @inproceedings{AzaEps97, AUTHOR = "Yossi Azar and Leah Epstein", TITLE = "On-line load balancing of temporary tasks on identical machines", BOOKTITLE = ISTCS97, ORGANIZATION = "IEEE", PAGES = "119-125", YEAR = 1997 } @article{AzaEps02, AUTHOR = "Yossi Azar and Leah Epstein", TITLE = "On-line scheduling with precedence constraints", JOURNAL = DAM, VOLUME = 119, YEAR = 2002, PAGES = "169-180" } @inproceedings{AzKPPW93, AUTHOR = "Yossi Azar and Bala Kalyanasundaram and Serge Plotkin and Kirk Pruhs and Orli Waarts", TITLE = "Online Load Balancing of Temporary Tasks", BOOKTITLE = WADS93, YEAR = 1993, PAGES = "119-130", PUBLISHER = "Springer", SERIES = LNCS, VOLUME = "709" } @inproceedings{AzNaRo92, AUTHOR = "Yossi Azar and Joseph Naor and Raphael Rom", TITLE = "The competitiveness of on-line assignments", BOOKTITLE = SODA92, ORGANIZATION = "ACM/SIAM", YEAR = 1992, PAGES = "203-210", } @article{AzNaRo95, AUTHOR = "Yossi Azar and Joseph Naor and Raphael Rom", TITLE = "The competitiveness of on-line assignments", JOURNAL = Jalg, YEAR = 1995, PAGES = "221-237", VOLUME= "18", } @incollection{Azar98, AUTHOR = "Y. Azar", TITLE = "On-Line Load Balancing", BOOKTITLE = "Online Algorithms: {The} State of the Art", EDITOR = "Amos Fiat and Gergard J. Woeginger", PUBLISHER = "Springer", YEAR = 1998, PAGES = "178-195" } @inproceedings{AzaLit04, AUTHOR = "Yossi Azar and Arik Litichevskey", TITLE = "Maximizing Throughput in Multi-queue Switches", PAGES = "53-64", BOOKTITLE = ESA04, YEAR = 2004, PUBLISHER = "Springer", SERIES = LNCS, VOLUME = 3221 } @article{AzaReg01, AUTHOR = "Yossi Azar and Oded Regev", TITLE = "On-line Bin Stretching", JOURNAL = TCS, VOLUME = 268, YEAR = 2001, PAGES = "17-41" } @inproceedings{AzaRic03, AUTHOR = {Y. Azar and Y. Richter}, TITLE = {Management of Multi-Queue Switches in {QoS} Networks}, BOOKTITLE = STOC03, ORGANIZATION = "ACM", YEAR = 2003, PAGES = {82--89} } @inproceedings{AzaRic04A, AUTHOR = {Y. Azar and Y. Richter}, TITLE = {The zero-one principle for switching networks}, BOOKTITLE = STOC04, ORGANIZATION = "ACM", YEAR = 2004, PAGES = {64--71} } @inproceedings{AzaRic04B, AUTHOR = "Yossi Azar and Yossi Richter", TITLE = "An Improved Algorithm for {CIOQ} Switches", PAGES = "65-76", BOOKTITLE = ESA04, YEAR = 2004, PUBLISHER = "Springer", SERIES = LNCS, VOLUME = 3221 } @inproceedings{AzaZac05, author = {Yossi Azar and Rafi Zachut}, title = {Packet Routing and Information Gathering in Lines, Rings and Trees.}, booktitle = ESA05, PUBLISHER = "Springer", SERIES = LNCS, VOLUME = "3669", year = 2005, pages = {484--495}, } %BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB% @inproceedings{BacElY97, AUTHOR = "Ran Bachrach and Ran El-Yaniv", TITLE = "Online List Accessing Algorithms and Their Applications: {Recent} Empirical Evidence", BOOKTITLE = SODA97, ORGANIZATION = "ACM/SIAM", YEAR = 1997, PAGES = "53-62" } @inproceedings{BaCuRa88, AUTHOR = "Ricardo A. Baeza-Yates and Joseph C. Culberson and Gregory J. E. Rawlins", TITLE = "Searching with uncertainty", BOOKTITLE = SWAT88, YEAR = 1988, PAGES = "176-189", PUBLISHER = "Springer", SERIES = LNCS, VOLUME = "318" } @article{BaCuRa93, AUTHOR = "Ricardo Baeza-Yates and Joseph Culberson and Gregory Rawlins", TITLE = "Searching in the plane", JOURNAL = InfComp, VOLUME = "106", YEAR = 1993, PAGES = "234-252", } @inproceedings{BaeSch94, AUTHOR = "Ricardo Baeza-Yates and Rene Schott", TITLE = "Parallel Searching in the Plane", BOOKTITLE = "Proc. 9th Conference on Shape Recognition and Artificial Intelligence, Paris", YEAR = 1994, PAGES = "557-566", } @article{BaeSch95, AUTHOR = "Ricardo Baeza-Yates and Rene Schott", TITLE = "Parallel searching in the plane", JOURNAL = CompGeo, VOLUME = "5", YEAR = 1995, PAGES = "143-154" } @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 } \@article{GolKer03, AUTHOR = "Michael H. Goldwasser and Boris Kerbikov", TITLE = "Admission Control with Immediate Notification", JOURNAL = JOS, VOLUME = 6, PAGES = "269-285", 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 = CongNum, 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" } @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" } \inproceedings{PhStWe95, AUTHOR = "Cynthia Philips and Cliff Stein and Joel Wein", TITLE = "Scheduling Jobs that Arrive Over Time", BOOKTITLE = WADS95, PAGES = "86-97", YEAR = 1995, PUBLISHER = "Springer", SERIES = LNCS, VOLUME= "955" } @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" }