Follow
Spyros Angelopoulos
Spyros Angelopoulos
CNRS and Sorbonne University
Verified email at lip6.fr - Homepage
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
712007
Online Computation with Untrusted Advice
S Angelopoulos, C Dürr, S Jin, S Kamali, M Renault
arXiv preprint arXiv:1905.05655, 2019
452019
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
Tight bounds for quasirandom rumor spreading
S Angelopoulos, B Doerr, A Huber, K Panagiotou
the electronic journal of combinatorics 16 (1), R102, 2009
272009
The power of priority algorithms for facility location and set cover
S Angelopoulos, A Borodin
Algorithmica 40 (4), 271-291, 2004
272004
Paging and list update under bijective analysis
S Angelopoulos, P Schweitzer
Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
252009
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
The expanding search ratio of a graph
S Angelopoulos, C Dürr, T Lidbetter
Discrete Applied Mathematics 260, 51-65, 2019
202019
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
192018
Randomized priority algorithms
S Angelopoulos
Approximation and Online Algorithms, 27-40, 2004
182004
Further Connections Between Contract-Scheduling and Ray-Searching Problems.
S Angelopoulos
IJCAI, 1516-1522, 2015
172015
Paging and list update under bijective analysis
S Angelopoulos, P Schweitzer
Journal of the ACM (JACM) 60 (2), 1-18, 2013
162013
Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
S Angelopoulos
SODA 7, 248-257, 2007
162007
Infinite linear programming and online searching with turn cost
S Angelopoulos, D Arsénio, C Dürr
Theoretical Computer Science 670, 11-22, 2017
152017
Optimal Scheduling of Contract Algorithms with Soft Deadlines.
S Angelopoulos, A López-Ortiz, AM Hamel
AAAI, 868-873, 2008
152008
Online Search With a Hint
S Angelopoulos
arXiv preprint arXiv:2008.13729, 2020
112020
Interruptible Algorithms for Multi-Problem Solving.
S Angelopoulos, A López-Ortiz
IJCAI, 380-386, 2009
112009
A near-tight bound for the online steiner tree problem in graphs of bounded asymmetry
S Angelopoulos
European Symposium on Algorithms, 76-87, 2008
112008
Primal–Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems
S Angelopoulos, G Lucarelli, TN Kim
Algorithmica 81 (9), 3391-3421, 2019
102019
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
102018
The system can't perform the operation now. Try again later.
Articles 1–20