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

• Connectability problems
  M.H. Overmars
  Lecture Notes in Computer Science 318, 1988, pp. 105-112
• Two hybrid methods for collision resolution in open addressing hashing
  W. Cunto, P.V. Poblete
  Lecture Notes in Computer Science 318, 1988, pp. 113-119
• Bin-packing in 1.5 dimension
  S.-O. Hyland
  Lecture Notes in Computer Science 318, 1988, pp. 129-137
• A fast parallel algorithm for computing all maximal cliques in a graph and the related problems
  E. Dahlhaus, M. Karpinski
  Lecture Notes in Computer Science 318, 1988, pp. 139-144
• Parallel solution of sparse linear systems
  J.R. Gilbert, H. Hafsteinsson
  Lecture Notes in Computer Science 318, 1988, pp. 145-153
• A note on determining the 3-dimensional convex hull of a set of points on a mesh of processors
  F. Dehne, J.-R. Sack, I. Stojmenović
  Lecture Notes in Computer Science 318, 1988, pp. 154-162
• Probabilistic log-space reductions and problems probabilistically hard for P
  L.M. Kirousis, P. Spirakis
  Lecture Notes in Computer Science 318, 1988, pp. 163-175
• Searching with uncertainty
  R.A. Baeza-Yates, J.C. Culberson, G.J.E. Rawlins
  Lecture Notes in Computer Science 318, 1988, pp. 176-189
• An optimal expected-time parallel algorithm for Voronoi diagrams
  C. Levcopoulos, J. Katajainen, A. Lingas
  Lecture Notes in Computer Science 318, 1988, pp. 190-198
• Generating binary trees by transpositions
  A. Proskurowski, F. Ruskey
  Lecture Notes in Computer Science 318, 1988, pp. 199-207
• Approximating the complete Euclidean graph
  J.M. Keil
  Lecture Notes in Computer Science 318, 1988, pp. 208-213
• Upper and lower bounds for the dictionary problem
  M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert
  Lecture Notes in Computer Science 318, 1988, pp. 214-215
• Linear algorithms for graph separation problems
  H.N. Djidjev
  Lecture Notes in Computer Science 318, 1988, pp. 216-222
• Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
  H.L. Bodlaender
  Lecture Notes in Computer Science 318, 1988, pp. 223-232
• Communication complexity of PRAMs (preliminary version)
  A. Aggarwal, A.K. Chandra
  Lecture Notes in Computer Science 317, 1988, pp. 1-17
• Average case complexity analysis of the RETE multi-pattern match algorithm
  L. Albert, F. Fages
  Lecture Notes in Computer Science 317, 1988, pp. 18-37
• Problems easy for tree-decomposable graphs (extended abstract)
  S. Arnborg, J. Lagergren, D. Seese
  Lecture Notes in Computer Science 317, 1988, pp. 38-51
• Serializability in distributed systems with handshaking
  R.J.R. Back, R. Kurki-Suonio
  Lecture Notes in Computer Science 317, 1988, pp. 52-66
• Algorithms for planar geometric models
  C. Bajaj, M.-S. Kim
  Lecture Notes in Computer Science 317, 1988, pp. 67-81
• Nonuniform learnability
  G.M. Benedek, A. Itai
  Lecture Notes in Computer Science 317, 1988, pp. 82-92
• Zeta functions of recognizable languages
  J. Berstel, C. Reutenauer
  Lecture Notes in Computer Science 317, 1988, pp. 93-104
• Dynamic programming on graphs with bounded treewidth
  H.L. Bodlaender
  Lecture Notes in Computer Science 317, 1988, pp. 105-118
• Efficient simulations of simple models of parallel computation by time-bounded ATM's and space-bounded TM's
  J.H. Chang, O.H. Ibarra, M.A. Palis
  Lecture Notes in Computer Science 317, 1988, pp. 119-132
• Optimal slope selection
  R. Cole, J. Salowe, W.L. Steiger, E. Szemerédi
  Lecture Notes in Computer Science 317, 1988, pp. 133-146
• Approximation of a trace, asynchronous automata and the ordering of events in a distributed system
  R. Cori, Y. Métivier
  Lecture Notes in Computer Science 317, 1988, pp. 147-161