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

• Some new effectivity bounds in computational geometry
  Léandro Caniglia, André Galligo, Joos Heintz
  Lecture Notes in Computer Science 357, 1988, pp. 131-152
• An environment for object-oriented conceptual programming based on PROT nets
  M. Baldassari, G. Bruno
  Lecture Notes in Computer Science 340, 1988, pp. 1-19
• OBJSA nets: a class of high-level nets having objects as domains
  E. Battiston, F. de Cindio, G. Mauri
  Lecture Notes in Computer Science 340, 1988, pp. 20-43
• On internal and external characterizations of PT-net building block behaviour
  B. Baumgarten
  Lecture Notes in Computer Science 340, 1988, pp. 44-61
• Timed Petri net schedules
  J. Carlier, P. Chretienne
  Lecture Notes in Computer Science 340, 1988, pp. 62-84
• An exercise in concurrency: a CSP process as a condition/event system
  P. Degano, R. Gorrieri, S. Marchetti
  Lecture Notes in Computer Science 340, 1988, pp. 85-105
• A survey on the decidability questions for classes of FIFO nets
  A. Finkel, L. Rosier
  Lecture Notes in Computer Science 340, 1988, pp. 106-132
• The construction of EN systems from a given trace behaviour
  P. Graubmann
  Lecture Notes in Computer Science 340, 1988, pp. 133-153
• Programming a closely coupled multiprocessor system with high level Petri nets
  G. Hartung
  Lecture Notes in Computer Science 340, 1988, pp. 154-174
• Music description and processing by Petri nets
  G. Haus, A. Rodriguez
  Lecture Notes in Computer Science 340, 1988, pp. 175-199
• On questions of fairness and temporal logic for conflict-free Petri nets
  R.R. Howell, L.E. Rosier
  Lecture Notes in Computer Science 340, 1988, pp. 200-226
• Infinitary partial Petri net languages and their relationship to other Petri net semantics
  A. Kiehn
  Lecture Notes in Computer Science 340, 1988, pp. 227-248
• Net representation of sentences in natural languages
  V. Koseska-Toszewa, A. Mazurkiewicz
  Lecture Notes in Computer Science 340, 1988, pp. 249-265
• Some consequences of the decidability of the reachability problem for Petri nets
  J.L. Lambert
  Lecture Notes in Computer Science 340, 1988, pp. 266-282
• Experiences in the use of Galileo to design telecommunication systems
  I. Lopez, M.C. Palaez
  Lecture Notes in Computer Science 340, 1988, pp. 283-306
• Compositional semantics of pure place/transition systems
  A. Mazurkiewicz
  Lecture Notes in Computer Science 340, 1988, pp. 307-330
• Occurrence traces: processes of elementary net systems
  E. Ochmański
  Lecture Notes in Computer Science 340, 1988, pp. 331-342
• On the generation of organizational architectures using Petri nets
  P.A. Remy, A.H. Levis
  Lecture Notes in Computer Science 340, 1988, pp. 371-385
• On the computation of structural synchronic invariants in P/T nets
  M. Silva, J.M. Colom
  Lecture Notes in Computer Science 340, 1988, pp. 386-417
• Linear broadcast routing
  Ching-Tsun Chou, Inder S. Gopal
  Lecture Notes in Computer Science 338, 1988, pp. 122
• Planar point location revisited (A guided tour of a decade of research)
  Franco P. Preparata
  Lecture Notes in Computer Science 338, 1988, pp. 1-17
• Computing a viewpoint of a set of points inside a polygon
  Subir Kumar Ghosh
  Lecture Notes in Computer Science 338, 1988, pp. 18-29
• Analysis of preflow push algorithms for maximum network flow
  Joseph Cheriyan, S.N. Maheshwari
  Lecture Notes in Computer Science 338, 1988, pp. 30-48
• A new linear algorithm for the two path problem on chordal graphs
  S.V. Krishnan, C. Pandu Rangan, S. Seshadri
  Lecture Notes in Computer Science 338, 1988, pp. 49-66
• Extending planar graph algorithms to K_{3,3}-free graphs
  Samir Khuller
  Lecture Notes in Computer Science 338, 1988, pp. 67-79