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 Volume=3221

• Tiling a polygon with two kinds of rectangles
  Eric Rémila
  Lecture Notes in Computer Science 3221, 2004, pp. 568-579
• On dynamic shortest paths problems
  Liam Roditty, Uri Zwick
  Lecture Notes in Computer Science 3221, 2004, pp. 580-591
• Uniform algorithms for deterministic construction of efficient dictionaries
  Milan Ruz̑ić
  Lecture Notes in Computer Science 3221, 2004, pp. 592-603
• Fast sparse matrix multiplication
  Raphael Yuster, Uri Zwick
  Lecture Notes in Computer Science 3221, 2004, pp. 604-615
• An experimental study of random knapsack problems
  Rene Beier, Berthold Vöcking
  Lecture Notes in Computer Science 3221, 2004, pp. 616-627
• Contraction and treewidth lower bounds
  Hans L. Bodlaender, Arie M.C.A. Koster, Thomas Wolle
  Lecture Notes in Computer Science 3221, 2004, pp. 628-639
• Load balancing of indivisible unit size tokens in dynamic and heterogeneous networks
  Robert Elsässer, Burkhard Monien, Stefan Schamberger
  Lecture Notes in Computer Science 3221, 2004, pp. 640-651
• Comparing real algebraic numbers of small degree
  Ioannis Z. Emiris, Elias P. Tsigaridas
  Lecture Notes in Computer Science 3221, 2004, pp. 652-663
• Code flexibility and program efficiency by genericity: Improving CGAL's arrangements
  Efi Fogel, Ron Wein, Dan Halperin
  Lecture Notes in Computer Science 3221, 2004, pp. 664-676
• Finding dominators in practice
  Loukas Georgiadis, Renato F. Werneck, Robert E. Tarjan, Spyridon Triantafyllis, David I. August
  Lecture Notes in Computer Science 3221, 2004, pp. 677-688
• Data migration on parallel disks
  Leana Golubchik, Samir Khuller, Yoo-Ah Kim, Svetlana Shargorodskaya, Yung-Chun (Justin) Wan
  Lecture Notes in Computer Science 3221, 2004, pp. 689-701
• Classroom examples of robustness problems in geometric computations
  Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee Yap
  Lecture Notes in Computer Science 3221, 2004, pp. 702-713
• Stable minimum storage merging by symmetric comparisons
  Pok-Son Kim, Arne Kutzner
  Lecture Notes in Computer Science 3221, 2004, pp. 714-723
• On rectangular cartograms
  Marc van Krefeld, Bettina Speckmann
  Lecture Notes in Computer Science 3221, 2004, pp. 724-735
• Multi-word atomic read/write registers on multiprocessor systems
  Andreas Larsson, Anders Gidenstam, Phuong H. Ha, Marina Papatriantafilou, Philippas Tsigas
  Lecture Notes in Computer Science 3221, 2004, pp. 736-748
• Beyond optimal play in two-person-zerosum games
  Ulf Lorenz
  Lecture Notes in Computer Science 3221, 2004, pp. 749-759
• Solving geometric covering problems by data reduction
  Steffen Mecke, Dorothea Wagner
  Lecture Notes in Computer Science 3221, 2004, pp. 760-771
• Efficient IP table lookup via adaptive stratified trees with selective reconstructions
  Marco Pellegrini, Giordano Fusco
  Lecture Notes in Computer Science 3221, 2004, pp. 772-783
• Super scalar sample sort
  Peter Sanders, Sebastian Winkel
  Lecture Notes in Computer Science 3221, 2004, pp. 784-796
• Construction of minimum-weight spanners
  Mikkel Sigurd, Martin Zachariasen
  Lecture Notes in Computer Science 3221, 2004, pp. 797-808
• A straight skeleton approximating the medial axis
  Mirela Tȃnase, Remco C. Veltkamp
  Lecture Notes in Computer Science 3221, 2004, pp. 809-821
• Non-additive shortest paths
  George Tsaggouris, Christos Zaroliagis
  Lecture Notes in Computer Science 3221, 2004, pp. 822-834