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

• Abstract interpretation of denotational definitions
  Flemming Nielson
  Lecture Notes in Computer Science 210, 1986, pp. 1-20
• Temporal reasoning under generalized fairness constraints
  E. Allen Emerson, Chin-Laung Lei
  Lecture Notes in Computer Science 210, 1986, pp. 21-36
• Décidabilité de l'égalité des langages algébriques infinitaires simples
  D. Caucal
  Lecture Notes in Computer Science 210, 1986, pp. 37-48
• Some probabilistic powerdomains in the category SFP
  D. Frutos Escrig
  Lecture Notes in Computer Science 210, 1986, pp. 49-59
• Ions and local definitions in logic programming
  M.A. Nait Abdallah
  Lecture Notes in Computer Science 210, 1986, pp. 60-72
• Input sensitive, optimal parallel randomized algorithms for addition and identification
  Paul G. Spirakis
  Lecture Notes in Computer Science 210, 1986, pp. 73-86
• A parallel statistical cooling algorithm
  E.H.L. Aarts, F.M.J. de Bont, J.H.A. Habers, P.J.M. van Laarhoven
  Lecture Notes in Computer Science 210, 1986, pp. 87-97
• Subgraph isomorphism for biconnected outerplanar graphs in cubic time
  Andrzej Lingas
  Lecture Notes in Computer Science 210, 1986, pp. 98-104
• Polynomial time algorithms for finding integer relations among real numbers
  J. Hastad, B. Helfrich, J. Lagarias, C.P. Schnorr
  Lecture Notes in Computer Science 210, 1986, pp. 105-118
• New upperbounds for decentralized extrema-finding in a ring of processors
  H.L. Bodlaender, J. van Leeuwen
  Lecture Notes in Computer Science 210, 1986, pp. 119-129
• Algorithms for visibility representations of planar graphs
  Roberto Tamassia, Ioannis G. Tollis
  Lecture Notes in Computer Science 210, 1986, pp. 130-141
• Speeding up random access machines by few processors
  Friedhelm Meyer auf der Heide
  Lecture Notes in Computer Science 210, 1986, pp. 142-152
• Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
  Thomas Lengauer
  Lecture Notes in Computer Science 210, 1986, pp. 153-170
• On sparseness, ambiguity and other decision problems for acceptors and transducers
  Oscar H. Ibarra, B. Ravikumar
  Lecture Notes in Computer Science 210, 1986, pp. 171-179
• Variétés de semigroupes et mots infinis
  Jean-Pierre Pecuchet
  Lecture Notes in Computer Science 210, 1986, pp. 180-191
• Equations in free partially commutative monoids
  Christine Duboc
  Lecture Notes in Computer Science 210, 1986, pp. 192-202
• Separating and testing
  Ph. Darondeau
  Lecture Notes in Computer Science 210, 1986, pp. 203-212
• Décomposition de fonctions rationnelles
  C. Choffrut, M.P. Schutzenberger
  Lecture Notes in Computer Science 210, 1986, pp. 213-226
• Long unavoidable patterns
  Ursula Schmidt
  Lecture Notes in Computer Science 210, 1986, pp. 227-235
• Abstract implementations and correctness proofs
  Gilles Bernot, Michel Bidoit, Christine Choppy
  Lecture Notes in Computer Science 210, 1986, pp. 236-251
• Strictness and serializability
  Udo Kelter
  Lecture Notes in Computer Science 210, 1986, pp. 252-261
• Towards specification and proof of asynchronous systems
  B. Gamatie
  Lecture Notes in Computer Science 210, 1986, pp. 262-276
• Monotone Boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures
  H.B. Hunt III, R.E. Stearns
  Lecture Notes in Computer Science 210, 1986, pp. 277-290
• Concurrent conciseness of degree, probabilistic, nondeterministic and deterministic finite automata
  C.M.R. Kintala, Detlef Wotschke
  Lecture Notes in Computer Science 210, 1986, pp. 291-305
• Logspace hierarchies, polynomial time and the complexity of fairness problems concerning \omega-machines
  Louis E. Rosier, Hsu-Chun Yen
  Lecture Notes in Computer Science 210, 1986, pp. 306-320