The Library
Browse by Warwick Author
Up a level |
Number of items: 48.
Englert, Matthias, Matsakis, Nicolaos and Veselรฝ, Pavel (2023) Approximation guarantees for shortest superstrings : simpler and better. In: 34th International Symposium on Algorithms and Computation (ISAAC 2023), Kyoto, Japan, 3โ6 Dec 2023. Published in: Proceedings of the 34th International Symposium on Algorithms and Computation (ISAAC 2023) , 286 29:1-29:17. doi:10.4230/LIPIcs.ISAAC.2023.29 (In Press)
Chistikov, Dmitry, Englert, Matthias and Lazic, Ranko (2023) Learning a neuron by a shallow ReLU network : dynamics and implicit bias for correlated inputs. In: 37th Conference on Neural Information Processing Systems (NeurIPS 2023)., New Orleans, USA, 10-16 Dec 2023 (In Press)
Englert, Matthias and Lazic, Ranko (2022) Adversarial reprogramming revisited. In: Thirty-sixth Conference on Neural Information Processing Systems (NeurIPS 2022), New Orleans, 28 Nov - 09 Dec 2022. Published in: Advances in Neural Information Processing Systems (NeurIPS 2022), 35 pp. 28588-28600.
Englert, Matthias, Matsakis, Nicolaos and Veselรฝ, Pavel (2022) Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios. In: STOC 2022: 54th Annual ACM Symposium on Theory of Computing, Rome, Italy, 20-24 Jun 2022. Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC โ22) pp. 317-330. ISBN 9781450392648. doi:10.1145/3519935.3520001
Adamaszek, Anna, Czumaj, Artur, Englert, Matthias and Rรคcke, Harald (2022) Almost tight bounds for reordering buffer management. SIAM Journal on Computing, 51 (3). pp. 701-722. doi:10.1137/20M1326167 ISSN 0097-5397.
Englert, Matthias, Mezlaf, David and Westermann, Matthias (2021) Online makespan scheduling with job migration on uniform machines. Algorithmica, 83 . pp. 3537-3566. doi:10.1007/s00453-021-00852-5 ISSN 0178-4617.
Blondin, Michael, Englert, Matthias, Finkel, Alain, Gรถller, Stefan , Haase, Christoph, Lazic, Ranko, McKenzie, Pierre and Totzke, Patrick (2021) The reachability problem for two-dimensional vector addition systems with states. Journal of the ACM, 68 (5). pp. 1-43. 34. doi:10.1145/3464794 ISSN 0004-5411.
Englert, Matthias, Hofman, Piotr, Lasota, Sลawomir, Lazic, Ranko, Leroux, Jรฉrรดme and Straszyลski, Juliusz (2021) A lower bound for the coverability problem in acyclic pushdown VAS. Information Processing Letters, 167 . 106079. doi:10.1016/j.ipl.2020.106079 ISSN 0020-0190.
Antoniadis, Antonios, Englert, Matthias, Matsakis, Nicolaos and Veselรฝ, Pavel (2021) Breaking the barrier of 2 for the competitiveness of longest queue drop. In: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Virtual, 12-16 Jul 2021. Published in: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 198 17:1-17:20. ISBN 9783959771955. doi:10.4230/LIPIcs.ICALP.2021.17 ISSN 1868-8969.
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.
Al-Bawani, Kamal, Englert, Matthias and Westermann, Matthias (2018) Online packet scheduling for CIOQ and buffered crossbar switches. Algorithmica, 80 . pp. 3861-3888. doi:10.1007/s00453-018-0421-x ISSN 0178-4617.
Adamaszek, Anna, Czumaj, Artur, Englert, Matthias and Rรคcke , Harald (2018) An O(log k)-competitive algorithm for generalized caching. ACM Transactions on Algorithms , 15 (1). pp. 1-18. 6. doi:10.1145/3280826 ISSN 1549-6325.
Englert, Matthias, Mezlaf, David and Westermann, Matthias (2018) Online makespan scheduling with job migration on uniform machines. In: 26th Annual European Symposium on Algorithms (ESA 2018), Helsinki, Finland, 20-24 Aug 2018. Published in: 26th Annual European Symposium on Algorithms (ESA 2018), 112 pp. 1-14. ISBN 9783959770811. doi:10.4230/LIPIcs.ESA.2018.26 ISSN 1868-8969.
Al-Bawani, Kamal, Englert, Matthias and Westermann, Matthias (2018) Comparison-based buffer management in QoS switches. Algorithmica, 80 (3). pp. 1073-1092. doi:10.1007/s00453-017-0393-2 ISSN 0178-4617.
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
Englert, Matthias, Rรถglin, Heiko and Vocking, Berthold (2016) Smoothed analysis of the 2-Opt algorithm for the general TSP. ACM Transactions on Algorithms , 13 (1). 10. doi:10.1145/2972953 ISSN 1549-6325.
Al-Bawan, Kamal, Englert, Matthias and Westermann, Matthias (2016) Online packet scheduling for CIOQ and buffered crossbar switches. In: 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), California, USA, 11-13 Jul 2016. Published in: SPAA '16 Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures pp. 241-250. ISBN 9781450342100. doi:10.1145/2935764.2935792
Englert, Matthias, Lazic, Ranko and Totzke, Patrick (2016) Reachability in two-dimensional unary vector addition systems with states is NL-complete. In: Thirty-First Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), New York City, USA, 5โ8 Jul 2016. Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Al-Bawan, Kamal, Englert, Matthias and Westermann, Matthias (2016) Comparison-based FIFO buffer management in QoS switches. In: 12th Latin American Theoretical Informatics Symposium (LATIN), 2016, Ensenada, Mรฉxico, 11-15 Apr 2016. Published in: Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN), 2016, 9644 pp. 27-40. doi:10.1007/978-3-662-49529-2_3
Englert, Matthias, Gupta, Anupam, Krauthgamer, Robert, Rรคcke, Harald, Talgam-Cohen, Inbal and Talwar, Kunal (2014) Vertex sparsifiers : new results from old techniques. SIAM Journal on Computing, Volume 43 (Number 4). pp. 1239-1262. doi:10.1137/130908440 ISSN 0097-5397.
Englert, Matthias, รzmen, Deniz and Westermann, Matthias (2014) The power of reordering for online minimum makespan scheduling. SIAM Journal on Computing, Volume 43 (Number 3). pp. 1220-1237. doi:10.1137/130919738 ISSN 1095-7111.
Azar, Yossi, Englert, Matthias, Gamzu, Iftah and Kidron, Eytan (2014) Generalized reordering buffer management. In: STACS โ14: 31st International Symposium on Theoretical Aspects of Computer Science, Lyon, France, 5-8 Mar 2014. Published in: 31st International Symposium on Theoretical Aspects of Computer Science (STACS โ14) pp. 87-98. doi:10.4230/LIPIcs.STACS.2014.87
Englert, Matthias, Rรถglin, Heiko and Vรถcking, Berthold (2014) Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP. Algorithmica, Volume 68 (Number 1). pp. 190-264. doi:10.1007/s00453-013-9801-4 ISSN 0178-4617.
Englert, Matthias, Matsakis, Nicolaos and Mucha, Marcin (2014) New bounds for online packing LPs. In: Latin American Theoretical INformatics (LATIN) 2014, Montevideo, Uruguay , 31 Mar- 4 Apr 2014. Published in: Lecture Notes in Computer Science series pp. 1-12. doi:10.1007/978-3-642-54423-1_28
Englert, Matthias and Westermann, Matthias (2012) Considering suppressed packets improves buffer management in quality of service switches. SIAM Journal on Computing, Volume 41 (Number 5). pp. 1166-1192. doi:10.1137/110856745 ISSN 0097-5397.
Berenbrink, Petra, Czumaj, Artur, Englert, Matthias, Friedetzky, Thomas and Nagel, Lars (2012) Multiple-choice balanced allocation in (almost) parallel. In: Gupta , Anupam and Jansen , Klaus and Rolim , Josรฉ and Servedio , Rocco , (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings. Lecture Notes in Computer Science, Volume 7408 . Berlin Heidelberg: Springer-Verlag, pp. 411-422. ISBN 9783642325113
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.
Englert, Matthias (2012) An overview of some results for reordering buffers. Computer Science - Research and Developmen, Vol.27 (No.3). pp. 217-223. doi:10.1007/s00450-011-0180-2 ISSN 1865-2034.
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.
Englert, Matthias, Franke, T. and Olbrich, L. (2010) Sensitivity of wardrop equilibria. Theory of Computing Systems, Volume 47 (Number 1). pp. 3-14. doi:10.1007/s00224-009-9196-4 ISSN 1432-4350.
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.
Englert, Matthias, Rรถglin, H. and Westermann, M. (2009) Evaluation of online strategies for reordering buffers. Experimental Algorithmics (JEA), Volume 14 . Article number 3. doi:10.1145/1498698.1564503 ISSN 1084-6654.
Englert, Matthias and Westermann, Matthias (2009) Lower and upper bounds on FIFO buffer management in QoS switches. Algorithmica, Volume 53 (Number 4). pp. 523-548. doi:10.1007/s00453-008-9236-5 ISSN 0178-4617.
Englert, Matthias, Rรถglin, Heiko, Spรถnemann, Jacob and Vรถcking, Berthold (2009) Economical caching. In: 26th International Symposium on Theoretical Aspects of Computer Science, Freiburg, Germany, Feb 2009. Published in: Leibniz International Proceedings in Informatics (LIPIcs), Volume 3 pp. 385-396. ISBN 9783939897095. doi:10.1007/978-3-642-04944-6_15 ISSN 1868-8969.
Englert, Matthias, Voecking, Berthold and Winkler, Melanie (2009) Economical caching with stochastic prices. In: Watanabe, O and Zeugmann, T, (eds.) Stochastic Algorithms : Foundations and Applications. Lecture Notes in Computer Science, Volume 5792 . Springer, pp. 179-190. ISBN 9783642049439
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.
Englert, Matthias, Franke, T. and Olbrich, L. (2008) Sensitivity of wardrop equilibria. In: Monien, Burkhard and Schroeder, Ulf-Peter, (eds.) Algorithmic game theory. Lecture Notes in Computer Science, Volume 4997 . Springer Verlag, pp. 158-169. ISBN 9783540793083
Englert, Matthias, รzmen, Deniz and Westermann, Matthias (2008) The power of reordering for online minimum makespan scheduling. In: 49th Annual IEEE Symposium on Foundations of Computer Science, Philadelphia, PA, 25-28 Oct 2008. Published in: Symposium on Foundations of Computer Science. Annual Proceedings pp. 603-612. doi:10.1109/FOCS.2008.46 ISSN 1523-8288.
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
Englert, Matthias and Westermann, Matthias (2007) Considering suppressed packets improves buffer management in QoS switches. In: ACM-SIAM symposium on Discrete algorithms, 7-9 Jan 2007, New Orleans, Louisiana. Published in: ACM-SIAM symposium on Discrete algorithms pp. 209-218. doi:10.1145/1283383.1283406
Englert, Matthias, Rรถglin, Heiko and Vรถcking, Berthold (2007) Worst case and probabilistic analysis of the 2-opt algorithm for the TSP. In: Eighteenth annual ACM-SIAM symposium on Discrete algorithm, New Orleans, Louisiana, 7-9 Jan 2007. Published in: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms pp. 1295-1304. ISBN 9780898716245.
Englert, Matthias, Roglin, H. and Vocking, B. (2006) Worst case and probabilistic analysis of the 2-opt algorithm for the TSP. In: Electronic Colloquium on Computational Complexity
Englert, Matthias, Roglin, H. and Westermann, M. (2006) Evaluation of online strategies for reordering buffers. In: Carme, รlvarez and Marรญa, Serna, (eds.) Experimental Algorithms. Lecture Notes in Computer Science, Volume 4007 . Springer Verlag, pp. 183-194. ISBN 9783540345978
Englert, Matthias and Westermann, Matthias (2006) Lower and upper bounds on FIFO buffer management in QoS switches. In: Azar, Yossi and Erlebach, Thomas, (eds.) Algorithms โ ESA 2006. Lecture Notes in Computer Science, 4168 . Springer Verlag, pp. 352-363. ISBN 9783540388753
Englert, Matthias and Westermann, Matthias (2005) Reordering buffer management for non-uniform cost models. In: Caires, Luรญs and Italiano, Giuseppe F. and Monteiro, Luรญs and Palamidessi, Catuscia and Yung, Moti , (eds.) Automata, Languages and Programming. Lecture Notes in Computer Science, Volume 3580 . Springer Berlin Heidelberg, pp. 627-638. ISBN 9783540275800
This list was generated on Fri Mar 29 00:40:23 2024 GMT.