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 : Workshop WADS '89 Ottawa, Canada, August 17–19, 1989 Proceedings, edited by F. Dehne, J. R. Sack, N. Santoro, (electronic resource)
Algorithms and Data Structures : Workshop WADS '89 Ottawa, Canada, August 17–19, 1989 Proceedings, edited by F. Dehne, J. R. Sack, N. Santoro, (electronic resource)
Resource Information
The item Algorithms and Data Structures : Workshop WADS '89 Ottawa, Canada, August 17–19, 1989 Proceedings, edited by F. Dehne, J. R. Sack, N. 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 : Workshop WADS '89 Ottawa, Canada, August 17–19, 1989 Proceedings, edited by F. Dehne, J. R. Sack, N. 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 book contains the papers presented at the 1989 Workshop on Algorithms and Data Structures, which succeeds the 1988 Scandinavian Workshop on Algorithm Theory. It presents current research in various areas of algorithms, computational geometry, geometric searching, VLSI placement and routing, graph algorithms, parallel algorithms, distributed algorithms, databases, and text searching
 Language
 eng
 Extent
 VI, 244 p.
 Contents

 Efficient text searching of regular expressions
 Efficient spatial point location
 Constructing the Voronoi diagram of a set of line segments in parallel
 Analysis of kdttrees: Kdtrees improved by local reorganisations
 Optimal algorithms for List Indexing and Subset Rank
 The Delaunay triangulation closely approximates the complete Euclidean graph
 Computing the furthest site voronoi diagram for a set of discs
 Fully persistent arrays
 String searching algorithms revisited
 Optimal channel placement for multiterminal nets
 Computing the minimum visible vertex distance between two polygons
 Computing the kernel of a point set in a polygon
 Using bounded degree spanning trees in the design of efficient algorithms on clawfree graphs
 Linear time algorithms for computing reachability regions from polygonal figures
 Computing the center of area of a polygon
 Weighted orthogonal linear L ?approximation and applications
 Discs and other related data structures
 Digital data structures and order statistics
 On the performance of orthogonal range queries in multiattribute and doubly chained trees
 Probabilistic analysis of algorithms and data structures
 Stabbing parallel segments with a convex polygon
 Selecting the Kth largestarea convex polygon
 Finding All Shortest Path Edge Sequences on a convex polyhedron
 Linear algorithms for parity path and two path problems on circulararc graph
 NC algorithms for circulararc graphs
 Parallel algorithms for the subgraph homeomorphism problem
 Galleries, light matchings and visibility graphs
 Weighted visibility graphs of bars and related flow problems
 Parallel algorithms for cographs recognition and applications
 Dynamic data structures for series parallel digraphs
 Motion planning in the CLenvironment
 Selfadjusting kary search trees
 Improving partial rebuilding by using simple balance criteria
 An efficient allparses systolic algorithm for general contextfree parsing
 A polynomial time algorithm for the local testability problem of deterministic finite automata
 Skip lists: A probabilistic alternative to balanced trees
 A fast algorithm for melding splay trees
 An efficient algorithm for finding all maximal square blocks in a matrix
 Complexity issues in treebased version control
 Structured NC
 Heapsort—Adapted for presorted files
 The distribution of keys in a binary heap
 Optimal hypercube algorithms for labeled images
 On the complexity of single row routing problems
 A new search time update time tradeoff for the implicit dictionary
 Sorting with minimum data movement (preliminary draft)
 Augmentation problems on hierarchically defined graphs
 On linear time minor tests and depth first search
 Combinatorial and computational results for line arrangements in space
 Isbn
 9783540482376
 Label
 Algorithms and Data Structures : Workshop WADS '89 Ottawa, Canada, August 17–19, 1989 Proceedings
 Title
 Algorithms and Data Structures
 Title remainder
 Workshop WADS '89 Ottawa, Canada, August 17–19, 1989 Proceedings
 Statement of responsibility
 edited by F. Dehne, J. R. Sack, N. Santoro
 Subject

 Computation by Abstract Devices
 Statistics
 Probability Theory and Stochastic Processes
 Computer science
 Information Storage and Retrieval
 Information storage and retrieval systems
 Computer software
 Algorithm Analysis and Problem Complexity
 Statistics, general
 Information storage and retrieval systems
 Combinatorial analysis
 Combinatorial analysis
 Computer Science
 Computer Science
 Statistics
 Distribution (Probability theory)
 Combinatorics
 Electronic resources
 Computer science
 Combinatorial analysis
 Computer software
 Computer software
 Combinatorics
 Distribution (Probability theory)
 Combinatorics
 Statistics
 Distribution (Probability theory)
 Information storage and retrieval systems
 Computer Science
 Computer science
 Language
 eng
 Summary
 This book contains the papers presented at the 1989 Workshop on Algorithms and Data Structures, which succeeds the 1988 Scandinavian Workshop on Algorithm Theory. It presents current research in various areas of algorithms, computational geometry, geometric searching, VLSI placement and routing, graph algorithms, parallel algorithms, distributed algorithms, databases, and text searching
 http://library.link/vocab/creatorName
 Dehne, F
 Image bit depth
 0
 LC call number
 QA76.9.A43
 Literary form
 non fiction
 http://library.link/vocab/relatedWorkOrContributorName

 Sack, J. R.
 Santoro, N.
 SpringerLink
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 382
 http://library.link/vocab/subjectName

 Computer science
 Computer software
 Information storage and retrieval systems
 Combinatorial analysis
 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 : Workshop WADS '89 Ottawa, Canada, August 17–19, 1989 Proceedings, edited by F. Dehne, J. R. Sack, N. 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
 Efficient text searching of regular expressions  Efficient spatial point location  Constructing the Voronoi diagram of a set of line segments in parallel  Analysis of kdttrees: Kdtrees improved by local reorganisations  Optimal algorithms for List Indexing and Subset Rank  The Delaunay triangulation closely approximates the complete Euclidean graph  Computing the furthest site voronoi diagram for a set of discs  Fully persistent arrays  String searching algorithms revisited  Optimal channel placement for multiterminal nets  Computing the minimum visible vertex distance between two polygons  Computing the kernel of a point set in a polygon  Using bounded degree spanning trees in the design of efficient algorithms on clawfree graphs  Linear time algorithms for computing reachability regions from polygonal figures  Computing the center of area of a polygon  Weighted orthogonal linear L ?approximation and applications  Discs and other related data structures  Digital data structures and order statistics  On the performance of orthogonal range queries in multiattribute and doubly chained trees  Probabilistic analysis of algorithms and data structures  Stabbing parallel segments with a convex polygon  Selecting the Kth largestarea convex polygon  Finding All Shortest Path Edge Sequences on a convex polyhedron  Linear algorithms for parity path and two path problems on circulararc graph  NC algorithms for circulararc graphs  Parallel algorithms for the subgraph homeomorphism problem  Galleries, light matchings and visibility graphs  Weighted visibility graphs of bars and related flow problems  Parallel algorithms for cographs recognition and applications  Dynamic data structures for series parallel digraphs  Motion planning in the CLenvironment  Selfadjusting kary search trees  Improving partial rebuilding by using simple balance criteria  An efficient allparses systolic algorithm for general contextfree parsing  A polynomial time algorithm for the local testability problem of deterministic finite automata  Skip lists: A probabilistic alternative to balanced trees  A fast algorithm for melding splay trees  An efficient algorithm for finding all maximal square blocks in a matrix  Complexity issues in treebased version control  Structured NC  Heapsort—Adapted for presorted files  The distribution of keys in a binary heap  Optimal hypercube algorithms for labeled images  On the complexity of single row routing problems  A new search time update time tradeoff for the implicit dictionary  Sorting with minimum data movement (preliminary draft)  Augmentation problems on hierarchically defined graphs  On linear time minor tests and depth first search  Combinatorial and computational results for line arrangements in space
 Dimensions
 unknown
 Extent
 VI, 244 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540482376
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540515429
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540482376
 Label
 Algorithms and Data Structures : Workshop WADS '89 Ottawa, Canada, August 17–19, 1989 Proceedings, edited by F. Dehne, J. R. Sack, N. 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
 Efficient text searching of regular expressions  Efficient spatial point location  Constructing the Voronoi diagram of a set of line segments in parallel  Analysis of kdttrees: Kdtrees improved by local reorganisations  Optimal algorithms for List Indexing and Subset Rank  The Delaunay triangulation closely approximates the complete Euclidean graph  Computing the furthest site voronoi diagram for a set of discs  Fully persistent arrays  String searching algorithms revisited  Optimal channel placement for multiterminal nets  Computing the minimum visible vertex distance between two polygons  Computing the kernel of a point set in a polygon  Using bounded degree spanning trees in the design of efficient algorithms on clawfree graphs  Linear time algorithms for computing reachability regions from polygonal figures  Computing the center of area of a polygon  Weighted orthogonal linear L ?approximation and applications  Discs and other related data structures  Digital data structures and order statistics  On the performance of orthogonal range queries in multiattribute and doubly chained trees  Probabilistic analysis of algorithms and data structures  Stabbing parallel segments with a convex polygon  Selecting the Kth largestarea convex polygon  Finding All Shortest Path Edge Sequences on a convex polyhedron  Linear algorithms for parity path and two path problems on circulararc graph  NC algorithms for circulararc graphs  Parallel algorithms for the subgraph homeomorphism problem  Galleries, light matchings and visibility graphs  Weighted visibility graphs of bars and related flow problems  Parallel algorithms for cographs recognition and applications  Dynamic data structures for series parallel digraphs  Motion planning in the CLenvironment  Selfadjusting kary search trees  Improving partial rebuilding by using simple balance criteria  An efficient allparses systolic algorithm for general contextfree parsing  A polynomial time algorithm for the local testability problem of deterministic finite automata  Skip lists: A probabilistic alternative to balanced trees  A fast algorithm for melding splay trees  An efficient algorithm for finding all maximal square blocks in a matrix  Complexity issues in treebased version control  Structured NC  Heapsort—Adapted for presorted files  The distribution of keys in a binary heap  Optimal hypercube algorithms for labeled images  On the complexity of single row routing problems  A new search time update time tradeoff for the implicit dictionary  Sorting with minimum data movement (preliminary draft)  Augmentation problems on hierarchically defined graphs  On linear time minor tests and depth first search  Combinatorial and computational results for line arrangements in space
 Dimensions
 unknown
 Extent
 VI, 244 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540482376
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540515429
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540482376
Subject
 Algorithm Analysis and Problem Complexity
 Combinatorial analysis
 Combinatorial analysis
 Combinatorial analysis
 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/AlgorithmsandDataStructuresWorkshopWADS/a8ljnAKqmg/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsandDataStructuresWorkshopWADS/a8ljnAKqmg/">Algorithms and Data Structures : Workshop WADS '89 Ottawa, Canada, August 17–19, 1989 Proceedings, edited by F. Dehne, J. R. Sack, N. 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 : Workshop WADS '89 Ottawa, Canada, August 17–19, 1989 Proceedings, edited by F. Dehne, J. R. Sack, N. 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/AlgorithmsandDataStructuresWorkshopWADS/a8ljnAKqmg/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsandDataStructuresWorkshopWADS/a8ljnAKqmg/">Algorithms and Data Structures : Workshop WADS '89 Ottawa, Canada, August 17–19, 1989 Proceedings, edited by F. Dehne, J. R. Sack, N. 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>