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

Suche: Series=LNCS AND YEAR=2005

• On the application of evolutionary algorithms to the consensus tree problem
  Carlos Cotta
  Lecture Notes in Computer Science 3448, 2005, pp. 58-67
• Analyzing fitness landscapes for the optimal Golomb Ruler Problem
  Carlos Cotta, Antonio J. Fernández
  Lecture Notes in Computer Science 3448, 2005, pp. 68-79
• Immune algorithms with aging operators for the string folding problem and the protein folding problem
  V. Cutello, G. Morelli, G. Nicosia, M. Pavone
  Lecture Notes in Computer Science 3448, 2005, pp. 80-90
• Multiobjective quadratic assignment problem solved by an explicit building block search algorithm - MOMGA-IIa
  Richard O. Day, Gary B. Lamont
  Lecture Notes in Computer Science 3448, 2005, pp. 91-100
• Introduction
  Ulrik Brandes, Thomas Erlebach
  Lecture Notes in Computer Science 3418, 2005, pp. 1-6
• Fundamentals
  Ulrik Brandes, Thomas Erlebach
  Lecture Notes in Computer Science 3418, 2005, pp. 7-15
• Network statistics
  Michael Brinkmeier, Thomas Schank
  Lecture Notes in Computer Science 3418, 2005, pp. 293-317
• Network comparison
  Michael Baur, Marc Benkert
  Lecture Notes in Computer Science 3418, 2005, pp. 318-340
• Network models
  Nadine Baumann, Sebastian Stiller
  Lecture Notes in Computer Science 3418, 2005, pp. 341-372
• Spectral analysis
  Andreas Baltz, Lasse Kliemann
  Lecture Notes in Computer Science 3418, 2005, pp. 373-416
• Object connectivity and full abstraction for a concurrent calculus of classes
  Erika Ábrahám, Marcello M. Bonsangue, Frank S. de Boer, Martin Steffen
  Lecture Notes in Computer Science 3407, 2005, pp. 37-51
• Specifying software connectors
  Marco Antonio Barbosa, Luís Soares Barbosa
  Lecture Notes in Computer Science 3407, 2005, pp. 52-67
• Minimal spanning set for coverage testing of interactive systems
  Fevzi Belli, Christof J. Budnik
  Lecture Notes in Computer Science 3407, 2005, pp. 220-234
• An approach to integration testing based on data flow specifications
  Yuting Chen, Shaoying Liu, Fumiko Nagoya
  Lecture Notes in Computer Science 3407, 2005, pp. 235-249
• Combining algebraic and model-based test case generation
  Li Dan, Bernhard K. Aichernig
  Lecture Notes in Computer Science 3407, 2005, pp. 250-264
• Symbolic and parametric model checking of discrete-time Markov chains
  Conrado Daws
  Lecture Notes in Computer Science 3407, 2005, pp. 280-294
• An algebraic approach for codesign
  Marc Aiguier, Stefan Béroff, Pierre-Yves Schobbens
  Lecture Notes in Computer Science 3407, 2005, pp. 415-430
• Duration calculus: A real-time semantic for B
  Samuel Colin, Georges Mariano, Vincent Poirriez
  Lecture Notes in Computer Science 3407, 2005, pp. 431-446
• Switched probabilistic I/0 automata
  Ling Cheung, Nancy Lynch, Roberto Segala, Frits Vaandrager
  Lecture Notes in Computer Science 3407, 2005, pp. 494-510
• Automorphisms of finite rings and applications to complexity of problems
  Manindra Agrawal, Nitin Saxena
  Lecture Notes in Computer Science 3404, 2005, pp. 1-17
• Algebraic generating functions in enumerative combinatorics and context-free languages
  Mireille Bousquet-Mélou
  Lecture Notes in Computer Science 3404, 2005, pp. 18-35
• Truthful approximation mechanisms for scheduling selfish related machines
  Nir Andelman, Yossi Azar, Motti Sorani
  Lecture Notes in Computer Science 3404, 2005, pp. 69-82
• The variable hierarchy of the \mu-calculus is strict
  Dietmar Berwanger, Giacomo Lenzi
  Lecture Notes in Computer Science 3404, 2005, pp. 97-109
• The core of a countably categorical structure
  Manuel Bodirsky
  Lecture Notes in Computer Science 3404, 2005, pp. 110-120
• On the decidability of temporal properties of probabilistic pushdown automata
  Tomás̑ Brázdil, Antonín Kuc̑era, Oldȓich Straz̑ovský
  Lecture Notes in Computer Science 3404, 2005, pp. 145-157