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

Suche: Series=LNCS AND Volume=3618

• Random databases and threshold for monotone non-recursive datalog
  Konstantin Korovin, Andrei Voronkov
  Lecture Notes in Computer Science 3618, 2005, pp. 591-602
• An asymptotically optimal linear-time algorithm for locally consistent constraint satisfaction problems
  Daniel Král', Ondȓej Pangrác
  Lecture Notes in Computer Science 3618, 2005, pp. 603-614
• Greedy approximation via duality for packing, combinatorial auctions and routing
  Piotr Krysta
  Lecture Notes in Computer Science 3618, 2005, pp. 615-627
• Tight approximability results for the maximum solution equation problem over Z_p
  Fredrik Kuivinen
  Lecture Notes in Computer Science 3618, 2005, pp. 628-639
• The complexity of model checking higher order fixpoint logic
  Martin Lange, Rafaƚ Somla
  Lecture Notes in Computer Science 3618, 2005, pp. 640-651
• An efficient algorithm for computing optimal discrete voltage schedules
  Minming Li, Frances F. Yao
  Lecture Notes in Computer Science 3618, 2005, pp. 652-663
• Inverse monoids: Decidability and complexity of algebraic questions
  Markus Lohrey, Nicole Ondrusch
  Lecture Notes in Computer Science 3618, 2005, pp. 664-675
• Dimension is compression
  María López-Valdés, Elvira Mayordomo
  Lecture Notes in Computer Science 3618, 2005, pp. 676-685
• Concurrent automata vs. asynchronous systems
  Rémi Morin
  Lecture Notes in Computer Science 3618, 2005, pp. 686-698
• Completeness and degeneracy in information dynamics of cellular automata
  Hidenosuke Nishio
  Lecture Notes in Computer Science 3618, 2005, pp. 699-707
• Strict language inequalities and their decision problems
  Alexander Okhotin
  Lecture Notes in Computer Science 3618, 2005, pp. 708-719
• Event structures for the collective tokens philosophy of inhibitor nets
  G. Michele Pinna
  Lecture Notes in Computer Science 3618, 2005, pp. 720-732
• An exact 2.9416^n algorithm for the three domatic number problem
  Tobias Riege, Jörg Rothe
  Lecture Notes in Computer Science 3618, 2005, pp. 733-744
• D-width: A more natural measure for directed tree width
  Mohammad Ali Safari
  Lecture Notes in Computer Science 3618, 2005, pp. 745-756
• On beta-shifts having arithmetical languages
  Jakob Grue Simonsen
  Lecture Notes in Computer Science 3618, 2005, pp. 757-768
• A BDD-representation for the logic of equality and uninterpreted functions
  Jaco van de Pol, Olga Tveretina
  Lecture Notes in Computer Science 3618, 2005, pp. 769-780
• On small hard leaf languages
  Falk Unger
  Lecture Notes in Computer Science 3618, 2005, pp. 781-792
• Explicit inapproximability bounds for the shortest superstring problem
  Virginia Vassilevska
  Lecture Notes in Computer Science 3618, 2005, pp. 793-800
• Stratified Boolean grammars
  Michaƚ Wrona
  Lecture Notes in Computer Science 3618, 2005, pp. 801-812