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

• Pomset languages of finite step transition systems
  Jean Fanchon, Rémi Morin
  Lecture Notes in Computer Science 5606, 2009, pp. 83-102
• p-semiflow computation with decision diagrams
  Gianfranco Ciardo, Galen Mecham, Emmanuel Paviot-Adet, Min Wan
  Lecture Notes in Computer Science 5606, 2009, pp. 143-162
• Orthomodular lattices in occurrence nets
  Luca Bernardinello, Lucia Pomello, Stefania Rombolà
  Lecture Notes in Computer Science 5606, 2009, pp. 163-182
• Modeling and analysis of transportation networks using Batches Petri nets with controllable batch speed
  Isabel Demongodin
  Lecture Notes in Computer Science 5606, 2009, pp. 204-222
• Oclets - Scenario-based modeling with Petri nets
  Dirk Fahland
  Lecture Notes in Computer Science 5606, 2009, pp. 223-242
• Monotonicity in service orchestrations
  Anne Bouillard, Sidney Rosario, Albert Benveniste, Stefan Haar
  Lecture Notes in Computer Science 5606, 2009, pp. 263-282
• Quasi-distinct parsing and optimal compression methods
  Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko
  Lecture Notes in Computer Science 5577, 2009, pp. 12-25
• Contracted suffix trees: A simple and dynamic text indexing data structure
  Andrzej Ehrenfeucht, Ross McConnell, Sung-Whan Woo
  Lecture Notes in Computer Science 5577, 2009, pp. 41-53
• Reoptimization of the shortest common superstring problem
  Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic̑, Tobias Mömke, Sebastian Seibert, Anna Zych
  Lecture Notes in Computer Science 5577, 2009, pp. 78-91
• An efficient matching algorithm for encoded DNA sequences and binary strings
  Simone Faro, Thierry Lecroq
  Lecture Notes in Computer Science 5577, 2009, pp. 106-115
• Fast searching in packed strings
  Philip Bille
  Lecture Notes in Computer Science 5577, 2009, pp. 116-126
• Online approximate matching with non-local distances
  Raphaël Clifford, Benjamin Sach
  Lecture Notes in Computer Science 5577, 2009, pp. 142-153
• Faster and space-optimal edit distance ``1'' dictionary
  Djamal Belazzougui
  Lecture Notes in Computer Science 5577, 2009, pp. 154-167
• Approximate matching for run-length encoded strings is 3sum-hard
  Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao
  Lecture Notes in Computer Science 5577, 2009, pp. 168-179
• Maximum motif problem in vertex-colored graphs
  Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
  Lecture Notes in Computer Science 5577, 2009, pp. 221-235
• Fast RNA structure alignment for crossing input structures
  Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann
  Lecture Notes in Computer Science 5577, 2009, pp. 236-248
• Sparse RNA folding: Time and space efficient algorithms
  Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson
  Lecture Notes in Computer Science 5577, 2009, pp. 249-262
• Multiple alignment of biological networks: A flexible approach
  Yves-Pol Deniélou, Frédéric Boyer, Alain Viari, Marie-France Sagot
  Lecture Notes in Computer Science 5577, 2009, pp. 263-273
• Graph mining: Patterns, generators and tools
  Christos Faloutsos
  Lecture Notes in Computer Science 5577, 2009, pp. 274-274
• Finding all sorting tandem duplication random loss operations
  Matthias Bernt, Ming-Chiang Chen, Daniel Merkle, Hung-Lung Wang, Kun-Mao Chao, Martin Middendorf
  Lecture Notes in Computer Science 5577, 2009, pp. 301-313
• Average-case analysis of perfect sorting by reversals
  Mathilde Bouvel, Cedric Chauve, Marni Mishna, Dominique Rossin
  Lecture Notes in Computer Science 5577, 2009, pp. 314-325
• Statistical properties of factor oracles
  Jérémie Bourdon, Irena Rusu
  Lecture Notes in Computer Science 5577, 2009, pp. 326-338
• Haplotype inference constrained by plausible haplotype data
  Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances Rosamond, Liat Rozenberg
  Lecture Notes in Computer Science 5577, 2009, pp. 339-352
• A survey of stochastic games with limsup and liminf objectives
  Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger
  Lecture Notes in Computer Science 5556, 2009, pp. 1-15
• Deciding safety properties in infinite-state pi-calculus via behavioural types
  Lucia Acciai, Michele Boreale
  Lecture Notes in Computer Science 5556, 2009, pp. 31-42