| Online Computation with Untrusted Advice S Angelopoulos, C Dürr, S Jin, S Kamali, M Renault Proceedings of the 11th Annual Conference on Innovations in Theoretical …, 2019 | 96 | 2019 |
| On the separation and equivalence of paging strategies S Angelopoulos, R Dorrigiv, A López-Ortiz Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007 | 76 | 2007 |
| List update with locality of reference S Angelopoulos, R Dorrigiv, A López-Ortiz Latin American Symposium on Theoretical Informatics, 399-410, 2008 | 36* | 2008 |
| Online bin packing with predictions S Angelopoulos, S Kamali, K Shadkami Journal of Artificial Intelligence Research 78, 1111-1141, 2023 | 33 | 2023 |
| Online search with a hint S Angelopoulos Information and Computation 295, 105091, 2023 | 31 | 2023 |
| The expanding search ratio of a graph S Angelopoulos, C Dürr, T Lidbetter Discrete Applied Mathematics 260, 51-65, 2019 | 30 | 2019 |
| Tight bounds for quasirandom rumor spreading S Angelopoulos, B Doerr, A Huber, K Panagiotou the electronic journal of combinatorics 16 (1), R102, 2009 | 28 | 2009 |
| The power of priority algorithms for facility location and set cover S Angelopoulos, A Borodin Algorithmica 40 (4), 271-291, 2004 | 28 | 2004 |
| Contract scheduling with predictions S Angelopoulos, S Kamali Journal of Artificial Intelligence Research 77, 395-426, 2023 | 26 | 2023 |
| Infinite linear programming and online searching with turn cost S Angelopoulos, D Arsénio, C Dürr Theoretical Computer Science 670, 11-22, 2017 | 25 | 2017 |
| Paging and list update under bijective analysis S Angelopoulos, P Schweitzer Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete …, 2009 | 25 | 2009 |
| On the power of priority algorithms for facility location and set cover S Angelopoulos, A Borodin International Workshop on Approximation Algorithms for Combinatorial …, 2002 | 24 | 2002 |
| Further connections between contract-scheduling and ray-searching problems S Angelopoulos arXiv preprint arXiv:1504.07168, 2015 | 22 | 2015 |
| Online bin packing with advice of small size S Angelopoulos, C Dürr, S Kamali, MP Renault, A Rosén Theory of Computing Systems 62 (8), 2006-2034, 2018 | 20 | 2018 |
| Optimal Scheduling of Contract Algorithms with Soft Deadlines. S Angelopoulos, A López-Ortiz, AM Hamel AAAI, 868-873, 2008 | 19* | 2008 |
| Randomized priority algorithms S Angelopoulos Approximation and Online Algorithms, 27-40, 2004 | 19 | 2004 |
| Paging and list update under bijective analysis S Angelopoulos, P Schweitzer Journal of the ACM (JACM) 60 (2), 1-18, 2013 | 18 | 2013 |
| Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry S Angelopoulos SODA 7, 248-257, 2007 | 18 | 2007 |
| Online bin packing with advice of small size S Angelopoulos, C Dürr, S Kamali, MP Renault, A Rosén Theory of Computing Systems 62, 2006-2034, 2018 | 15 | 2018 |
| Optimal scheduling of contract algorithms for anytime problem-solving A López-Ortiz, S Angelopoulos, AM Hamel Journal of Artificial Intelligence Research 51, 533-554, 2014 | 15 | 2014 |
Christoph DürrCNRS, Sorbonne University, LIP6Verified email at lip6.fr
