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

• On area-optimal planar graph drawings
  Therese Biedl
  Lecture Notes in Computer Science 8572, 2014, pp. 198-210
• Shortest two disjoint paths in polynomial time
  Andreas Björklund, Thore Husfeldt
  Lecture Notes in Computer Science 8572, 2014, pp. 211-222
• Listing triangles
  Andreas Björklund, Rasmus Pagh, Virginia Vassilevska Williams, Uri Zwick
  Lecture Notes in Computer Science 8572, 2014, pp. 223-234
• On DNF approximators for monotone Boolean functions
  Eric Blais, Johan Håstad, Rocco A. Servedio, Li-Yang Tan
  Lecture Notes in Computer Science 8572, 2014, pp. 235-246
• Internal DLA: Efficient simulation of a physical growth model
  Karl Bringmann, Fabian Kuhn, Konstantinos Panagiotou, Ueli Peter, Henning Thomas
  Lecture Notes in Computer Science 8572, 2014, pp. 247-258
• Lower bounds for approximate LDCs
  Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf
  Lecture Notes in Computer Science 8572, 2014, pp. 259-270
• Holographic algorithms beyond matchgates
  Jin-Yi Cai, Heng Guo, Tyson Williams
  Lecture Notes in Computer Science 8572, 2014, pp. 271-282
• Testing probability distributions underlying aggregated data
  Clément Canonne, Ronitt Rubinfeld
  Lecture Notes in Computer Science 8572, 2014, pp. 283-295
• Parallel repetition of entangled games with exponential decay via the superposed information cost
  André Chailloux, Giannicola Scarpa
  Lecture Notes in Computer Science 8572, 2014, pp. 296-307
• The Bose-Hubbard model is QMA-complete
  Andrew M. Childs, David Gosset, Zak Webb
  Lecture Notes in Computer Science 8572, 2014, pp. 308-319
• Characterization of binary constraint system games
  Richard Cleve, Rajat Mittal
  Lecture Notes in Computer Science 8572, 2014, pp. 320-331
• Fast algorithms for constructing maximum entropy summary trees
  Richard Cole, Howard Karloff
  Lecture Notes in Computer Science 8572, 2014, pp. 332-343
• Thorp shuffling, butterflies, and non-Markovian couplings
  Artur Czumaj, Berthold Vöcking
  Lecture Notes in Computer Science 8572, 2014, pp. 344-355
• Dynamic complexity of directed reachability and other problems
  Samir Datta, William Hesse, Raghav Kulkarni
  Lecture Notes in Computer Science 8572, 2014, pp. 356-367
• One tile to rule them all: Simulating any tile assembly system with a single universal tile
  Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Matthew J. Patitz, Robert T. Schweller, Andrew Winslow, Damien Woods
  Lecture Notes in Computer Science 8572, 2014, pp. 368-379
• Canadians should travel randomly
  Erik D. Demaine, Yamming Huang, Chung-Shou Liao, Kunihiko Sadakane
  Lecture Notes in Computer Science 8572, 2014, pp. 380-391
• Efficiency guarantees in auctions with budgets
  Shahar Dobzinski, Renato Paes Leme
  Lecture Notes in Computer Science 8572, 2014, pp. 392-404
• Parameterized complexity of bandwidth on trees
  Markus Sortland Dregi, Daniel Lokshtanov
  Lecture Notes in Computer Science 8572, 2014, pp. 405-416
• Testing equivalence of polynomials under shifts
  Zeev Dvir, Rafael Mendes de Oliveira, Amir Shpilka
  Lecture Notes in Computer Science 8572, 2014, pp. 417-428
• Optimal analysis of best fit bin packing
  György Dósa, Jiȓí Sgall
  Lecture Notes in Computer Science 8572, 2014, pp. 429-441
• Light spanners
  Michael Elkin, Ofer Neiman, Shay Solomon
  Lecture Notes in Computer Science 8572, 2014, pp. 442-452
• Semi-streaming set cover
  Yuval Emek, Adi Rosén
  Lecture Notes in Computer Science 8572, 2014, pp. 453-464
• Online stochastic reordering buffer scheduling
  Hossein Esfandiari, MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Vahid Liaghat, Hamid Mahini, Harald Räcke
  Lecture Notes in Computer Science 8572, 2014, pp. 465-476
• Demand queries with preprocessing
  Uriel Feige, Shlomo Jozeph
  Lecture Notes in Computer Science 8572, 2014, pp. 477-488
• Algorithmic aspects of regular graph covers with applications to planar graphs
  Jiȓí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela
  Lecture Notes in Computer Science 8572, 2014, pp. 489-501