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 YEAR=2014

• Public vs private coin in bounded-round information
  Mark Braverman, Ankit Garg
  Lecture Notes in Computer Science 8572, 2014, pp. 502-513
• En route to the log-rank conjecture: New reductions and equivalent formulations
  Dmitry Gavinsky, Shachar Lovett
  Lecture Notes in Computer Science 8572, 2014, pp. 514-524
• Improved submatrix maximum queries in Monge matrices
  Paweƚ Gawrychowski, Shay Mozes, Oren Weimann
  Lecture Notes in Computer Science 8572, 2014, pp. 525-537
• Parameterized algorithms to preserve connectivity
  Manu Basavaraju, Fedor V. Fomin, Petr Golovach, Pranabendu Misra, M.S. Ramanujan, Saket Saurabh
  Lecture Notes in Computer Science 8572, 2014, pp. 800-811
• QCSP on semicomplete digraphs
  Petar Dapić, Petar Marković, Barnaby Martin
  Lecture Notes in Computer Science 8572, 2014, pp. 847-858
• 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
• 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
• I/O-efficient range minima queries
  Peyman Afshani, Nodari Sitchinava
  Lecture Notes in Computer Science 8503, 2014, pp. 1-12
• Online makespan minimization with parallel schedules
  Susanne Albers, Matthias Hellwig
  Lecture Notes in Computer Science 8503, 2014, pp. 13-25
• Expected linear time sorting for word size \Omega(\log^2n\log\log n)
  Djamal Belazzougui, Gerth Stlting Brodal, Jesper Sindahl Nielsen
  Lecture Notes in Computer Science 8503, 2014, pp. 26-37
• Amortized analysis of smooth quadtrees in all dimensions
  Huck Bennett, Chee Yap
  Lecture Notes in Computer Science 8503, 2014, pp. 38-49
• New approximability results for the robust k-median problem
  Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann
  Lecture Notes in Computer Science 8503, 2014, pp. 50-61
• Trees and co-trees with bounded degrees in planar 3-connected graphs
  Therese Biedl
  Lecture Notes in Computer Science 8503, 2014, pp. 62-73
• Approximating the revenue maximization problem with sharp demands
  Vittorio Bilò, Michele Flammini, Gianpiero Monaco
  Lecture Notes in Computer Science 8503, 2014, pp. 74-85
• Reconfiguring independent sets in claw-free graphs
  Paul Bonsma, Marcin Kamiński, Marcin Wrochna
  Lecture Notes in Computer Science 8503, 2014, pp. 86-97
• Competitive online routing on Delaunay triangulations
  Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher, Perouz Taslakian
  Lecture Notes in Computer Science 8503, 2014, pp. 98-109
• Optimal planar orthogonal skyline counting queries
  Gerth Stlting Brodal, Kasper Green Larsen
  Lecture Notes in Computer Science 8503, 2014, pp. 110-121
• B-slack trees: Space efficient B-trees
  Trevor Brown
  Lecture Notes in Computer Science 8503, 2014, pp. 122-133
• Approximately minwise independence with twisted tabulation
  Sren Dahlgaard, Mikkel Thorup
  Lecture Notes in Computer Science 8503, 2014, pp. 134-145
• Line-distortion, bandwidth and path-length of a graph
  Feodor F. Dragan, Ekkehard Köhler, Arne Leitert
  Lecture Notes in Computer Science 8503, 2014, pp. 158-169
• Colorful bin packing
  György Dósa, Leah Epstein
  Lecture Notes in Computer Science 8503, 2014, pp. 170-181
• Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
  Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre, Ioan Todinca
  Lecture Notes in Computer Science 8503, 2014, pp. 182-193
• Win-win kernelization for degree sequence completion problems
  Vincent Froese, André Nichterlein, Rolf Niedermeier
  Lecture Notes in Computer Science 8503, 2014, pp. 194-205
• On matchings and b-edge dominating sets: A 2-approximation algorithm for the 3-edge dominating set problem
  Toshihiro Fujito
  Lecture Notes in Computer Science 8503, 2014, pp. 206-216
• Covering problems in edge- and node-weighted graphs
  Takuro Fukunaga
  Lecture Notes in Computer Science 8503, 2014, pp. 217-228