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

• Space-constrained interval selection
  Yuval Emek, Magnús M. Halldórsson, Adi Rosén
  Lecture Notes in Computer Science 7391, 2012, pp. 302-313
• Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations
  Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
  Lecture Notes in Computer Science 7391, 2012, pp. 314-326
• Succinct indices for range queries with applications to orthogonal range maxima
  Arash Farzan, J. Ian Munro, Rajeev Raman
  Lecture Notes in Computer Science 7391, 2012, pp. 327-338
• Universal factor graphs
  Uriel Feige, Shlomo Jozeph
  Lecture Notes in Computer Science 7391, 2012, pp. 339-350
• Parameterized approximation via fidelity preserving transformations
  Michael R. Fellows, Ariel Kulik, Frances Rosamond, Hadas Shachnai
  Lecture Notes in Computer Science 7391, 2012, pp. 351-362
• Backdoors to acyclic SAT
  Serge Gaspers, Stefan Szeider
  Lecture Notes in Computer Science 7391, 2012, pp. 363-374
• Dominators, directed bipolar orders, and independent spanning trees
  Loukas Georgiadis, Robert E. Tarjan
  Lecture Notes in Computer Science 7391, 2012, pp. 375-386
• Hardness of approximation for quantum problems
  Sevag Gharibian, Julia Kempe
  Lecture Notes in Computer Science 7391, 2012, pp. 387-398
• The complexity of computing the sign of the Tutte polynomial (and consequent \#P-hardness of approximation)
  Leslie Ann Goldberg, Mark Jerrum
  Lecture Notes in Computer Science 7391, 2012, pp. 399-410
• Stochastic vehicle routing with recourse
  Inge Li Grtz, Viswanath Nagarajan, Rishi Saket
  Lecture Notes in Computer Science 7391, 2012, pp. 411-423
• The online metric matching problem for doubling metrics
  Anupam Gupta, Kevin Lewi
  Lecture Notes in Computer Science 7391, 2012, pp. 424-435
• Approximating sparse covering integer programs online
  Anupam Gupta, Viswanath Nagarajan
  Lecture Notes in Computer Science 7391, 2012, pp. 436-448
• Streaming and communication complexity of clique approximation
  Magnús M. Halldórsson, Xiaoming Sun, Mario Szegedy, Chengu Wang
  Lecture Notes in Computer Science 7391, 2012, pp. 449-460
• Distributed private heavy hitters
  Justin Hsu, Sanjeev Khanna, Aaron Roth
  Lecture Notes in Computer Science 7391, 2012, pp. 461-472
• A thirty year old conjecture about promise problems
  Andrew Hughes, A. Pavan, Nathan Russell, Alan Selman
  Lecture Notes in Computer Science 7391, 2012, pp. 473-484
• Minimum latency submodular cover
  Sungjin Im, Viswanath Nagarajan, Ruben van der Zwaan
  Lecture Notes in Computer Science 7391, 2012, pp. 485-497
• Constant-time algorithms for sparsity matroids
  Hiro Ito, Shin-Ichi Tanigawa, Yuichi Yoshida
  Lecture Notes in Computer Science 7391, 2012, pp. 498-509
• CRAM: Compressed random access memory
  Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
  Lecture Notes in Computer Science 7391, 2012, pp. 510-521
• Improving quantum query complexity of Boolean matrix multiplication using graph collision
  Stacey Jeffery, Robin Kothari, Frédéric Magniez
  Lecture Notes in Computer Science 7391, 2012, pp. 522-532
• Faster fully compressed pattern matching by recompression
  Artur Jeż
  Lecture Notes in Computer Science 7391, 2012, pp. 533-544
• NNS lower bounds via metric expansion for l_\infty and EMD
  Michael Kapralov, Rina Panigrahy
  Lecture Notes in Computer Science 7391, 2012, pp. 545-556
• Quantum adversary (upper) bound
  Shelby Kimmel
  Lecture Notes in Computer Science 7391, 2012, pp. 557-568
• Solving Planar k-Terminal Cut in O(n^{c \sqrt{k}}) time
  Philip N. Klein, Dániel Marx
  Lecture Notes in Computer Science 7391, 2012, pp. 569-580
• Fixed-parameter tractability of multicut in directed acyclic graphs
  Stefan Kratsch, Marcin Pilipczuk, Michaƚ Pilipczuk, Magnus Wahlström
  Lecture Notes in Computer Science 7391, 2012, pp. 581-593
• Preserving terminal distances using minors
  Robert Krauthgamer, Tamar Zondiner
  Lecture Notes in Computer Science 7391, 2012, pp. 594-605