The Library
Browse by Warwick Author
Up a level |
Number of items: 16.
Englert, Matthias, Rรคcke, Harald and Stotz, Richard (2020) Polylogarithmic guarantees for generalized reordering buffer management. In: FOCS 2019 60th Annual IEEE Symposium on Foundations of Computer Science , , Baltimore, Maryland, 9-12 Nov 2019. Published in: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) doi:10.1109/FOCS.2019.00012 ISSN 2575-8454.
Englert, Matthias and Rรคcke, Harald (2017) Reordering buffers with logarithmic diameter dependency for trees. In: 28th ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain, 16-19 Jan 2017. Published in: SODA '17 Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms 1224-1234 . ISBN 9781611974782. doi:10.1137/1.9781611974782.79
Damerow, Valentina, Manthey, Bodo, Heide, Friedhelm Meyer Auf Der, Rรคcke, Harald, Scheideler, Christian, Sohler, Christian and Tantau, Till (2012) Smoothed analysis of left-to-right maxima with applications. ACM Transactions on Algorithms , Volume 8 (Number 3). Article number 30. doi:10.1145/2229163.2229174 ISSN 1549-6325.
Adamaszek, Anna, Czumaj, Artur, Englert, Matthias and Rรคcke, Harald (2012) An O(log k)-competitive algorithm for generalized caching. In: 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, 17-19 Jan 2012. Published in: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms pp. 1681-1689. ISSN 9781611972108.
Adamaszek, Anna, Czumaj, Artur, Englert, Matthias and Rรคcke, Harald (2011) Almost tight bounds for reordering buffer management. In: STOC'11 Symposium on Theory of Computing Conference (Co-located with FCRC 2011), San Jose, CA, USA, 6-8 Jun 2011. Published in: STOC '11 Proceedings of the 43rd annual ACM symposium on Theory of computing pp. 607-616. doi:10.1145/1993636.1993717 ISSN 9781450306911.
Fischer, Simon, Raecke, Harald and Voecking, Berthold (2010) Fast convergence to wardrop equilibria by adaptive sampling methods. SIAM Journal on Computing, Volume 39 (Number 8). pp. 3700-3735. doi:10.1137/090746720 ISSN 0097-5397.
Englert, Matthias, Raecke, Harald and Westermann, Matthias (2010) Reordering buffers for general metric spaces. Theory of Computing, Vol.6 (No.1). pp. 27-46. doi:10.4086/toc.2010.v006a002 ISSN 1557-2862.
Englert, Matthias, Gupta, Anupam (Researcher in Computer Science), Krauthgamer, Robert, Raecke, Harald, Talgam-Cohen, Inbal and Talwar, Kunal (2010) Vertex sparsifiers : new results from old techniques. In: 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2010)/14th International Workshop on Randomization and Computation (RANDOM 2010), Univ Politecnica Catalunya (UPC), Barcelona, Spain, 01-03 Sep 2010 doi:10.1007/978-3-642-15369-3_12
Englert, Matthias, Gupta, A., Krauthgamer, Robert, Rรคcke, Harald, Talgam-Cohen, Inbal and Talwar, Kunal (2010) Vertex sparsifiers : new results from old techniques. In: Serna, Maria and Shaltiel, Ronen and Jansen, Klaus and Rolim, Josรฉ, (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science (6302). Springer Verlag, pp. 152-165. ISBN 9783642153686
Englert, Matthias, Gupta, Anupam, Krauthgamer, Robert, Rรคcke, Harald, Talgam-Cohen, Inbal and Talwar, Kunal (2010) Vertex sparsifiers : new results from old techniques. In: 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, , , Barcelona, Spain, 1-3 Sep 2010. Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Volume 6302 pp. 152-165. ISBN 9783642153686. doi:10.1007/978-3-642-15369-3_12 ISSN 0302-9743.
Rรคcke, Harald and Rosen, Adi (2009) Approximation algorithms for time-constrained scheduling on line networks. In: 21st ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Canada, August 11-13, 2009. Published in: SPAA '09: Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architecture pp. 337-346. ISBN 978-1-60558-606-9. doi:10.1145/1583991.1584071
Englert, Matthias and Rรคcke, Harald (2009) Oblivious routing for the Lp-norm. In: 50th Annual IEEE Symposium on Foundations of Computer Science, Atlanta, GA, October 25-27 2009. Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science pp. 32-40. ISBN 9780769538501. doi:10.1109/FOCS.2009.52 ISSN 0272-5428.
Rรคcke, Harald (2009) Survey on oblivious routing strategies. In: 5th Conference on Computability in Europe (CiE 2009), Heidelberg, Germany, July 19-24, 2009. Published in: Lecture Notes in Computer Science, Vol.5635 pp. 419-429. ISBN 978-3-642-03072-7. doi:10.1007/978-3-642-03073-4 ISSN 0302-9743.
Chawla, Shuchi, Gupta, Anupam and Raecke, Harald (2008) Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. ACM Transactions on Algorithms , Vol.4 (No.2). doi:10.1145/1361192.1361199 ISSN 1549-6325.
Raecke, Harald (2008) Optimal hierarchical decompositions for congestion minimization in networks. In: 40th Annual ACM International Symposium on Theory of Computing, Victoria, Canada, May 17-20, 2008. Published in: Annual Proceedings of the 40th ACM Symposium on the Theory of Computing pp. 255-263. ISBN 978-1-60558-047-0. ISSN 0737-8017.
Englert, Matthias, Rรคcke, Harald and Westermann, Matthias (2007) Reordering buffers for general metric spaces. In: ACM symposium on theory of computing. Published in: STOC '07 Proceedings of the thirty-ninth annual ACM symposium on Theory of computing pp. 556-564. ISBN 9781595936318. doi:10.1145/1250790.1250871
This list was generated on Mon May 13 03:51:41 2024 BST.