Coverart for item
The Resource Algorithms and data structures : 2nd workshop, WADS '91, Ottawa, Canada, August 14-16, 1991 : proceedings, F. Dehne, J.-R. Sack, N. Santoro, eds

Algorithms and data structures : 2nd workshop, WADS '91, Ottawa, Canada, August 14-16, 1991 : proceedings, F. Dehne, J.-R. Sack, N. Santoro, eds

Label
Algorithms and data structures : 2nd workshop, WADS '91, Ottawa, Canada, August 14-16, 1991 : proceedings
Title
Algorithms and data structures
Title remainder
2nd workshop, WADS '91, Ottawa, Canada, August 14-16, 1991 : proceedings
Statement of responsibility
F. Dehne, J.-R. Sack, N. Santoro, eds
Creator
Contributor
Subject
Genre
Language
eng
Summary
"This volume presents the proceedings of the Second Workshop on Algorithms and Data Structures (WADS '91), held at Carleton University in Ottawa. The workshop was organized by the School of Computer Science at Carleton University. The workshop alternates with the Scandinavian Workshop on Algorithm Theory (SWAT), continuing the tradition of SWAT '88 (LNCS, Vol. 318), WADS '89 (LNCS, Vol. 382), and SWAT '90 (LNCS, Vol. 447). From 107 papers submitted, 37 were selected for presentation at the workshop. In addition, there were 5 invited presentations."--PUBLISHER'S WEBSITE
Member of
Action
digitized
Cataloging source
OCLCE
Dewey number
005.7/3
Illustrations
illustrations
Index
index present
LC call number
QA76.9.D35
LC item number
A43 1991
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
1991
http://bibfra.me/vocab/lite/meetingName
WADS '91
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorDate
  • 1960-
  • 1954-
  • 1951-
http://library.link/vocab/relatedWorkOrContributorName
  • Dehne, F.
  • Sack, J.-R.
  • Santoro, N.
Series statement
Lecture notes in computer science
Series volume
519
http://library.link/vocab/subjectName
  • Data structures (Computer science)
  • Computer algorithms
  • Structures de données (Informatique)
  • Algorithmes
  • Computer algorithms
  • Data structures (Computer science)
  • Algoritmen
  • Datastructuren
  • Structures de données (informatique)
Label
Algorithms and data structures : 2nd workshop, WADS '91, Ottawa, Canada, August 14-16, 1991 : proceedings, F. Dehne, J.-R. Sack, N. Santoro, eds
Instantiates
Publication
Antecedent source
file reproduced from original
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
black and white
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
A case study in comparison based complexity: Finding the nearest value(s) -- On the zone of a surface in a hyperplane arrangement -- Ray-shooting and isotopy classes of lines in 3-dimensional space -- Finding level-ancestors in dynamic trees -- Treewidth of circular-arc graphs+ -- Fully dynamic delaunay triangulation in logarithmic expected time per operation -- On computing the voronoi diagram for restricted planar figures -- The MINSUMCUT problem -- Efficient algorithms for the minimum range cut problems -- Memory access in models of parallel computation: From folklore to synergy and beyond -- Farthest neighbors, maximum spanning trees and related problems in higher dimensions -- Shallow interdistance selection and interdistance enumeration -- Sharing memory in asynchronous message passing systems -- A linear-time scheme for version reconstruction -- The interval skip list: A data structure for finding all intervals that overlap a point -- Geometric knapsack problems -- A fast derandomization scheme and its applications -- Unstructured path problems and the making of semirings -- Neighborhood graphs and geometric embedding -- Finding optimal bipartitions of points and polygons -- Immobilizing a polytope -- What can we learn about suffix trees from independent tries? -- Competitive algorithms for the weighted list update problem -- An optimal algorithm for the rectilinear link center of a rectilinear polygon -- Geometric searching and link distance -- Representing and enumerating edge connectivity cuts in RNC -- Planar graph augmentation problems -- Parametric search and locating supply centers in trees -- On bends and lengths of rectilinear paths: A graph-theoretic approach -- Computing minimum length paths of a given homotopy class -- Approximation algorithms for selecting network centers -- Facility dispersion problems: Heuristics and special cases -- Optimum guard covers and m-watchmen routes for restricted polygons -- Applications of a new space partitioning technique -- Offline algorithms for dynamic minimum spanning tree problems -- An empirical analysis of algorithms for constructing a minimum spanning tree -- A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible -- Dynamically maintaining the visibility graph -- An optimal algorithm for computing visibility in the plane -- Fully persistent data structures for disjoint set union problems -- Algorithms for generating all spanning trees of undirected, directed and weighted graphs -- Sorting multisets and vectors in-place -- Probabilistic leader election on rings of known size
Control code
824538587
Dimensions
unknown
Extent
1 online resource (x, 495 pages)
Form of item
online
Isbn
9783540475668
Level of compression
  • lossless
  • lossy
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations
Reformatting quality
  • preservation
  • access
Reproduction note
Electronic reproduction.
Specific material designation
remote
System control number
(OCoLC)824538587
System details
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
Label
Algorithms and data structures : 2nd workshop, WADS '91, Ottawa, Canada, August 14-16, 1991 : proceedings, F. Dehne, J.-R. Sack, N. Santoro, eds
Publication
Antecedent source
file reproduced from original
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
black and white
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
A case study in comparison based complexity: Finding the nearest value(s) -- On the zone of a surface in a hyperplane arrangement -- Ray-shooting and isotopy classes of lines in 3-dimensional space -- Finding level-ancestors in dynamic trees -- Treewidth of circular-arc graphs+ -- Fully dynamic delaunay triangulation in logarithmic expected time per operation -- On computing the voronoi diagram for restricted planar figures -- The MINSUMCUT problem -- Efficient algorithms for the minimum range cut problems -- Memory access in models of parallel computation: From folklore to synergy and beyond -- Farthest neighbors, maximum spanning trees and related problems in higher dimensions -- Shallow interdistance selection and interdistance enumeration -- Sharing memory in asynchronous message passing systems -- A linear-time scheme for version reconstruction -- The interval skip list: A data structure for finding all intervals that overlap a point -- Geometric knapsack problems -- A fast derandomization scheme and its applications -- Unstructured path problems and the making of semirings -- Neighborhood graphs and geometric embedding -- Finding optimal bipartitions of points and polygons -- Immobilizing a polytope -- What can we learn about suffix trees from independent tries? -- Competitive algorithms for the weighted list update problem -- An optimal algorithm for the rectilinear link center of a rectilinear polygon -- Geometric searching and link distance -- Representing and enumerating edge connectivity cuts in RNC -- Planar graph augmentation problems -- Parametric search and locating supply centers in trees -- On bends and lengths of rectilinear paths: A graph-theoretic approach -- Computing minimum length paths of a given homotopy class -- Approximation algorithms for selecting network centers -- Facility dispersion problems: Heuristics and special cases -- Optimum guard covers and m-watchmen routes for restricted polygons -- Applications of a new space partitioning technique -- Offline algorithms for dynamic minimum spanning tree problems -- An empirical analysis of algorithms for constructing a minimum spanning tree -- A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible -- Dynamically maintaining the visibility graph -- An optimal algorithm for computing visibility in the plane -- Fully persistent data structures for disjoint set union problems -- Algorithms for generating all spanning trees of undirected, directed and weighted graphs -- Sorting multisets and vectors in-place -- Probabilistic leader election on rings of known size
Control code
824538587
Dimensions
unknown
Extent
1 online resource (x, 495 pages)
Form of item
online
Isbn
9783540475668
Level of compression
  • lossless
  • lossy
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations
Reformatting quality
  • preservation
  • access
Reproduction note
Electronic reproduction.
Specific material designation
remote
System control number
(OCoLC)824538587
System details
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
Processing Feedback ...