Algorithms and data structures. 2nd workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings (Q1202067)

The articles of this volume will be reviewed individually. For the preceding workshop see [Zbl 0753.00021]. Indexed articles: \textit{Cunto, Walter; Munro, J. Ian; Poblete, Patricio V.}, A case study in comparison based complexity: Finding the nearest value(s), 1-12 [Zbl 0765.68046] \textit{Aronov, Boris; Sharir, Micha}, On the zone of a surface in a hyperplane arrangement, 13-19 [Zbl 0764.68166] \textit{Pellegrini, Marco}, Ray-shooting and isotopy classes of lines in 3-dimensional space, 20-31 [Zbl 0765.68212] \textit{Dietz, Paul F.}, Finding level-ancestors in dynamic trees, 32-40 [Zbl 0765.68025] \textit{Devillers, Olivier; Meiser, Stefan; Teillaud, Monique}, Fully dynamic Delaunay triangulation in logarithmic expected time per operation, 42-53 [Zbl 0765.68204] \textit{Djidjev, Hristo; Lingas, Andrzej}, On computing the Voronoi diagram for restricted planar figures, 54-64 [Zbl 0765.68047] \textit{Díaz, J.; Gibbons, A. M.; Paterson, M. S.; Torán, J.}, The MINSUMCUT problem, 65-79 [Zbl 0764.68064] \textit{Katoh, Naoki; Iwano, Kazuo}, Efficient algorithms for the minimum range cut problems, 80-91 [Zbl 0765.68050] \textit{Akl, Selim G.}, Memory access in models of parallel computation: From folklore to synergy and beyond, 92-104 [Zbl 0764.68037] \textit{Agarwal, Pankaj K.; Matoušek, Jiří; Suri, Subhash}, Farthest neighbors, maximum spanning trees and related problems in higher dimensions, 105-116 [Zbl 0764.68164] \textit{Salowe, Jeffrey S.}, Shallow interdistance selection and interdistance enumeration, 117-128 [Zbl 0766.68141] \textit{Aguilar, Oscar R.; Datta, Ajoy Kumar; Ghosh, Sukumar}, Sharing memory in asynchronous message passing systems, 129-140 [Zbl 0764.68004] \textit{Hanson, Eric N.}, The interval skip list: A data structure for finding all intervals that overlap a point, 153-164 [Zbl 0764.68021] \textit{Arkin, Esther M.; Khuller, Samir; Mitchell, Joseph S. B.}, Geometric knapsack problems, 165-176 [Zbl 0764.68165] \textit{Han, Yijie}, A fast derandomization scheme and its applications, 177-188 [Zbl 0764.68071] \textit{Lengauer, T.; Theune, D.}, Unstructured path problems and the making of semirings, 189-200 [Zbl 0764.68124] \textit{Mitchell, Joseph S. B.; Wynters, Erik L.}, Finding optimal bipartitions of points and polygons, 202-213 [Zbl 0764.68175] \textit{Czyzowicz, Jurek; Stojmenovic, Ivan; Urrutia, Jorge}, Immobilizing a polytope, 214-227 [Zbl 0785.52004] \textit{Jacquet, Philippe; Szpankowski, Wojciech}, What can we learn about suffix trees from independent tries!, 228-239 [Zbl 0764.68088] \textit{d'Amore, Fabrizio; Marchetti-Spaccamela, Alberto; Nanni, Umberto}, Competitive algorithms for the weighted list update problem, 240-248 [Zbl 0764.68044] \textit{Nilsson, Bengt J.; Schuierer, Sven}, An optimal algorithm for the rectilinear link center of a rectilinear polygon, 249-260 [Zbl 0764.68176] \textit{Das, Gautam; Narasimhan, Giri}, Geometric searching and link distance. (Extended abstract), 261-272 [Zbl 0764.68172] \textit{Naor, Dalit; Vazirani, Vijay V.}, Representing and enumerating edge connectivity cuts in \(\mathcal {RNC}\), 273-285 [Zbl 0765.68041] \textit{Kant, Goos; Bodlaender, Hans L.}, Planar graph augmentation problems, 286-298 [Zbl 0764.68075] \textit{Frederickson, Greg N.}, Parametric search and locating supply centers in trees, 299-319 [Zbl 0764.68069] \textit{Yang, C. D.; Lee, D. T.; Wong, C. K.}, On bends and lengths of rectilinear paths: A graph-theoretic approach, 320-330 [Zbl 0765.68213] \textit{Hershberger, John; Snoeyink, Jack}, Computing minimum length paths of a given homotopy class. (Extended abstract), 331-342 [Zbl 0764.68174] \textit{Bar-Ilan, Judit; Peleg, David}, Approximation algorithms for selecting network centers, 343-354 [Zbl 0764.68059] \textit{Ravi, S. S.; Rosenkrantz, D. J.; Tayi, G. K.}, Facility dispersion problems: Heuristics and special cases, 355-366 [Zbl 0765.68055] \textit{Carlsson, Svante; Nilsson, Bengt J.; Ntafos, Simeon}, Optimum guard covers and \(m\)-watchmen routes for restricted polygons, 367-378 [Zbl 0764.68063] \textit{Agarwal, Pankaj K.; Sharir, Micha}, Applications of a new space partitioning technique, 379-391 [Zbl 0766.68131] \textit{Eppstein, David}, Offline algorithms for dynamic minimum spanning tree problems, 392-399 [Zbl 0764.68066] \textit{Moret, Bernard M. E.; Shapiro, Henry D.}, An empirical analysis of algorithms for constructing a minimum spanning tree, 400-411 [Zbl 0765.68054] \textit{Bhattacharya, Binay K.; Mukhopadhyay, Asish; Toussaint, Godfried T.}, A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible, 412-424 [Zbl 0764.68060] \textit{Vegter, Gert}, Dynamically maintaining the visibility graph, 425-436 [Zbl 0764.68183] \textit{Heffernan, Paul J.; Mitchell, Joseph S. B.}, An optimal algorithm for computing visibility in the plane, 437-448 [Zbl 0764.68072] \textit{Italiano, Giuseppe F.; Sarnak, Neil}, Fully persistent data structures for disjoint set union problems, 449-460 [Zbl 0764.68022] \textit{Kapoor, Sanjiv; Ramesh, H.}, Algorithms for generating all spanning trees of undirected, directed and weighted graphs, 461-472 [Zbl 0764.68076] \textit{Munro, J. Ian; Raman, Venkatesh}, Sorting multisets and vectors in-place, 473-480 [Zbl 0765.68027] \textit{Abrahamson, Karl; Adler, Andrew; Higham, Lisa; Kirkpatrick, David}, Probabilistic leader election on rings of known size, 481-495 [Zbl 0765.68042]