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

• More robust hashing: Cuckoo hashing with a stash
  Adam Kirsch, Michael Mitzenmacher, Udi Wieder
  Lecture Notes in Computer Science 5193, 2008, pp. 611-622
• Better and simpler approximation algorithms for the stable marriage problem
  Zoltán Király
  Lecture Notes in Computer Science 5193, 2008, pp. 623-634
• Edit distances and factorisations of even permutations
  Anthony Labarre
  Lecture Notes in Computer Science 5193, 2008, pp. 635-646
• Speed scaling functions for flow time scheduling based on active job count
  Tak-Wah Lam, Lap-Kei Lee, Isaac K.K. To, Prudence W.H. Wong
  Lecture Notes in Computer Science 5193, 2008, pp. 647-659
• Facility location in dynamic geometric data streams
  Christiane Lammersen, Christian Sohler
  Lecture Notes in Computer Science 5193, 2008, pp. 660-671
• The effects of local randomness in the adversarial queueing model
  Yann Lorion, Maik Weinard
  Lecture Notes in Computer Science 5193, 2008, pp. 672-683
• Parallel imaging problem
  Thành Nguyen, Éva Tardos
  Lecture Notes in Computer Science 5193, 2008, pp. 684-695
• An online algorithm for finding the longest previous factors
  Daisuke Okanohara, Kunihiko Sadakane
  Lecture Notes in Computer Science 5193, 2008, pp. 696-707
• Collusion-resistant mechanisms with verification yielding optimal solutions
  Paolo Penna, Carmine Ventre
  Lecture Notes in Computer Science 5193, 2008, pp. 708-719
• Improved BDD algorithms for the simulation of quantum circuits
  Vasilis Samoladas
  Lecture Notes in Computer Science 5193, 2008, pp. 720-731
• Mobile route planning
  Peter Sanders, Dominik Schultes, Christian Vetter
  Lecture Notes in Computer Science 5193, 2008, pp. 732-743
• How reliable are practical point-in-polygon strategies?
  Stefan Schirra
  Lecture Notes in Computer Science 5193, 2008, pp. 744-755
• Fast divide-and-conquer algorithms for preemptive scheduling problems with controllable processing times - A polymatroid optimization approach
  Natalia Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich
  Lecture Notes in Computer Science 5193, 2008, pp. 756-767
• Approximability of average completion time scheduling on unrelated machines
  René A. Sitters
  Lecture Notes in Computer Science 5193, 2008, pp. 768-779
• Relative convex hulls in semi-dynamic subdivisions
  Mashhood Ishaque, Csaba D. Tóth
  Lecture Notes in Computer Science 5193, 2008, pp. 780-792
• An experimental analysis of Robinson-Foulds distance matrix algorithms
  Seung-Jin Sul, Tiffani L. Williams
  Lecture Notes in Computer Science 5193, 2008, pp. 793-804
• On the size of the 3D visibility skeleton: Experimental results
  Linqiao Zhang, Hazel Everett, Sylvain Lazard, Christophe Weibel, Sue Whitesides
  Lecture Notes in Computer Science 5193, 2008, pp. 805-816
• An almost space-optimal streaming algorithm for coresets in fixed dimensions
  Hamid Zarrabi-Zadeh
  Lecture Notes in Computer Science 5193, 2008, pp. 817-829
• Deterministic sampling algorithms for network design
  Anke van Zuylen
  Lecture Notes in Computer Science 5193, 2008, pp. 830-841