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 YEAR=1991

• The Gauß lattice basis reduction algorithm succeeds with any norm
  Michael Kaib
  Lecture Notes in Computer Science 529, 1991, pp. 275-286
• Regularity of one-letter languages acceptable by 2-way finite probabilistic automata
  Jānis Kaņeps
  Lecture Notes in Computer Science 529, 1991, pp. 287-296
• On the semantics of atomized statements - the parallel-choice option
  Peter Knijnenburg, Joost N. Kok
  Lecture Notes in Computer Science 529, 1991, pp. 297-306
• Delays in synchronized elementary net systems
  Charles André
  Lecture Notes in Computer Science 524, 1991, pp. 1-28
• Proving temporal properties of Petri nets
  J.C. Bradfield
  Lecture Notes in Computer Science 524, 1991, pp. 29-47
• The complexity of testing the equivalence of transition sequences
  Heino Carstensen
  Lecture Notes in Computer Science 524, 1991, pp. 48-57
• Use of reentrant nets in modular analysis of colored nets
  Ghassan Chehaibar
  Lecture Notes in Computer Science 524, 1991, pp. 58-77
• On abstraction of nets
  Jörg Desel
  Lecture Notes in Computer Science 524, 1991, pp. 78-92
• Semantics, composition and net properties of algebraic high-level nets
  Cristian Dimitrovici, Udo Hummert, Laure Petrucci
  Lecture Notes in Computer Science 524, 1991, pp. 93-117
• Top-down synthesis of live and bounded free choice nets
  Javier Esparza, Manuel Silva
  Lecture Notes in Computer Science 524, 1991, pp. 118-139
• Distributable nets
  R.P. Hopkins
  Lecture Notes in Computer Science 524, 1991, pp. 161-187
• Computer supported design of Kanban controlled production
  F. Itter, C. Relewicz
  Lecture Notes in Computer Science 524, 1991, pp. 188-204
• Optimal simulations, nets and reachibility graphs
  Ryszard Janicki, Maciej Koutny
  Lecture Notes in Computer Science 524, 1991, pp. 205-226
• Strong conjunction and intersection types
  Fabio Alessi, Franco Barbanera
  Lecture Notes in Computer Science 520, 1991, pp. 64-73
• Partial higher-order specifications
  Egidio Astesiano, Maura Cerioli
  Lecture Notes in Computer Science 520, 1991, pp. 74-83
• Unification in incompletely specified theories. A case study
  Staffan Bonnier
  Lecture Notes in Computer Science 520, 1991, pp. 84-92
• Observing localities
  G. Boudol, I. Castellani, M. Hennessy, A. Kiehn
  Lecture Notes in Computer Science 520, 1991, pp. 93-102
• Abstract dynamic data types: A temporal logic approach
  Gerardo Costa, Gianna Reggio
  Lecture Notes in Computer Science 520, 1991, pp. 103-112
• Generating words by cellular automata
  Anton C̑erný
  Lecture Notes in Computer Science 520, 1991, pp. 113-120
• Atomic refinement in process description languages
  Pierpaolo Degano, Roberto Gorrieri
  Lecture Notes in Computer Science 520, 1991, pp. 121-130
• Recognizable complex trace languages
  Volker Diekert, Paul Gastin, Antoine Petit
  Lecture Notes in Computer Science 520, 1991, pp. 131-140
• Solving systems of linear diophantine equations: An algebraic approach
  Eric Domenjoud
  Lecture Notes in Computer Science 520, 1991, pp. 141-150
• A second-order pattern matching algorithm for the cube of typed \lambda-calculi
  Gilles Dowek
  Lecture Notes in Computer Science 520, 1991, pp. 151-160
• The lazy call-by-value \lambda-calculus
  Lavinia Egidi, Furio Honsell, Simona Ronchi della Roca
  Lecture Notes in Computer Science 520, 1991, pp. 161-169
• The limit of \mbox{split}_n-bisimulations for CCS agents
  Roberto Gorrieri, Cosimo Laneve
  Lecture Notes in Computer Science 520, 1991, pp. 170-180