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

• An improved interactive streaming algorithm for the distinct elements problem
  Hartmut Klauck, Ved Prakash
  Lecture Notes in Computer Science 8572, 2014, pp. 919-930
• A faster parameterized algorithm for treedepth
  Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
  Lecture Notes in Computer Science 8572, 2014, pp. 931-942
• Pseudorandom graphs in data structures
  Omer Reingold, Ron D. Rothblum, Udi Wieder
  Lecture Notes in Computer Science 8572, 2014, pp. 943-954
• Sampling-based proofs of almost-periodicity results and algorithmic applications
  Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf
  Lecture Notes in Computer Science 8572, 2014, pp. 955-966
• The Mondshein sequence
  Jens M. Schmidt
  Lecture Notes in Computer Science 8572, 2014, pp. 967-978
• Balanced allocations: A simple proof for the heavily loaded case
  Kunal Talwar, Udi Wieder
  Lecture Notes in Computer Science 8572, 2014, pp. 979-990
• Close to uniform prime number generation with fewer random bits
  Pierre-Alain Fouque, Mehdi Tibouchi
  Lecture Notes in Computer Science 8572, 2014, pp. 991-1002
• Optimal strong parallel repetition for projection games on low threshold rank graphs
  Madhur Tulsiani, John Wright, Yuan Zhou
  Lecture Notes in Computer Science 8572, 2014, pp. 1003-1014
• Sparser random 3-SAT refutation algorithms and the interpolation problem
  Iddo Tzameret
  Lecture Notes in Computer Science 8572, 2014, pp. 1015-1026
• On learning, lower bounds and (un)keeping promises
  Ilya Volkovich
  Lecture Notes in Computer Science 8572, 2014, pp. 1027-1038
• Certificates in data structures
  Yaoyu Wang, Yitong Yin
  Lecture Notes in Computer Science 8572, 2014, pp. 1039-1050
• Optimal query complexity for estimating the trace of a matrix
  Karl Wimmer, Yi Wu, Peng Zhang
  Lecture Notes in Computer Science 8572, 2014, pp. 1051-1062
• Faster separators for shallow minor-free graphs via dynamic approximate distance oracles
  Christian Wulff-Nilsen
  Lecture Notes in Computer Science 8572, 2014, pp. 1063-1074
• Spatial mixing of coloring random graphs
  Yitong Yin
  Lecture Notes in Computer Science 8572, 2014, pp. 1075-1086