Dipl.-Math. Dipl.-Inform. Thomas Lücking

2004

Martin Gairing , Thomas Lücking , Marios Mavronicolas , Burkhard Monien
The Price of Anarchy for Polynomial Social Cost
Proc. of the 29th International Symposium on Mathematical Foundations of Computer Science
(MFCS 2004), LNCS 3153, 2004, 574-585.
(c) Springer Verlag
[Abstract]

Martin Gairing , Thomas Lücking , Marios Mavronicolas , Burkhard Monien , Manuel Rode
Nash Equilibria in Discrete Routing Games with Convex Latency Functions
Proc. of the 31st International Colloquium on Automata, Languages and Programming
(ICALP 2004), LNCS 3142, 2004, 645-657.
(c) Springer Verlag
[Abstract]

Martin Gairing , Thomas Lücking , Marios Mavronicolas , Burkhard Monien
Computing Nash Equilibria for Scheduling on Restricted Parallel Links
Proc. of the 36th ACM Symposium on Theory of Computing
(STOC 2004), 2004, 613-622.
[Abstract]

Thomas Lücking , Marios Mavronicolas , Burkhard Monien , Manuel Rode
A New Model for Selfish Routing
Proc. of the 21st International Symposium on Theoretical Aspects of Computer Science
(STACS 2004), LNCS 2996, 2004, 547-558.
(c) Springer Verlag
[Abstract] [Postscript]

2003

Robert Elsässer , Thomas Lücking , Burkhard Monien
On Spectral Bounds for the k-Partitioning of Graphs
Theory of Computing Systems, 36, 2003, 461-478.
(c) Springer Verlag
[Abstract] [Postscript]

Thomas Lücking , Joachim von zur Gathen
Subresultants revisited
Theoretical Computer Science, 297(1), 2003, 199-239.
[Abstract]

Thomas Decker , Thomas Lücking , Burkhard Monien
A 5/4-approximation algorithm for scheduling identical malleable tasks
Proc. of the 1st Workshop on Approximation and Online Algorithms
(WAOA 2003), LNCS 2909, 2003, 95-108.
(c) Springer Verlag
[Abstract] [Postscript]

Martin Gairing , Thomas Lücking , Marios Mavronicolas , Burkhard Monien , Paul Spirakis
Extreme Nash Equilibria
Proc. of the 8th Italian Conference on Theoretical Computer Science
(ICTCS 2003), LNCS 2841, 2003, 1-20.
(c) Springer Verlag
[Abstract] [Postscript]

Rainer Feldmann , Martin Gairing , Thomas Lücking , Burkhard Monien , Manuel Rode
Selfish Routing in Non-cooperative Networks: A Survey
Proc. of the 28th International Symposium on Mathematical Foundations of Computer Science
(MFCS 2003), LNCS 2747, 2003, 21-45.
(c) Springer Verlag
[Abstract] [Postscript]

Thomas Lücking , Marios Mavronicolas , Burkhard Monien , Manuel Rode , Paul Spirakis , Imrich Vrto
Which Is the Worst-case Nash Equilibrium?
Proc. of the 28th International Symposium on Mathematical Foundations of Computer Science
(MFCS 2003), LNCS 2747, 2003, 551-561.
(c) Springer Verlag
[Abstract] [Postscript]

Rainer Feldmann , Martin Gairing , Thomas Lücking , Burkhard Monien , Manuel Rode
Nashification and the Coordination Ratio for a Selfish Routing Game
Proc. of the 30th International Colloquium on Automata, Languages and Programming
(ICALP 2003), LNCS 2719, 2003, 514-526.
(c) Springer Verlag
[Abstract] [Postscript]

2002

Thomas Lücking , Burkhard Monien , Manuel Rode
On the Problem of Scheduling Flows on Distributed Networks
Proc. of the 27th International Symposium on Mathematical Foundations of Computer Science
(MFCS 2002), LNCS 2420, 2002, 495-505.
(c) Springer Verlag
[Abstract] [Postscript]

Thomas Decker , Thomas Lücking , Burkhard Monien
A 5/4-approximation algorithm for scheduling identical malleable tasks
Technical Report, tr-rsfb-02-071, University of Paderborn, 2002.
[Abstract] [Postscript]

2001

Robert Elsässer , Thomas Lücking , Burkhard Monien
New Spectral Bounds on k-Partitioning of Graphs
Proc. of the 13th ACM Symposium on Parallel Algorithms and Architectures
(SPAA 2001), 2001, 255-262.
[Abstract] [Postscript]

2000

Thomas Lücking , Joachim von zur Gathen
Subresultants revisited
Proc. of the 4th Latin American Symposium on Theoretical Informatics
(LATIN 2000), LNCS 1776, 2000, 318-342.
(c) Springer Verlag
[Abstract] [Postscript] [PDF]

Thomas Lücking
Subresultants
Master Thesis, University of Paderborn, 2000.
[Abstract] [Postscript] [PDF]

Index A – Z | Impressum | Webmaster | Modified: 18.11.2004

Weiter zum Anfang