Thomas Lcking
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
12
Venues
7
Active years
2000–2005
Best venue rank
A*
Where they publish
Papers
12 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2005 | ICALP | Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. | Martin Gairing, Thomas Lcking, Burkhard Monien, Karsten Tiemann |
| 2004 | ICALP | Nash Equilibria in Discrete Routing Games with Convex Latency Functions. | Martin Gairing, Thomas Lcking, Marios Mavronicolas, Burkhard Monien, Manuel Rode |
| 2004 | MFCS | The Price of Anarchy for Polynomial Social Cost. | Martin Gairing, Thomas Lcking, Marios Mavronicolas, Burkhard Monien |
| 2004 | STOC | Computing Nash equilibria for scheduling on restricted parallel links. | Martin Gairing, Thomas Lcking, Marios Mavronicolas, Burkhard Monien |
| 2004 | STACS | A New Model for Selfish Routing. | Thomas Lcking, Marios Mavronicolas, Burkhard Monien, Manuel Rode |
| 2003 | ICALP | Nashification and the Coordination Ratio for a Selfish Routing Game. | Rainer Feldmann, Martin Gairing, Thomas Lcking, Burkhard Monien, Manuel Rode |
| 2003 | MFCS | Selfish Routing in Non-cooperative Networks: A Survey. | Rainer Feldmann, Martin Gairing, Thomas Lcking, Burkhard Monien, Manuel Rode |
| 2003 | MFCS | Which Is the Worst-Case Nash Equilibrium? | Thomas Lcking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto |
| 2003 | WAOA | A 5/4-Approximation Algorithm for Scheduling Identical Malleable Tasks. | Thomas Decker, Thomas Lcking, Burkhard Monien |
| 2002 | MFCS | On the Problem of Scheduling Flows on Distributed Networks. | Thomas Lcking, Burkhard Monien, Manuel Rode |
| 2001 | SPAA | New spectral bounds on k-partitioning of graphs. | Robert Elssser, Thomas Lcking, Burkhard Monien |
| 2000 | LATIN | Subresultants Revisited. | Joachim von zur Gathen, Thomas Lcking |