Matthias Englert

Matthias Englert

I am also affiliated with DIMAP.

For students outside of Warwick, I do not offer any kind of internships at this time. Please excuse if I do not respond to such email requests.

Program Committees

ESA 2012, MedAlg 2012, WAOA 2013

Conference calendar

You may find this calendar in the iCal format with information about some theory conferences useful. The calendar is based on the nice CS Theory Conferences Information page maintained by Iftah Gamzu. If you think something is wrong, missing, or could be improved, feel free to contact me.

Teaching

I am teaching "CS409 - Algorithmic Game Theory" in Term 2 of 2012/13.

I am teaching "CS301 - Complexity of Algorithms" in Term 1 of 2012/13.

I was teaching "CS341 - Advanced Topics in Algorithms" in Term 2 of 2011/12.

I was teaching "CS301 - Complexity of Algorithms" in Term 1 of 2011/12.

Stuff

Events I was involved in:

Publications

The downloadable version of a publication is some version of the work. For the original publication see, for example, the publishers website or your favorite library.

  • Catch Them If You Can: How to Serve Impatient Users
    Marek Cygan, Matthias Englert, Anupam Gupta, Marcin Mucha, and Piotr Sankowski
    In Proc. of the 4th ITCS (Berkeley, USA, 2013). To appear. [PDF | ©]
  • Multiple-Choice Balanced Allocation in (almost) Parallel
    Petra Berenbrink, Artur Czumaj, Matthias Englert, Tom Friedetzky, and Lars Nagel
    In Proc. of the 16th RANDOM (Cambridge, USA, 2012). Pages 411-422. [PDF | ©]
  • Optimal Online Buffer Scheduling for Block Devices
    Anna Adamaszek, Artur Czumaj, Matthias Englert, and Harald Räcke
    In Proc. of the 44th STOC (New York, USA, 2012). Pages 589-598. [PDF | ©]
  • An O(log k)-competitive Algorithm for Generalized Caching
    Anna Adamaszek, Artur Czumaj, Matthias Englert, and Harald Räcke
    In Proc. of the 23rd SODA (Kyoto, Japan, 2012). Pages 1681-1689. [PDF | ©]
  • Almost Tight Bounds for Reordering Buffer Management
    Anna Adamaszek, Artur Czumaj, Matthias Englert, and Harald Räcke
    In Proc. of the 43rd STOC (San Jose, USA, 2011). Pages 607-616. [PDF | ©]
  • Vertex Sparsifiers: New Results from Old Techniques
    Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, and Kunal Talwar
    In Proc. of the 13th APPROX (Barcelona, Spain, 2010). Pages 152-165. [PDF | ©]
  • Oblivious Routing for the L_p-norm
    Matthias Englert and Harald Räcke
    In Proc. of the 50th FOCS (Atlanta, USA, 2009). Pages 32-40. [PDF | ©]
  • Economical Caching with Stochastic Prices
    Matthias Englert, Berthold Vöcking, and Melanie Winkler
    In Proc. of the 5th SAGA (Sapporo, Japan, 2009). Pages 179-190. [PDF | ©]
  • Economical Caching
    Matthias Englert, Heiko Röglin, Jacob Spönemann, and Berthold Vöcking
    In Proc. of the 26th STACS (Freiburg, Germany, 2009). Pages 385-396. [PDF | ©]
  • The Power of Reordering for Online Minimum Makespan Scheduling
    Matthias Englert, Deniz Özmen, and Matthias Westermann
    In Proc. of the 49th FOCS (Philadelphia, USA, 2008). Pages 603-612. [PDF | ©]
  • Sensitivity of Wardrop Equilibria
    Matthias Englert, Thomas Franke, and Lars Olbrich
    In Proc. of the 1st SAGT (Paderborn, Germany, 2008), Pages 158-169. [PDF | ©]
    Theory of Computing Systems (special issue SAGT 2008), 47(1): 3-14, 2010.
  • Reordering Buffers for General Metric Spaces
    Matthias Englert, Harald Räcke, and Matthias Westermann
    In Proc. of the 39th STOC (San Diego, USA, 2007), Pages 556-564. [PDF | ©]
    Theory of Computing, 6: 27-46, 2010.
  • Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP
    Matthias Englert, Heiko Röglin, and Berthold Vöcking
    In Proc. of the 18th SODA (New Orleans, USA, 2007), Pages 1295-1304. [PDF | ©]
    Preliminary Version: ECCC Technical Report TR06-092, 2006.
  • Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches
    Matthias Englert and Matthias Westermann
    In Proc. of the 18th SODA (New Orleans, USA, 2007), Pages 209-218. [PDF | ©]
    SIAM Journal on Computing, 41(5): 1166-1192, 2012.
  • Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
    Matthias Englert and Matthias Westermann
    In Proc. of the 14th ESA (Zürich, Switzerland, 2006), Pages 352-363. [PDF | ©]
    Algorithmica (special issue ESA 2006), 53(4): 523-548, 2009.
  • Evaluation of Online Strategies for Reordering Buffers
    Matthias Englert, Heiko Röglin, and Matthias Westermann
    In Proc. of the 5th WEA (Menorca Island, Spain, 2006), Pages 183-194. [PDF | ©]
    ACM Journal of Experimental Algorithmics (special issue WEA 2006), 14: 3.3-3.14, 2009.
  • Reordering Buffer Management for Non-Uniform Cost Models
    Matthias Englert and Matthias Westermann
    In Proc. of the 32nd ICALP (Lisboa, Portugal, 2005), Pages 627-638. [PDF | ©]
  • The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes
    Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, and Ingo Wegener
    In Proc. of the 8th PPSN (Birmingham, UK, 2004), Pages 31-40. [PDF | ©]
  • Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
    Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, and Ingo Wegener
    In Proc. of the 8th PPSN (Birmingham, UK, 2004), Pages 21-30. [PDF | ©]

© Copyright Notice

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder. In particular this applies to all PDF files and images linked to from this page and this page itself.