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)

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
Creator
Contributor
Editor
Provider
Subject
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
Member of
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)
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
Efficient text searching of regular expressions -- Efficient spatial point location -- Constructing the Voronoi diagram of a set of line segments in parallel -- Analysis of kdt-trees: Kd-trees 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 multi-terminal 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 claw-free 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 largest-area convex polygon -- Finding All Shortest Path Edge Sequences on a convex polyhedron -- Linear algorithms for parity path and two path problems on circular-arc graph -- NC algorithms for circular-arc 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 CL-environment -- Self-adjusting k-ary search trees -- Improving partial rebuilding by using simple balance criteria -- An efficient all-parses systolic algorithm for general context-free 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 tree-based 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/3-540-51542-9
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-540-48237-6
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)
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
Efficient text searching of regular expressions -- Efficient spatial point location -- Constructing the Voronoi diagram of a set of line segments in parallel -- Analysis of kdt-trees: Kd-trees 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 multi-terminal 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 claw-free 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 largest-area convex polygon -- Finding All Shortest Path Edge Sequences on a convex polyhedron -- Linear algorithms for parity path and two path problems on circular-arc graph -- NC algorithms for circular-arc 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 CL-environment -- Self-adjusting k-ary search trees -- Improving partial rebuilding by using simple balance criteria -- An efficient all-parses systolic algorithm for general context-free 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 tree-based 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/3-540-51542-9
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-540-48237-6

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 ...