The Resource Algorithms and Data Structures : 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings, edited by Frank Dehne, Alejandro López-Ortiz, Jörg-Rüdiger Sack, (electronic resource)

Algorithms and Data Structures : 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings, edited by Frank Dehne, Alejandro López-Ortiz, Jörg-Rüdiger Sack, (electronic resource)

Label
Algorithms and Data Structures : 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings
Title
Algorithms and Data Structures
Title remainder
9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings
Statement of responsibility
edited by Frank Dehne, Alejandro López-Ortiz, Jörg-Rüdiger Sack
Creator
Contributor
Editor
Editor
Subject
Language
  • eng
  • eng
Member of
Is Subseries of
http://bibfra.me/vocab/relation/corporateauthor
pid_xYfNFQg
Dewey number
005.7/3
http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt
  • aB_UCTY7Epo
  • eOrVq6ZbIU0
  • n4GoYBlz_Yw
Image bit depth
0
Language note
English
LC call number
QA76.9.A43
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2005
http://bibfra.me/vocab/lite/meetingName
WADS 2005
Nature of contents
dictionaries
http://bibfra.me/vocab/lite/organizationName
WADS 2005
http://library.link/vocab/relatedWorkOrContributorName
  • Dehne, Frank.
  • López-Ortiz, Alejandro.
  • Sack, Jörg-Rüdiger.
Series statement
Theoretical Computer Science and General Issues
Series volume
3608
http://library.link/vocab/subjectName
  • Computer software
  • Data structures (Computer scienc
  • Computational complexity
  • Computer graphics
  • Electronic data processing
  • Algorithm Analysis and Problem Complexity
  • Data Structures
  • Discrete Mathematics in Computer Science
  • Computer Graphics
  • Numeric Computing
Label
Algorithms and Data Structures : 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings, edited by Frank Dehne, Alejandro López-Ortiz, Jörg-Rüdiger Sack, (electronic resource)
Instantiates
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
cr
Color
not applicable
Content category
text
Content type code
txt
Contents
Session 1 -- Towards a Theory of Algorithms -- Session 2A -- k-Restricted Rotation with an Application to Search Tree Rebalancing -- Heap Building Bounds -- Session 2B -- The Multi-radius Cover Problem -- Parameterized Complexity of Generalized Vertex Cover Problems -- The Complexity of Implicit and Space Efficient Priority Queues -- Analysis of a Class of Tries with Adaptive Multi-digit Branching -- Balanced Aspect Ratio Trees Revisited -- Session 3B -- Improved Combinatorial Group Testing for Real-World Problem Sizes -- Parameterized Counting Algorithms for General Graph Covering Problems -- Approximating the Online Set Multicover Problems via Randomized Winnowing -- Session 4A -- Max-stretch Reduction for Tree Spanners -- Succinct Representation of Triangulations with a Boundary -- Line-Segment Intersection Made In-Place -- Session 4B -- Improved Fixed-Parameter Algorithms for Two Feedback Set Problems -- Communication-Aware Processor Allocation for Supercomputers -- Dynamic Hotlinks -- Session 6A -- The Minimum-Area Spanning Tree Problem -- Hinged Dissection of Polypolyhedra -- Session 6B -- Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms -- Linear Time Algorithms for Generalized Edge Dominating Set Problems -- Session 7A -- On Geometric Dilation and Halving Chords -- Orthogonal Subdivisions with Low Stabbing Numbers -- Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes -- Session 7B -- Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length -- A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs -- The On-line Asymmetric Traveling Salesman Problem -- Session 8A -- All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time -- k-Link Shortest Paths in Weighted Subdivisions -- Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices -- Session 8B -- Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems -- On the Vehicle Routing Problem -- Session 9A -- The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case -- Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms -- Derandomization of Dimensionality Reduction and SDP Based Algorithms -- Session 9B -- Subquadratic Algorithms for 3SUM -- Near-Optimal Pricing in Near-Linear Time -- Improved Approximation Bounds for Planar Point Pattern Matching
Dimensions
unknown
Edition
1st ed. 2005.
Extent
1 online resource (XIV, 446 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540317111
Level of compression
uncompressed
Media category
computer
Media type code
c
Other control number
10.1007/11534273
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000213160
  • (SSID)ssj0000316181
  • (PQKBManifestationID)11285823
  • (PQKBTitleCode)TC0000316181
  • (PQKBWorkID)10262920
  • (PQKB)11248830
  • (DE-He213)978-3-540-31711-1
  • (MiAaPQ)EBC3068012
  • (EXLCZ)991000000000213160
Label
Algorithms and Data Structures : 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings, edited by Frank Dehne, Alejandro López-Ortiz, Jörg-Rüdiger Sack, (electronic resource)
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
cr
Color
not applicable
Content category
text
Content type code
txt
Contents
Session 1 -- Towards a Theory of Algorithms -- Session 2A -- k-Restricted Rotation with an Application to Search Tree Rebalancing -- Heap Building Bounds -- Session 2B -- The Multi-radius Cover Problem -- Parameterized Complexity of Generalized Vertex Cover Problems -- The Complexity of Implicit and Space Efficient Priority Queues -- Analysis of a Class of Tries with Adaptive Multi-digit Branching -- Balanced Aspect Ratio Trees Revisited -- Session 3B -- Improved Combinatorial Group Testing for Real-World Problem Sizes -- Parameterized Counting Algorithms for General Graph Covering Problems -- Approximating the Online Set Multicover Problems via Randomized Winnowing -- Session 4A -- Max-stretch Reduction for Tree Spanners -- Succinct Representation of Triangulations with a Boundary -- Line-Segment Intersection Made In-Place -- Session 4B -- Improved Fixed-Parameter Algorithms for Two Feedback Set Problems -- Communication-Aware Processor Allocation for Supercomputers -- Dynamic Hotlinks -- Session 6A -- The Minimum-Area Spanning Tree Problem -- Hinged Dissection of Polypolyhedra -- Session 6B -- Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms -- Linear Time Algorithms for Generalized Edge Dominating Set Problems -- Session 7A -- On Geometric Dilation and Halving Chords -- Orthogonal Subdivisions with Low Stabbing Numbers -- Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes -- Session 7B -- Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length -- A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs -- The On-line Asymmetric Traveling Salesman Problem -- Session 8A -- All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time -- k-Link Shortest Paths in Weighted Subdivisions -- Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices -- Session 8B -- Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems -- On the Vehicle Routing Problem -- Session 9A -- The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case -- Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms -- Derandomization of Dimensionality Reduction and SDP Based Algorithms -- Session 9B -- Subquadratic Algorithms for 3SUM -- Near-Optimal Pricing in Near-Linear Time -- Improved Approximation Bounds for Planar Point Pattern Matching
Dimensions
unknown
Edition
1st ed. 2005.
Extent
1 online resource (XIV, 446 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540317111
Level of compression
uncompressed
Media category
computer
Media type code
c
Other control number
10.1007/11534273
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000213160
  • (SSID)ssj0000316181
  • (PQKBManifestationID)11285823
  • (PQKBTitleCode)TC0000316181
  • (PQKBWorkID)10262920
  • (PQKB)11248830
  • (DE-He213)978-3-540-31711-1
  • (MiAaPQ)EBC3068012
  • (EXLCZ)991000000000213160

Library Locations

  • Albert D. Cohen Management LibraryBorrow it
    181 Freedman Crescent, Winnipeg, MB, R3T 5V4, CA
    49.807878 -97.129961
  • Architecture/Fine Arts LibraryBorrow it
    84 Curry Place, Winnipeg, MB, CA
    49.807716 -97.136226
  • Archives and Special CollectionsBorrow it
    25 Chancellors Circle (Elizabeth Dafoe Library), Room 330, Winnipeg, MB, R3T 2N2, CA
    49.809961 -97.131878
  • Bibliothèque Alfred-Monnin (Université de Saint-Boniface)Borrow it
    200, avenue de la Cathédrale, Local 2110, Winnipeg, MB, R2H 0H7, CA
    49.888861 -97.119735
  • Bill Larson Library (Grace Hospital)Borrow it
    300 Booth Drive, G-227, Winnipeg, MB, R3J 3M7, CA
    49.882400 -97.276436
  • Carolyn Sifton - Helene Fuld Library (St. Boniface General Hospital)Borrow it
    409 Tache Avenue, Winnipeg, MB, R2H 2A6, CA
    49.883388 -97.126050
  • Concordia Hospital LibraryBorrow it
    1095 Concordia Avenue, Winnipeg, MB, R2K 3S8, CA
    49.913252 -97.064683
  • Donald W. Craik Engineering LibraryBorrow it
    75B Chancellors Circle (Engineering Building E3), Room 361, Winnipeg, MB, R3T 2N2, CA
    49.809053 -97.133292
  • E.K. Williams Law LibraryBorrow it
    224 Dysart Road, Winnipeg, MB, R3T 5V4, CA
    49.811829 -97.131017
  • Eckhardt-Gramatté Music LibraryBorrow it
    136 Dafoe Road (Taché Arts Complex), Room 257, Winnipeg, MB, R3T 2N2, CA
    49.807964 -97.132222
  • Elizabeth Dafoe LibraryBorrow it
    25 Chancellors Circle, Winnipeg, MB, R3T 2N2, CA
    49.809961 -97.131878
  • Fr. H. Drake Library (St. Paul's College)Borrow it
    70 Dysart Road, Winnipeg, MB, R3T 2M6, CA
    49.810605 -97.138184
  • J.W. Crane Memorial Library (Deer Lodge Centre)Borrow it
    2109 Portage Avenue, Winnipeg, MB, R3J 0L3, CA
    49.878000 -97.235520
  • Libraries Annex (not open to the public; please see web page for details)Borrow it
    25 Chancellors Circle (in the Elizabeth Dafoe Library), Winnipeg, MB, R3T 2N2, CA
    49.809961 -97.131878
  • Neil John Maclean Health Sciences LibraryBorrow it
    727 McDermot Avenue (Brodie Centre), 200 Level, Winnipeg, MB, R3E 3P5, CA
    49.903563 -97.160554
  • Sciences and Technology LibraryBorrow it
    186 Dysart Road, Winnipeg, MB, R3T 2M8, CA
    49.811526 -97.133257
  • Seven Oaks General Hospital LibraryBorrow it
    2300 McPhillips Street, Winnipeg, MB, R2V 3M3, CA
    49.955177 -97.148865
  • Sister St. Odilon Library (Misericordia Health Centre)Borrow it
    99 Cornish Avenue, Winnipeg, MB, R3C 1A2, CA
    49.879592 -97.160425
  • St. John's College LibraryBorrow it
    92 Dysart Road, Winnipeg, MB, R3T 2M5, CA
    49.811242 -97.137156
  • Victoria General Hospital LibraryBorrow it
    2340 Pembina Highway, Winnipeg, MB, R3T 2E8, CA
    49.806755 -97.152739
  • William R Newman Library (Agriculture)Borrow it
    66 Dafoe Road, Winnipeg, MB, R3T 2R3, CA
    49.806936 -97.135525
Processing Feedback ...