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

• Nearest neighbor search in high-dimensional spaces
  Alexandr Andoni
  Lecture Notes in Computer Science 6907, 2011, pp. 1-1
• Invariantization of listings
  Jörg Flum
  Lecture Notes in Computer Science 6907, 2011, pp. 2-2
• Duality and recognition
  Mai Gehrke
  Lecture Notes in Computer Science 6907, 2011, pp. 3-18
• Some variants of the star height problem
  Daniel Kirsten
  Lecture Notes in Computer Science 6907, 2011, pp. 19-33
• Generic techniques to round SDP relaxations
  Prasad Raghavendra
  Lecture Notes in Computer Science 6907, 2011, pp. 34-34
• New proofs in graph minors
  Paul Wollan
  Lecture Notes in Computer Science 6907, 2011, pp. 35-35
• The least-core of threshold network flow games
  Yoram Bachrach
  Lecture Notes in Computer Science 6907, 2011, pp. 36-47
• Adhesivity is not enough: Local Church-Rosser revisited
  Paolo Baldan, Fabio Gadducci, Pawel Sobociński
  Lecture Notes in Computer Science 6907, 2011, pp. 48-59
• Quantitative refinement for weighted modal transition systems
  Sebastian S. Bauer, Uli Fahrenberg, Line Juhl, Kim G. Larsen, Axel Legay, Claus Thrane
  Lecture Notes in Computer Science 6907, 2011, pp. 60-71
• Faster coupon collecting via replication with applications in gossiping
  Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Lars Nagel, Thomas Sauerwald
  Lecture Notes in Computer Science 6907, 2011, pp. 72-83
• Verifying proofs in constant depth
  Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
  Lecture Notes in Computer Science 6907, 2011, pp. 84-95
• The complexity of the cover polynomials for planar graphs of bounded degree
  Markus Bläser, Radu Curticapean
  Lecture Notes in Computer Science 6907, 2011, pp. 96-107
• Model checking coverability graphs of vector addition systems
  Michel Blockelet, Sylvain Schmitz
  Lecture Notes in Computer Science 6907, 2011, pp. 108-119
• Hard functions for low-degree polynomials over prime fields
  Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka
  Lecture Notes in Computer Science 6907, 2011, pp. 120-131
• Temporal logics for concurrent recursive programs: Satisfiability and model checking
  Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun
  Lecture Notes in Computer Science 6907, 2011, pp. 132-144
• The reachability problem for Vector Addition System with one zero-test
  Rémi Bonnet
  Lecture Notes in Computer Science 6907, 2011, pp. 145-157
• The bounded search tree algorithm for the Closest String problem has quadratic smoothed complexity
  Christina Boucher
  Lecture Notes in Computer Science 6907, 2011, pp. 158-169
• Solving analytic differential equations in polynomial time over unbounded domains
  Olivier Bournez, Daniel S. Graça, Amaury Pouly
  Lecture Notes in Computer Science 6907, 2011, pp. 170-181
• Pattern-guided data anonymization and clustering
  Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip
  Lecture Notes in Computer Science 6907, 2011, pp. 182-193
• Language equivalence of deterministic real-time one-counter automata is NL-complete
  Stanislav Böhm, Stefan Göller
  Lecture Notes in Computer Science 6907, 2011, pp. 194-205
• Energy and mean-payoff parity Markov decision processes
  Krishnendu Chatterjee, Laurent Doyen
  Lecture Notes in Computer Science 6907, 2011, pp. 206-218
• The role of polymorphism in the characterisation of complexity by soft types
  Jacek Chrza̧szcz, Aleksy Schubert
  Lecture Notes in Computer Science 6907, 2011, pp. 219-230
• An algebraic theory of complexity for valued constraints: Establishing a Galois connection
  David A. Cohen, Páidí Creed, Peter G. Jeavons, Stanislav Z̑ivný
  Lecture Notes in Computer Science 6907, 2011, pp. 231-242
• On the use of guards for logics with data
  Thomas Colcombet, Clemens Ley, Gabriele Puppis
  Lecture Notes in Computer Science 6907, 2011, pp. 243-255
• An elementary proof of a 3n-o(n) lower bound on the circuit complexity of affine dispersers
  Evgeny Demenkov, Alexander S. Kulikov
  Lecture Notes in Computer Science 6907, 2011, pp. 256-265