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

Suche: Series=LNCS AND YEAR=1995

• Vienna Fortran 90 - An advanced data parallel language
  Siegfried Benkner
  Lecture Notes in Computer Science 964, 1995, pp. 142-156
• COVERS - A tool for the design of real-time concurrent systems
  A.V. Borshchev, Yu.G. Karpov, V.V. Roudakov
  Lecture Notes in Computer Science 964, 1995, pp. 219-233
• New trends in simulation of distributed shared memory architectures
  Luis Barriga, Rassul Ayani
  Lecture Notes in Computer Science 964, 1995, pp. 314-319
• Architectural issues of distributed workflow management systems
  Cristoph Buss̈ler, Stefan Jablonski, Thomas Kirsche, Hans Schuster, Hartmut Wedekind
  Lecture Notes in Computer Science 964, 1995, pp. 370-384
• Parallelization of the solution of 3D Navier-Stokes equations for fluid flow in a cavity with moving covers
  Oleg Bessonov, Valery Brailovskaya, Vadim Polezhaev, Bernhard Roux
  Lecture Notes in Computer Science 964, 1995, pp. 385-399
• Distributing search and knowledge using a coordination language
  P. Ciancarini, P. Mancini
  Lecture Notes in Computer Science 964, 1995, pp. 400-410
• Design and evaluation of a multi-threaded architecture for parallel graph reduction
  Francis Caudal, Bernard Lecussan
  Lecture Notes in Computer Science 964, 1995, pp. 411-426
• Fully abstract models for nondeterministic regular expressions
  Flavio Corradini, Rocco De Nicola, Anna Labella
  Lecture Notes in Computer Science 962, 1995, pp. 130-144
• A Petri net semantics for \pi-calculus
  Nadia Busi, Roberto Gorrieri
  Lecture Notes in Computer Science 962, 1995, pp. 145-159
• Towards a denotational semantics for ET-LOTOS
  Jeremy Bryans, Jim Davies, Steve Schneider
  Lecture Notes in Computer Science 962, 1995, pp. 269-283
• Fair testing
  Ed Brinksma, Arend Rensink, Walter Vogler
  Lecture Notes in Computer Science 962, 1995, pp. 313-327
• Formal methods technology transfer: Impediments and innovation
  Dan Craigen
  Lecture Notes in Computer Science 962, 1995, pp. 328-332
• Decidability of simulation and bisimulation between lossy channel systems and finite state systems
  Parosh Aziz Abdulla, Mats Kindahl
  Lecture Notes in Computer Science 962, 1995, pp. 333-347
• Metric predicate transformers: Towards a notion of refinement for concurrency
  Marcello M. Bonsangue, Joost N. Kok, Erik de Vink
  Lecture Notes in Computer Science 962, 1995, pp. 363-377
• Verifying parameterized networks using abstraction and regular languages
  E.M. Clarke, O. Grumberg, S. Jha
  Lecture Notes in Computer Science 962, 1995, pp. 395-407
• Process semantics of graph reduction
  Simon Brock, Gerald Ostheimer
  Lecture Notes in Computer Science 962, 1995, pp. 471-485
• CTR: A calculus of timed refinement
  Kārlis C̑erāns
  Lecture Notes in Computer Science 962, 1995, pp. 516-530
• Temporal logic + timed automata: Expressiveness and decidability
  Ahmed Bouajjani, Yassine Lakhnech
  Lecture Notes in Computer Science 962, 1995, pp. 531-545
• Strict finitism and feasibility
  Felice Cardone
  Lecture Notes in Computer Science 960, 1995, pp. 1-21
• On parallel hierarchies and R_k^i
  Stephen Bloch
  Lecture Notes in Computer Science 960, 1995, pp. 52-76
• Program extraction from classical proofs
  Ulrich Berger, Helmut Schwichtenberg
  Lecture Notes in Computer Science 960, 1995, pp. 77-97
• Computational models and function algebras
  Peter Clote
  Lecture Notes in Computer Science 960, 1995, pp. 98-130
• Expressing computational complexity in constructive type theory
  Robert L. Constable
  Lecture Notes in Computer Science 960, 1995, pp. 131-144
• On Herbrand's theorem
  Samuel R. Buss
  Lecture Notes in Computer Science 960, 1995, pp. 195-209
• Characterizing parallel time by type 2 recursions with polynomial output length
  Stephen J. Bellantoni
  Lecture Notes in Computer Science 960, 1995, pp. 253-268