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

• StarT-NG: Delivering seamless parallel computing
  Derek Chiou, Boon S. Ang, Robert Greiner, Arvind, James C. Hoe, Michael J. Beckerle, James E. Hicks, Andy Boughton
  Lecture Notes in Computer Science 966, 1995, pp. 101-116
• On the completeness of a proof system for a simple data-parallel programming language
  Luc Bougé, David Cachera
  Lecture Notes in Computer Science 966, 1995, pp. 143-154
• An implementation of race detection and deterministic replay with MPI
  C. Clémençon, J. Fritscher, M.J. Meehan, R. Rühl
  Lecture Notes in Computer Science 966, 1995, pp. 155-166
• Optimal emulation of meshes on meshes of trees
  Alf-Christian Achilles
  Lecture Notes in Computer Science 966, 1995, pp. 193-204
• Tight bounds on parallel list marking
  Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade
  Lecture Notes in Computer Science 966, 1995, pp. 231-242
• Optimal circular arc representations
  Lin Chen
  Lecture Notes in Computer Science 966, 1995, pp. 255-266
• Efficient solutions for mapping parallel programs
  P. Bouvry, J. Chassin de Kergommeaux, D. Trystram
  Lecture Notes in Computer Science 966, 1995, pp. 379-390
• Communication in multicomputers with nonconvex faults
  Suresh Chalasani, Rajendra V. Boppana
  Lecture Notes in Computer Science 966, 1995, pp. 673-684
• Portable software tools for parallel architectures
  Catherine Barnes, Chris Wadsworth
  Lecture Notes in Computer Science 966, 1995, pp. 699-702
• Discrete time process algebra with abstraction
  J.C.M. Baeten, J.A. Bergstra
  Lecture Notes in Computer Science 965, 1995, pp. 1-15
• A duration calculus with infinite intervals
  Zhou Chaochen, Dang Van Hung, Li Xiaoshan
  Lecture Notes in Computer Science 965, 1995, pp. 16-41
• From a concurrent \lambda-calculus to the \pi-calculus
  Roberto M. Amadio, Lone Leth, Bent Thomsen
  Lecture Notes in Computer Science 965, 1995, pp. 106-115
• Rewriting regular inequalities
  Valentin Antimirov
  Lecture Notes in Computer Science 965, 1995, pp. 116-125
• A simple abstract semantics for equational theories
  Gilles Barthe
  Lecture Notes in Computer Science 965, 1995, pp. 126-135
• Processes with multiple entries and exits
  J.A. Bergstra, Gh.Ştefănescu
  Lecture Notes in Computer Science 965, 1995, pp. 136-145
• Efficient rewriting in cograph trace monoids
  Michael Bertol
  Lecture Notes in Computer Science 965, 1995, pp. 146-155
• Effective category and measure in abstract complexity theory
  Cristian Calude, Marius Zimand
  Lecture Notes in Computer Science 965, 1995, pp. 156-170
• About planar Cayley graphs
  Thomas Chaboud
  Lecture Notes in Computer Science 965, 1995, pp. 171-180
• On Condorcet and median points of simple rectilinear polygons
  Victor D. Chepoi, Feodor F. Dragan
  Lecture Notes in Computer Science 965, 1995, pp. 181-190
• Synchronous-asynchronous cellular computations
  S.M. Achasova
  Lecture Notes in Computer Science 964, 1995, pp. 1-6
• Parallel computations and finite automata on semilattices
  Gennady P. Agibalov
  Lecture Notes in Computer Science 964, 1995, pp. 7-15
• Linear Fibonacci forms and parallel algorithms for high dimension arithmetic
  A.V. Anisimov
  Lecture Notes in Computer Science 964, 1995, pp. 16-20
• Cellular-neural computations: Formal model and possible applications
  O.L. Bandman
  Lecture Notes in Computer Science 964, 1995, pp. 21-35
• An efficient verifier of truly concurrent properties
  Alessandro Bianchi, Stefano Coluccini, Pierpaolo Degano, Corrado Priami
  Lecture Notes in Computer Science 964, 1995, pp. 36-50
• cT: An imperative language with parallelizing features supporting the computation model "Autotransformation of the evaluation network"
  Alexey I. Adamovich
  Lecture Notes in Computer Science 964, 1995, pp. 127-141