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 Volume=480

• Polymorphism, parameterization and typing: An algebraic specification perspective
  Jacek Leszczyƚowski, Martin Wirsing
  Lecture Notes in Computer Science 480, 1991, pp. 1-15
• Executable higher-order algebraic specifications
  Jean-Pierre Jouannaud
  Lecture Notes in Computer Science 480, 1991, pp. 16-25
• Efficient memory access in large-scale computation
  Jeffrey S. Vitter
  Lecture Notes in Computer Science 480, 1991, pp. 26-41
• l-occurrences of avoidable patterns
  Peter Roth
  Lecture Notes in Computer Science 480, 1991, pp. 42-49
• Rational relations with bounded delay
  Christiane Frougny, Jacques Sakarovitch
  Lecture Notes in Computer Science 480, 1991, pp. 50-63
• On the power of several queues
  Martin Schmidt
  Lecture Notes in Computer Science 480, 1991, pp. 64-75
• On aperiodic trace languages
  Giovanna Guaiana, Antonio Restivo, Sergio Salemi
  Lecture Notes in Computer Science 480, 1991, pp. 76-88
• Recognizable and rational languages of finite and infinite traces
  Paul Gastin
  Lecture Notes in Computer Science 480, 1991, pp. 89-104
• On the concatenation of infinite traces
  Volker Diekert
  Lecture Notes in Computer Science 480, 1991, pp. 105-117
• Tight RNC approximations to max flow
  María Serna, Paul Spirakis
  Lecture Notes in Computer Science 480, 1991, pp. 118-126
• A natural metric for curves - computing the distance for polygonal chains and approximation algorithms
  Michael Godau
  Lecture Notes in Computer Science 480, 1991, pp. 127-136
• The worst case complexity of the McDiarmid and Reed's variant of BOTTOM-UP-HEAP SORT is less than n\log n + 1.1n
  Ingo Wegener
  Lecture Notes in Computer Science 480, 1991, pp. 137-147
• Decision problems for term rewriting systems and recognizable tree languages
  Rémi Gilleron
  Lecture Notes in Computer Science 480, 1991, pp. 148-159
• Decidable sentences for context-free groups
  Klaus Madlener, Friedrich Otto
  Lecture Notes in Computer Science 480, 1991, pp. 160-171
• The owner concept for PRAMs
  Peter Rossmanith
  Lecture Notes in Computer Science 480, 1991, pp. 172-183
• Actors as a parallel programming model
  Françoise Baude, Guy Vidal-Naquet
  Lecture Notes in Computer Science 480, 1991, pp. 184-195
• Average case analysis of unification algorithms
  Luc Albert, Rafael Casas, François Fages, Antonio Torrecillas, Paul Zimmermann
  Lecture Notes in Computer Science 480, 1991, pp. 196-213
• Methodology for proving the termination of logic programs
  Bal Wang, Rudraprasad K. Shyamasundar
  Lecture Notes in Computer Science 480, 1991, pp. 214-227
• Polynomial size constant depth circuits with a limited number of negations
  Miklos Santha, Christopher Wilson
  Lecture Notes in Computer Science 480, 1991, pp. 228-237
• Randomized polynomials, threshold circuits, and the polynomial hierarchy
  Jun Tarui
  Lecture Notes in Computer Science 480, 1991, pp. 238-250
• Computationally convincing proofs of knowledge
  Gilles Brassard, Claude Crépeau, Sophie Laplante, Christian Léger
  Lecture Notes in Computer Science 480, 1991, pp. 251-262
• Interactive proof systems and alternating time-space complexity
  Lance Fortnow, Carsten Lund
  Lecture Notes in Computer Science 480, 1991, pp. 263-274
• Optimal tradeoffs between time and bit complexity in distributed synchronous rings
  Bernd Schmeltz
  Lecture Notes in Computer Science 480, 1991, pp. 275-284
• Unconditional Byzantine agreement with good majority
  Birgit Baum-Waidner, Birgit Pfitzmann, Michael Waidner
  Lecture Notes in Computer Science 480, 1991, pp. 285-295
• A new compacting garbage-collection algorithm with a good average-case performance
  Svante Carlsson, Christer Mattsson, Patricio V. Poblete, Mats Bengtsson
  Lecture Notes in Computer Science 480, 1991, pp. 296-308