The Resource Algorithms and data structures : 4th International Workshop, WADS '95 Kingston, Canada, August 1618, 1995 Proceedings, Selim G. Akl [and others] (eds.)
Algorithms and data structures : 4th International Workshop, WADS '95 Kingston, Canada, August 1618, 1995 Proceedings, Selim G. Akl [and others] (eds.)
Resource Information
The item Algorithms and data structures : 4th International Workshop, WADS '95 Kingston, Canada, August 1618, 1995 Proceedings, Selim G. Akl [and others] (eds.) 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 : 4th International Workshop, WADS '95 Kingston, Canada, August 1618, 1995 Proceedings, Selim G. Akl [and others] (eds.) 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 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
 Extent
 1 online resource.
 Contents

 Lower bounds to processortime tradeoffs under boundedspeed message propagation
 The twoline 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
 Twofloodlight illumination of convex polygons
 On the complexity of approximating and illuminating threedimensional 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 polynomialtime
 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 5axis NCmachining
 Computing common tangents without a separating line
 Online perfect matching and mobile computing
 Competitive algorithms for the online traveling salesman
 Quadrangulations of planar sets
 A lineartime construction of the relative neighborhood graph within a histogram
 Computing proximity drawings of trees in the 3dimensional space
 Routing on trees via matchings
 A ranking algorithm for Hamilton paths in shuffleexchange 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/Oalgorithms
 Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
 Computing a dominating pair in an asteroidal triplefree graph in linear time
 A linear algorithm for the maximal planar subgraph problem
 Topology Btrees and their applications
 Inplace calculation of minimumredundancy codes
 Regularfactors in the complements of partial ktrees
 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
 Label
 Algorithms and data structures : 4th International Workshop, WADS '95 Kingston, Canada, August 1618, 1995 Proceedings
 Title
 Algorithms and data structures
 Title remainder
 4th International Workshop, WADS '95 Kingston, Canada, August 1618, 1995 Proceedings
 Statement of responsibility
 Selim G. Akl [and others] (eds.)
 Subject

 Combinatorial analysis
 Combinatorial analysis
 Combinatorial analysis
 Computer Science
 Computer graphics
 Computer graphics
 Computer graphics
 Computer science
 Computer science
 Computer science
 Computer software
 Computer software
 Computer software
 Conference papers and proceedings
 Conference papers and proceedings
 Data structures (Computer science)
 Data structures (Computer science)
 Data structures (Computer science)  Congresses
 Datastructuren
 Engineering & Applied Sciences
 Information storage and retrieval systems
 Information storage and retrieval systems
 Information storage and retrieval systems
 Algoritmen
 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
 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 1618, 1995 Proceedings, Selim G. Akl [and others] (eds.)
 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 processortime tradeoffs under boundedspeed message propagation  The twoline 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  Twofloodlight illumination of convex polygons  On the complexity of approximating and illuminating threedimensional 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 polynomialtime  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 5axis NCmachining  Computing common tangents without a separating line  Online perfect matching and mobile computing  Competitive algorithms for the online traveling salesman  Quadrangulations of planar sets  A lineartime construction of the relative neighborhood graph within a histogram  Computing proximity drawings of trees in the 3dimensional space  Routing on trees via matchings  A ranking algorithm for Hamilton paths in shuffleexchange 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/Oalgorithms  Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep  Computing a dominating pair in an asteroidal triplefree graph in linear time  A linear algorithm for the maximal planar subgraph problem  Topology Btrees and their applications  Inplace calculation of minimumredundancy codes  Regularfactors in the complements of partial ktrees  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/3540602208
 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 1618, 1995 Proceedings, Selim G. Akl [and others] (eds.)
 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 processortime tradeoffs under boundedspeed message propagation  The twoline 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  Twofloodlight illumination of convex polygons  On the complexity of approximating and illuminating threedimensional 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 polynomialtime  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 5axis NCmachining  Computing common tangents without a separating line  Online perfect matching and mobile computing  Competitive algorithms for the online traveling salesman  Quadrangulations of planar sets  A lineartime construction of the relative neighborhood graph within a histogram  Computing proximity drawings of trees in the 3dimensional space  Routing on trees via matchings  A ranking algorithm for Hamilton paths in shuffleexchange 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/Oalgorithms  Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep  Computing a dominating pair in an asteroidal triplefree graph in linear time  A linear algorithm for the maximal planar subgraph problem  Topology Btrees and their applications  Inplace calculation of minimumredundancy codes  Regularfactors in the complements of partial ktrees  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/3540602208
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (OCoLC)827360013
Subject
 Combinatorial analysis
 Combinatorial analysis
 Combinatorial analysis
 Computer Science
 Computer graphics
 Computer graphics
 Computer graphics
 Computer science
 Computer science
 Computer science
 Computer software
 Computer software
 Computer software
 Conference papers and proceedings
 Conference papers and proceedings
 Data structures (Computer science)
 Data structures (Computer science)
 Data structures (Computer science)  Congresses
 Datastructuren
 Engineering & Applied Sciences
 Information storage and retrieval systems
 Information storage and retrieval systems
 Information storage and retrieval systems
 Algoritmen
Genre
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/Algorithmsanddatastructures4th/Fyst1vaCrk8/" 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/Algorithmsanddatastructures4th/Fyst1vaCrk8/">Algorithms and data structures : 4th International Workshop, WADS '95 Kingston, Canada, August 1618, 1995 Proceedings, Selim G. Akl [and others] (eds.)</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 : 4th International Workshop, WADS '95 Kingston, Canada, August 1618, 1995 Proceedings, Selim G. Akl [and others] (eds.)
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/Algorithmsanddatastructures4th/Fyst1vaCrk8/" 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/Algorithmsanddatastructures4th/Fyst1vaCrk8/">Algorithms and data structures : 4th International Workshop, WADS '95 Kingston, Canada, August 1618, 1995 Proceedings, Selim G. Akl [and others] (eds.)</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>