Jetzt 20% Rabatt auf alle English Books. Jetzt in über 4 Millionen Büchern stöbern und profitieren!
Willkommen, schön sind Sie da!
Logo Ex Libris

SWAT '88

  • Kartonierter Einband
  • 272 Seiten
(0) Erste Bewertung abgeben
Bewertungen
(0)
(0)
(0)
(0)
(0)
Alle Bewertungen ansehen
The papers in this volume were presented at the 1st Scandinavian Workshop on Algorithm Theory held July 5-8, 1988 in Halmstad, Swe... Weiterlesen
20%
100.00 CHF 80.00
Sie sparen CHF 20.00
Print on Demand - Auslieferung erfolgt in der Regel innert 4 bis 6 Wochen.
Bestellung & Lieferung in eine Filiale möglich

Beschreibung

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.

Klappentext

From the contents: Invited papers: S. Carlsson, J.I. Munro, P.V. Poblete: An Implicit Binomial Queue with Constant Insertion Time.- D. Wood: Extremal Cost Tree Data Structures.- M.H. Overmars: Connectability Problems.- M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert: Upper and Lower Bounds for the Dictionary Problem.

Inhalt
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.

Produktinformationen

Titel: SWAT '88
Untertitel: 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5-8, 1988. Proceedings
Editor:
EAN: 9783540194873
ISBN: 3540194878
Format: Kartonierter Einband
Herausgeber: Springer Berlin Heidelberg
Anzahl Seiten: 272
Gewicht: 417g
Größe: H235mm x B155mm x T14mm
Jahr: 1988
Untertitel: Englisch
Auflage: 1988

Weitere Produkte aus der Reihe "Lecture Notes in Computer Science"

Teil 318
Sie sind hier.