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

• Partially commutative inverse monoids
  Volker Diekert, Markus Lohrey, Alexander Miller
  Lecture Notes in Computer Science 4162, 2006, pp. 292-304
• Learning Bayesian networks does not have to be NP-hard
  Norbert Dojer
  Lecture Notes in Computer Science 4162, 2006, pp. 305-314
• Lower bounds for the transition complexity of NFAs
  Michael Domaratzki, Kai Salomaa
  Lecture Notes in Computer Science 4162, 2006, pp. 315-326
• Smart robot teams exploring sparse trees
  M. Dynia, J. Kutyƚowski, F. Meyer auf der Heide, C. Schindelhauer
  Lecture Notes in Computer Science 4162, 2006, pp. 327-338
• k-sets of convex inclusion chains of planar point sets
  Wael El Oraiby, Dominique Schmitt
  Lecture Notes in Computer Science 4162, 2006, pp. 339-350
• Toward the eigenvalue power law
  Robert Elsässer
  Lecture Notes in Computer Science 4162, 2006, pp. 351-362
• Multicast transmissions in non-cooperative networks with a limited number of selfish moves
  Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli
  Lecture Notes in Computer Science 4162, 2006, pp. 363-374
• Very sparse leaf languages
  Lance Fortnow, Mitsunori Ogihara
  Lecture Notes in Computer Science 4162, 2006, pp. 375-386
• On the correlation between parity and modular polynomials
  Anna Gál, Vladimir Trifonov
  Lecture Notes in Computer Science 4162, 2006, pp. 387-398
• Optimally fast data gathering in sensor networks
  Luisa Gargano, Adele A. Rescigno
  Lecture Notes in Computer Science 4162, 2006, pp. 399-411
• Magic numbers in the state hierarchy of finite automata
  Viliam Geffert
  Lecture Notes in Computer Science 4162, 2006, pp. 412-423
• Online single machine batch scheduling
  Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer
  Lecture Notes in Computer Science 4162, 2006, pp. 424-435
• Machines that can output empty words
  Christian Glaßer, Stephen Travers
  Lecture Notes in Computer Science 4162, 2006, pp. 436-446
• Completeness of global evaluation logic
  Sergey Goncharov, Lutz Schröder, Till Mossakowski
  Lecture Notes in Computer Science 4162, 2006, pp. 447-458
• NOF-multiparty information complexity bounds for pointer jumping
  Andre Gronemeier
  Lecture Notes in Computer Science 4162, 2006, pp. 459-470
• Dimension characterizations of complexity classes
  Xiaoyang Gu, Jack H. Lutz
  Lecture Notes in Computer Science 4162, 2006, pp. 471-479
• Approximation algorithms and hardness results for labeled connectivity problems
  Refael Hassin, Jérôme Monnot, Danny Segev
  Lecture Notes in Computer Science 4162, 2006, pp. 480-491
• An expressive temporal logic for real time
  Yoram Hirshfeld, Alexander Rabinovich
  Lecture Notes in Computer Science 4162, 2006, pp. 492-504
• On matroid representability and minor problems
  Petr Hlinȇný
  Lecture Notes in Computer Science 4162, 2006, pp. 505-516
• Non-cooperative tree creation
  Martin Hoefer
  Lecture Notes in Computer Science 4162, 2006, pp. 517-527
• Guarantees for the success frequency of an algorithm for finding Dodgson-election winners
  Christopher M. Homan, Lane A. Hemaspaandra
  Lecture Notes in Computer Science 4162, 2006, pp. 528-539
• Reductions for monotone Boolean circuits
  Kazuo Iwama, Hiroki Morizumi
  Lecture Notes in Computer Science 4162, 2006, pp. 540-548
• Generalised integer programming based on logically defined relations
  Peter Jonsson, Gustav Nordh
  Lecture Notes in Computer Science 4162, 2006, pp. 549-560
• Probabilistic length-reducing automata
  Tomasz Jurdziński
  Lecture Notes in Computer Science 4162, 2006, pp. 561-572
• Sorting long sequences in a single hop radio network
  Marcin Kik
  Lecture Notes in Computer Science 4162, 2006, pp. 573-583