Algorithms and data structures. 3rd workshop, WADS '93. Montréal, Canada 11--13, 1993. Proceedings (Q1309035)

The articles of this volume will be reviewed individually. For the preceding workshop see [Zbl 0756.00009]. Indexed articles: \textit{Atallah, Mikhail J.; Chen, Danny Z.}, Computing the all-pairs longest chains in the plane, 1-13 [Zbl 1504.68247] \textit{Borodin, Allan}, Towards a better understanding of pure packet routing, 14-25 [Zbl 1504.68011] \textit{Karp, Richard M.}, A generalization of binary search, 27-34 [Zbl 1504.68051] \textit{Agarwal, Pankaj K.; van Kreveld, Marc}, Connected component and simple polygon intersection searching (extended abstract), 36-47 [Zbl 1504.68039] \textit{Amato, Nancy M.}, An optimal algorithm for finding the separation of simple polygons, 48-59 [Zbl 1504.68244] \textit{Andersson, Arne}, Balanced search trees made simple, 60-71 [Zbl 1504.68041] \textit{Aoki, Yasukazu; Imai, Hiroshi; Imai, Keiko; Rappaport, David}, Probing a set of hyperplanes by lines and related problems, 72-82 [Zbl 1504.68245] \textit{Arge, Lars; Knudsen, Mikael; Larsen, Kirsten}, A general lower bound on the I/O-complexity of comparison-based algorithms, 83-94 [Zbl 1504.68076] \textit{Arkin, Esther M.; Goodrich, Michael T.; Mitchell, Joseph S. B.; Mount, David; Piatko, Christine D.; Skiena, Steven S.}, Point probe decision trees for geometric concept classes, 95-106 [Zbl 1504.68239] \textit{Armon, Deganit; Reif, John}, A dynamic separator algorithm, 107-118 [Zbl 1504.68246] \textit{Azar, Yossi; Kalyanasundaram, Bala; Plotkin, Serge; Pruhs, Kirk R.; Waarts, Orli}, Online load balancing of temporary tasks, 119-130 [Zbl 1504.90056] \textit{Balakrishnan, Hari; Rajaraman, Anand; Rangan, C. Pandu}, Connected domination and Steiner set on asteroidal triple-free graphs, 131-141 [Zbl 1504.05209] \textit{Balasubramanian, R.; Raman, Venkatesh; Srinivasaraghavan, G.}, The complexity of finding certain trees in tournaments, 142-150 [Zbl 1504.68153] \textit{Di Battista, Giuseppe; Liotta, Giuseppe; Vargiu, Francesco}, Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract), 151-162 [Zbl 1504.68161] \textit{Beame, Paul; Fich, Faith E.; Sinha, Rakesh K.}, Separating the power of EREW and CREW PRAMs with small communication width, 163-174 [Zbl 1504.68072] \textit{Berkman, O.; Matias, Y.; Ragde, P.}, Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs, 175-187 [Zbl 1504.68280] \textit{Bern, Marshall; Eppstein, David; Teng, Shang-Hua}, Parallel construction of quadtrees and quality triangulations, 188-199 [Zbl 1504.68248] \textit{Bose, Prosenjit; Buss, Jonathan F.; Lubiw, Anna}, Pattern matching for permutations, 200-209 [Zbl 1504.68150] \textit{Bose, Prosenjit; van Kreveld, Marc; Toussaint, Godfried}, Filling polyhedral molds, 210-221 [Zbl 1504.68271] \textit{Chang, Maw-Shang; Peng, Sheng-Lung; Liaw, Jenn-Liang}, Deferred-query -- an efficient approach for problems on interval and circular-arc graphs (extended abstract), 222-233 [Zbl 1504.68156] \textit{Chen, Jianer; Kanchi, Saroja P.; Kanevsky, Arkady}, On the complexity of graph embeddings (extended abstract), 234-245 [Zbl 1504.68157] \textit{Clarkson, Kenneth L.}, Algorithms for polytope covering and approximation, 246-252 [Zbl 1504.68250] \textit{Codenotti, Bruno; Manzini, Giovanni; Margara, Luciano; Resta, Giovanni}, Global strategies for augmenting the efficiency of TSP heuristics, 253-264 [Zbl 1504.90203] \textit{Datta, Amitava; Lenhof, Hans-Peter; Schwarz, Christian; Smid, Michiel}, Static and dynamic algorithms for \(k\)-point clustering problems, 265-276 [Zbl 1504.68251] \textit{Devillers, Olivier; Fabri, Andreas}, Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers, 277-288 [Zbl 1504.68281] \textit{Dietz, Paul F.; Raman, Rajeev}, Persistence, randomization and parallelization: on some combinatorial games and their applications (abstract), 289-301 [Zbl 1504.68044] \textit{Ding, Yuzheng; Weiss, Mark Alien}, The \(k\)-d heap: an efficient multi-dimensional priority queue, 302-313 [Zbl 1504.68045] \textit{Dobrindt, Katrin; Mehlhorn, Kurt; Yvinec, Mariette}, A complete and efficient algorithm for the intersection of a general and a convex polyhedron, 314-324 [Zbl 1504.68252] \textit{Efrat, Alon; Sharir, Micha; Ziv, Alon}, Computing the smallest \(k\)-enclosing circle and related problems, 325-336 [Zbl 1504.68253] \textit{Giancarlo, Raffaele}, An index data structure for matrices, with applications to fast two-dimensional pattern matching (extended abstract), 337-348 [Zbl 1504.68047] \textit{Graf, Thorsten; Hinrichs, Klaus}, A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects, 349-360 [Zbl 1504.68255] \textit{Gupta, Prosenjit; Janardan, Ravi; Smid, Michiel}, Further results on generalized intersection searching problems: counting, reporting, and dynamization, 361-372 [Zbl 1504.68256] \textit{Heffernan, Paul J.}, Generalized approximate algorithms for point set congruence, 373-384 [Zbl 1504.68257] \textit{Jiang, Tao; Li, Ming}, Approximating shortest superstrings with constraints (extended abstract), 385-396 [Zbl 1504.68295] \textit{Kannan, Sampath; Warnow, Tandy}, Tree reconstruction from partial orders, 397-408 [Zbl 1504.68169] \textit{Kao, Ming-Yang; Teng, Shang-Hua; Toyama, Kentaro}, Improved parallel depth-first search in undirected planar graphs, 409-420 [Zbl 1504.68170] \textit{Karger, David; Motwani, Rajeev; Ramkumar, G. D. S.}, On approximating the longest path in a graph (preliminary version), 421-432 [Zbl 1504.68171] \textit{Khuller, Samir; Raghavachari, Balaji; Young, Neal}, Designing multi-commodity flow trees, 433-441 [Zbl 1504.90016] \textit{Klein, Philip N.; Subramanian, Sairam}, A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs, 442-451 [Zbl 1504.68174] \textit{van Kreveld, Marc}, On fat partitioning, fat covering and the union size of polygons (extended abstract), 452-463 [Zbl 1504.68270] \textit{Krizanc, Danny}, A time-randomness tradeoff for selection in parallel, 464-470 [Zbl 1504.68080] \textit{Lu, Hsueh-I; Klein, Philip N.; Netzer, Robert H. B.}, Detecting race conditions in parallel programs that use one semaphore, 471-482 [Zbl 1504.68036] \textit{Maggs, Bruce; Rauch, Monika}, An algorithm for finding predecessors in integer sets, 483-493 [Zbl 1504.68048] \textit{Maier, Robert S.; Schott, René}, The exhaustion of shared memory: stochastic results, 494-505 [Zbl 1504.68018] \textit{Mirzaian, Andy}, Minimum weight Euclidean matching and weighted relative neighborhood graphs, 506-517 [Zbl 1504.68180] \textit{Mitra, Pinaki; Bhattacharya, Binay}, Efficient approximate shortest-path queries among isothetic rectangular obstacles, 518-529 [Zbl 1504.68262] \textit{Palazzi, Larry; Snoeyink, Jack}, Counting and reporting red/blue segment intersections, 530-540 [Zbl 1504.68265] \textit{Pellegrini, Marco}, Repetitive hidden-surface-removal for polyhedral scenes, 541-552 [Zbl 1504.68266] \textit{De Prisco, Roberto; Monti, Angelo}, On reconfigurability of VLSI linear arrays, 553-564 [Zbl 1504.68020] \textit{Skiena, Steven S.; Sundaram, Gopalakrishnan}, Reconstructing strings from substrings (extended abstract), 565-576 [Zbl 1504.68298] \textit{Souvaine, Diane L.; Yap, Chee-Keng}, Combinatorial complexity of signed discs (extended abstract), 577-588 [Zbl 1504.68268] \textit{Stallmann, Matthias F. M.; Hughes, Thomas A.}, Fast algorithms for one-dimensionsal compaction with jog insertion, 589-600 [Zbl 1504.68299] \textit{Swanson, Kurt}, An optimal algorithm for roundness determination on convex polygons, 601-609 [Zbl 1504.68269] \textit{Telle, Jan Arne; Proskurowski, Andrzej}, Practical algorithms on partial \(k\)-trees with an application to domination-like problems, 610-621 [Zbl 1504.68183] \textit{Westbrook, Jeffery; Yan, Dicky C. K.}, Greedy algorithms for the on-line Steiner tree and generalized Steiner problems, 622-633 [Zbl 1504.68184]