SWAT 88 [electronic resource] : 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5–8, 1988 Proceedings /

SWAT 88 [electronic resource] : 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5–8, 1988 Proceedings /

Show other versions (1)

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.

Saved in:
Bibliographic Details
Main Authors: Karlsson, Rolf. editor., Lingas, Andrzej. editor., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 1988
Subjects:Computer science., Computers., Algorithms., Mathematics., Computer Science., Theory of Computation., Mathematics, general., Algorithm Analysis and Problem Complexity.,
Online Access:http://dx.doi.org/10.1007/3-540-19487-8
Tags: Add Tag
No Tags, Be the first to tag this record!
id KOHA-OAI-TEST:183173
record_format koha
spelling KOHA-OAI-TEST:1831732018-07-30T23:04:15ZSWAT 88 [electronic resource] : 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5–8, 1988 Proceedings / Karlsson, Rolf. editor. Lingas, Andrzej. editor. SpringerLink (Online service) textBerlin, Heidelberg : Springer Berlin Heidelberg,1988.engThe 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.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.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.Computer science.Computers.Algorithms.Mathematics.Computer Science.Theory of Computation.Mathematics, general.Algorithm Analysis and Problem Complexity.Springer eBookshttp://dx.doi.org/10.1007/3-540-19487-8URN:ISBN:9783540392880
institution COLPOS
collection Koha
country México
countrycode MX
component Bibliográfico
access En linea
En linea
databasecode cat-colpos
tag biblioteca
region America del Norte
libraryname Departamento de documentación y biblioteca de COLPOS
language eng
topic Computer science.
Computers.
Algorithms.
Mathematics.
Computer Science.
Theory of Computation.
Mathematics, general.
Algorithm Analysis and Problem Complexity.
Computer science.
Computers.
Algorithms.
Mathematics.
Computer Science.
Theory of Computation.
Mathematics, general.
Algorithm Analysis and Problem Complexity.
spellingShingle Computer science.
Computers.
Algorithms.
Mathematics.
Computer Science.
Theory of Computation.
Mathematics, general.
Algorithm Analysis and Problem Complexity.
Computer science.
Computers.
Algorithms.
Mathematics.
Computer Science.
Theory of Computation.
Mathematics, general.
Algorithm Analysis and Problem Complexity.
Karlsson, Rolf. editor.
Lingas, Andrzej. editor.
SpringerLink (Online service)
SWAT 88 [electronic resource] : 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5–8, 1988 Proceedings /
description 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.
format Texto
topic_facet Computer science.
Computers.
Algorithms.
Mathematics.
Computer Science.
Theory of Computation.
Mathematics, general.
Algorithm Analysis and Problem Complexity.
author Karlsson, Rolf. editor.
Lingas, Andrzej. editor.
SpringerLink (Online service)
author_facet Karlsson, Rolf. editor.
Lingas, Andrzej. editor.
SpringerLink (Online service)
author_sort Karlsson, Rolf. editor.
title SWAT 88 [electronic resource] : 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5–8, 1988 Proceedings /
title_short SWAT 88 [electronic resource] : 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5–8, 1988 Proceedings /
title_full SWAT 88 [electronic resource] : 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5–8, 1988 Proceedings /
title_fullStr SWAT 88 [electronic resource] : 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5–8, 1988 Proceedings /
title_full_unstemmed SWAT 88 [electronic resource] : 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5–8, 1988 Proceedings /
title_sort swat 88 [electronic resource] : 1st scandinavian workshop on algorithm theory halmstad, sweden, july 5–8, 1988 proceedings /
publisher Berlin, Heidelberg : Springer Berlin Heidelberg,
publishDate 1988
url http://dx.doi.org/10.1007/3-540-19487-8
work_keys_str_mv AT karlssonrolfeditor swat88electronicresource1stscandinavianworkshoponalgorithmtheoryhalmstadswedenjuly581988proceedings
AT lingasandrzejeditor swat88electronicresource1stscandinavianworkshoponalgorithmtheoryhalmstadswedenjuly581988proceedings
AT springerlinkonlineservice swat88electronicresource1stscandinavianworkshoponalgorithmtheoryhalmstadswedenjuly581988proceedings
_version_ 1756265061220876288

Similar Items