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

• The calculus of constructions
  Gérard Huet
  Lecture Notes in Computer Science 287, 1987, pp. 372
• Algebraic operational semantics
  Yuri Gurevich
  Lecture Notes in Computer Science 287, 1987, pp. 1-2
• On ambiguity of DTOL systems
  K.G. Subramanian, Do Long Van, R. Siromoney
  Lecture Notes in Computer Science 287, 1987, pp. 3-14
• The equivalence problem for n-tape finite automata with simple cycles
  K. Culik II, M. Linna
  Lecture Notes in Computer Science 287, 1987, pp. 15-25
• Relating the degree of ambiguity of finite automata to the succinctnes of their representation
  O.H. Ibarra, B. Ravikumar
  Lecture Notes in Computer Science 287, 1987, pp. 26-43
• Automata, games, and positive monadic theories of trees
  M. Parigot
  Lecture Notes in Computer Science 287, 1987, pp. 44-57
• An algorithm for colouring perfect planar graphs
  I.A. Stewart
  Lecture Notes in Computer Science 287, 1987, pp. 58-64
• Efficient algorithms for domination and Hamilton circuit problems on permutation graphs
  P.S. Sastry, N. Jayakumar, C.E. Veni Madhavan
  Lecture Notes in Computer Science 287, 1987, pp. 65-78
• Fast parallel algorithms for the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs
  A. Lingas, A. Proskurowski
  Lecture Notes in Computer Science 287, 1987, pp. 79-94
• Improved bounds for covering general polygons with rectangles
  C. Levcopoulos
  Lecture Notes in Computer Science 287, 1987, pp. 95-102
• Submodule construction as equation solving in CCS
  J. Parrow
  Lecture Notes in Computer Science 287, 1987, pp. 103-123
• Computations in undistinguished networks
  S. Bhaskar, G.N. Buckley
  Lecture Notes in Computer Science 287, 1987, pp. 124-137
• A distributed algorithm to implement N-party rendezvous
  R. Bagrodia
  Lecture Notes in Computer Science 287, 1987, pp. 138-152
• Merge and termination in process algebra
  J.C.M. Baeten, R.J. van Glabbeek
  Lecture Notes in Computer Science 287, 1987, pp. 153-172
• Parallelism and programming
  K.M. Chandy, Jayadev Misra
  Lecture Notes in Computer Science 287, 1987, pp. 173-194
• On optimal parallelization of sorting networks
  E. Gannett, S.C. Kothari, H.-C. Yen
  Lecture Notes in Computer Science 287, 1987, pp. 195-206
• Parallel algorithms for approximate edge coloring of simple graphs
  O.A. Ogunyode
  Lecture Notes in Computer Science 287, 1987, pp. 207-225
• On optimal randomized routing algorithm for the mesh and a class of efficient mesh-like routing networks
  S. Rajasekaran, T. Tsantilas
  Lecture Notes in Computer Science 287, 1987, pp. 226-241
• An O(n^2) algorithm for fan-out free query optimization
  P. Dublish, S.N. Maheshwari
  Lecture Notes in Computer Science 287, 1987, pp. 242-264
• Weak consistency of read-only transactions
  R.C. Hansdah, L.M. Patnaik
  Lecture Notes in Computer Science 287, 1987, pp. 265-281
• Optimizing join queries in distributed databases
  S. Pramanik, D. Vineyard
  Lecture Notes in Computer Science 287, 1987, pp. 282-304
• Reasoning in systems of equations and inequations
  C.K. Mohan, M.K. Srivas
  Lecture Notes in Computer Science 287, 1987, pp. 305-325
• Specification = program + types
  Lee Naish
  Lecture Notes in Computer Science 287, 1987, pp. 326-339
• Paraconsistent logic programming
  H.A. Blair, V.S. Subrahmanian
  Lecture Notes in Computer Science 287, 1987, pp. 340-360
• Semantics of distributed horn clause programs
  R. Ramanujam
  Lecture Notes in Computer Science 287, 1987, pp. 361-371