The Resource Algorithms and Data Structures : Workshop WADS '89 Ottawa, Canada, August 1719, 1989 Proceedings, edited by F. Dehne, J.R. Sack, N. Santoro
Algorithms and Data Structures : Workshop WADS '89 Ottawa, Canada, August 1719, 1989 Proceedings, edited by F. Dehne, J.R. Sack, N. Santoro
Resource Information
The item Algorithms and Data Structures : Workshop WADS '89 Ottawa, Canada, August 1719, 1989 Proceedings, edited by F. Dehne, J.R. Sack, N. Santoro represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Algorithms and Data Structures : Workshop WADS '89 Ottawa, Canada, August 1719, 1989 Proceedings, edited by F. Dehne, J.R. Sack, N. Santoro represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
 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
 1 online resource
 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
 HeapsortAdapted 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
 9780387515427
 Label
 Algorithms and Data Structures : Workshop WADS '89 Ottawa, Canada, August 1719, 1989 Proceedings
 Title
 Algorithms and Data Structures
 Title remainder
 Workshop WADS '89 Ottawa, Canada, August 1719, 1989 Proceedings
 Statement of responsibility
 edited by F. Dehne, J.R. Sack, N. Santoro
 Subject

 Algoritmen
 Combinatorial analysis
 Combinatorial analysis
 Combinatorial analysis
 Computer science
 Computer science
 Computer science
 Computer software
 Computer software
 Computer software
 Datastructuren
 Distribution (Probability theory)
 Distribution (Probability theory)
 Distribution (Probability theory)
 Information storage and retrieval systems
 Information storage and retrieval systems
 Information storage and retrieval systems
 Statistics
 Statistics
 Statistics
 Structures de données (Informatique)  Congrès
 Algorithmes  Congrès
 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
 Action
 digitized
 Cataloging source
 KIJ
 Dewey number
 005.7/3
 Image bit depth
 0
 Index
 index present
 Language note
 English
 LC call number
 QA76.9.D35
 LC item number
 A44 1989
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 1989
 http://bibfra.me/vocab/lite/meetingName
 Workshop WADS '89
 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
 382
 http://library.link/vocab/subjectName

 Computer science
 Computer software
 Information storage and retrieval systems
 Combinatorial analysis
 Distribution (Probability theory)
 Statistics
 Structures de données (Informatique)
 Algorithmes
 Combinatorial analysis
 Computer science
 Computer software
 Distribution (Probability theory)
 Information storage and retrieval systems
 Statistics
 Algoritmen
 Datastructuren
 Label
 Algorithms and Data Structures : Workshop WADS '89 Ottawa, Canada, August 1719, 1989 Proceedings, edited by F. Dehne, J.R. Sack, N. Santoro
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references and index
 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  HeapsortAdapted 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
 Control code
 827360400
 Dimensions
 unknown
 Extent
 1 online resource
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9780387515427
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/3540515429.
 Other physical details
 volumes: digital.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Reproduction note
 Electronic reproduction.
 Specific material designation
 remote
 System control number
 (OCoLC)827360400
 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 : Workshop WADS '89 Ottawa, Canada, August 1719, 1989 Proceedings, edited by F. Dehne, J.R. Sack, N. Santoro
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references and index
 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  HeapsortAdapted 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
 Control code
 827360400
 Dimensions
 unknown
 Extent
 1 online resource
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9780387515427
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/3540515429.
 Other physical details
 volumes: digital.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Reproduction note
 Electronic reproduction.
 Specific material designation
 remote
 System control number
 (OCoLC)827360400
 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.
Subject
 Algoritmen
 Combinatorial analysis
 Combinatorial analysis
 Combinatorial analysis
 Computer science
 Computer science
 Computer science
 Computer software
 Computer software
 Computer software
 Datastructuren
 Distribution (Probability theory)
 Distribution (Probability theory)
 Distribution (Probability theory)
 Information storage and retrieval systems
 Information storage and retrieval systems
 Information storage and retrieval systems
 Statistics
 Statistics
 Statistics
 Structures de données (Informatique)  Congrès
 Algorithmes  Congrès
Member of
Library Links
Embed
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.library.missouri.edu/portal/AlgorithmsandDataStructuresWorkshopWADS/pdsL1KCsltA/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/AlgorithmsandDataStructuresWorkshopWADS/pdsL1KCsltA/">Algorithms and Data Structures : Workshop WADS '89 Ottawa, Canada, August 1719, 1989 Proceedings, edited by F. Dehne, J.R. Sack, N. Santoro</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri 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 1719, 1989 Proceedings, edited by F. Dehne, J.R. Sack, N. Santoro
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.library.missouri.edu/portal/AlgorithmsandDataStructuresWorkshopWADS/pdsL1KCsltA/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/AlgorithmsandDataStructuresWorkshopWADS/pdsL1KCsltA/">Algorithms and Data Structures : Workshop WADS '89 Ottawa, Canada, August 1719, 1989 Proceedings, edited by F. Dehne, J.R. Sack, N. Santoro</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>