Spyros Angelopoulos
Spyros Angelopoulos
CNRS and Sorbonne University
Verified email at lip6.fr
Title
Cited by
Cited by
Year
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
642007
List update with locality of reference
S Angelopoulos, R Dorrigiv, A López-Ortiz
Latin American Symposium on Theoretical Informatics, 399-410, 2008
32*2008
List update with locality of reference
S Angelopoulos, R Dorrigiv, A López-Ortiz
Latin American Symposium on Theoretical Informatics, 399-410, 2008
282008
Tight bounds for quasirandom rumor spreading
S Angelopoulos, B Doerr, A Huber, K Panagiotou
the electronic journal of combinatorics 16 (1), R102, 2009
262009
The power of priority algorithms for facility location and set cover
S Angelopoulos, A Borodin
Algorithmica 40 (4), 271-291, 2004
252004
On the power of priority algorithms for facility location and set cover
S Angelopoulos, A Borodin
International Workshop on Approximation Algorithms for Combinatorial …, 2002
232002
Paging and list update under bijective analysis
S Angelopoulos, P Schweitzer
Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
202009
Randomized priority algorithms
S Angelopoulos
Approximation and Online Algorithms, 27-40, 2004
162004
Improved bounds for the online Steiner tree problem in graphs of bounded edge-asymmetry
S Angelopoulos
Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007
152007
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
132018
Further Connections Between Contract-Scheduling and Ray-Searching Problems.
S Angelopoulos
IJCAI, 1516-1522, 2015
122015
Optimal Scheduling of Contract Algorithms with Soft Deadlines.
S Angelopoulos, A López-Ortiz, AM Hamel
AAAI, 868-873, 2008
112008
The node-weighted Steiner problem in graphs of restricted node weights
S Angelopoulos
Scandinavian Workshop on Algorithm Theory, 208-219, 2006
112006
Paging and list update under bijective analysis
S Angelopoulos, P Schweitzer
Journal of the ACM (JACM) 60 (2), 7, 2013
102013
Randomized priority algorithms
S Angelopoulos, A Borodin
Theoretical Computer Science 411 (26-28), 2542-2558, 2010
102010
Optimal scheduling of contract algorithms for anytime problems
A López-Ortiz, S Angelopoulos, AM Hamel
PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE 21 (1), 874, 2006
102006
Multi-target ray searching problems
S Angelopoulos, A López-Ortiz, K Panagiotou
Theoretical Computer Science 540, 2-12, 2014
92014
Infinite linear programming and online searching with turn cost
S Angelopoulos, D Arsénio, C Dürr
Theoretical Computer Science 670, 11-22, 2017
82017
Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow time problems
S Angelopoulos, G Lucarelli, KT Nguyen
Algorithms-ESA 2015, 35-46, 2015
82015
A near-tight bound for the online steiner tree problem in graphs of bounded asymmetry
S Angelopoulos
European Symposium on Algorithms, 76-87, 2008
82008
The system can't perform the operation now. Try again later.
Articles 1–20