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 [1]	Hilfe

Suche: Series=LNCS AND Volume=194

• Vertex packing algorithms
  L. Lovász
  Lecture Notes in Computer Science 194, 1985, pp. 1-14
• Linear and branching structures in the semantics and logics of reactive systems
  A. Pnueli
  Lecture Notes in Computer Science 194, 1985, pp. 15-32
• About rational sets of factors of a bi-infinite word
  D. Beauquier, M. Nivat
  Lecture Notes in Computer Science 194, 1985, pp. 33-42
• A fair protocol for signing contracts
  M. Ben-Or, O. Goldreich, S. Micali, R.L. Rivest
  Lecture Notes in Computer Science 194, 1985, pp. 43-52
• The influence of key length on the area-time complexity of sorting
  G. Bilardi, F.P. Preparata
  Lecture Notes in Computer Science 194, 1985, pp. 53-62
• Repeated synchronous snapshots and their implementation in CSP
  L. Bougé
  Lecture Notes in Computer Science 194, 1985, pp. 63-70
• On total regulators generated by derivation relations
  W. Bucher, A. Ehrenfeucht, D. Haussler
  Lecture Notes in Computer Science 194, 1985, pp. 71-79
• Optimal solutions for a class of point retrieval problems
  B. Chazelle, H. Edelsbrunner
  Lecture Notes in Computer Science 194, 1985, pp. 80-89
• Fractional cascading: A data structuring technique with geometric applications
  B. Chazelle, L.J. Guibas
  Lecture Notes in Computer Science 194, 1985, pp. 90-100
• 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