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

• Hierarchies of one-way multihead automata languages
  M. Chrobak
  Lecture Notes in Computer Science 194, 1985, pp. 101-110
• Partitioning point sets in 4 dimensions
  R. Cole
  Lecture Notes in Computer Science 194, 1985, pp. 111-119
• A completeness theorem for recursively defined types
  M. Coppo
  Lecture Notes in Computer Science 194, 1985, pp. 120-129
• Categorical combinatory logic
  P.-L. Curien
  Lecture Notes in Computer Science 194, 1985, pp. 130-139
• Towards a uniform topological treatment of streams and functions on streams
  J.W. de Bakker, J.N. Kok
  Lecture Notes in Computer Science 194, 1985, pp. 140-148
• Infinite streams and finite observations in the semantics of uniform concurrency
  J.W. de Bakker, J.-J.C. Meyer, E.-R. Olderog
  Lecture Notes in Computer Science 194, 1985, pp. 149-157
• Imposed-functional dependencies inducing horizontal decompositions
  P. de Bra
  Lecture Notes in Computer Science 194, 1985, pp. 158-170
• Characterization of high level tree transducers
  J. Engelfriet, H. Vogler
  Lecture Notes in Computer Science 194, 1985, pp. 171-178
• Ambiguity and transcendence
  P. Flajolet
  Lecture Notes in Computer Science 194, 1985, pp. 179-188
• A fast algorithm for polygon containment by translation
  S.J. Fortune
  Lecture Notes in Computer Science 194, 1985, pp. 189-198
• Deterministic and Las Vegas primality testing algorithms
  M. Fürer
  Lecture Notes in Computer Science 194, 1985, pp. 199-209
• Efficient algorithms for graphic matroid intersection and parity
  H.N. Gabow, M. Stallmann
  Lecture Notes in Computer Science 194, 1985, pp. 210-220
• Operational semantics for order-sorted algebra
  J.A. Goguen, J.-P. Jouannaud, J. Meseguer
  Lecture Notes in Computer Science 194, 1985, pp. 221-231
• A universal domain technique for profinite posets
  C.A. Gunter
  Lecture Notes in Computer Science 194, 1985, pp. 232-243
• A simple proof of the Skolem-Mahler-Lech theorem
  G. Hansel
  Lecture Notes in Computer Science 194, 1985, pp. 244-249
• On complete problems for NP\cap coNP
  J. Hartmanis, N. Immerman
  Lecture Notes in Computer Science 194, 1985, pp. 250-259
• An algebraic theory of fair asynchronous communicating processes
  M. Hennessy
  Lecture Notes in Computer Science 194, 1985, pp. 260-269
• Hoare's logic for nondeterministic regular programs: A nonstandard completeness theorem
  T. Hortalá-González, M. Rodriguez-Artalejo
  Lecture Notes in Computer Science 194, 1985, pp. 270-280
• Powerdomains as algebraic lattices
  K. Hrbacek
  Lecture Notes in Computer Science 194, 1985, pp. 281-289
• Random generation of combinatorial structures from a uniform distribution
  M. Jerrum
  Lecture Notes in Computer Science 194, 1985, pp. 290-299
• On probabilistic time and space
  H. Jung
  Lecture Notes in Computer Science 194, 1985, pp. 310-317
• The nearest neighbor problem on bounded domains
  R.G. Karlsson, J.I. Munro, E.L. Robertson
  Lecture Notes in Computer Science 194, 1985, pp. 318-327
• Routing through a generalized switchbox
  M. Kaufmann, K. Mehlhorn
  Lecture Notes in Computer Science 194, 1985, pp. 328-337
• On k-repetition free words generated by length uniform morphisms over a binary alphabet
  V. Keränen
  Lecture Notes in Computer Science 194, 1985, pp. 338-347
• Every commutative quasirational language is regualar
  J. Kortelainen
  Lecture Notes in Computer Science 194, 1985, pp. 348-355