Borrow it
 African Studies Library
 Alumni Medical Library
 Astronomy Library
 Fineman and Pappas Law Libraries
 Frederick S. Pardee Management Library
 Howard Gotlieb Archival Research Center
 Mugar Memorial Library
 Music Library
 Pikering Educational Resources Library
 School of Theology Library
 Science & Engineering Library
 Stone Science Library
The Resource Algorithms and Data Structures : 2nd Workshop, WADS '91 Ottawa, Canada, August 14–16, 1991 Proceedings, edited by Frank Dehne, JörgRü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örgRüdiger Sack, Nicola Santoro, (electronic resource)
Resource Information
The item Algorithms and Data Structures : 2nd Workshop, WADS '91 Ottawa, Canada, August 14–16, 1991 Proceedings, edited by Frank Dehne, JörgRüdiger Sack, Nicola Santoro, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Algorithms and Data Structures : 2nd Workshop, WADS '91 Ottawa, Canada, August 14–16, 1991 Proceedings, edited by Frank Dehne, JörgRüdiger Sack, Nicola Santoro, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
 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
 Language
 eng
 Extent
 X, 502 p.
 Contents

 A case study in comparison based complexity: Finding the nearest value(s)
 On the zone of a surface in a hyperplane arrangement
 Rayshooting and isotopy classes of lines in 3dimensional space
 Finding levelancestors in dynamic trees
 Treewidth of circulararc 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 lineartime 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 graphtheoretic 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 mwatchmen 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 inplace
 Probabilistic leader election on rings of known size
 Isbn
 9783540475668
 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örgRüdiger Sack, Nicola Santoro
 Subject

 Computation by Abstract Devices
 Probability Theory and Stochastic Processes
 Computer science
 Computer science
 Information Storage and Retrieval
 Computer software
 Algorithm Analysis and Problem Complexity
 Statistics, general
 Information storage and retrieval systems
 Combinatorics
 Computer Science
 Computer Science
 Distribution (Probability theory)
 Statistics
 Distribution (Probability theory)
 Combinatorics
 Electronic resources
 Statistics
 Computer software
 Information storage and retrieval systems
 Computer software
 Combinatorics
 Distribution (Probability theory)
 Statistics
 Information storage and retrieval systems
 Computer Science
 Computer science
 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
 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örgRü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örgRüdiger Sack, Nicola Santoro, (electronic resource)
 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  Rayshooting and isotopy classes of lines in 3dimensional space  Finding levelancestors in dynamic trees  Treewidth of circulararc 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 lineartime 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 graphtheoretic 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 mwatchmen 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 inplace  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
 (DEHe213)9783540475668
 Label
 Algorithms and Data Structures : 2nd Workshop, WADS '91 Ottawa, Canada, August 14–16, 1991 Proceedings, edited by Frank Dehne, JörgRüdiger Sack, Nicola Santoro, (electronic resource)
 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  Rayshooting and isotopy classes of lines in 3dimensional space  Finding levelancestors in dynamic trees  Treewidth of circulararc 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 lineartime 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 graphtheoretic 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 mwatchmen 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 inplace  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
 (DEHe213)9783540475668
Subject
 Algorithm Analysis and Problem Complexity
 Combinatorics
 Combinatorics
 Combinatorics
 Computation by Abstract Devices
 Computer Science
 Computer Science
 Computer Science
 Computer science
 Computer science
 Computer science
 Computer software
 Computer software
 Computer software
 Distribution (Probability theory)
 Distribution (Probability theory)
 Distribution (Probability theory)
 Electronic resources
 Information Storage and Retrieval
 Information storage and retrieval systems
 Information storage and retrieval systems
 Information storage and retrieval systems
 Probability Theory and Stochastic Processes
 Statistics
 Statistics
 Statistics
 Statistics, general
Member of
Library Locations

African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 71.108227


Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 71.105717

Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 71.107023

Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 71.099547

Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 71.108227


Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 71.108227

Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 71.101425

School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 71.107235

Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 71.102257

Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/AlgorithmsandDataStructures2ndWorkshop/Ezj3H8PlA_k/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsandDataStructures2ndWorkshop/Ezj3H8PlA_k/">Algorithms and Data Structures : 2nd Workshop, WADS '91 Ottawa, Canada, August 14–16, 1991 Proceedings, edited by Frank Dehne, JörgRüdiger Sack, Nicola Santoro, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Algorithms and Data Structures : 2nd Workshop, WADS '91 Ottawa, Canada, August 14–16, 1991 Proceedings, edited by Frank Dehne, JörgRüdiger Sack, Nicola Santoro, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/AlgorithmsandDataStructures2ndWorkshop/Ezj3H8PlA_k/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsandDataStructures2ndWorkshop/Ezj3H8PlA_k/">Algorithms and Data Structures : 2nd Workshop, WADS '91 Ottawa, Canada, August 14–16, 1991 Proceedings, edited by Frank Dehne, JörgRüdiger Sack, Nicola Santoro, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>