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

• Verifying a protocol using relativized bisimulation
  K.G. Larsen, R. Milner
  Lecture Notes in Computer Science 267, 1987, pp. 126-135
• On recent trends in formal language theory
  J. Karhumäki
  Lecture Notes in Computer Science 267, 1987, pp. 136-162
• Non-uniform automata over groups
  D.A. Barrington, D. Thérien
  Lecture Notes in Computer Science 267, 1987, pp. 163-173
• Minimal automaton of a rational cover
  D. Beauquier
  Lecture Notes in Computer Science 267, 1987, pp. 174-189
• A star-height problem in free monoids with partial commutations
  C. Choffrut, C. Duboc
  Lecture Notes in Computer Science 267, 1987, pp. 190-201
• Single-valued finite transduction
  J.H. Johnson
  Lecture Notes in Computer Science 267, 1987, pp. 202-211
• The Kleene and the Parikh theorem in complete semirings
  W. Kuich
  Lecture Notes in Computer Science 267, 1987, pp. 212-225
• An algorithm for computing asynchronous automata in the case of acyclic non-commutation graphs
  Y. Métivier
  Lecture Notes in Computer Science 267, 1987, pp. 226-236
• On the languages accepted by finite reversible automata
  J.E. Pin
  Lecture Notes in Computer Science 267, 1987, pp. 237-249
• Decision problems for regular trace languages
  I.J. Aalbersberg, H.J. Hoogeboom
  Lecture Notes in Computer Science 267, 1987, pp. 250-259
• Panic mode without panic
  M.P. Chytil, J. Demner
  Lecture Notes in Computer Science 267, 1987, pp. 260-268
• Computation tree logic CTL^* and path quantifiers in the monadic theory of the binary tree
  T. Hafer, W. Thomas
  Lecture Notes in Computer Science 267, 1987, pp. 269-279
• Modelchecking of CTL formulae under liveness assumptions
  B. Josko
  Lecture Notes in Computer Science 267, 1987, pp. 280-289
• A modal logic for a subclass of event structures
  K. Lodaya, P.S. Thiagarajan
  Lecture Notes in Computer Science 267, 1987, pp. 290-303
• Parallel 5-colouring of planar graphs
  T. Hagerup, M. Chrobak, K. Diks
  Lecture Notes in Computer Science 267, 1987, pp. 304-313
• Parallel construction of a suffix tree
  G.M. Landau, B. Schieber, U. Vishkin
  Lecture Notes in Computer Science 267, 1987, pp. 314-325
• The probabilistic and deterministic parallel complexity of symmetric functions
  M. Li, Y. Yesha
  Lecture Notes in Computer Science 267, 1987, pp. 326-335
• Term matching on parallel computers
  R. Ramesh, R.M. Verma, T. Krishnaprasad, I.V. Ramakrishnan
  Lecture Notes in Computer Science 267, 1987, pp. 336-346
• On the bivariate function minimization problem and its applications to motion planning
  J.T. Schwartz, M. Sharir
  Lecture Notes in Computer Science 267, 1987, pp. 357-363
• Testing the necklace condition for shortest tours and optimal factors in the plane
  H. Edelsbrunner, G. Rote, E. Welzl
  Lecture Notes in Computer Science 267, 1987, pp. 364-375
• Nearly optimal heuristics for binary search trees with geometric generalizations
  C. Levcopoulos, A. Lingas, J.-R. Sack
  Lecture Notes in Computer Science 267, 1987, pp. 376-385
• Approximating integer lattices by lattices with cyclic factor groups
  A. Paz, C.P. Schnorr
  Lecture Notes in Computer Science 267, 1987, pp. 386-393
• On the complexity of graph critical uncolorability
  J. Cai, G.E. Meyer
  Lecture Notes in Computer Science 267, 1987, pp. 394-403
• Posets, boolean representations and quick path searching
  G. Gambosi, J. Nes̑etȓil, M. Talamo
  Lecture Notes in Computer Science 267, 1987, pp. 404-424
• The lexicographically first maximal subgraph problems: P-completeness and NC algorithms
  S. Miyano
  Lecture Notes in Computer Science 267, 1987, pp. 425-434