Borrow it
Coverart for item
The Resource Algorithms and data structures : 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings, Selim G. Akl [and others] (eds.)

Algorithms and data structures : 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings, Selim G. Akl [and others] (eds.)

Creator
Contributor
Summary
This volume constitutes the proceedings of the Fourth International Workshop on Algorithms and Data Structures, WADS '95, held in Kingston, Canada in August 1995. The book presents 40 full refereed papers selected from a total of 121 submissions together with invited papers by Preparata and Bilardi, Sharir, Toussaint, and Vitanyi and Li. The book addresses various aspects of algorithms, data structures, computational geometry, scheduling, computational graph theory, and searching
Language
eng
Work
Publication
Extent
1 online resource.
Contents
  • Lower bounds to processor-time tradeoffs under bounded-speed message propagation
  • The two-line center problem from a polar view: a new algorithm and data structure
  • On some geometric selection and optimization problems via sorted matrices
  • Load balancing in quorum systems
  • Balanced distributed search trees do not exist
  • Two-floodlight illumination of convex polygons
  • On the complexity of approximating and illuminating three-dimensional convex polyhedra
  • Scheduling jobs that arrive over time
  • Dynamic algorithms for the Dyck languages
  • Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
  • Computing a shortest watchman path in a simple polygon in polynomial-time
  • Going home through an unknown street
  • Page migration with limited local memory capacity
  • Randomized algorithms for metrical task systems
  • Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining
  • Computing common tangents without a separating line
  • Online perfect matching and mobile computing
  • Competitive algorithms for the on-line traveling salesman
  • Quadrangulations of planar sets
  • A linear-time construction of the relative neighborhood graph within a histogram
  • Computing proximity drawings of trees in the 3-dimensional space
  • Routing on trees via matchings
  • A ranking algorithm for Hamilton paths in shuffle-exchange graphs
  • Amortization results for chromatic search trees, with an application to priority queues
  • Fast meldable priority queues
  • On the computation of fast data transmissions in networks with capacities and delays
  • Routing with delays when storage is costly
  • Algorithmic arguments in physics of computation
  • The buffer tree: A new technique for optimal I/O-algorithms
  • Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
  • Computing a dominating pair in an asteroidal triple-free graph in linear time
  • A linear algorithm for the maximal planar subgraph problem
  • Topology B-trees and their applications
  • In-place calculation of minimum-redundancy codes
  • Regular-factors in the complements of partial k-trees
  • Obstructions to within a few vertices or edges of acyclic
  • Faster enumeration of all spanning trees of a directed graph
  • A simpler minimum spanning tree verification algorithm
  • On approximation properties of the Independent set problem for degree 3 graphs
  • Approximation of Constraint Satisfaction via local search
  • On the difficulty of range searching
  • Tables should be sorted (on random access machines)
  • Improved length bounds for the shortest superstring problem
  • Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)
  • Experiences with the implementation of geometric algorithms
Isbn
9783540447474
Instance
Label
Algorithms and data structures : 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings
Title
Algorithms and data structures
Title remainder
4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings
Statement of responsibility
Selim G. Akl [and others] (eds.)
Creator
Contributor
Subject
Genre
Language
eng
Summary
This volume constitutes the proceedings of the Fourth International Workshop on Algorithms and Data Structures, WADS '95, held in Kingston, Canada in August 1995. The book presents 40 full refereed papers selected from a total of 121 submissions together with invited papers by Preparata and Bilardi, Sharir, Toussaint, and Vitanyi and Li. The book addresses various aspects of algorithms, data structures, computational geometry, scheduling, computational graph theory, and searching
Member of
Cataloging source
KIJ
Dewey number
005.1
Image bit depth
0
Index
index present
LC call number
QA76.9.D35
LC item number
W33 1995
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
1995
http://bibfra.me/vocab/lite/meetingName
WADS '95
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
Akl, Selim G
Series statement
Lecture Notes in Computer Science,
Series volume
955
http://library.link/vocab/subjectName
  • Data structures (Computer science)
  • Computer science
  • Computer software
  • Information storage and retrieval systems
  • Computer graphics
  • Combinatorial analysis
  • Combinatorial analysis
  • Computer graphics
  • Computer science
  • Computer software
  • Data structures (Computer science)
  • Information storage and retrieval systems
  • Algoritmen
  • Datastructuren
  • Computer Science
  • Engineering & Applied Sciences
Label
Algorithms and data structures : 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings, Selim G. Akl [and others] (eds.)
Instantiates
Publication
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
Lower bounds to processor-time tradeoffs under bounded-speed message propagation -- The two-line center problem from a polar view: a new algorithm and data structure -- On some geometric selection and optimization problems via sorted matrices -- Load balancing in quorum systems -- Balanced distributed search trees do not exist -- Two-floodlight illumination of convex polygons -- On the complexity of approximating and illuminating three-dimensional convex polyhedra -- Scheduling jobs that arrive over time -- Dynamic algorithms for the Dyck languages -- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications -- Computing a shortest watchman path in a simple polygon in polynomial-time -- Going home through an unknown street -- Page migration with limited local memory capacity -- Randomized algorithms for metrical task systems -- Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining -- Computing common tangents without a separating line -- Online perfect matching and mobile computing -- Competitive algorithms for the on-line traveling salesman -- Quadrangulations of planar sets -- A linear-time construction of the relative neighborhood graph within a histogram -- Computing proximity drawings of trees in the 3-dimensional space -- Routing on trees via matchings -- A ranking algorithm for Hamilton paths in shuffle-exchange graphs -- Amortization results for chromatic search trees, with an application to priority queues -- Fast meldable priority queues -- On the computation of fast data transmissions in networks with capacities and delays -- Routing with delays when storage is costly -- Algorithmic arguments in physics of computation -- The buffer tree: A new technique for optimal I/O-algorithms -- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep -- Computing a dominating pair in an asteroidal triple-free graph in linear time -- A linear algorithm for the maximal planar subgraph problem -- Topology B-trees and their applications -- In-place calculation of minimum-redundancy codes -- Regular-factors in the complements of partial k-trees -- Obstructions to within a few vertices or edges of acyclic -- Faster enumeration of all spanning trees of a directed graph -- A simpler minimum spanning tree verification algorithm -- On approximation properties of the Independent set problem for degree 3 graphs -- Approximation of Constraint Satisfaction via local search -- On the difficulty of range searching -- Tables should be sorted (on random access machines) -- Improved length bounds for the shortest superstring problem -- Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles) -- Experiences with the implementation of geometric algorithms
Control code
827360013
Dimensions
unknown
Extent
1 online resource.
File format
multiple file formats
Form of item
online
Isbn
9783540447474
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/3-540-60220-8
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(OCoLC)827360013
Label
Algorithms and data structures : 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings, Selim G. Akl [and others] (eds.)
Publication
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
Lower bounds to processor-time tradeoffs under bounded-speed message propagation -- The two-line center problem from a polar view: a new algorithm and data structure -- On some geometric selection and optimization problems via sorted matrices -- Load balancing in quorum systems -- Balanced distributed search trees do not exist -- Two-floodlight illumination of convex polygons -- On the complexity of approximating and illuminating three-dimensional convex polyhedra -- Scheduling jobs that arrive over time -- Dynamic algorithms for the Dyck languages -- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications -- Computing a shortest watchman path in a simple polygon in polynomial-time -- Going home through an unknown street -- Page migration with limited local memory capacity -- Randomized algorithms for metrical task systems -- Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining -- Computing common tangents without a separating line -- Online perfect matching and mobile computing -- Competitive algorithms for the on-line traveling salesman -- Quadrangulations of planar sets -- A linear-time construction of the relative neighborhood graph within a histogram -- Computing proximity drawings of trees in the 3-dimensional space -- Routing on trees via matchings -- A ranking algorithm for Hamilton paths in shuffle-exchange graphs -- Amortization results for chromatic search trees, with an application to priority queues -- Fast meldable priority queues -- On the computation of fast data transmissions in networks with capacities and delays -- Routing with delays when storage is costly -- Algorithmic arguments in physics of computation -- The buffer tree: A new technique for optimal I/O-algorithms -- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep -- Computing a dominating pair in an asteroidal triple-free graph in linear time -- A linear algorithm for the maximal planar subgraph problem -- Topology B-trees and their applications -- In-place calculation of minimum-redundancy codes -- Regular-factors in the complements of partial k-trees -- Obstructions to within a few vertices or edges of acyclic -- Faster enumeration of all spanning trees of a directed graph -- A simpler minimum spanning tree verification algorithm -- On approximation properties of the Independent set problem for degree 3 graphs -- Approximation of Constraint Satisfaction via local search -- On the difficulty of range searching -- Tables should be sorted (on random access machines) -- Improved length bounds for the shortest superstring problem -- Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles) -- Experiences with the implementation of geometric algorithms
Control code
827360013
Dimensions
unknown
Extent
1 online resource.
File format
multiple file formats
Form of item
online
Isbn
9783540447474
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/3-540-60220-8
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(OCoLC)827360013

Subject

Genre

Member of

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012

Library Links

Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by University of Missouri Libraries. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...