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 YEAR=2006

• Shared-variable concurrency: A proposal
  Gérard Boudol
  Lecture Notes in Computer Science 4337, 2006, pp. 1-3
• Normal and feature approximations from noisy point clouds
  Tamal Dey, Jian Sun
  Lecture Notes in Computer Science 4337, 2006, pp. 21-32
• Self-assemblying classes of shapes with a minimum number of tiles, and in optimal time
  Florent Becker, Ivan Rapaport, Éric Rémila
  Lecture Notes in Computer Science 4337, 2006, pp. 45-56
• One-input-face MPCVP is hard for L, but in LogDCFL
  Tanmoy Chakraborty, Samir Datta
  Lecture Notes in Computer Science 4337, 2006, pp. 57-68
• Multi-stack boundary labeling problems
  Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
  Lecture Notes in Computer Science 4337, 2006, pp. 81-92
• Computing a center-transversal line
  Pankaj K. Agarwal, Sergio Cabello, J. Antoni Sellarès, Micha Sharir
  Lecture Notes in Computer Science 4337, 2006, pp. 93-104
• Fast edge colorings with fixed number of colors to minimize imbalance
  Gruia Calinescu, Michael Pelsmajer
  Lecture Notes in Computer Science 4337, 2006, pp. 117-128
• Zero error list-decoding capacity of the q/(q - 1) channel
  Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan, Prashant Sasatte
  Lecture Notes in Computer Science 4337, 2006, pp. 129-138
• Computationally sound symbolic secrecy in the presence of hash functions
  Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi
  Lecture Notes in Computer Science 4337, 2006, pp. 176-187
• Unbiased rounding of rational matrices
  Benjamin Doerr, Christian Klein
  Lecture Notes in Computer Science 4337, 2006, pp. 200-211
• Testing probabilistic equivalence through reinforcement learning
  Josée Desharnais, François Laviolette, Sami Zhioua
  Lecture Notes in Computer Science 4337, 2006, pp. 236-247
• On decidability of LTL model checking for process rewrite systems
  Laura Bozzelli, Mojmír Kȓetínský, Vojtȇch Ȓehák, Jan Strejc̑ek
  Lecture Notes in Computer Science 4337, 2006, pp. 248-259
• Monitoring of real-time properties
  Andreas Bauer, Martin Leucker, Christian Schallhart
  Lecture Notes in Computer Science 4337, 2006, pp. 260-272
• A proof system for the linear time \mu-calculus
  Christian Dax, Martin Hofmann, Martin Lange
  Lecture Notes in Computer Science 4337, 2006, pp. 273-284
• Tree automata make ordinal theory easy
  Thierry Cachat
  Lecture Notes in Computer Science 4337, 2006, pp. 285-296
• Context-sensitive dependency pairs
  Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas
  Lecture Notes in Computer Science 4337, 2006, pp. 297-308
• Almost optimal strategies in one clock priced timed games
  Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Jacob Illum Rasmussen
  Lecture Notes in Computer Science 4337, 2006, pp. 345-356
• On continuous timed automata with input-determined guards
  Fabrice Chevalier, Deepak D'Souza, Pavithra Prabhakar
  Lecture Notes in Computer Science 4337, 2006, pp. 369-380
• Branching pushdown tree automata
  Rajeev Alur, Swarat Chaudhuri
  Lecture Notes in Computer Science 4337, 2006, pp. 393-404
• Delaunay meshing of surfaces
  Tamal K. Dey
  Lecture Notes in Computer Science 4288, 2006, pp. 2-2
• Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
  Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi
  Lecture Notes in Computer Science 4288, 2006, pp. 3-15
• Optimal algorithms for tower of Hanoi problems with relaxed placement rules
  Yefim Dinitz, Shay Solomon
  Lecture Notes in Computer Science 4288, 2006, pp. 36-47
• Frequency allocation problems for linear cellular networks
  Joseph Wun-Tat Chan, Francis Y.L. Chin, Deshi Ye, Yong Zhang, Hong Zhu
  Lecture Notes in Computer Science 4288, 2006, pp. 61-70
• Approximating tree edit distance through string edit distance
  Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu
  Lecture Notes in Computer Science 4288, 2006, pp. 90-99
• A 6-approximation algorithm for computing smallest common AoN-supertree with application to the reconstruction of Glycan trees
  Kiyoko F. Aoki-Kinoshita, Minoru Kanehisa, Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
  Lecture Notes in Computer Science 4288, 2006, pp. 100-110