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

• 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
• A probabilistic distributed algorithm for set intersection and its analysis
  T.G. Kurtz, U. Manber
  Lecture Notes in Computer Science 194, 1985, pp. 356-362
• Distributed algorithms in synchronous broadcasting networks
  G.M. Landau, M.M. Yung, Z. Galil
  Lecture Notes in Computer Science 194, 1985, pp. 363-372
• A context dependent equivalence between processes
  K.G. Larsen
  Lecture Notes in Computer Science 194, 1985, pp. 373-382
• Lower bounds by Kolmogorov-complexity
  M. Li
  Lecture Notes in Computer Science 194, 1985, pp. 383-393
• A bidirectional shortest-path algorithm with good average-case behavior
  M. Luby, P. Ragde
  Lecture Notes in Computer Science 194, 1985, pp. 394-403
• Applications of an infinite squarefree CO-CFL
  M.G. Main, W. Bucher, D. Haussler
  Lecture Notes in Computer Science 194, 1985, pp. 404-412
• Special relations in automated deduction
  Z. Manna, R. Waldinger
  Lecture Notes in Computer Science 194, 1985, pp. 413-423
• Dynamic interpolation search
  K. Mehlhorn, A. Tsakalidis
  Lecture Notes in Computer Science 194, 1985, pp. 424-434
• Polynomial levelability and maximal complexity cores
  P. Orponen, D.A. Russo, U. Schöning
  Lecture Notes in Computer Science 194, 1985, pp. 435-444
• Finite group topology and p-adic topology for free monoids
  J.E. Pin
  Lecture Notes in Computer Science 194, 1985, pp. 445-455
• On the use of relational expressions in the design of efficient algorithms
  S. Sippu, E. Soisalon-Soininen
  Lecture Notes in Computer Science 194, 1985, pp. 456-464
• The complementation problem for Büchi automata with applications to temporal logic
  A.P. Sistla, M.Y. Vardi, P. Wolper
  Lecture Notes in Computer Science 194, 1985, pp. 465-474
• A complete compositional modal proof system for a subset of CCS
  C. Stirling
  Lecture Notes in Computer Science 194, 1985, pp. 475-486
• On matrix multiplication using array processors
  P.J. Varman, I.V. Ramakrishnan
  Lecture Notes in Computer Science 194, 1985, pp. 487-496
• Optimal parallel pattern matching in strings
  U. Vishkin
  Lecture Notes in Computer Science 194, 1985, pp. 497-508
• Compositionality and concurrent networks: Soundness and completeness of a proofsystem
  J. Zwiers, W.P. de Roever, P. van Emde Boas
  Lecture Notes in Computer Science 194, 1985, pp. 509-519