×

Algorithms and data structures. 3rd workshop, WADS ’93. Montréal, Canada 11–13, 1993. Proceedings. (English) Zbl 0825.00122

Lecture Notes in Computer Science 709. Berlin: Springer-Verlag. xii, 635 p. (1993).

Show indexed articles as search result.

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

MSC:

00B25 Proceedings of conferences of miscellaneous specific interest
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68P05 Data structures
68Wxx Algorithms in computer science

Citations:

Zbl 0756.00009
PDFBibTeX XMLCite
Full Text: DOI