The Resource Algorithms and Data Structures : 2nd Workshop, WADS '91 Ottawa, Canada, August 14–16, 1991 Proceedings, edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro, (electronic resource)

Algorithms and Data Structures : 2nd Workshop, WADS '91 Ottawa, Canada, August 14–16, 1991 Proceedings, edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro, (electronic resource)

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
edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro
Creator
Contributor
Editor
Provider
Subject
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
Member of
http://library.link/vocab/creatorName
Dehne, Frank
Image bit depth
0
LC call number
QA76.9.A43
Literary form
non fiction
http://library.link/vocab/relatedWorkOrContributorName
  • Sack, Jörg-Rüdiger.
  • Santoro, Nicola.
  • SpringerLink
Series statement
Lecture Notes in Computer Science,
Series volume
519
http://library.link/vocab/subjectName
  • Computer science
  • Computer software
  • Information storage and retrieval systems
  • Combinatorics
  • Distribution (Probability theory)
  • Statistics
  • Computer Science
  • Algorithm Analysis and Problem Complexity
  • Computation by Abstract Devices
  • Combinatorics
  • Probability Theory and Stochastic Processes
  • Statistics, general
  • Information Storage and Retrieval
Label
Algorithms and Data Structures : 2nd Workshop, WADS '91 Ottawa, Canada, August 14–16, 1991 Proceedings, edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro, (electronic resource)
Instantiates
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
not applicable
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
Dimensions
unknown
Extent
X, 502 p.
File format
multiple file formats
Form of item
electronic
Isbn
9783540475668
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/BFb0028243
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-540-47566-8
Label
Algorithms and Data Structures : 2nd Workshop, WADS '91 Ottawa, Canada, August 14–16, 1991 Proceedings, edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro, (electronic resource)
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
not applicable
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
Dimensions
unknown
Extent
X, 502 p.
File format
multiple file formats
Form of item
electronic
Isbn
9783540475668
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/BFb0028243
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-540-47566-8

Library Locations

  • African Studies LibraryBorrow it
    771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Alumni Medical LibraryBorrow it
    72 East Concord Street, Boston, MA, 02118, US
    42.336388 -71.072393
  • Astronomy LibraryBorrow it
    725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US
    42.350259 -71.105717
  • Fineman and Pappas Law LibrariesBorrow it
    765 Commonwealth Avenue, Boston, MA, 02215, US
    42.350979 -71.107023
  • Frederick S. Pardee Management LibraryBorrow it
    595 Commonwealth Avenue, Boston, MA, 02215, US
    42.349626 -71.099547
  • Howard Gotlieb Archival Research CenterBorrow it
    771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Mugar Memorial LibraryBorrow it
    771 Commonwealth Avenue, Boston, MA, 02215, US
    42.350723 -71.108227
  • Music LibraryBorrow it
    771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Pikering Educational Resources LibraryBorrow it
    2 Silber Way, Boston, MA, 02215, US
    42.349804 -71.101425
  • School of Theology LibraryBorrow it
    745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350494 -71.107235
  • Science & Engineering LibraryBorrow it
    38 Cummington Mall, Boston, MA, 02215, US
    42.348472 -71.102257
  • Stone Science LibraryBorrow it
    675 Commonwealth Avenue, Boston, MA, 02445, US
    42.350103 -71.103784
Processing Feedback ...