Data Portal @ linkeddatafragments.org

Matches in Harvard for { <http://id.lib.harvard.edu/aleph/003724838/catalog> ?p ?o. }

• catalog abstract ""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.".
• catalog contributor b5391782.
• catalog contributor b5391783.
• catalog created "c1993.".
• catalog date "1993".
• catalog date "c1993.".
• catalog dateCopyrighted "c1993.".
• catalog description ""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.".
• catalog description "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 -- ".
• catalog description "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.".
• catalog description "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] -- ".
• catalog description "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 -- ".
• catalog description "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 -- ".
• catalog description "Includes bibliographical references and index.".
• catalog description "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 -- ".
• catalog extent "xii, 633 p. :".
• catalog hasFormat "Algorithms and data structures.".
• catalog identifier "0387571558 (New York)".
• catalog identifier "3540571558 (Berlin)".
• catalog isFormatOf "Algorithms and data structures.".
• catalog isPartOf "Lecture notes in computer science ; 709".
• catalog issued "1993".
• catalog issued "c1993.".
• catalog language "eng".
• catalog publisher "Berlin ; New York : Springer-Verlag,".
• catalog relation "Algorithms and data structures.".
• catalog subject "005.7/3 20".
• catalog subject "Computer algorithms Congresses.".
• catalog subject "Data structures (Computer science) Congresses.".
• catalog subject "QA76.9.D35 A43 1993".
• catalog tableOfContents "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 -- ".
• catalog tableOfContents "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.".
• catalog tableOfContents "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] -- ".
• catalog tableOfContents "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 -- ".
• catalog tableOfContents "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 -- ".
• catalog tableOfContents "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 -- ".
• catalog title "Algorithms and data structures : third workshop, WADS ʾ93, Montréal, Canada, August 11-13, 1993 : proceedings / Frank Dehne ... [et al.], eds.".
• catalog type "Conference proceedings. fast".
• catalog type "text".