Borrow it
 African Studies Library
 Alumni Medical Library
 Astronomy Library
 Fineman and Pappas Law Libraries
 Frederick S. Pardee Management Library
 Howard Gotlieb Archival Research Center
 Mugar Memorial Library
 Music Library
 Pikering Educational Resources Library
 School of Theology Library
 Science & Engineering Library
 Stone Science Library
The Resource Algorithms and data structures : third workshop, WADS ʼ93, Montreal, Canada, August 1113, 1993 : proceedings, Frank Dehne [and others]
Algorithms and data structures : third workshop, WADS ʼ93, Montreal, Canada, August 1113, 1993 : proceedings, Frank Dehne [and others]
Resource Information
The item Algorithms and data structures : third workshop, WADS ʼ93, Montreal, Canada, August 1113, 1993 : proceedings, Frank Dehne [and others] represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Algorithms and data structures : third workshop, WADS ʼ93, Montreal, Canada, August 1113, 1993 : proceedings, Frank Dehne [and others] represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
 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 allpairs 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
 Language
 eng
 Extent
 xii, 633 pages
 Contents

 Computing the allpairs 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/Ocomplexity of comparisonbased 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 triplefree 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 seriesparallel graphs and 3planar 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
 Triplylogarithmic 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
 Deferredquery, an efficient approach for problems on interval and circulararc 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 kpoint 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 kd 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 kenclosing circle and related problems / A. Efrat, M. Sharir, A. Ziv
 An index data structure for matrices, with applications to fast twodimensional pattern matching / R. Giancarlo
 A planesweep algorithm for the allnearestneighbors 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 depthfirst 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 multicommodity flow trees / S. Khuller, B. Raghavachari, N. Young
 A fully dynamic approximation scheme for allpairs paths in planar graphs / P.N. Klein, S. Subramanian
 On fat partitioning, fat covering, and the union size of polygons / M. van Kreveld
 A timerandomness 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 shortestpath queries among isothetic rectangular obstacles / P. Mitra, B. Bhattacharya
 Counting and reporting red/blue segment intersections / L. Palazzi, J. Snoeyink
 Repetitive hiddensurfaceremoval 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 onedimensional 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 ktrees with an application to dominationlike problems / J.A. Telle, A. Proskurowski
 Greedy algorithms for the online steiner tree and generalized steiner problems / J. Westbrook, D.C.K. Yan
 Isbn
 9780387571553
 Label
 Algorithms and data structures : third workshop, WADS ʼ93, Montreal, Canada, August 1113, 1993 : proceedings
 Title
 Algorithms and data structures
 Title remainder
 third workshop, WADS ʼ93, Montreal, Canada, August 1113, 1993 : proceedings
 Statement of responsibility
 Frank Dehne [and others]
 Subject

 Structures de données (informatique)  Congrès
 Data structures (Computer science)
 Conference papers and proceedings
 Algorithmes  Congrès
 Data structures (Computer science)  Congresses
 Algorithmes  Congrès
 Computer algorithms  Congresses
 Computer algorithms
 Algoritmen
 structure donnée
 géométrie algorithmique
 Structures de données (Informatique)  Congrès
 Electronic resources (Books)
 Datastructuren
 algorithme
 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 allpairs 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
 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 1113, 1993 : proceedings, Frank Dehne [and others]
 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 allpairs 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/Ocomplexity of comparisonbased 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 triplefree 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 seriesparallel graphs and 3planar 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  Triplylogarithmic 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  Deferredquery, an efficient approach for problems on interval and circulararc 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 kpoint 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 kd 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 kenclosing circle and related problems / A. Efrat, M. Sharir, A. Ziv  An index data structure for matrices, with applications to fast twodimensional pattern matching / R. Giancarlo  A planesweep algorithm for the allnearestneighbors 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 depthfirst 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 multicommodity flow trees / S. Khuller, B. Raghavachari, N. Young  A fully dynamic approximation scheme for allpairs paths in planar graphs / P.N. Klein, S. Subramanian  On fat partitioning, fat covering, and the union size of polygons / M. van Kreveld  A timerandomness 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 shortestpath queries among isothetic rectangular obstacles / P. Mitra, B. Bhattacharya  Counting and reporting red/blue segment intersections / L. Palazzi, J. Snoeyink  Repetitive hiddensurfaceremoval 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 onedimensional 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 ktrees with an application to dominationlike problems / J.A. Telle, A. Proskurowski  Greedy algorithms for the online 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 1113, 1993 : proceedings, Frank Dehne [and others]
 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 allpairs 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/Ocomplexity of comparisonbased 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 triplefree 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 seriesparallel graphs and 3planar 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  Triplylogarithmic 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  Deferredquery, an efficient approach for problems on interval and circulararc 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 kpoint 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 kd 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 kenclosing circle and related problems / A. Efrat, M. Sharir, A. Ziv  An index data structure for matrices, with applications to fast twodimensional pattern matching / R. Giancarlo  A planesweep algorithm for the allnearestneighbors 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 depthfirst 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 multicommodity flow trees / S. Khuller, B. Raghavachari, N. Young  A fully dynamic approximation scheme for allpairs paths in planar graphs / P.N. Klein, S. Subramanian  On fat partitioning, fat covering, and the union size of polygons / M. van Kreveld  A timerandomness 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 shortestpath queries among isothetic rectangular obstacles / P. Mitra, B. Bhattacharya  Counting and reporting red/blue segment intersections / L. Palazzi, J. Snoeyink  Repetitive hiddensurfaceremoval 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 onedimensional 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 ktrees with an application to dominationlike problems / J.A. Telle, A. Proskurowski  Greedy algorithms for the online 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
Subject
 Algorithmes  Congrès
 Algorithmes  Congrès
 Algoritmen
 Computer algorithms
 Computer algorithms  Congresses
 Conference papers and proceedings
 Data structures (Computer science)
 Data structures (Computer science)  Congresses
 Datastructuren
 Electronic resources (Books)
 Structures de données (Informatique)  Congrès
 Structures de données (informatique)  Congrès
 algorithme
 géométrie algorithmique
 structure donnée
Genre
Member of
Library Locations

African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 71.108227


Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 71.105717

Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 71.107023

Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 71.099547

Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 71.108227


Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 71.108227

Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 71.101425

School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 71.107235

Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 71.102257

Embed (Experimental)
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.bu.edu/portal/Algorithmsanddatastructuresthirdworkshop/cEM6cTdPaBM/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Algorithmsanddatastructuresthirdworkshop/cEM6cTdPaBM/">Algorithms and data structures : third workshop, WADS ʼ93, Montreal, Canada, August 1113, 1993 : proceedings, Frank Dehne [and others]</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University 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 : third workshop, WADS ʼ93, Montreal, Canada, August 1113, 1993 : proceedings, Frank Dehne [and others]
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.bu.edu/portal/Algorithmsanddatastructuresthirdworkshop/cEM6cTdPaBM/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Algorithmsanddatastructuresthirdworkshop/cEM6cTdPaBM/">Algorithms and data structures : third workshop, WADS ʼ93, Montreal, Canada, August 1113, 1993 : proceedings, Frank Dehne [and others]</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>