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

• Continuous and discrete methods in computer science
  Cristopher Moore
  Lecture Notes in Computer Science 6034, 2010, pp. 1-1
• Colorful strips
  Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stephan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian
  Lecture Notes in Computer Science 6034, 2010, pp. 2-13
• The mono- and bichromatic empty rectangle and square problems in all dimensions
  Jonathan Backer, J. Mark Keil
  Lecture Notes in Computer Science 6034, 2010, pp. 14-25
• Connectivity is not a limit for kernelization: Planar connected dominating set
  Qianping Gu, Navid Imani
  Lecture Notes in Computer Science 6034, 2010, pp. 26-37
• Randomized truthful algorithms for scheduling selfish tasks on parallel machines
  Eric Angel, Evripidis Bampis, Nicolas Thibault
  Lecture Notes in Computer Science 6034, 2010, pp. 38-48
• Almost linear time computation of the chromatic polynomial of a graph of bounded tree-width
  Martin Fürer
  Lecture Notes in Computer Science 6034, 2010, pp. 49-59
• Average parameterization and partial kernelization for computing medians
  Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier
  Lecture Notes in Computer Science 6034, 2010, pp. 60-71
• Sharp separation and applications to exact and parameterized algorithms
  Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh
  Lecture Notes in Computer Science 6034, 2010, pp. 72-83
• Finding the minimum-distance schedule for a boundary searcher with a flashlight
  Tsunehiko Kameda, Ichiro Suzuki, John Z. Zhang
  Lecture Notes in Computer Science 6034, 2010, pp. 84-95
• The language theory of bounded context-switching
  Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato
  Lecture Notes in Computer Science 6034, 2010, pp. 96-107
• Local search performance guarantees for restricted related parallel machine scheduling
  Diego Recalde, Cyriel Rutten, Petra Schuurman, Tjark Vredeveld
  Lecture Notes in Computer Science 6034, 2010, pp. 108-119
• Packet routing on the grid
  Britta Peis, Martin Skutella, Andreas Wiese
  Lecture Notes in Computer Science 6034, 2010, pp. 120-130
• Faithful representations of graphs by islands in the extended grid
  Michael D. Coury, Pavol Hell, Jan Kratochvíl, Tomás̑ Vyskoc̑il
  Lecture Notes in Computer Science 6034, 2010, pp. 131-142
• The I/O complexity of sparse matrix dense matrix multiplication
  Gero Greiner, Riko Jacob
  Lecture Notes in Computer Science 6034, 2010, pp. 143-156
• Sparse recovery using sparse random matrices
  Piotr Indyk
  Lecture Notes in Computer Science 6034, 2010, pp. 157-157
• Optimal succinctness for range minimum queries
  Johannes Fischer
  Lecture Notes in Computer Science 6034, 2010, pp. 158-169
• Compact rich-functional binary relation representations
  Jérémy Barbay, Francisco Claude, Gonzalo Navarro
  Lecture Notes in Computer Science 6034, 2010, pp. 170-183
• Radix cross-sections for length morphisms
  Sylvain Lombardy, Jacques Sakarovitch
  Lecture Notes in Computer Science 6034, 2010, pp. 184-195
• Pairs of complementary unary languages with ``balanced'' nondeterministic automata
  Viliam Geffert, Giovanni Pighizzini
  Lecture Notes in Computer Science 6034, 2010, pp. 196-207
• Quotient complexity of ideal languages
  Janusz Brzozowski, Galina Jirásková, Baiyu Li
  Lecture Notes in Computer Science 6034, 2010, pp. 208-221
• Complexity of operations on cofinite languages
  Frédérique Bassino, Laura Giambruno, Cyril Nicaud
  Lecture Notes in Computer Science 6034, 2010, pp. 222-233
• Fast set intersection and two-patterns matching
  Hagai Cohen, Ely Porat
  Lecture Notes in Computer Science 6034, 2010, pp. 234-242
• Counting reducible, powerful, and relatively irreducible multivariate polynomials over finite fields
  Joachim von zur Gathen, Alfredo Viola, Konstantin Ziegler
  Lecture Notes in Computer Science 6034, 2010, pp. 243-254
• A larger lower bound on the OBDD complexity of the most significant bit of multiplication
  Beate Bollig
  Lecture Notes in Computer Science 6034, 2010, pp. 255-266
• Modelling the LLL algorithm by sandpiles
  Manfred Madritsch, Brigitte Vallée
  Lecture Notes in Computer Science 6034, 2010, pp. 267-281