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=6198

• Cell probe lower bounds and approximations for range mode
  Mark Greve, Allan Grnlund Jrgensen, Kasper Dalgaard Larsen, Jakob Truelsen
  Lecture Notes in Computer Science 6198, 2010, pp. 605-616
• SDP gaps for 2-to-1 and other Label-Cover variants
  Venkatesan Guruswami, Subhash Khot, Ryan O'Donnell, Preyas Popat, Madhur Tulsiani, Yi Wu
  Lecture Notes in Computer Science 6198, 2010, pp. 617-628
• Data stream algorithms for codeword testing
  Atri Rudra, Steve Uurtamo
  Lecture Notes in Computer Science 6198, 2010, pp. 629-640
• Streaming algorithms for independent sets
  Bjarni V. Halldórsson, Magnús M. Halldórsson, Elena Losievskaja, Mario Szegedy
  Lecture Notes in Computer Science 6198, 2010, pp. 641-652
• Preprocessing of min ones problems: A dichotomy
  Stefan Kratsch, Magnus Wahlström
  Lecture Notes in Computer Science 6198, 2010, pp. 653-665
• Holographic reduction: A domain changed application and its partial converse theorems
  Mingji Xia
  Lecture Notes in Computer Science 6198, 2010, pp. 666-677
• Optimal trade-offs for succinct string indexes
  Roberto Grossi, Alessio Orlandi, Rajeev Raman
  Lecture Notes in Computer Science 6198, 2010, pp. 678-689
• Approximation algorithms for optimal decision trees and adaptive TSP problems
  Anupam Gupta, Viswanath Nagarajan, R. Ravi
  Lecture Notes in Computer Science 6198, 2010, pp. 690-701
• Concurrent knowledge extraction in the public-key model
  Andrew C. Yao, Moti Yung, Yunlei Zhao
  Lecture Notes in Computer Science 6198, 2010, pp. 702-714
• On the k-independence required by linear probing and minwise independence
  Mihai Pȃtraşcu, Mikkel Thorup
  Lecture Notes in Computer Science 6198, 2010, pp. 715-726
• Covering and packing in linear space
  Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
  Lecture Notes in Computer Science 6198, 2010, pp. 727-737
• Testing 2-vertex connectivity and computing pairs of vertex-disjoint s-t paths in digraphs
  Loukas Georgiadis
  Lecture Notes in Computer Science 6198, 2010, pp. 738-749