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 [2]	Hilfe

Suche: Series=LNCS AND Volume=7357

• Linear-space data structures for range minority query in arrays
  Timothy M. Chan, Stephane Durocher, Matthew Skala, Bryan T. Wilkinson
  Lecture Notes in Computer Science 7357, 2012, pp. 295-306
• Asynchronous rumor spreading in preferential attachment graphs
  Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich
  Lecture Notes in Computer Science 7357, 2012, pp. 307-315
• Connectivity oracles for planar graphs
  Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen
  Lecture Notes in Computer Science 7357, 2012, pp. 316-327
• Access graphs results for LRU versus FIFO under relative worst order analysis
  Joan Boyar, Sushmita Gupta, Kim S. Larsen
  Lecture Notes in Computer Science 7357, 2012, pp. 328-339
• Competitive analysis of maintaining frequent items of a stream
  Yiannis Giannakopoulos, Elias Koutsoupias
  Lecture Notes in Computer Science 7357, 2012, pp. 340-351
• Kernel bounds for structural parameterizations of pathwidth
  Hans L. Bodlaender, Bart M.P. Jansen, Stefan Kratsch
  Lecture Notes in Computer Science 7357, 2012, pp. 352-363
• Kernel lower bounds using co-nondeterminism: Finding induced hereditary subgraphs
  Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman
  Lecture Notes in Computer Science 7357, 2012, pp. 364-375
• Testing formula satisfaction
  Eldar Fischer, Yonatan Goldhirsh, Oded Lachish
  Lecture Notes in Computer Science 7357, 2012, pp. 376-387
• Reconstructing strings from substrings with quantum queries
  Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita
  Lecture Notes in Computer Science 7357, 2012, pp. 388-397