Algorithms and data structures. Workshop WADS '89. Ottawa, Canada, August 17--19, 1989. Proceedings (Q1187673)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Baeza-Yates, Ricardo A.; Gonnet, Gaston H.}, Efficient text searching of regular expressions, 1-2 [Zbl 0794.68030] \textit{Preparata, Franco P.; Tamassia, Roberto}, Efficient spatial point location, 3-11 [Zbl 0794.68025] \textit{Goodrich, Michael T.; Ó'Dúnlaing, Colm; Yap, Chee K.}, Constructing the Voronoi diagram of a set of line segments in parallel, 12-23 [Zbl 0794.68062] \textit{Cunto, Walter; Lau, Gustavo; Flajolet, Philippe}, Analysis of \(k\)d\(t\)-trees: \(k\)d-trees improved by local reorganisations, 24-38 [Zbl 0794.68024] \textit{Dietz, Paul F.}, Optimal algorithms for list indexing and subset rank, 39-46 [Zbl 0766.68057] \textit{Keil, J. Mark; Gutwin, Carl A.}, The Delaunay triangulation closely approximates the complete Euclidean graph, 47-56 [Zbl 0766.52004] \textit{Rappaport, David}, Computing the furthest site Voronoi diagram for a set of discs, 57-66 [Zbl 0767.68098] \textit{Dietz, Paul F.}, Fully persistent arrays. (Extended abstract), 67-74 [Zbl 0767.68017] \textit{Baeza-Yates, Ricardo A.}, String searching algorithms revisited, 75-96 [Zbl 0794.68029] \textit{Atallah, Mikhail J.; Hambrusch, Susanne E.}, Optimal channel placement for multi-terminal nets, 97-114 [Zbl 0794.68011] \textit{Aggarwal, Alok; Moran, Shlomo; Shor, Peter W.; Suri, Subhash}, Computing the minimum visible vertex distance between two polygons, 115-134 [Zbl 0794.68061] \textit{Ke, Yan; O'Rourke, Joseph}, Computing the kernel of a point set in a polygon. (Extended abstract), 135-146 [Zbl 0767.68094] \textit{Chrobak, Marek; Naor, Joseph; Novick, Mark B.}, Using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs, 147-162 [Zbl 0767.68049] \textit{Zhao, Rongyao}, Linear time algorithms for computing reachability regions from polygonal figures, 163-170 [Zbl 0767.68101] \textit{Díaz, Matthew; O'Rourke, Joseph}, Computing the center of area of a polygon, 171-182 [Zbl 0794.68160] \textit{Houle, Michael E.; Imai, Hiroshi; Imai, Keiko; Robert, Jean-Marc}, Weighted orthogonal linear \(L_{\infty{}}\)-approximation and applications, 183-191 [Zbl 0767.68093] \textit{Luccio, Fabrizio; Régnier, Mireille; Schott, René}, Discs and other related data structures, 192-205 [Zbl 0767.68021] \textit{Szpankowski, Wojciech}, Digital data structures and order statistics, 206-217 [Zbl 0767.68025] \textit{Gardy, Danièle; Flajolet, Philippe; Puech, Claude}, On the performance of orthogonal range queries in multiattribute and doubly chained trees, 218-229 [Zbl 0767.68018] \textit{Goodrich, Michael T.; Snoeyink, Jack Scott}, Stabbing parallel segments with a convex polygon, 231-242 [Zbl 0794.68166] \textit{Salowe, Jeffrey S.}, Selecting the kth largest-area convex polygon, 243-250 [Zbl 0796.68102] \textit{Hwang, Yie-Huei; Chang, Ruei-Chuan; Tu, Hung-Yi}, Finding all shortest path edge sequences on a convex polyhedron, 251-266 [Zbl 0794.68162] \textit{Rao, A. Srinivasa; Rangan, C. Pandu}, Linear algorithms for parity path and two path problems on circular-arc graphs, 267-290 [Zbl 0773.05073] \textit{Chen, Lin}, NC algorithms for circular-arc graphs, 291-302 [Zbl 0765.68038] \textit{Khuller, Samir}, Parallel algorithms for the subgraph homeomorphism problem, 303-315 [Zbl 0765.68039] \textit{Czyzowicz, Jurek; Rival, Ivan; Urrutia, Jorge}, Galleries, light matchings and visibility graphs, 316-324 [Zbl 0766.05091] \textit{Kirkpatrick, David G.; Wismath, Stephen K.}, Weighted visibility graphs of bars and related flow problems. (Extended abstract), 325-334 [Zbl 0765.68159] \textit{Adhar, Gur Saran; Peng, Shietung}, Parallel algorithms for cographs recognition and applications, 335-351 [Zbl 0765.68037] \textit{Italiano, Giuseppe F.; Marchetti Spaccamela, Alberto; Nanni, Umberto}, Dynamic data structures for series parallel digraphs, 352-372 [Zbl 0767.68020] \textit{Yap, Chee-Keng; Alt, Helmut}, Motion planning in the \(CL\)-environment, 373-380 [Zbl 0767.68100] \textit{Sherk, Murray}, Self-adjusting \(k\)-ary search trees, 381-392 [Zbl 0766.68018] \textit{Andersson, Arne}, Improving partial rebuilding by using simple balance criteria, 393-402 [Zbl 0767.68016] \textit{Ibarra, Oscar H.; Palis, Michael A.}, An efficient all-parses systolic algorithm for general context-free parsing, 403-419 [Zbl 0767.68073] \textit{Kim, Sam; McNaughton, Robert; McCloskey, Robert}, A polynomial time algorithm for the local testability problem of deterministic finite automata, 420-436 [Zbl 0767.68077] \textit{Pugh, William}, Skip lists: A probabilistic alternative to balanced trees, 437-449 [Zbl 0767.68023] \textit{Port, Graeme; Moffat, Alistair}, A fast algorithm for melding splay trees, 450-459 [Zbl 0767.68022] \textit{Breu, Heinz}, An efficient algorithm for finding all maximal square blocks in a matrix, 460-471 [Zbl 0766.68054] \textit{Nishimura, Naomi}, Complexity issues in tree-based version control, 472-486 [Zbl 0767.68060] \textit{Scholten, Bertha; van Leeuwen, Jan}, Structured NC, 487-498 [Zbl 0766.68045] \textit{Levcopoulos, Christos; Petersson, Ola}, Heapsort --- adapted for presorted files, 499-509 [Zbl 0766.68023] \textit{Weiss, Mark Allen; Navlakha, Jainendra K.}, The distribution of keys in a binary heap, 510-516 [Zbl 0766.68019] \textit{Miller, Russ; Stout, Quentin F.}, Optimal hypercube algorithms for labeled images, 517-528 [Zbl 0766.68050] \textit{Dingle, Adair; Sudborough, I. Hal}, On the complexity of single row routing problems, 529-540 [Zbl 0766.68058] \textit{Derome, Philippe}, A new search time update time tradeoff for the implicit dictionary, 541-551 [Zbl 0766.68016] \textit{Munro, J. Ian; Raman, Venkatesh}, Sorting with minimum data movement, 552-562 [Zbl 0766.68024] \textit{Fernández-Baca, David; Williams, Mark A.}, Augmentation problems on hierarchically defined graphs, 563-576 [Zbl 0766.05093] \textit{Bodlaender, Hans L.}, On linear time minor tests and depth first search, 577-590 [Zbl 0766.68102]