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

• Fairness in context-free grammars under canonical derivations
  Sera Porat, Nissim Francez
  Lecture Notes in Computer Science 182, 1985, pp. 255-266
• Distributed termination in CSP: Symmetric solutions with minimal storage
  Jean-Luc Richier
  Lecture Notes in Computer Science 182, 1985, pp. 267-278
• A dynamization of the all pairs least cost path problem
  Hans Rohnert
  Lecture Notes in Computer Science 182, 1985, pp. 279-286
• Boundedness, empty channel detection and synchronization for communicating finite state machines
  Louis E. Rosier, Hsu-Chun Yen
  Lecture Notes in Computer Science 182, 1985, pp. 287-298
• Deriving stack semantics congruent to standard denotational semantics
  Véronique Royer
  Lecture Notes in Computer Science 182, 1985, pp. 299-309
• Translating polygons in the plane
  Jörg R. Sack, Godfried T. Toussaint
  Lecture Notes in Computer Science 182, 1985, pp. 310-321
• Geometric containment is not reducible to Pareto dominance
  N. Santoro, J.B. Sidney, S.J. Sidney, J.B. Urrutia
  Lecture Notes in Computer Science 182, 1985, pp. 322-327
• The volume of the union of many spheres and point inclusion problems
  Paul G. Spirakis
  Lecture Notes in Computer Science 182, 1985, pp. 328-338
• Combined simplicity and immunity in relativized NP
  Leen Torenvliet, Peter van Emde Boas
  Lecture Notes in Computer Science 182, 1985, pp. 339-350
• Groups, codes and unambiguous automata
  Pascal Weil
  Lecture Notes in Computer Science 182, 1985, pp. 351-362
• Reduced memory space for multi-dimensional search trees
  Dan E. Willard
  Lecture Notes in Computer Science 182, 1985, pp. 363-374