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

• The ubiquitous digital tree
  Philippe Flajolet
  Lecture Notes in Computer Science 3884, 2006, pp. 1-22
• Flat holonomies on automata networks
  Gene Itkis, Leonid A. Levin
  Lecture Notes in Computer Science 3884, 2006, pp. 23-49
• Interprocedurally analyzing polynomial identities
  Markus Müller-Olm, Michael Petter, Helmut Seidl
  Lecture Notes in Computer Science 3884, 2006, pp. 50-67
• External string sorting: Faster and cache-oblivious
  Rolf Fagerberg, Anna Pagh, Rasmus Pagh
  Lecture Notes in Computer Science 3884, 2006, pp. 68-79
• Amortized rigidness in dynamic Cartesian trees
  Iwona Bialynicka-Birula, Roberto Grossi
  Lecture Notes in Computer Science 3884, 2006, pp. 80-91
• Distribution-sensitive construction of minimum-redundancy prefix codes
  Ahmed Belal, Amr Elmasry
  Lecture Notes in Computer Science 3884, 2006, pp. 92-103
• On critical exponents in fixed points of binary k-uniform morphisms
  Dalia Krieger
  Lecture Notes in Computer Science 3884, 2006, pp. 104-114
• Equivalence of F-algebras and cubic forms
  Manindra Agrawal, Nitin Saxena
  Lecture Notes in Computer Science 3884, 2006, pp. 115-126
• Complete codes in a sofic shift
  Marie-Pierre Béal, Dominique Perrin
  Lecture Notes in Computer Science 3884, 2006, pp. 127-136
• Kolmogorov complexity with error
  Lance Fortnow, Troy Lee, Nikolai K. Vereshchagin
  Lecture Notes in Computer Science 3884, 2006, pp. 137-148
• Kolmogorov complexity and the recursion theorem
  Bjrn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan
  Lecture Notes in Computer Science 3884, 2006, pp. 149-161
• Entanglement in interactive proof systems with binary answers
  Stephanie Wehner
  Lecture Notes in Computer Science 3884, 2006, pp. 162-171
• Quantum algorithms for matching and network flows
  Andris Ambainis, Robert S̑palek
  Lecture Notes in Computer Science 3884, 2006, pp. 172-183
• The number of runs in a string: Improved analysis of the linear upper bound
  Wojciech Rytter
  Lecture Notes in Computer Science 3884, 2006, pp. 184-195
• Estimating entropy and entropy norm on data streams
  Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan
  Lecture Notes in Computer Science 3884, 2006, pp. 196-205
• Pay today for a rainy day: Improved approximation algorithms for demand-robust min-cut and shortest path problems
  Daniel Golovin, Vineet Goyal, R. Ravi
  Lecture Notes in Computer Science 3884, 2006, pp. 206-217
• Exact price of anarchy for polynomial congestion games
  Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann
  Lecture Notes in Computer Science 3884, 2006, pp. 218-229
• Oblivious symmetric alternation
  Venkatesan T. Chakaravarthy, Sambuddha Roy
  Lecture Notes in Computer Science 3884, 2006, pp. 230-241
• Combining multiple heuristics
  Tzur Sayag, Shai Fine, Yishay Mansour
  Lecture Notes in Computer Science 3884, 2006, pp. 242-253
• Conflict-free colorings of rectangles ranges
  Khaled M. Elbassioni, Nabil H. Mustafa
  Lecture Notes in Computer Science 3884, 2006, pp. 254-263
• Grid vertex-unfolding orthogonal polyhedra
  Mirela Damian, Robin Y. Flatland, Joseph O'Rourke
  Lecture Notes in Computer Science 3884, 2006, pp. 264-276
• Theory and application of width bounded geometric separator
  Bin Fu
  Lecture Notes in Computer Science 3884, 2006, pp. 277-288
• Invariants of automatic presentations and semi-synchronous transductions
  Vince Bárány
  Lecture Notes in Computer Science 3884, 2006, pp. 289-300
• On the accepting power of 2-tape Büchi automata
  Olivier Finkel
  Lecture Notes in Computer Science 3884, 2006, pp. 301-312
• Weighted picture automata and weighted logics
  Ina Mäurer
  Lecture Notes in Computer Science 3884, 2006, pp. 313-324