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...
Gorde:
| Erakunde egilea: | |
|---|---|
| Beste egile batzuk: | , |
| Formatua: | Livre numérique |
| Hizkuntza: | Anglais |
| Argitaratua: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Saila: | Lecture notes in computer science
318 |
| Gaiak: | |
| Sarrera elektronikoa: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Oharra: |
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 |
| LEADER | 04519nam a22003977a 4500 | ||
|---|---|---|---|
| 001 | 944985 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155210017 | ||
| 020 | |a 9783540392880 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a Scandinavian workshop on algorithm theory |n (01 |d :1988 |c :Halmstad, Suède). | |
| 245 | 1 | 0 | |a SWAT 88 : |b 1st Scandinavian workshop on algorithm theory, Halmstad, Sweden, July 5 8, 1988 : proceedings |c [edited by] Rolf Karlsson, Andrzej Lingas. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 318 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a 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. | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Complexité de calcul (informatique) | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Karlsson, Rolf, |d 1950- |4 pbd | |
| 700 | 1 | |a Lingas, Andrzej. |4 pbd | |
| 776 | 0 | |0 020771371 |t SWAT 88 |o proceedings |f 1st Scandinavian workshop on algorithm theory, Halmstad, Sweden, July 5-8, 1988 |c Berlin |n Springer-Verlag |d 1988 |p 1 vol. (VI-262 p.) |s Lecture notes in computer science |z 3-540-19487-8 | |
| 776 | 0 | |t SWAT '88 |b Texte imprimé |z 9783662163252 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-19487-8 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-GZ4SG7QW-D |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747914680 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-19487-8 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750927380 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-19487-8 |z Accès INSA CVL | |
| 997 | |0 944985 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||