Frank K. H. A. Dehne Papers on DiSC'06 PnP: parallel and external memory iceberg cube computation Publications Note: Links lead to the DBLP on the Web. Frank K. H. A. Dehne Roozbeh Derakhshan , Frank K. H. A. Dehne, Othmar Korn , Bela Stantic : Simulated Annealing for Materialized View Selection in Data Warehousing Environment. Databases and Applications 2006 : 89-94 Ying Chen , Andrew Rau-Chaplin , Frank K. H. A. Dehne, Todd Eavis , D. Green , E. Sithirasenan : cgmOLAP: Efficient Parallel Generation and Querying of Terabyte Size ROLAP Data Cubes. ICDE 2006 : 164 Frank K. H. A. Dehne, Michael R. Fellows , Henning Fernau , Elena Prieto , Frances A. Rosamond : NONBLOCKER: Parameterized Algorithmics for minimum dominating set. SOFSEM 2006 : 237-245 Mike D. Atkinson , Frank K. H. A. Dehne: Theory of Computing 2005, Eleventh CATS 2005, Computing: The Australasian Theory Symposium, Newcastle, NSW, Australia, January/February 2005 Australian Computer Society 2005 Frank K. H. A. Dehne, Alejandro López-Ortiz , Jörg-Rüdiger Sack : Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings Springer 2005 Frank K. H. A. Dehne, Michael R. Fellows , Michael A. Langston , Frances A. Rosamond , Kim Stevens : An O(2 O(k) n 3 ) FPT Algorithm for the Undirected Feedback Vertex Set Problem. COCOON 2005 : 859-869 Frank K. H. A. Dehne, Todd Eavis , Andrew Rau-Chaplin : Parallel querying of ROLAP cubes in the presence of hierarchies. DOLAP 2005 : 89-96 Ying Chen , Frank K. H. A. Dehne, Todd Eavis , Andrew Rau-Chaplin : PnP: Parallel And External Memory Iceberg Cubes. ICDE 2005 : 576-577 Avinash Shankar , Frank K. H. A. Dehne, Ashwin Shankar , Ganesh Subramanian : Applying Coalition Concepts to Service Oriented Multi-Agent Load Balancing Systems - A3p viLoad. PDPTA 2005 : 1283-1289 Frank K. H. A. Dehne, Rolf Klein , Raimund Seidel : Maximizing a Voronoi Region: the Convex Case. Int. J. Comput. Geometry Appl. 15 (5): 463-476 (2005) Rodney G. Downey , Michael R. Fellows , Frank K. H. A. Dehne: Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings Springer 2004 Edson Norberto Cáceres , Frank K. H. A. Dehne, Henrique Mongelli , Siang W. Song , Jayme Luiz Szwarcfiter : A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components. Euro-Par 2004 : 828-831 Frank K. H. A. Dehne, Todd Eavis , Andrew Rau-Chaplin : Top-Down Computation of Partial ROLAP Data Cubes. HICSS 2004 Ying Chen , Frank K. H. A. Dehne, Todd Eavis , Andrew Rau-Chaplin : Building Large ROLAP Data Cubes in Parallel. IDEAS 2004 : 367-377 Frank K. H. A. Dehne, Michael R. Fellows , Frances A. Rosamond , Peter Shaw : Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover. IWPEC 2004 : 271-280 Ying Chen , Frank K. H. A. Dehne, Todd Eavis , Andrew Rau-Chaplin : Parallel ROLAP Data Cube Construction on Shared-Nothing Multiprocessors. Distributed and Parallel Databases 15 (3): 219-236 (2004) Frank K. H. A. Dehne, Jörg-Rüdiger Sack , Michiel H. M. Smid : Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings Springer 2003 James Cheetham , Frank K. H. A. Dehne, Andrew Rau-Chaplin , Ulrike Stege , Peter J. Taillon : A Parallel FPT Application For Clusters. CCGRID 2003 : 70-77 Frank K. H. A. Dehne, Todd Eavis , Andrew Rau-Chaplin : Parallel Multi-Dimensional ROLAP Indexing. CCGRID 2003 : 86- C. E. R. Alves , Edson Cáceres , Frank K. H. A. Dehne, Siang W. Song : A Parallel Wavefront Algorithm for Efficient Biological Sequence Comparison. ICCSA (2) 2003 : 249-258 James Cheetham , Frank K. H. A. Dehne, Sylvain Pitre , Andrew Rau-Chaplin , Peter J. Taillon : Parallel CLUSTAL W for PC Clusters. ICCSA (2) 2003 : 300-309 Ying Chen , Frank K. H. A. Dehne, Todd Eavis , Andrew Rau-Chaplin : Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors. IPDPS 2003 : 70 Albert Chan , Frank K. H. A. Dehne: CGMgraph/CGMlib: Implementing and Testing CGM Graph Algorithms on PC Clusters. PVM/MPI 2003 : 117-125 Frank K. H. A. Dehne, Michael R. Fellows , Frances A. Rosamond : An FPT Algorithm for Set Splitting. WG 2003 : 180-191 Frank K. H. A. Dehne, Wolfgang Dittrich , David A. Hutchinson : Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. Algorithmica 36 (2): 97-122 (2003) James Cheetham , Frank K. H. A. Dehne, Andrew Rau-Chaplin , Ulrike Stege , Peter J. Taillon : Solving large FPT problems on coarse-grained parallel machines. J. Comput. Syst. Sci. 67 (4): 691-706 (2003) Frank K. H. A. Dehne, Stefano Mardegan , Andrea Pietracaprina , Giuseppe Prencipe : Distribution Sweeping on Clustered Machines with Hierarchical Memories. IPDPS 2002 Frank K. H. A. Dehne, Rolf Klein , Raimund Seidel : Maximizing a Voronoi Region: The Convex Case. ISAAC 2002 : 624-634 C. E. R. Alves , Edson Cáceres , Frank K. H. A. Dehne: Parallel dynamic programming for solving the string editing problem on a CGM/BSP. SPAA 2002 : 275-281 C. E. R. Alves , Edson Cáceres , Frank K. H. A. Dehne, Siang W. Song : A CGM/BSP Parallel Similarity Algorithm. WOB 2002 : 1-8 Frank K. H. A. Dehne, Afonso Ferreira , Edson Cáceres , Siang W. Song , Alessandro Roncato : Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP. Algorithmica 33 (2): 183-200 (2002) Frank K. H. A. Dehne, Todd Eavis , Susanne E. Hambrusch , Andrew Rau-Chaplin : Parallelizing the Data Cube. Distributed and Parallel Databases 11 (2): 181-201 (2002) Frank K. H. A. Dehne, Wolfgang Dittrich , David A. Hutchinson , Anil Maheshwari : Bulk Synchronous Parallel Algorithms for the External Memory Model. Theory Comput. Syst. 35 (6): 567-597 (2002) Frank K. H. A. Dehne, Jörg-Rüdiger Sack , Roberto Tamassia : Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings Springer 2001 Frank K. H. A. Dehne, Todd Eavis , Andrew Rau-Chaplin : A Cluster Architecture for Parallel Data Warehousing. CCGRID 2001 : 161-168 Frank K. H. A. Dehne, Todd Eavis , Susanne E. Hambrusch , Andrew Rau-Chaplin : Parallelizing the Data Cube. ICDT 2001 : 129-143 Frank K. H. A. Dehne, Todd Eavis , Andrew Rau-Chaplin : Coarse Grained Parallel On-Line Analytical Processing (OLAP) for Data Mining. International Conference on Computational Science (2) 2001 : 589-598 Frank K. H. A. Dehne, Todd Eavis , Andrew Rau-Chaplin : Computing Partial Data Cubes for Parallel Data Warehousing Applications. PVM/MPI 2001 : 319-326 Frank K. H. A. Dehne, Ans A. G. Steuten , Reind P. van de Riet : WORDNET++: A lexicon for the COLOR-X-method. Data Knowl. Eng. 38 (1): 3-29 (2001) Ans A. G. Steuten , Frank K. H. A. Dehne, Reind P. van de Riet : WordNet++: A Lexicon Supporting the Color-X Method. NLDB 2000 : 1-16 Edson Cáceres , Albert Chan , Frank K. H. A. Dehne, Siang W. Song : Coarse Grained Parallel Graph Planarity Testing. PDPTA 2000 Edson Cáceres , Albert Chan , Frank K. H. A. Dehne, Giuseppe Prencipe : Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs. WG 2000 : 83-94 Thomas H. Cormen , Frank K. H. A. Dehne, Pierre Fraigniaud , Yossi Matias : Guest Editors' Foreword. Theory Comput. Syst. 33 (5/6): 335-335 (2000) Frank K. H. A. Dehne, Arvind Gupta , Jörg-Rüdiger Sack , Roberto Tamassia : Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings Springer 1999 Prosenjit Bose , Albert Chan , Frank K. H. A. Dehne, M. Latzel : Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs. IPPS/SPDP 1999 : 125-129 Frank K. H. A. Dehne, David A. Hutchinson , Anil Maheshwari , Wolfgang Dittrich : Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms. IPPS/SPDP 1999 : 14-20 Frank K. H. A. Dehne, Wolfgang Dittrich , David A. Hutchinson , Anil Maheshwari : Parallel Virtual Memory. SODA 1999 : 889-890 Frank K. H. A. Dehne: Guest Editor's Introduction Algorithmica 24 (3-4): 173-176 (1999) Albert Chan , Frank K. H. A. Dehne, Andrew Rau-Chaplin : Coarse-Grained Parallel Geometric Search. J. Parallel Distrib. Comput. 57 (2): 224-235 (1999) Albert Chan , Frank K. H. A. Dehne: A Note on Coarse Grained Parallel Integer Sorting. Parallel Processing Letters 9 (4): 533-538 (1999) Vassil N. Alexandrov , Frank K. H. A. Dehne, Andrew Rau-Chaplin , Keith Taft : Coarse Grained Parallel Monte Carlo Algorithms for Solving SLAE Using PVM. PVM/MPI 1998 : 323-330 Frank K. H. A. Dehne, Silvia Götz : Practical Parallel Algorithms for Minimum Spanning Trees. Symposium on Reliable Distributed Systems 1998 : 366-371 Frank K. H. A. Dehne, Andrew Rau-Chaplin , Jörg-Rüdiger Sack , Roberto Tamassia : Algorithms and Data Structures, 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings Springer 1997 Edson Cáceres , Frank K. H. A. Dehne, Afonso Ferreira , Paola Flocchini , Ingo Rieping , Alessandro Roncato , Nicola Santoro , Siang W. Song : Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP. ICALP 1997 : 390-400 Albert Chan , Frank K. H. A. Dehne, Andrew Rau-Chaplin : Coarse Grained Parallel Next Element Search. IPPS 1997 : 320- Frank K. H. A. Dehne, Wolfgang Dittrich , David A. Hutchinson : Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. SPAA 1997 : 106-115 Frank K. H. A. Dehne, Rolf Klein : "The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. Algorithmica 17 (1): 19-32 (1997) Frank K. H. A. Dehne, Katia S. Guimarães : Exact and Approximate Computational Geometry Solutions of an Unrestricted Point Set Stereo Matching Problem. Inf. Process. Lett. 64 (3): 107-114 (1997) Frank K. H. A. Dehne, Xiaotie Deng , Patrick W. Dymond , Andreas Fabri , Ashfaq A. Khokhar : A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers. Theory Comput. Syst. 30 (6): 547-558 (1997) Frank K. H. A. Dehne, Siang W. Song : Randomized Parallel List Ranking for Distributed Memory Multiprocessors. ASIAN 1996 : 1-10 Frank K. H. A. Dehne, Andreas Fabri , Andrew Rau-Chaplin : Scalable parallel computational geometry for coarse grained multicomputers. Int. J. Comput. Geometry Appl. 6 (3): 379-400 (1996) Selim G. Akl , Frank K. H. A. Dehne, Jörg-Rüdiger Sack , Nicola Santoro : Algorithms and Data Structures, 4th International Workshop, WADS '95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings Springer 1995 Frank K. H. A. Dehne, Xiaotie Deng , Patrick W. Dymond , Andreas Fabri , Ashfaq A. Khokhar : A Randomized Parallel 3D Convex Hull Algorithm for Coarse Grained Multicomputers. SPAA 1995 : 27-33 Frank K. H. A. Dehne: Scalable Parallel Computational Geometry (Summary). Canada-France Conference on Parallel and Distributed Computing 1994 : 115-119 Frank K. H. A. Dehne, Rafael Dueire Lins : Distributed Cyclic Reference Counting. Canada-France Conference on Parallel and Distributed Computing 1994 : 95-100 Frank K. H. A. Dehne, Rolf Klein : "The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. MFCS 1994 : 296-305 Mikhail J. Atallah , Frank K. H. A. Dehne, Russ Miller , Andrew Rau-Chaplin , Jyh-Jong Tsay : Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers. J. Parallel Distrib. Comput. 20 (1): 1-13 (1994) Frank K. H. A. Dehne, Andreas Fabri , Mostafa Nassar , Andrew Rau-Chaplin , Rada Valiveti : Construction of d-Dimensional Hyperoctrees on a Hypercube Multiprocessor. J. Parallel Distrib. Comput. 23 (2): 256-262 (1994) Frank K. H. A. Dehne, Afonso Ferreira , Andrew Rau-Chaplin : A Massively Parallel Knowledge-Base Server Using a Hypercube Multiprocessor. Parallel Computing 20 (9): 1369-1382 (1994) Frank K. H. A. Dehne, Jörg-Rüdiger Sack , Nicola Santoro , Sue Whitesides : Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings Springer 1993 Frank K. H. A. Dehne, Andreas Fabri , Andrew Rau-Chaplin : Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers. Symposium on Computational Geometry 1993 : 298-307 Susanne E. Hambrusch , Frank K. H. A. Dehne: Determining Maximum K-width-connectivity on Meshes. Comput. Geom. 3 : 91-105 (1993) Susanne E. Hambrusch , Frank K. H. A. Dehne: Determining Maximum itk-Width Connectivity on Meshes. IPPS 1992 : 234-241 Frank K. H. A. Dehne, Afonso Ferreira , Andrew Rau-Chaplin : Parallel Fractional Cascading on Hypercube Multiprocessors. Comput. Geom. 2 : 141-167 (1992) Frank K. H. A. Dehne, Frantisek Fiala , Waldemar W. Koczkodaj : Advances in Computing and Information - ICCI'91, International Conference on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings Springer 1991 Frank K. H. A. Dehne, Jörg-Rüdiger Sack , Nicola Santoro : Algorithms and Data Structures, 2nd Workshop WADS '91, Ottawa, Canada, August 14-16, 1991, Proceedings Springer 1991 Frank K. H. A. Dehne, Andrew Rau-Chaplin : Parallel algorithms for color image quantization on hypercubes and meshes. Algorithms and Parallel VLSI Architectures 1991 : 91-96 Frank K. H. A. Dehne, Afonso Ferreira , Andrew Rau-Chaplin : Efficient Parallel Construction and Manipulation of Quadtrees. ICPP (3) 1991 : 255-262 Mikhail J. Atallah , Frank K. H. A. Dehne, Russ Miller , Andrew Rau-Chaplin , Jyh-Jong Tsay : Multisearch Techniques for Implementing Data Structures on a Mesh-Connected Computer (Preliminary Version). SPAA 1991 : 204-214 Frank K. H. A. Dehne: Editor's Foreword Special Issue on Parallel Algorithms for Geometric Problems on Digitzed Pictures. Algorithmica 6 (5): 621-623 (1991) Frank K. H. A. Dehne, Anne-Lise Hassenklover , Jörg-Rüdiger Sack , Nicola Santoro : Computational Geometry Algorithms for the Systolic Screen. Algorithmica 6 (5): 734-761 (1991) Frank K. H. A. Dehne, Susanne E. Hambrusch : Parallel Algorithms for Determining k-Width Connectivity in Binary Images. J. Parallel Distrib. Comput. 12 (1): 12-23 (1991) Frank K. H. A. Dehne, Michel Gastaldo : A Note on the Load Balancing Problem for Coarse Grained Hypercube Dictionary Machines. CONPAR 1990 : 417-422 Frank K. H. A. Dehne, L. Ficocelli : An Efficient Computational Geometry Method for Detecting Dotted Lines in Noisy Images. Comput. J. 33 (5): 424-428 (1990) Frank K. H. A. Dehne, Andrew Rau-Chaplin : Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry. J. Parallel Distrib. Comput. 8 (4): 367-375 (1990) Frank K. H. A. Dehne: Computing the Largest Empty Rectangle on One- and Two-Dimensional Processor Arrays. J. Parallel Distrib. Comput. 9 (1): 63-68 (1990) Frank K. H. A. Dehne, Afonso Ferreira , Andrew Rau-Chaplin : A. G. Ferreira Parallel branch and bound on fine-grained hypercube multiprocessors. Parallel Computing 15 (1-3): 201-209 (1990) Frank K. H. A. Dehne, Michel Gastaldo : A note on the load balancing problem for coarse grained hypercube dictionary machines. Parallel Computing 16 (1): 75-79 (1990) Frank K. H. A. Dehne, Jörg-Rüdiger Sack , Nicola Santoro : Algorithms and Data Structures, Workshop WADS '89, Ottawa, Canada, August 17-19, 1989, Proceedings Springer 1989 Frank K. H. A. Dehne, Anne-Lise Hassenklover , Jörg-Rüdiger Sack : Computing the Configuration Space for a Robot on a Mesh-of-Processors. ICPP (3) 1989 : 40-47 Frank K. H. A. Dehne: Computing Digitized Voronoi Diagrams on a Systolic Screen and Applications to Clustering. Optimal Algorithms 1989 : 14-24 Frank K. H. A. Dehne, Andrew Rau-Chaplin : Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry. WG 1989 : 316-329 Frank K. H. A. Dehne, Anne-Lise Hassenklover , Jörg-Rüdiger Sack : Computing the configuration space for a robot on a mesh-of-processors. Parallel Computing 12 (2): 221-231 (1989) Frank K. H. A. Dehne, Jörg-Rüdiger Sack : A survey of paralle computational geometry algorithms. Parcella 1988 : 73-88 Frank K. H. A. Dehne, Jörg-Rüdiger Sack , Ivan Stojmenovic : A Note on Determinig the 3-Dimensional Convex Hull of a Set of Points on a Mesh of Processors. SWAT 1988 : 154-162 Frank K. H. A. Dehne: Solving visibility and separability problems on a Mesh-of-Processors. The Visual Computer 3 (6): 356-370 (1988) Frank K. H. A. Dehne, Nicola Santoro : Optimal VLSI Dictionary Machines on Meshes. ICPP 1987 : 832-840 Frank K. H. A. Dehne, Jörg-Rüdiger Sack , Nicola Santoro : Computing on a Systolic Screen: Hulls, Contours and Applications. PARLE (1) 1987 : 121-133 Frank K. H. A. Dehne, Rolf Klein : A Sweepcircle Algorithm for Voronoi Diagrams. WG 1987 : 59-83 Frank K. H. A. Dehne, Hartmut Noltemeier : Voronoi trees and clustering problems. Inf. Syst. 12 (2): 171-175 (1987) Frank K. H. A. Dehne, Jörg-Rüdiger Sack : Translation separability of sets of polygons. The Visual Computer 3 (4): 227-235 (1987) Frank K. H. A. Dehne, Jörg-Rüdiger Sack : Seperability of Sets of Polygons. WG 1986 : 237-251 Frank K. H. A. Dehne: O(n^(1/2)) Algorithms for the Maximal Elements and ECDF Searching Problem on a Mesh-Connected Parallel Computer. Inf. Process. Lett. 22 (6): 303-306 (1986) Frank K. H. A. Dehne, Hartmut Noltemeier : Clustering methods for geometric objects and applications to design problems. The Visual Computer 2 (1): 31-38 (1986) Frank K. H. A. Dehne: Optical clustering. The Visual Computer 2 (1): 39-43 (1986) Frank K. H. A. Dehne: On O(N^4) Algorithm to Contstruct all Vornoi Diagrams for K Nearest Neighbor Searching. ICALP 1983 : 160-172 1 [ 45 ] 2 [ 56 ] 3 [ 77 ] [ 78 ] [ 87 ] 4 [ 28 ] [ 40 ] 5 [ 103 ] 6 [ 62 ] 7 [ 53 ] [ 65 ] [ 66 ] [ 76 ] [ 77 ] [ 78 ] [ 87 ] [ 95 ] 8 [ 52 ] [ 57 ] [ 58 ] [ 62 ] [ 65 ] [ 66 ] [ 84 ] 9 [ 81 ] [ 86 ] [ 89 ] 10 [ 85 ] [ 91 ] [ 93 ] [ 99 ] [ 105 ] 11 [ 64 ] 12 [ 44 ] [ 48 ] 13 [ 106 ] 14 [ 51 ] [ 60 ] [ 61 ] [ 74 ] [ 82 ] 15 [ 96 ] 16 [ 44 ] [ 48 ] 17 [ 69 ] [ 70 ] [ 71 ] [ 72 ] [ 75 ] [ 85 ] [ 88 ] [ 91 ] [ 93 ] [ 94 ] [ 99 ] [ 100 ] [ 105 ] 18 [ 36 ] [ 39 ] [ 44 ] [ 46 ] [ 48 ] 19 [ 83 ] [ 92 ] [ 96 ] [ 101 ] [ 104 ] 20 [ 104 ] 21 [ 20 ] [ 29 ] [ 33 ] [ 38 ] [ 53 ] [ 76 ] 22 [ 32 ] 23 [ 23 ] 24 [ 53 ] 25 [ 64 ] 26 [ 19 ] [ 24 ] 27 [ 55 ] 28 [ 105 ] 29 [ 49 ] 30 [ 63 ] 31 [ 25 ] [ 34 ] [ 35 ] [ 71 ] [ 75 ] 32 [ 14 ] [ 17 ] [ 26 ] 33 [ 51 ] [ 60 ] [ 61 ] [ 74 ] [ 82 ] 34 [ 44 ] [ 48 ] 35 [ 8 ] [ 41 ] [ 50 ] [ 79 ] [ 97 ] 36 [ 32 ] 37 [ 106 ] 38 [ 101 ] 39 [ 62 ] 40 [ 42 ] 41 [ 102 ] 42 [ 60 ] [ 61 ] [ 74 ] 43 [ 80 ] 44 [ 64 ] 45 [ 28 ] [ 40 ] 46 [ 95 ] 47 [ 39 ] 48 [ 3 ] [ 7 ] 49 [ 80 ] 50 [ 86 ] 51 [ 65 ] [ 80 ] 52 [ 104 ] 53 [ 15 ] [ 20 ] [ 22 ] [ 28 ] [ 29 ] [ 30 ] [ 33 ] [ 36 ] [ 38 ] [ 39 ] [ 40 ] [ 46 ] [ 52 ] [ 54 ] [ 56 ] [ 58 ] [ 69 ] [ 70 ] [ 71 ] [ 72 ] [ 75 ] [ 81 ] [ 85 ] [ 86 ] [ 88 ] [ 89 ] [ 91 ] [ 93 ] [ 94 ] [ 99 ] [ 100 ] [ 105 ] 54 [ 53 ] 55 [ 67 ] [ 68 ] 56 [ 53 ] [ 76 ] 57 [ 83 ] [ 92 ] [ 101 ] [ 104 ] 58 [ 5 ] [ 6 ] [ 9 ] [ 12 ] [ 13 ] [ 14 ] [ 17 ] [ 18 ] [ 26 ] [ 31 ] [ 37 ] [ 45 ] [ 54 ] [ 63 ] [ 73 ] [ 90 ] [ 102 ] 59 [ 9 ] [ 10 ] [ 18 ] [ 26 ] [ 31 ] [ 37 ] [ 45 ] [ 53 ] 60 [ 79 ] [ 97 ] 61 [ 98 ] 62 [ 98 ] 63 [ 92 ] 64 [ 105 ] 65 [ 90 ] 66 [ 47 ] [ 53 ] [ 66 ] [ 76 ] [ 77 ] [ 87 ] [ 95 ] 67 [ 106 ] 68 [ 81 ] [ 89 ] 69 [ 67 ] [ 68 ] 70 [ 101 ] 71 [ 12 ] 72 [ 98 ] 73 [ 95 ] 74 [ 56 ] 75 [ 81 ] [ 86 ] [ 89 ] 76 [ 54 ] [ 63 ] [ 73 ] 77 [ 28 ] [ 40 ] 78 [ 39 ] 79 [ 37 ] ©2006 Association for Computing Machinery