The Resource Algorithms and data structures : third workshop, WADS ʼ93, Montreal, Canada, August 11-13, 1993 : proceedings, Frank Dehne [and others]

Algorithms and data structures : third workshop, WADS ʼ93, Montreal, Canada, August 11-13, 1993 : proceedings, Frank Dehne [and others]

Label
Algorithms and data structures : third workshop, WADS ʼ93, Montreal, Canada, August 11-13, 1993 : proceedings
Title
Algorithms and data structures
Title remainder
third workshop, WADS ʼ93, Montreal, Canada, August 11-13, 1993 : proceedings
Statement of responsibility
Frank Dehne [and others]
Creator
Contributor
Subject
Genre
Language
eng
Summary
"The papers in this volume were presented at the Third Workshop on Algorithmsand Data Structures (WADS '93), held in Montreal, Canada, August 1993. The volume opens with five invited presentations: "Computing the all-pairs longest chains in the plane" by M.J. Atallah and D.Z. Chen, "Towards a better understanding of pure packet routing" by A. Borodin, "Tolerating faults in meshes and other networks" (abstract) by R. Cole, "A generalization of binary search" by R.M. Karp, and "Groups and algebraic complexity" (abstract) by A.C. Yao. The volume continues with 52 regular presentations selected from 165 submissions, each of which was evaluated by at least three program committee members, many of whom called upon additional reviewers."--PUBLISHER'S WEBSITE
Member of
Cataloging source
DLC
Illustrations
illustrations
Index
index present
LC call number
QA76.9.D35
LC item number
A43 1993
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
1993
http://bibfra.me/vocab/lite/meetingName
WADS '93
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorDate
1960-
http://library.link/vocab/relatedWorkOrContributorName
Dehne, F.
http://library.link/vocab/subjectName
  • Data structures (Computer science)
  • Computer algorithms
  • géométrie algorithmique
  • structure donnée
  • algorithme
  • Structures de données (Informatique)
  • Algorithmes
  • Computer algorithms
  • Data structures (Computer science)
  • Algoritmen
  • Datastructuren
  • Algorithmes
  • Structures de données (informatique)
Label
Algorithms and data structures : third workshop, WADS ʼ93, Montreal, Canada, August 11-13, 1993 : proceedings, Frank Dehne [and others]
Instantiates
Publication
Antecedent source
unknown
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
Computing the all-pairs longest chains in the plane / M.J. Atallah, D.Z. Chen -- Towards a better understanding of pure packet routing / A. Borodin -- Tolerating faults in meshes and other networks (abstract) / R. Cole -- A generalization of binary search / R.M. Karp -- Groups and algebraic complexity (abstract) / A.C. Yao -- Connected component and simple polygon intersection searching / P.K. Agarwal, M. van Kreveld -- An optimal algorithm for finding the separation of simple polygons / N.M. Amato -- Balanced search trees made simple / A. Andersson -- Probing a set of hyperplanes by lines and related problems / Y. Aoki, H. Imai, K. Imai -- A general gower bound on the I/O-complexity of comparison-based algorithms / L. Arge, M. Knudsen -- Point probe decision trees for geometric concept classes / E.M. Arkin [and others] -- A dynamic separator algorithm / D. Armon, J. Reif -- Online goad balancing of temporary tasks / Y. Azar [and others] -- Connected domination and Steiner set on asteroidal triple-free graphs / H. Balakrishnan, A. Rajaraman, C.P. Rangan -- The complexity of finding certain trees in tournaments / R. Balasubramanian, V. Raman, G. Srinivasaraghavan -- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs / G. Di Battista, G. Liotta, F. Vargiu -- Separating the power of EREW and CREW PRAMs with small communication width / P. Beame, F. Fich, R.K. Sinha -- Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs / O. Berkman, Y. Matias, P. Ragde -- Parallel construction of quadtrees and quality triangulations / M. Bern, D. Eppstein, S.-H. Teng -- Pattern matching for permutations / P. Bose, J.F. Buss, A. Lubiw -- Filling polyhedral molds / P. Bose, M. van Kreveld, G. Toussaint -- Deferred-query, an efficient approach for problems on interval and circular-arc graphs / M.-S. Chang, S.-L. Peng, J.-L. Liaw -- On the complexity of graph embeddings / J. Chen, S.P. Kanchi, A. Kanevsky -- Algorithms for polytope covering and approximation / K.L. Clarkson -- Global strategies for augmenting the efficiency of TSP heuristics / B. Codenotti [and others] -- Static and dynamic algorithms for k-point clustering problems / A. Datta [and others] -- Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers / O. Devillers, A. Fabri -- Persistence, randomization and parallelization / P.F. Dietz, R. Raman -- The k-d heap / Y. Ding, M.A. Weiss -- A complete and efficient algorithm for the Intersection of a general and a convex polyhedron / K. Dobrindt, K. Mehlhorn, M. Yvinec -- Computing the smallest k-enclosing circle and related problems / A. Efrat, M. Sharir, A. Ziv -- An index data structure for matrices, with applications to fast two-dimensional pattern matching / R. Giancarlo -- A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects / T. Graf, K. Hinrichs -- Further results on generalized Intersection searching problems / P. Gupta, R. Janardan, M. Smid -- Generalized approximate algorithms for point set congruence / P.J. Heffernan -- Approximating shortest superstrings with constraints / T. Jiang, M. Li -- Tree reconstruction from partial orders / S. Kannan, T. Warnow -- Improved parallel depth-first search in undirected planar graphs / M.-Y. Kao, S.-H. Teng, K. Toyama -- On approximating the longest path in a graph / D. Karger, R. Motwani, G.D.S. Ramkumar -- Designing multi-commodity flow trees / S. Khuller, B. Raghavachari, N. Young -- A fully dynamic approximation scheme for all-pairs paths in planar graphs / P.N. Klein, S. Subramanian -- On fat partitioning, fat covering, and the union size of polygons / M. van Kreveld -- A time-randomness tradeoff for selection in parallel / D. Krizanc -- Detecting race conditions in parallel programs that use one semaphore / H.-I. Lu, P.N. Klein, R.H.B. Netzer -- An algorithm for finding predecessors in Integer sets / B.M. Maggs, M. Rauch -- The exhaustion of shared memory / R.S. Maier, R. Schott -- Minimum weight Euclidean matching and weighted relative neighborhood graphs / A. Mirzaian -- Efficient approximate shortest-path queries among isothetic rectangular obstacles / P. Mitra, B. Bhattacharya -- Counting and reporting red/blue segment intersections / L. Palazzi, J. Snoeyink -- Repetitive hidden-surface-removal for polyhedral scenes / M. Pellegrini -- On reconfigurability of VLSI linear arrays / R. De Prisco, A. Monti -- Reconstructing strings from substrings / S.S. Skiena, G. Sundaram -- Combinatorial complexity of signed discs / D.L. Souvaine, C.-K. Yap -- Fast algorithms for one-dimensional compaction with jog insertion / M.F.M. Stallmann, T.A. Hughes -- An optimal algorithm for roundness determination on convex polygons / K. Swanson -- Practical algorithms on partial k-trees with an application to domination-like problems / J.A. Telle, A. Proskurowski -- Greedy algorithms for the on-line steiner tree and generalized steiner problems / J. Westbrook, D.C.K. Yan
Dimensions
24 cm.
Dimensions
unknown
Extent
xii, 633 pages
File format
unknown
Isbn
9780387571553
Lccn
93028887
Level of compression
unknown
Media category
unmediated
Media MARC source
rdamedia
Media type code
n
Other physical details
illustrations
Quality assurance targets
unknown
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
  • (OCoLC)28546988
  • (OCoLC)ocm28546988
Label
Algorithms and data structures : third workshop, WADS ʼ93, Montreal, Canada, August 11-13, 1993 : proceedings, Frank Dehne [and others]
Publication
Antecedent source
unknown
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
Computing the all-pairs longest chains in the plane / M.J. Atallah, D.Z. Chen -- Towards a better understanding of pure packet routing / A. Borodin -- Tolerating faults in meshes and other networks (abstract) / R. Cole -- A generalization of binary search / R.M. Karp -- Groups and algebraic complexity (abstract) / A.C. Yao -- Connected component and simple polygon intersection searching / P.K. Agarwal, M. van Kreveld -- An optimal algorithm for finding the separation of simple polygons / N.M. Amato -- Balanced search trees made simple / A. Andersson -- Probing a set of hyperplanes by lines and related problems / Y. Aoki, H. Imai, K. Imai -- A general gower bound on the I/O-complexity of comparison-based algorithms / L. Arge, M. Knudsen -- Point probe decision trees for geometric concept classes / E.M. Arkin [and others] -- A dynamic separator algorithm / D. Armon, J. Reif -- Online goad balancing of temporary tasks / Y. Azar [and others] -- Connected domination and Steiner set on asteroidal triple-free graphs / H. Balakrishnan, A. Rajaraman, C.P. Rangan -- The complexity of finding certain trees in tournaments / R. Balasubramanian, V. Raman, G. Srinivasaraghavan -- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs / G. Di Battista, G. Liotta, F. Vargiu -- Separating the power of EREW and CREW PRAMs with small communication width / P. Beame, F. Fich, R.K. Sinha -- Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs / O. Berkman, Y. Matias, P. Ragde -- Parallel construction of quadtrees and quality triangulations / M. Bern, D. Eppstein, S.-H. Teng -- Pattern matching for permutations / P. Bose, J.F. Buss, A. Lubiw -- Filling polyhedral molds / P. Bose, M. van Kreveld, G. Toussaint -- Deferred-query, an efficient approach for problems on interval and circular-arc graphs / M.-S. Chang, S.-L. Peng, J.-L. Liaw -- On the complexity of graph embeddings / J. Chen, S.P. Kanchi, A. Kanevsky -- Algorithms for polytope covering and approximation / K.L. Clarkson -- Global strategies for augmenting the efficiency of TSP heuristics / B. Codenotti [and others] -- Static and dynamic algorithms for k-point clustering problems / A. Datta [and others] -- Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers / O. Devillers, A. Fabri -- Persistence, randomization and parallelization / P.F. Dietz, R. Raman -- The k-d heap / Y. Ding, M.A. Weiss -- A complete and efficient algorithm for the Intersection of a general and a convex polyhedron / K. Dobrindt, K. Mehlhorn, M. Yvinec -- Computing the smallest k-enclosing circle and related problems / A. Efrat, M. Sharir, A. Ziv -- An index data structure for matrices, with applications to fast two-dimensional pattern matching / R. Giancarlo -- A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects / T. Graf, K. Hinrichs -- Further results on generalized Intersection searching problems / P. Gupta, R. Janardan, M. Smid -- Generalized approximate algorithms for point set congruence / P.J. Heffernan -- Approximating shortest superstrings with constraints / T. Jiang, M. Li -- Tree reconstruction from partial orders / S. Kannan, T. Warnow -- Improved parallel depth-first search in undirected planar graphs / M.-Y. Kao, S.-H. Teng, K. Toyama -- On approximating the longest path in a graph / D. Karger, R. Motwani, G.D.S. Ramkumar -- Designing multi-commodity flow trees / S. Khuller, B. Raghavachari, N. Young -- A fully dynamic approximation scheme for all-pairs paths in planar graphs / P.N. Klein, S. Subramanian -- On fat partitioning, fat covering, and the union size of polygons / M. van Kreveld -- A time-randomness tradeoff for selection in parallel / D. Krizanc -- Detecting race conditions in parallel programs that use one semaphore / H.-I. Lu, P.N. Klein, R.H.B. Netzer -- An algorithm for finding predecessors in Integer sets / B.M. Maggs, M. Rauch -- The exhaustion of shared memory / R.S. Maier, R. Schott -- Minimum weight Euclidean matching and weighted relative neighborhood graphs / A. Mirzaian -- Efficient approximate shortest-path queries among isothetic rectangular obstacles / P. Mitra, B. Bhattacharya -- Counting and reporting red/blue segment intersections / L. Palazzi, J. Snoeyink -- Repetitive hidden-surface-removal for polyhedral scenes / M. Pellegrini -- On reconfigurability of VLSI linear arrays / R. De Prisco, A. Monti -- Reconstructing strings from substrings / S.S. Skiena, G. Sundaram -- Combinatorial complexity of signed discs / D.L. Souvaine, C.-K. Yap -- Fast algorithms for one-dimensional compaction with jog insertion / M.F.M. Stallmann, T.A. Hughes -- An optimal algorithm for roundness determination on convex polygons / K. Swanson -- Practical algorithms on partial k-trees with an application to domination-like problems / J.A. Telle, A. Proskurowski -- Greedy algorithms for the on-line steiner tree and generalized steiner problems / J. Westbrook, D.C.K. Yan
Dimensions
24 cm.
Dimensions
unknown
Extent
xii, 633 pages
File format
unknown
Isbn
9780387571553
Lccn
93028887
Level of compression
unknown
Media category
unmediated
Media MARC source
rdamedia
Media type code
n
Other physical details
illustrations
Quality assurance targets
unknown
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
  • (OCoLC)28546988
  • (OCoLC)ocm28546988

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