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

• Structuring and modularizing algebraic specifications: The PLUSS specification language, evolutions and perspectives
  Marie-Claude Gaudel
  Lecture Notes in Computer Science 577, 1992, pp. 3-18
• The parallel complexity of tree embedding problems
  Arvind Gupta, Naomi Nishimura
  Lecture Notes in Computer Science 577, 1992, pp. 21-32
• A theory of strict \P-completeness
  Anne Condon
  Lecture Notes in Computer Science 577, 1992, pp. 33-44
• Fast and optimal simulations between CRCW PRAMs
  Torben Hagerup
  Lecture Notes in Computer Science 577, 1992, pp. 45-56
• Suitability of the propositional temporal logic to express properties of real-time systems
  Eric Nassor, Guy Vidal-Naquet
  Lecture Notes in Computer Science 577, 1992, pp. 59-70
• Axiomatizations of backtracking
  Michel Billaud
  Lecture Notes in Computer Science 577, 1992, pp. 71-82
• Joining k- and l-recognizable sets of natural numbers
  Roger Villemaire
  Lecture Notes in Computer Science 577, 1992, pp. 83-94
• On the performance of networks with multiple busses
  Friedhelm Meyer auf der Heide, Hieu Thien Pham
  Lecture Notes in Computer Science 577, 1992, pp. 97-108
• Efficient algorithms for solving systems of linear equations and path problems
  Venkatesh Radhakrishnan, Harry B. Hunt III, Richard E. Stearns
  Lecture Notes in Computer Science 577, 1992, pp. 109-119
• Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition
  Lawrence L. Larmore, Wojciech Rytter
  Lecture Notes in Computer Science 577, 1992, pp. 121-132
• A simplified technique for hidden-line elimination in terrains
  Franco P. Preparata, Jeffrey Scott Vitter
  Lecture Notes in Computer Science 577, 1992, pp. 135-146
• A competitive analysis of nearest neighbor based algorithms for searching unknown scenes
  Bala Kalyanasundaram, Kirk Pruhs
  Lecture Notes in Computer Science 577, 1992, pp. 147-157
• Equality and disequality constraints on direct subterms in tree automata
  B. Bogaert, S. Tison
  Lecture Notes in Computer Science 577, 1992, pp. 161-171
• Deterministic regular languages
  Anne Brüggemann-Klein, Derick Wood
  Lecture Notes in Computer Science 577, 1992, pp. 173-184
• The extended low hierarchy is an infinite hierarchy
  Ming-Jye Sheu, Timothy J. Long
  Lecture Notes in Computer Science 577, 1992, pp. 187-198
• Locally definable acceptance types for polynomial time machines
  Ulrich Hertrampf
  Lecture Notes in Computer Science 577, 1992, pp. 199-207
• The theory of the polynomial many-one degrees of recursive sets is undecidable
  Klaus Ambos-Spies, André Nies
  Lecture Notes in Computer Science 577, 1992, pp. 209-218
• A plane-sweep algorithm for finding a closest pair among convex planar objects
  Frank Bartling, Klaus Hinrichs
  Lecture Notes in Computer Science 577, 1992, pp. 221-232
• Linear approximation of simple objects
  Jean-Marc Robert, Godfried Toussaint
  Lecture Notes in Computer Science 577, 1992, pp. 233-244
• Language learning without overgeneralization
  Shyam Kapur, Gianfranco Bilardi
  Lecture Notes in Computer Science 577, 1992, pp. 245-256
• The log-star revolution
  Torben Hagerup
  Lecture Notes in Computer Science 577, 1992, pp. 259-278
• Separating counting communication complexity classes
  Carsten Damm, Matthias Krause, Christoph Meinel, Stephen Waack
  Lecture Notes in Computer Science 577, 1992, pp. 281-292
• A nonlinear lower bound on the practical combinatorial complexity
  Xaver Gubás, Juraj Hromkovic̑, Juraj Waczulik
  Lecture Notes in Computer Science 577, 1992, pp. 293-302
• Characterizations of some complexity classes between \Theta^p_n and \Delta^p_2
  Jorge Castro, Carlos Seara
  Lecture Notes in Computer Science 577, 1992, pp. 305-317
• On complexity classes and algorithmically random languages
  Ronald V. Book, Jack H. Lutz, Klaus W. Wagner
  Lecture Notes in Computer Science 577, 1992, pp. 319-328