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

• Shared-variable concurrency: A proposal
  Gérard Boudol
  Lecture Notes in Computer Science 4337, 2006, pp. 1-3
• Hennessy-Plotkin-Brookes revisited
  Gordon Plotkin
  Lecture Notes in Computer Science 4337, 2006, pp. 4-4
• Approximation algorithms for 2-stage stochastic optimization problems
  Chaitanya Swamy, David B. Shmoys
  Lecture Notes in Computer Science 4337, 2006, pp. 5-19
• The number of crossing free configurations on finite point sets in the plane
  Emo Welzl
  Lecture Notes in Computer Science 4337, 2006, pp. 20-20
• Normal and feature approximations from noisy point clouds
  Tamal Dey, Jian Sun
  Lecture Notes in Computer Science 4337, 2006, pp. 21-32
• Coresets for discrete integration and clustering
  Sariel Har-Peled
  Lecture Notes in Computer Science 4337, 2006, pp. 33-44
• 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
• Hardness of approximation results for the problem of finding the stopping distance in Tanner graphs
  K. Murali Krishnan, L. Sunil Chandran
  Lecture Notes in Computer Science 4337, 2006, pp. 69-80
• 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
• On obtaining pseudorandomness from error-correcting codes
  Shankar Kalyanaraman, Christopher Umans
  Lecture Notes in Computer Science 4337, 2006, pp. 105-116
• 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
• Fast exponential algorithms for maximum r-regular induced subgraph problems
  Sushmita Gupta, Venkatesh Raman, Saket Saurabh
  Lecture Notes in Computer Science 4337, 2006, pp. 139-151
• Solving connected dominating set faster than 2^n
  Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
  Lecture Notes in Computer Science 4337, 2006, pp. 152-163
• Linear-time algorithms for two subtree-comparison problems on phylogenetic trees with different species
  Sun-Yuan Hsieh
  Lecture Notes in Computer Science 4337, 2006, pp. 164-175
• 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
• Some results on average-case hardness within the polynomial hierarchy
  A. Pavan, Rahul Santhanam, N.V. Vinodchandran
  Lecture Notes in Computer Science 4337, 2006, pp. 188-199
• Unbiased rounding of rational matrices
  Benjamin Doerr, Christian Klein
  Lecture Notes in Computer Science 4337, 2006, pp. 200-211
• Rational behaviour and strategy construction in infinite multiplayer games
  Michael Ummels
  Lecture Notes in Computer Science 4337, 2006, pp. 212-223
• The anatomy of innocence revisited
  Russ Harmer, Olivier Laurent
  Lecture Notes in Computer Science 4337, 2006, pp. 224-235
• 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