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 [1]	Hilfe

Suche: Series=LNCS AND Volume=6907

• On the complexity of the l-diversity problem
  Riccardo Dondi, Giancarlo Mauri, Italo Zoppis
  Lecture Notes in Computer Science 6907, 2011, pp. 266-277
• Infinite synchronizing words for probabilistic automata
  Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi
  Lecture Notes in Computer Science 6907, 2011, pp. 278-289
• Characterizing EF over infinite trees and modal logic on transitive graphs
  Balder ten Cate, Alessandro Facchini
  Lecture Notes in Computer Science 6907, 2011, pp. 290-302
• Parity games on graphs with medium tree-width
  John Fearnley, Oded Lachish
  Lecture Notes in Computer Science 6907, 2011, pp. 303-314
• Satisfiability of systems of equations of real analytic functions is quasi-decidable
  Peter Franek, Stefan Ratschan, Piotr Zgliczynski
  Lecture Notes in Computer Science 6907, 2011, pp. 315-326
• On minimising automata with errors
  Paweƚ Gawrychowski, Artur Jeż, Andreas Maletti
  Lecture Notes in Computer Science 6907, 2011, pp. 327-338
• Contracting a chordal graph to a split graph or a tree
  Petr A. Golovach, Marcin Kamiński, Daniël Paulusma
  Lecture Notes in Computer Science 6907, 2011, pp. 339-350
• Quantum finite automata and probabilistic reversible automata: R-trivial idempotent languages
  Marats Golovkins, Maksim Kravtsev, Vasilijs Kravcevs
  Lecture Notes in Computer Science 6907, 2011, pp. 351-363
• A universally defined undecidable unimodal logic
  Edith Hemaspaandra, Henning Schnoor
  Lecture Notes in Computer Science 6907, 2011, pp. 364-375
• On the approximability of minimum topic connected overlay and its special instances
  Jun Hosoda, Juraj Hromkovic̑, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
  Lecture Notes in Computer Science 6907, 2011, pp. 376-387
• Can everybody sit closer to their friends than their enemies?
  Anne-Marie Kermarrec, Christopher Thraves
  Lecture Notes in Computer Science 6907, 2011, pp. 388-399
• Submodularity on a tree: Unifying L^{\natural}-convex and bisubmodular functions
  Vladimir Kolmogorov
  Lecture Notes in Computer Science 6907, 2011, pp. 400-411
• Streaming algorithms for recognizing nearly well-parenthesized expressions
  Andreas Krebs, Nutan Limaye, Srikanth Srinivasan
  Lecture Notes in Computer Science 6907, 2011, pp. 412-423
• Size and computation of injective tree automatic presentations
  Dietrich Kuske, Thomas Weidner
  Lecture Notes in Computer Science 6907, 2011, pp. 424-435
• Symmetric functions capture general functions
  Richard J. Lipton, Kenneth W. Regan, Atri Rudra
  Lecture Notes in Computer Science 6907, 2011, pp. 436-447
• Compressed word problems for inverse monoids
  Markus Lohrey
  Lecture Notes in Computer Science 6907, 2011, pp. 448-459
• Pushing for weighted tree automata
  Andreas Maletti, Daniel Quernheim
  Lecture Notes in Computer Science 6907, 2011, pp. 460-471
• Periodicity algorithms for partial words
  Florin Manea, Robert Mercaş, Cȃtȃlin Tiseanu
  Lecture Notes in Computer Science 6907, 2011, pp. 472-484
• State complexity of operations on input-driven pushdown automata
  Alexander Okhotin, Kai Salomaa
  Lecture Notes in Computer Science 6907, 2011, pp. 485-496
• Conflict packing yields linear vertex-kernels for k-FAST, k-dense RTI and a related problem
  Christophe Paul, Anthony Perez, Stéphan Thomassé
  Lecture Notes in Computer Science 6907, 2011, pp. 497-507
• Transduction on Kadanoff Sand pile model avalanches, application to wave pattern emergence
  Kevin Perrot, Eric Rémila
  Lecture Notes in Computer Science 6907, 2011, pp. 508-519
• Problems parameterized by treewidth tractable in single exponential time: A logical approach
  Michaƚ Pilipczuk
  Lecture Notes in Computer Science 6907, 2011, pp. 520-531
• Distributed synthesis for regular and contextfree specifications
  Wladimir Fridman, Bernd Puchala
  Lecture Notes in Computer Science 6907, 2011, pp. 532-543
• Geometric graphs with randomly deleted edges - Connectivity and routing protocols
  K. Krzywdziński, K. Rybarczyk
  Lecture Notes in Computer Science 6907, 2011, pp. 544-555
• Untimed language preservation in timed systems
  Ocan Sankur
  Lecture Notes in Computer Science 6907, 2011, pp. 556-567