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

• The complexity of manipulating hierarchically defined sets of rectangles
  Jon Louis Bentley, Thomas Ottmann
  Lecture Notes in Computer Science 118, 1981, pp. 1-15
• The transformational machine: Theme and variations
  Andrei P. Ershov
  Lecture Notes in Computer Science 118, 1981, pp. 16-32
• Probabilistic two-way machines
  Rūsiņs̑ Freivalds
  Lecture Notes in Computer Science 118, 1981, pp. 33-45
• A survey of some recent results on computational complexity in weak theories of arithmetic
  Deborah Joseph, Paul Young
  Lecture Notes in Computer Science 118, 1981, pp. 46-60
• A survey on oracle techniques
  B. Korte, R. Schrader
  Lecture Notes in Computer Science 118, 1981, pp. 61-77
• Time and space bounded complexity classes and bandwidth constrained problems
  Burkhard Monien, Ivan Hal Sudborough
  Lecture Notes in Computer Science 118, 1981, pp. 78-93
• Representations of graphs by means of products and their complexity
  Jaroslav Nes̑etȓil
  Lecture Notes in Computer Science 118, 1981, pp. 94-102
• Parsing strategies: A concise survey
  Anton Nijholt
  Lecture Notes in Computer Science 118, 1981, pp. 103-120
• The art of dynamizing
  Jan van Leeuwen, Mark H. Overmars
  Lecture Notes in Computer Science 118, 1981, pp. 121-131
• Fast parallel computation of polynomials using few processors
  L.G. Valiant, S. Skyum
  Lecture Notes in Computer Science 118, 1981, pp. 132-139
• Generalizations of Petri nets
  Rüdiger Valk
  Lecture Notes in Computer Science 118, 1981, pp. 140-155
• Partial match retrieval in implicit data structures
  Helmut Alt, Kurt Mehlhorn, J. Ian Munro
  Lecture Notes in Computer Science 118, 1981, pp. 156-161
• A characterization of Floyd-provable programs
  H. Andréka, I. Németi, I. Sain
  Lecture Notes in Computer Science 118, 1981, pp. 162-171
• Semantics of CSP via translation into CCS
  Egidio Astesiano, Elena Zucca
  Lecture Notes in Computer Science 118, 1981, pp. 172-182
• More about the ``geography'' of context-free languages
  J. Beauquier, J. Berstel
  Lecture Notes in Computer Science 118, 1981, pp. 183-192
• On the power of algebraic specifications
  J.A. Bergstra, M. Broy, J.V. Tucker, M. Wirsing
  Lecture Notes in Computer Science 118, 1981, pp. 193-204
• An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
  A. Bertoni, M. Brambilla, G. Mauri, N. Sabadini
  Lecture Notes in Computer Science 118, 1981, pp. 205-215
• On the complexity of word problems in certain Thue systems
  R. Book, M. Jantzen, B. Monien, C. Ó'Dúnlaing, C. Wrathall
  Lecture Notes in Computer Science 118, 1981, pp. 216-223
• On the transformation of derivation graphs to derivation trees
  Franz-Josef Brandenburg
  Lecture Notes in Computer Science 118, 1981, pp. 224-233
• Pushdown automata with restricted use of storage symbols
  Andreas Brandstädt
  Lecture Notes in Computer Science 118, 1981, pp. 234-241
• Structured nets
  L.A. Cherkasova, V.E. Kotov
  Lecture Notes in Computer Science 118, 1981, pp. 242-251
• Retraceability, repleteness and busy beaver sets
  Robert P. Daley
  Lecture Notes in Computer Science 118, 1981, pp. 252-261
• Combining T and level-N
  W. Damm, I. Guessarian
  Lecture Notes in Computer Science 118, 1981, pp. 262-270
• On realization and implementation
  H.D. Ehrich
  Lecture Notes in Computer Science 118, 1981, pp. 271-280
• Multiplicative complexity of a bilinear form over a commutative ring
  D.Yu. Grigor'ev
  Lecture Notes in Computer Science 118, 1981, pp. 281-286