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

• 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
• On the relative complexity of subproblems of intractable problems
  Klaus Ambos-Spies
  Lecture Notes in Computer Science 182, 1985, pp. 1-12
• On Lovász' lattice reduction and the nearest lattice point problem
  László Babai
  Lecture Notes in Computer Science 182, 1985, pp. 13-20
• Layouts with wires of balanced length
  B. Becker, H.G. Osthof
  Lecture Notes in Computer Science 182, 1985, pp. 21-31
• On the single-operation worst-case time complexity of the disjoint set union problem
  Norbert Blum
  Lecture Notes in Computer Science 182, 1985, pp. 32-38
• Deterministic languages and non-generators
  L. Boasson, A. Petit
  Lecture Notes in Computer Science 182, 1985, pp. 39-46
• Simulation of large networks on smaller networks
  H.L. Bodlaender, J. van Leeuwen
  Lecture Notes in Computer Science 182, 1985, pp. 47-58
• Petri nets and algebraic calculi of processes
  Gérard Boudol, Gérard Roucairol, Robert de Simone
  Lecture Notes in Computer Science 182, 1985, pp. 59-70
• Non-deterministic two-tape automata are more powerful than deterministic ones
  W. Brauer, K.-J. Lange
  Lecture Notes in Computer Science 182, 1985, pp. 71-79
• Construction of a family of factorizing codes
  Clelia de Felice
  Lecture Notes in Computer Science 182, 1985, pp. 80-86