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

• The resource allocation problem in flexible manufacturing systems
  J.M. Colom
  Lecture Notes in Computer Science 2679, 2003, pp. 23-35
• Colored GSPN models for the QoS design of Internet subnets
  M. Ajmone Marsan, M. Garetto, R. Lo Cigno, M. Meo
  Lecture Notes in Computer Science 2679, 2003, pp. 36-36
• Compositional theories of qualitative and quantitative behaviour
  Ed Brinksma
  Lecture Notes in Computer Science 2679, 2003, pp. 37-42
• Net models supporting human and humane behaviors
  C.A. Ellis
  Lecture Notes in Computer Science 2679, 2003, pp. 43-43
• Nets enriched over closed monoidal structures
  Eric Badouel, Jules Chenou
  Lecture Notes in Computer Science 2679, 2003, pp. 64-81
• A proposal for structuring Petri net-based agent interaction protocols
  Lawrence Cabac, Daniel Moldt, Heiko Rölke
  Lecture Notes in Computer Science 2679, 2003, pp. 102-120
• Modular system development with pullbacks
  Marek Bednarczyk, Luca Bernardinello, Benoît Caillaud, Wiesƚaw Pawƚowski, Lucia Pomello
  Lecture Notes in Computer Science 2679, 2003, pp. 140-160
• On the use of Petri nets for the computation of completion time distribution for short TCP transfers
  R. Gaeta, M. Gribaudo, D. Manini, M. Sereno
  Lecture Notes in Computer Science 2679, 2003, pp. 181-200
• Reactive Petri nets for workflow modeling
  Rik Eshuis, Juliane Dehnert
  Lecture Notes in Computer Science 2679, 2003, pp. 296-315
• Hierarchical timed high level nets and their branching processes
  Hans Fleischhack, Elisabeth Pelz
  Lecture Notes in Computer Science 2679, 2003, pp. 397-416
• Prototyping object oriented specifications
  Ali Al-Shabibi, Didier Buchs, Mathieu Buffo, Stanislav Chachkov, Ang Chen, David Hurzeler
  Lecture Notes in Computer Science 2679, 2003, pp. 473-482
• The Petri Net Markup Language: Concepts, technology, and tools
  Jonathan Billington, Sren Christensen, Kees van Hee, Ekkart Kindler, Olaf Kummer, Laure Petrucci, Reinier Post, Christian Stehno, Michael Weber
  Lecture Notes in Computer Science 2679, 2003, pp. 483-505
• Multiple genome alignment: Chaining algorithms revisited
  Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
  Lecture Notes in Computer Science 2676, 2003, pp. 1-16
• Two-dimensional pattern matching with rotations
  Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps
  Lecture Notes in Computer Science 2676, 2003, pp. 17-31
• An improved algorithm for generalized comparison of minisatellites
  Behshad Behzadi, Jean-Marc Steyaert
  Lecture Notes in Computer Science 2676, 2003, pp. 32-41
• Optimal spaced seeds for hidden Markov models, with application to homologous coding regions
  Bron̑a Brejová, Daniel G. Brown, Tomás̑ Vinaȓ
  Lecture Notes in Computer Science 2676, 2003, pp. 42-54
• Fast lightweight suffix array construction and checking
  Stefan Burkhardt, Juha Kärkkäinen
  Lecture Notes in Computer Science 2676, 2003, pp. 55-69
• Distributed and paged suffix trees for large genetic databases
  Raphaël Clifford, Marek Sergot
  Lecture Notes in Computer Science 2676, 2003, pp. 70-82
• Analysis of tree edit distance algorithms
  Serge Dulucq, Hélène Touzet
  Lecture Notes in Computer Science 2676, 2003, pp. 83-95
• An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees
  Olivier Elemento, Olivier Gascuel
  Lecture Notes in Computer Science 2676, 2003, pp. 96-108
• Average-optimal multiple approximate string matching
  Kimmo Fredriksson, Gonzalo Navarro
  Lecture Notes in Computer Science 2676, 2003, pp. 109-128
• Efficient update strategies for geometric computing with uncertainty
  Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman
  Lecture Notes in Computer Science 2653, 2003, pp. 12-23
• An improved algorithm for point set pattern matching under rigid motion
  Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya
  Lecture Notes in Computer Science 2653, 2003, pp. 36-45
• The relative worst order ratio for on-line algorithms
  Joan Boyar, Lene M. Favrholdt
  Lecture Notes in Computer Science 2653, 2003, pp. 58-69
• On-line stream merging, max span, and min coverage
  Wun-Tat Chan, Tak-Wah Lam, Hing-Fung Ting, Prudence W.H. Wong
  Lecture Notes in Computer Science 2653, 2003, pp. 70-82