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	Hilfe

Suche: Series=LNCS AND YEAR=2001

• Grouping techniques for scheduling problems: Simpler and faster
  Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli
  Lecture Notes in Computer Science 2161, 2001, pp. 206-217
• A separation bound for real algebraic expressions
  Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt
  Lecture Notes in Computer Science 2161, 2001, pp. 254-265
• Property testing with geometric queries
  Artur Czumaj, Christian Sohler
  Lecture Notes in Computer Science 2161, 2001, pp. 266-277
• Smallest color-spanning objects
  Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, Belén Palop, Vera Sacristán
  Lecture Notes in Computer Science 2161, 2001, pp. 278-289
• Splitting a Delaunay triangulation in linear time
  Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, Monique Teillaud
  Lecture Notes in Computer Science 2161, 2001, pp. 312-320
• A fast algorithm for approximating the detour of a polygonal chain
  Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, Andrzej Lingas
  Lecture Notes in Computer Science 2161, 2001, pp. 321-332
• An approximation algorithm for MINIMUM CONVEX COVER with logarithmic performance guarantee
  Stephan Eidenbenz, Peter Widmayer
  Lecture Notes in Computer Science 2161, 2001, pp. 333-344
• Distributed O(\delta \log n)-edge-coloring algorithm
  A. Czygrinow, M. Hańćkowiak, M. Karoński
  Lecture Notes in Computer Science 2161, 2001, pp. 345-355
• Modeling replica placement in a distributed file system: Narrowing the gap between analysis and simulation
  John R. Douceur, Roger P. Wattenhofer
  Lecture Notes in Computer Science 2161, 2001, pp. 356-367
• Computing cycle covers without short cycles
  Markus Bläser, Bodo Siebert
  Lecture Notes in Computer Science 2161, 2001, pp. 368-379
• Fast pricing of European Asian options with provable accuracy: Single-stock and basket options
  Karhan Akcoglu, Ming-Yang Kao, Shuba V. Raghavan
  Lecture Notes in Computer Science 2161, 2001, pp. 404-415
• Approximation algorithms for minimum-time broadcast under the vertex-disjoint paths mode
  Pierre Fraigniaud
  Lecture Notes in Computer Science 2161, 2001, pp. 440-451
• Round robin is optimal for fault-tolerant broadcasting on wireless networks
  Andrea E.F. Clementi, Angelo Monti, Riccardo Silvestri
  Lecture Notes in Computer Science 2161, 2001, pp. 452-463
• Online and offline distance constrained labeling of disk graphs
  Jiȓí Fiala, Aleksei V. Fishkin, Fedor V. Fomin
  Lecture Notes in Computer Science 2161, 2001, pp. 464-475
• Approximate distance labeling schemes
  Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg
  Lecture Notes in Computer Science 2161, 2001, pp. 476-487
• On the parameterized complexity of layered graph drawing
  V. Dujmović, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, D.R. Wood
  Lecture Notes in Computer Science 2161, 2001, pp. 488-499
• A general model of undirected web graphs
  Colin Cooper, Alan M. Frieze
  Lecture Notes in Computer Science 2161, 2001, pp. 500-511
• Packing cycles and cuts in undirected graphs
  Alberto Caprara, Alessandro Panconesi, Romeo Rizzi
  Lecture Notes in Computer Science 2161, 2001, pp. 512-523
• Fractal matrix multiplication: A case study on portability of cache performance
  Gianfranco Bilardi, Paolo DáAlberto, Alex Nicolau
  Lecture Notes in Computer Science 2141, 2001, pp. 26-38
• Designing and implementing a general purpose halfedge data structure
  Hervé Brönnimann
  Lecture Notes in Computer Science 2141, 2001, pp. 51-66
• Efficient resource allocation with noisy functions
  Arne Andersson, Per Carlsson, Fredrik Ygge
  Lecture Notes in Computer Science 2141, 2001, pp. 91-105
• Using PRAM algorithms on a uniform-memory-access shared-memory architecture
  David A. Bader, Ajith K. Illendula, Bernard M.E. Moret, Nina R. Weisse-Bernstein
  Lecture Notes in Computer Science 2141, 2001, pp. 129-144
• An experimental study of data migration algorithms
  Eric Anderson, Joe Hall, Jason Hartline, Michael Hobbs, Anna R. Karlin, Jared Saia, Ram Swaminathan, John Wilkes
  Lecture Notes in Computer Science 2141, 2001, pp. 145-158
• An experimental study of basic communication protocols in ad-hoc mobile networks
  Ioannis Chatzigiannakis, Sotiris Nikoletseas, Nearchos Paspallis, Paul Spirakis, Christos Zaroliagis
  Lecture Notes in Computer Science 2141, 2001, pp. 159-171
• Experimental analysis of algorithms for bilateral-contract clearing mechanisms arising in deregulated power industry
  Chris Barrett, Doug Cook, Gregory Hicks, Vance Faber, Achla Marathe, Madhav Marathe, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist
  Lecture Notes in Computer Science 2141, 2001, pp. 172-184