Author of the publication

Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms.

, and . ICALP (1), volume 7965 of Lecture Notes in Computer Science, page 757-768. Springer, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Engineering Efficient Paging Algorithms., , , and . ACM Journal of Experimental Algorithmics, (2014)Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms., and . ICALP (1), volume 7965 of Lecture Notes in Computer Science, page 757-768. Springer, (2013)OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm., , and . Theory Comput. Syst., 56 (1): 22-40 (2015)OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm., , and . WAOA, volume 7164 of Lecture Notes in Computer Science, page 164-175. Springer, (2011)Outperforming LRU via competitive analysis on parametrized inputs for paging., and . SODA, page 1669-1680. SIAM, (2012)The optimal structure of algorithms for α-paging., , , and . Inf. Process. Lett., 115 (12): 932-938 (2015)Engineering Efficient Paging Algorithms., , , and . SEA, volume 7276 of Lecture Notes in Computer Science, page 320-331. Springer, (2012)Analyzing Flickr groups., and . CIVR, page 417-426. ACM, (2008)Flickr hypergroups., , , , and . ACM Multimedia, page 813-816. ACM, (2009)Modeling and Understanding Communities in Online Social Media using Probabilistic Methods.. EPFL, Switzerland, (2011)