Competitive analysis (online algorithm): Difference between revisions

Content deleted Content added
No edit summary
m Citations: [Pu177]Misc citation tidying. You can use this bot yourself! Report bugs here.
Line 22:
*{{citation|contribution=Competitive analysis of distributed algorithms|first=James|last=Aspnes|year=1998|doi=10.1007/BFb0029567|title=Online Algorithms: The State of the Art|series=Lecture Notes in Computer Science|volume=1442|pages=118–146|editor1-first=A.|editor1-last=Fiat|editor1-link=Amos Fiat|editor2-first=G. J.|editor2-last=Woeginger}}.
*{{citation|last1=Borodin|first1=A.|author1-link=Allan Borodin|last2=El-Yaniv|first2=R.|year=1998|title=Online Computation and Competitive Analysis|publisher=Cambridge University Press|isbn=0-521-56392-5}}.
*{{citation|last1=Awerbuch|first1=B.|last2=Kutten|first2=S.|Last3last3=Peleg|First3first3=d.|year=1992|contribution=Competitive Distributed Job Scheduling|title=ACM STOC, Victoria, BC, Canada|DUPLICATE DATA: year=1992}}.
 
[[Category:Analysis of algorithms]]