Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen [1]	Hilfe

Suche: Series=LNCS AND YEAR=2005

• On weighted balls-into-bins games
  Petra Berenbrink, Tom Friedetzky, Zengjian Hu, Russell Martin
  Lecture Notes in Computer Science 3404, 2005, pp. 231-243
• Parametric duality and kernelization: Lower bounds and upper bounds on kernel size
  Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia
  Lecture Notes in Computer Science 3404, 2005, pp. 269-280
• Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms
  Hubie Chen
  Lecture Notes in Computer Science 3404, 2005, pp. 315-326
• Regular tree languages definable in FO
  Michael Benedikt, Luc Segoufin
  Lecture Notes in Computer Science 3404, 2005, pp. 327-339
• Improved algorithms for dynamic page migration
  Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzeniowski
  Lecture Notes in Computer Science 3404, 2005, pp. 365-376
• Approximate range mode and range median queries
  Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yihui Tang
  Lecture Notes in Computer Science 3404, 2005, pp. 377-388
• Increasing Kolmogorov complexity
  Harry Buhrman, Lance Fortnow, Ilan Newman, Nikolai Vereshchagin
  Lecture Notes in Computer Science 3404, 2005, pp. 412-421
• Information theory in property testing and monotonicity testing in higher dimension
  Nir Ailon, Bernard Chazelle
  Lecture Notes in Computer Science 3404, 2005, pp. 434-447
• On Nash equilibria in non-cooperative all-optical networks
  Vittorio Bil, Michele Flammini, Luca Moscardelli
  Lecture Notes in Computer Science 3404, 2005, pp. 448-459
• Speed scaling to manage temperature
  Nikhil Bansal, Kirk Pruhs
  Lecture Notes in Computer Science 3404, 2005, pp. 460-471
• The complexity of solving linear equations over a finite ring
  V. Arvind, T.C. Vijayaraghavan
  Lecture Notes in Computer Science 3404, 2005, pp. 472-484
• The PIGs full monty - A floor show of minimal separators
  Gerard Jennhwa Chang, Antonius J.J. Kloks, Jiping Liu, Sheng-Lung Peng
  Lecture Notes in Computer Science 3404, 2005, pp. 521-532
• Centrality measures based on current flow
  Ulrik Brandes, Daniel Fleischer
  Lecture Notes in Computer Science 3404, 2005, pp. 533-544
• Varieties of codes and Kraft inequality
  Fabio Burderi, Antonio Restivo
  Lecture Notes in Computer Science 3404, 2005, pp. 545-556
• Robust polynomials and quantum algorithms
  Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf
  Lecture Notes in Computer Science 3404, 2005, pp. 593-604
• All-pairs nearly 2-approximate shortest-paths in O(n^2 polylog n) time
  Surender Baswana, Vishrut Goyal, Sandeep Sen
  Lecture Notes in Computer Science 3404, 2005, pp. 666-679
• Online packet switching
  Yossi Azar
  Lecture Notes in Computer Science 3351, 2005, pp. 1-5
• Approximation algorithms for spreading points
  Sergio Cabello
  Lecture Notes in Computer Science 3351, 2005, pp. 83-96
• Priority algorithms for graph optimization problems
  Allan Borodin, Joan Boyar, Kim S. Larsen
  Lecture Notes in Computer Science 3351, 2005, pp. 126-139
• A \frac 54-approximation algorithm for biconnecting a graph with a given Hamiltonian path
  Davide Bilò, Guido Proietti
  Lecture Notes in Computer Science 3351, 2005, pp. 181-196
• Order-preserving transformations and greedy-like algorithms
  Spyros Angelopoulos
  Lecture Notes in Computer Science 3351, 2005, pp. 197-210
• Off-line admission control for advance reservations in star networks
  Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl
  Lecture Notes in Computer Science 3351, 2005, pp. 211-224
• Universal bufferless routing
  Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas
  Lecture Notes in Computer Science 3351, 2005, pp. 239-252
• Strong colorings of hypergraphs
  Geir Agnarsson, Magnús M. Halldórsson
  Lecture Notes in Computer Science 3351, 2005, pp. 253-266
• Deterministic monotone algorithms for scheduling on related machines
  Pasquale Ambrosio, Vincenzo Auletta
  Lecture Notes in Computer Science 3351, 2005, pp. 267-280