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

• Causal and distributed semantics for concurrent
  Ilaria Castellani
  Lecture Notes in Computer Science 665, 1993, pp. 1
• The alternation hierarchy for sublogarithmic space: An exciting race to STACS'93 (editorial note)
  Klaus W. Wagner
  Lecture Notes in Computer Science 665, 1993, pp. 2-4
• Alternation for two-way machines with sublogarithmic space
  Burchard von Braunmühl
  Lecture Notes in Computer Science 665, 1993, pp. 5-15
• Separating the lower levels of the sublogarithmic space hierarchy
  Maciej Liśkiewicz, Rüdiger Reischuk
  Lecture Notes in Computer Science 665, 1993, pp. 16-27
• Locating P/poly optimally in the extended low hierarchy
  Johannes Köbler
  Lecture Notes in Computer Science 665, 1993, pp. 28-37
• Measure, stochasticity, and the density of hard languages
  Jack H. Lutz, Elvira Mayordomo
  Lecture Notes in Computer Science 665, 1993, pp. 38-47
• Halting problem of one binary Horn clause is undecidable
  Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier
  Lecture Notes in Computer Science 665, 1993, pp. 48-57
• Decidability and undecidability results for duration calculus
  Zhou Chaochen, Michael R. Hansen, Peter Sestoft
  Lecture Notes in Computer Science 665, 1993, pp. 58-68
• The complexity of logic-based abduction
  Thomas Eiter, Georg Gottlob
  Lecture Notes in Computer Science 665, 1993, pp. 70-79
• Treewidth of chordal bipartite graphs
  T. Kloks, D. Kratsch
  Lecture Notes in Computer Science 665, 1993, pp. 80-89
• On paths in networks with valves
  Ulrich Huckenbeck
  Lecture Notes in Computer Science 665, 1993, pp. 90-99
• Scheduling interval ordered tasks in parallel
  S. Sunder, Xin He
  Lecture Notes in Computer Science 665, 1993, pp. 100-109
• An O(\sqrt n)-worst-case-time solution to the granularity problem
  A. Pietracaprina, F.P. Preparata
  Lecture Notes in Computer Science 665, 1993, pp. 110-119
• The synthesis problem of Petri nets
  Jörg Desel, Wolfgang Reisig
  Lecture Notes in Computer Science 665, 1993, pp. 120-129
• General refinement and recursion operators for the Petri box calculus
  Eike Best, Raymond Devillers, Javier Esparza
  Lecture Notes in Computer Science 665, 1993, pp. 130-140
• On fairness in distributed automated deduction
  Maria Paola Bonacina, Jieh Hsiang
  Lecture Notes in Computer Science 665, 1993, pp. 141-152
• Divide-and-conquer algorithms on the hypercube
  Ernst W. Mayr, Ralph Werchner
  Lecture Notes in Computer Science 665, 1993, pp. 153-162
• A first-order isomorphism theorem
  Eric Allender, José Balcázar, Neil Immerman
  Lecture Notes in Computer Science 665, 1993, pp. 163-174
• Splittings, robustness and structure of complete sets
  Harry Buhrman, Albrecht Hoene, Leen Torenvliet
  Lecture Notes in Computer Science 665, 1993, pp. 175-184
• Defying upward and downward separation
  Lane A. Hemachandra, Sudhir K. Jha
  Lecture Notes in Computer Science 665, 1993, pp. 185-195
• Counting, selecting, and sorting by query-bounded machines
  Albrecht Hoene, Arfst Nickelsen
  Lecture Notes in Computer Science 665, 1993, pp. 196-205
• Cancellation in context-free languages: Enrichment by reduction
  M. Jantzen, H. Petersen
  Lecture Notes in Computer Science 665, 1993, pp. 206-215
• Counting overlap-free binary words
  Julien Cassaigne
  Lecture Notes in Computer Science 665, 1993, pp. 216-225
• The limit set of recognizable substitution systems
  Philippe Narbel
  Lecture Notes in Computer Science 665, 1993, pp. 226-236
• Partially commutative Lyndon words
  D. Krob, P. Lalonde
  Lecture Notes in Computer Science 665, 1993, pp. 237-246