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

• 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
• Guessing games and distributed computations in synchronous networks
  Jan van Leeuwen, N. Santoro, J. Urrutia, S. Zaks
  Lecture Notes in Computer Science 267, 1987, pp. 347-356
• 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
• Uniform computational complexity of Taylor series
  N.Th. Müller
  Lecture Notes in Computer Science 267, 1987, pp. 435-444
• Efficient on-line algorithms for the knapsack problem
  A. Marchetti-Spaccamela, C. Vercellis
  Lecture Notes in Computer Science 267, 1987, pp. 445-456
• Lower bounds for sorting of sums
  M. Dietzfelbinger
  Lecture Notes in Computer Science 267, 1987, pp. 457-466
• The I/O complexity of sorting and related problems
  A. Aggarwal, J.S. Vitter
  Lecture Notes in Computer Science 267, 1987, pp. 467-478
• A lower bound for the complexity of the union-split-find problem
  K. Mehlhorn, S. Näher, H. Alt
  Lecture Notes in Computer Science 267, 1987, pp. 479-488
• The nearest common ancestor in a dynamic tree
  A.K. Tsakalidis
  Lecture Notes in Computer Science 267, 1987, pp. 489-498
• A generalization of the procedure of Karp and Miller to well structured transition systems
  A. Finkel
  Lecture Notes in Computer Science 267, 1987, pp. 499-508
• Completeness results for reachability, containment, and equivalence with respect to conflict-free vector replacement systems
  R.R. Howell, L.E. Rosier
  Lecture Notes in Computer Science 267, 1987, pp. 509-520
• Partial algebras flow from algebraic specifications
  H.-J. Kreowski
  Lecture Notes in Computer Science 267, 1987, pp. 521-530
• The logarithmic alternation hierarchy collapses: A\Sigma_2^{\cal L} = A\Pi_2^{\cal L}
  K.-J. Lange, B. Jenner, B. Kirsig
  Lecture Notes in Computer Science 267, 1987, pp. 531-541
• Testing membership in commutative transformation semigroups
  M. Beaudry
  Lecture Notes in Computer Science 267, 1987, pp. 542-549
• On the computing power of one-way cellular arrays
  O.H. Ibarra, T. Jiang
  Lecture Notes in Computer Science 267, 1987, pp. 550-562