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

• Algorithms for energy management
  Susanne Albers
  Lecture Notes in Computer Science 6072, 2010, pp. 1-11
• Sofic and almost of finite type tree-shifts
  Nathalie Aubrun, Marie-Pierre Béal
  Lecture Notes in Computer Science 6072, 2010, pp. 12-24
• Proof-based design of security protocols
  Nazim Benaissa, Dominique Méry
  Lecture Notes in Computer Science 6072, 2010, pp. 25-36
• Approximating the minimum length of synchronizing words is hard
  Mikhail V. Berlinkov
  Lecture Notes in Computer Science 6072, 2010, pp. 37-47
• Realizability of dynamic MSC languages
  Benedikt Bollig, Loïc Hélouët
  Lecture Notes in Computer Science 6072, 2010, pp. 48-59
• The MAX QUASI-INDEPENDENT SET problem
  N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, V.Th. Paschos, O. Pottié
  Lecture Notes in Computer Science 6072, 2010, pp. 60-71
• Equilibria in quantitative reachability games
  Thomas Brihaye, Véronique Bruyère, Julie De Pril
  Lecture Notes in Computer Science 6072, 2010, pp. 72-83
• Quotient complexity of closed languages
  Janusz Brzozowski, Galina Jirásková, Chenglong Zou
  Lecture Notes in Computer Science 6072, 2010, pp. 84-95
• Right-sequential functions on infinite words
  Olivier Carton
  Lecture Notes in Computer Science 6072, 2010, pp. 96-106
• Kernelization
  Fedor V. Fomin
  Lecture Notes in Computer Science 6072, 2010, pp. 107-108
• Zigzags in Turing machines
  Anahí Gajardo, Pierre Guillon
  Lecture Notes in Computer Science 6072, 2010, pp. 109-119
• Frameworks for logically classifying polynomial-time optimisation problems
  James Gate, Iain A. Stewart
  Lecture Notes in Computer Science 6072, 2010, pp. 120-131
• Validating the Knuth-Morris-Pratt failure function, fast and online
  Paweƚ Gawrychowski, Artur Jeż, Łukasz Jeż
  Lecture Notes in Computer Science 6072, 2010, pp. 132-143
• Identical relations in symmetric groups and separating words with reversible automata
  R.A. Gimadeev, M.N. Vyalyi
  Lecture Notes in Computer Science 6072, 2010, pp. 144-155
• Time optimal d-list colouring of a graph
  Nick Gravin
  Lecture Notes in Computer Science 6072, 2010, pp. 156-168
• The cantor space as a generic model of topologically presented knowledge
  Bernhard Heinemann
  Lecture Notes in Computer Science 6072, 2010, pp. 169-180
• Algorithmics - Is there hope for a unified theory?
  Juraj Hromkovic̑
  Lecture Notes in Computer Science 6072, 2010, pp. 181-194
• Classifying rankwidth k-DH-graphs
  Ling-Ju Hung, Ton Kloks
  Lecture Notes in Computer Science 6072, 2010, pp. 195-203
• Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms
  Dmitry Itsykson
  Lecture Notes in Computer Science 6072, 2010, pp. 204-215
• A SAT based effective algorithm for the directed Hamiltonian cycle problem
  Gerold Jäger, Weixiong Zhang
  Lecture Notes in Computer Science 6072, 2010, pp. 216-227
• Balancing bounded treewidth circuits
  Maurice Jansen, Jayalal Sarma M.N.
  Lecture Notes in Computer Science 6072, 2010, pp. 228-239
• Obtaining online ecological colourings by generalizing first-fit
  Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck
  Lecture Notes in Computer Science 6072, 2010, pp. 240-251
• Classical simulation and complexity of quantum computations
  Richard Jozsa
  Lecture Notes in Computer Science 6072, 2010, pp. 252-258
• Prefix-free and prefix-correct complexities with compound conditions
  Elena Kalinina
  Lecture Notes in Computer Science 6072, 2010, pp. 259-265
• Monotone complexity of a pair
  Pavel Karpovich
  Lecture Notes in Computer Science 6072, 2010, pp. 266-275