SWAT '88 (häftad)
Format
Häftad (Paperback / softback)
Språk
Engelska
Antal sidor
264
Utgivningsdatum
1988-06-01
Upplaga
1988.
Förlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Medarbetare
Karlsson, Rolf (ed.), Lingas, Andrzej (ed.)
Illustrationer
VIII, 264 p.
Dimensioner
239 x 165 x 18 mm
Vikt
454 g
Antal komponenter
1
Komponenter
1 Paperback / softback
ISBN
9783540194873
SWAT '88 (häftad)

SWAT '88

1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5-8, 1988. Proceedings

Häftad Engelska, 1988-06-01
929
Skickas inom 5-8 vardagar.
Fri frakt inom Sverige för privatpersoner.
The papers in this volume were presented at the 1st Scandinavian Workshop on Algorithm Theory held July 5-8, 1988 in Halmstad, Sweden. The contributions present original research in areas related to algorithm theory, including data structures, computational geometry, and computational complexity. In addition to the selected papers the proceedings include invited papers from I. Munro, K. Mehlhorn, M. Overmars, and D. Wood.
Visa hela texten

Passar bra ihop

  1. SWAT '88
  2. +
  3. Algorithm Theory - SWAT '96

De som köpt den här boken har ofta också köpt Algorithm Theory - SWAT '96 av Rolf Karlsson, Andrzej Lingas (häftad).

Köp båda 2 för 2128 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Bloggat om SWAT '88

Innehållsförteckning

An implicit binomial queue with constant insertion time.- Implicit selection.- An extrapolation on the interpolation search.- Time parameter and arbitrary deunions in the set union problem.- Two new algorithms for constructing min-max heaps.- Extremal cost tree data structures.- Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques.- Problems of posting sentries: Variations on the art gallery theorem.- A lower bound and two approximative algorithms for the K-partitioning of rectilinear polygons.- On recognizing and characterizing visibility graphs of simple polygons.- Connectability problems.- Two hybrid methods for collision resolution in open addressing hashing.- On an alternative sum useful in the analysis of some data structures.- Bin-packing in 1.5 dimension.- Applications of a symbolic perturbation scheme.- A fast parallel algorithm for computing all maximal cliques in a graph and the related problems.- Parallel solution of sparse linear systems.- A note on determining the 3-dimensional convex hull of a set of points on a mesh of processors.- Probabilistic log-space reductions and problems probabilistically hard for p.- Searching with uncertainty extended abstract.- An optimal expected-time parallel algorithm for Voronoi diagrams.- Generating binary trees by transpositions.- Approximating the complete Euclidean graph.- Upper and lower bounds for the dictionary problem.- Linear algorithms for graph separation problems.- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees.- NC algorithms for computing the number of perfect matchings in K 3,3-free graphs and related problems.- Independent covers in outerplanar graphs.- Tight lower bounds for Shellsort.