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

• The complexity of word circuits
  Xue Chen, Guangda Hu, Xiaoming Sun
  Lecture Notes in Computer Science 6196, 2010, pp. 308-317
• Approximate counting with a floating-point counter
  Miklós Csŭrös
  Lecture Notes in Computer Science 6196, 2010, pp. 358-367
• On sorting permutations by double-cut-and-joins
  Xin Chen
  Lecture Notes in Computer Science 6196, 2010, pp. 439-448
• A three-string approach to the closest string problem
  Zhi-Zhong Chen, Bin Ma, Lusheng Wang
  Lecture Notes in Computer Science 6196, 2010, pp. 449-458
• A 2k kernel for the cluster editing problem
  Jianer Chen, Jie Meng
  Lecture Notes in Computer Science 6196, 2010, pp. 459-468
• Threshold rules for online sample selection
  Eric Bach, Shuchi Chawla, Seeun Umboh
  Lecture Notes in Computer Science 6196, 2010, pp. 489-499
• Zero-knowledge argument for simultaneous discrete logarithms
  Sherman S.M. Chow, Changshe Ma, Jian Weng
  Lecture Notes in Computer Science 6196, 2010, pp. 520-529
• Optimal exploration of terrains with obstacles
  Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
  Lecture Notes in Computer Science 6139, 2010, pp. 1-12
• Semidefinite programming and approximation algorithms: A survey
  Sanjeev Arora
  Lecture Notes in Computer Science 6139, 2010, pp. 25-25
• An O(\log \log n)-competitive binary search tree with optimal worst-case access times
  Prosenjit Bose, Karim Douïeb, Vida Dujmović, Rolf Fagerberg
  Lecture Notes in Computer Science 6139, 2010, pp. 38-49
• A bottom-up method and fast algorithms for max independent set
  Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M.M. van Rooij
  Lecture Notes in Computer Science 6139, 2010, pp. 62-73
• Capacitated domination faster than O(2^n)
  Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk
  Lecture Notes in Computer Science 6139, 2010, pp. 74-80
• On feedback vertex set new measure and new structures
  Yixin Cao, Jianer Chen, Yang Liu
  Lecture Notes in Computer Science 6139, 2010, pp. 93-104
• Systems of linear equations over \mathbb {F}_2 and problems parameterized above average
  Robert Crowston, Gregory Gutin, Mark Jones, Eun Jung Kim, Imre Z. Ruzsa
  Lecture Notes in Computer Science 6139, 2010, pp. 164-175
• Representing a functional curve by curves with fewer peaks
  Danny Z. Chen, Chao Wang, Haitao Wang
  Lecture Notes in Computer Science 6139, 2010, pp. 200-211
• Bregman clustering for separable instances
  Marcel R. Ackermann, Johannes Blömer
  Lecture Notes in Computer Science 6139, 2010, pp. 212-223
• Improved methods for generating quasi-Gray codes
  Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin, Michiel Smid
  Lecture Notes in Computer Science 6139, 2010, pp. 224-235
• The MST of symmetric disk graphs is light
  A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz
  Lecture Notes in Computer Science 6139, 2010, pp. 236-247
• Faster parameterized algorithms for minor containment
  Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 6139, 2010, pp. 322-333
• Dispatching equal-length jobs to parallel machines to maximize throughput
  David P. Bunde, Michael H. Goldwasser
  Lecture Notes in Computer Science 6139, 2010, pp. 346-358
• Online function tracking with generalized penalties
  Marcin Bienkowski, Stefan Schmid
  Lecture Notes in Computer Science 6139, 2010, pp. 359-370
• Online selection of intervals and t-intervals
  Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai
  Lecture Notes in Computer Science 6139, 2010, pp. 383-394
• Succinct dictionary matching with no slowdown
  Djamal Belazzougui
  Lecture Notes in Computer Science 6129, 2010, pp. 88-100
• Pseudo-realtime pattern matching: Closing the gap
  Raphaël Clifford, Benjamin Sach
  Lecture Notes in Computer Science 6129, 2010, pp. 101-111
• Succinct representations of separable graphs
  Guy E. Blelloch, Arash Farzan
  Lecture Notes in Computer Science 6129, 2010, pp. 138-150