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

• A simple deterministic reduction for the gap minimum distance of code problem
  Per Austrin, Subhash Khot
  Lecture Notes in Computer Science 6755, 2011, pp. 474-485
• Recoverable values for independent sets
  Uriel Feige, Daniel Reichman
  Lecture Notes in Computer Science 6755, 2011, pp. 486-497
• Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width
  Magnus Bordewich, Ross J. Kang
  Lecture Notes in Computer Science 6755, 2011, pp. 533-544
• Efficient sample extractors for juntas with applications
  Sourav Chakraborty, David García-Soriano, Arie Matsliah
  Lecture Notes in Computer Science 6755, 2011, pp. 545-556
• Robust simulations and significant separations
  Lance Fortnow, Rahul Santhanam
  Lecture Notes in Computer Science 6755, 2011, pp. 569-580
• A PCP characterization of AM
  Andrew Drucker
  Lecture Notes in Computer Science 6755, 2011, pp. 581-592
• Lower bounds for online integer multiplication and convolution in the cell-probe model
  Raphaël Clifford, Markus Jalsenius
  Lecture Notes in Computer Science 6755, 2011, pp. 593-604
• Exponential lower bounds for AC^{\small\mbox{0}}-Frege imply superpolynomial frege lower bounds
  Yuval Filmus, Toniann Pitassi, Rahul Santhanam
  Lecture Notes in Computer Science 6755, 2011, pp. 618-629
• Parameterized bounded-depth Frege is not optimal
  Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander Razborov
  Lecture Notes in Computer Science 6755, 2011, pp. 630-641
• Sorting by transpositions is difficult
  Laurent Bulteau, Guillaume Fertin, Irena Rusu
  Lecture Notes in Computer Science 6755, 2011, pp. 654-665
• Center stable matchings and centers of cover graphs of distributive lattices
  Christine Cheng, Eric McDermid, Ichiro Suzuki
  Lecture Notes in Computer Science 6755, 2011, pp. 678-689
• VC-dimension and shortest path algorithms
  Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato F. Werneck
  Lecture Notes in Computer Science 6755, 2011, pp. 690-699
• On the power of algebraic branching programs of width two
  Eric Allender, Fengming Wang
  Lecture Notes in Computer Science 6755, 2011, pp. 736-747
• Steiner transitive-closure spanners of low-dimensional posets
  Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev
  Lecture Notes in Computer Science 6755, 2011, pp. 760-772
• Solving the Chromatic Cone Clustering problem via minimum spanning sphere
  Hu Ding, Jinhui Xu
  Lecture Notes in Computer Science 6755, 2011, pp. 773-784
• Forward analysis and model checking for trace bounded WSTS
  Pierre Chambart, Alain Finkel, Sylvain Schmitz
  Lecture Notes in Computer Science 6709, 2011, pp. 49-68
• Branching processes of general Petri nets
  Jean-Michel Couvreur, Denis Poitrenaud, Pascal Weil
  Lecture Notes in Computer Science 6709, 2011, pp. 129-148
• On parametric steady state analysis of a generalized stochastic Petri net with a fork-join subnet
  Jonathan Billington, Guy Edward Gallasch
  Lecture Notes in Computer Science 6709, 2011, pp. 268-287
• Crocodile: A symbolic/symbolic tool for the analysis of symmetric nets with bag
  M. Colange, S. Baarir, F. Kordon, Y. Thierry-Mieg
  Lecture Notes in Computer Science 6709, 2011, pp. 338-347
• Automatic discovery of patterns in media content
  Nello Cristianini
  Lecture Notes in Computer Science 6661, 2011, pp. 2-13
• String comparison and Lyndon-like factorization using V-order in linear time
  David E. Daykin, Jacqueline W. Daykin, W.F. Smyth
  Lecture Notes in Computer Science 6661, 2011, pp. 65-76
• A d-step approach for distinct squares in strings
  Antoine Deza, Frantisek Franek, Mei Jiang
  Lecture Notes in Computer Science 6661, 2011, pp. 77-89
• Tractability results for the consecutive-ones property with multiplicity
  Cedric Chauve, Ján Man̑uch, Murray Patterson, Roland Wittler
  Lecture Notes in Computer Science 6661, 2011, pp. 90-103
• Fast error-tolerant quartet phylogeny algorithms
  Daniel G. Brown, Jakub Truszkowski
  Lecture Notes in Computer Science 6661, 2011, pp. 147-161
• Real-time streaming string-matching
  Dany Breslauer, Zvi Galil
  Lecture Notes in Computer Science 6661, 2011, pp. 162-172