SWAT 88 : 1st Scandinavian workshop on algorithm theory, Halmstad, Sweden, July 5 8, 1988 : proceedings
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...
محفوظ في:
| مؤلف مشترك: | |
|---|---|
| مؤلفون آخرون: | , |
| التنسيق: | Livre numérique |
| اللغة: | Anglais |
| منشور في: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| سلاسل: | Lecture notes in computer science
318 |
| الموضوعات: | |
| الوصول للمادة أونلاين: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| ملاحظة: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • SWAT 88, proceedings, 1st Scandinavian workshop on algorithm theory, Halmstad, Sweden, July 5-8, 1988, Berlin, Springer-Verlag, 1988, 1 vol. (VI-262 p.), Lecture notes in computer science, 3-540-19487-8 • SWAT '88, Texte imprimé, 9783662163252 |
جدول المحتويات:
- 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.