| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Jeffrey F. Naughton Rajasekar Krishnamurthy , Venkatesan T. Chakaravarthy , Raghav Kaushik , Jeffrey F. Naughton: Recursive XML Schemas, Recursive XML Queries, and Relational Storage: XML-to-SQL Query Translation. ICDE 2004 : 42-53 Raghav Kaushik , Rajasekar Krishnamurthy , Jeffrey F. Naughton, Raghu Ramakrishnan : On the Integration of Structure Indexes and Inverted Lists. ICDE 2004 : 829 Raghav Kaushik , Rajasekar Krishnamurthy , Jeffrey F. Naughton, Raghu Ramakrishnan : On the Integration of Structure Indexes and Inverted Lists. SIGMOD Conference 2004 Ahmed Ayad , Jeffrey F. Naughton: Static Optimization of Conjunctive Queries with Sliding Windows Over Infinite Streams. SIGMOD Conference 2004 Gang Luo , Jeffrey F. Naughton, Curt Ellmann , Michael Watzke : Toward a Progress Indicator for Database Queries. SIGMOD Conference 2004 Ashraf Aboulnaga , Jeffrey F. Naughton: Building XML statistics for the hidden web. CIKM 2003 : 358-365 Gang Luo , Jeffrey F. Naughton, Curt Ellmann , Michael Watzke : A Comparison of Three Methods for Join View Maintenance in Parallel RDBMS. ICDE 2003 : 177-188 Jaewoo Kang , Jeffrey F. Naughton, Stratis Viglas : Evaluating Window Joins over Unbounded Streams. ICDE 2003 : 341-352 Rajasekar Krishnamurthy , Venkatesan T. Chakaravarthy , Jeffrey F. Naughton: On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theoretic Perspective. ICDT 2003 : 270-284 Jaewoo Kang , Jeffrey F. Naughton: On Schema Matching with Opaque Column Names and Data Values. SIGMOD Conference 2003 : 205-216 Surajit Chaudhuri , Raghav Kaushik , Jeffrey F. Naughton: On Relational Support for XML Publishing: Beyond Sorting and Tagging. SIGMOD Conference 2003 : 611-622 Alan Halverson , Josef Burger , Leonidas Galanis , Ameet Kini , Rajasekar Krishnamurthy , Ajith Nagaraja Rao , Feng Tian , Stratis Viglas , Yuan Wang , Jeffrey F. Naughton, David J. DeWitt : Mixed Mode XML Query Processing. VLDB 2003 : 225-236 Stratis Viglas , Jeffrey F. Naughton, Josef Burger : Maximizing the Output Rate of Multi-Way Join Queries over Streaming Information Sources. VLDB 2003 : 285-296 Gang Luo , Jeffrey F. Naughton, Curt Ellmann , Michael Watzke : Locking Protocols for Materialized Aggregate Join Views. VLDB 2003 : 596-607 Rajasekar Krishnamurthy , Raghav Kaushik , Jeffrey F. Naughton: XML-SQL Query Translation Literature: The State of the Art and Open Problems. Xsym 2003 : 1-18 Kenneth A. Ross , Minos N. Garofalakis , Jeffrey F. Naughton: Reminiscences an Influential Papers. SIGMOD Record 32 (1): 62-63 (2003) Jianjun Chen , David J. DeWitt , Jeffrey F. Naughton: Design and Evaluation of Alternative Selection Placement Strategies in Optimizing Continuous Queries. ICDE 2002 : 345-356 Gang Luo , Jeffrey F. Naughton, Curt Ellmann : A Non-Blocking Parallel Spatial Join Algorithm. ICDE 2002 : 697-705 Raghav Kaushik , Philip Bohannon , Jeffrey F. Naughton, Henry F. Korth : Covering indexes for branching path queries. SIGMOD Conference 2002 : 133-144 Gang Luo , Curt Ellmann , Peter J. Haas , Jeffrey F. Naughton: A scalable hash ripple join algorithm. SIGMOD Conference 2002 : 252-262 Stratis Viglas , Jeffrey F. Naughton: Rate-based query optimization for streaming information sources. SIGMOD Conference 2002 : 37-48 Qiong Luo , Sailesh Krishnamurthy , C. Mohan , Hamid Pirahesh , Honguk Woo , Bruce G. Lindsay , Jeffrey F. Naughton: Middle-tier database caching for e-business. SIGMOD Conference 2002 : 600-611 Raghav Kaushik , Philip Bohannon , Jeffrey F. Naughton, Pradeep Shenoy : Updates for Structure Indexes. VLDB 2002 : 239-250 Jin-yi Cai , Venkatesan T. Chakaravarthy , Raghav Kaushik , Jeffrey F. Naughton: On the Complexity of Join Predicates. PODS 2001 Chun Zhang , Jeffrey F. Naughton, David J. DeWitt , Qiong Luo , Guy M. Lohman : On Supporting Containment Queries in Relational Database Management Systems. SIGMOD Conference 2001 Qiong Luo , Jeffrey F. Naughton: Form-Based Proxy Caching for Database-Backed Web Sites. VLDB 2001 : 191-200 Ashraf Aboulnaga , Alaa R. Alameldeen , Jeffrey F. Naughton: Estimating the Selectivity of XML Path Expressions for Internet Scale Applications. VLDB 2001 : 591-600 Ashraf Aboulnaga , Jeffrey F. Naughton, Chun Zhang : Generating Synthetic Complex-Structured XML Data. WebDB 2001 : 79-84 Jeffrey F. Naughton, David J. DeWitt , David Maier , Ashraf Aboulnaga , Jianjun Chen , Leonidas Galanis , Jaewoo Kang , Rajasekar Krishnamurthy , Qiong Luo , Naveen Prakash , Ravishankar Ramamurthy , Jayavel Shanmugasundaram , Feng Tian , Kristin Tufte , Stratis Viglas , Yuan Wang , Chun Zhang , Bruce Jackson , Anurag Gupta , Rushan Chen : The Niagara Internet Query System. IEEE Data Eng. Bull. 24 (2): 27-33 (2001) Jayavel Shanmugasundaram , Eugene J. Shekita , Jerry Kiernan , Rajasekar Krishnamurthy , Stratis Viglas , Jeffrey F. Naughton, Igor Tatarinov : A General Techniques for Querying XML Documents using a Relational Database System. SIGMOD Record 30 (3): 20-26 (2001) Weidong Chen , Jeffrey F. Naughton, Philip A. Bernstein : Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, May 16-18, 2000, Dallas, Texas, USA. ACM 2000 Prasad Deshpande , Jeffrey F. Naughton: Aggregate Aware Caching for Multi-Dimensional Queries. EDBT 2000 : 167-182 Amit Shukla , Prasad Deshpande , Jeffrey F. Naughton: Materialized View Selection for Multi-Cube Data Models. EDBT 2000 : 269-284 Ashraf Aboulnaga , Jeffrey F. Naughton: Accurate Estimation of the Cost of Spatial Selections. ICDE 2000 : 123-134 Karthikeyan Ramasamy , Jignesh M. Patel , Jeffrey F. Naughton, Raghav Kaushik : Set Containment Joins: The Good, The Bad and The Ugly. VLDB 2000 : 351-362 Jayavel Shanmugasundaram , Kristin Tufte , David J. DeWitt , Jeffrey F. Naughton, David Maier : Architecting a Network Query Engine for Producing Partial Results. WebDB (Informal Proceedings) 2000 : 17-22 Qiong Luo , Jeffrey F. Naughton, Rajasekar Krishnamurthy , Pei Cao , Yunrui Li : Active Query Caching for Database Web Servers. WebDB (Informal Proceedings) 2000 : 29-34 Jayavel Shanmugasundaram , Kristin Tufte , David J. DeWitt , David Maier , Jeffrey F. Naughton: Architecting a Network Query Engine for Producing Partial Results. WebDB (Selected Papers) 2000 : 58-77 Qiong Luo , Jeffrey F. Naughton, Rajasekar Krishnamurthy , Pei Cao , Yunrui Li : Active Query Caching for Database Web Servers. WebDB (Selected Papers) 2000 : 92-104 Jeffrey F. Naughton: SIGMOD'2000 Program Chair's Message. SIGMOD Record 29 (3): 10-11 (2000) Jayavel Shanmugasundaram , Kristin Tufte , Chun Zhang , Gang He , David J. DeWitt , Jeffrey F. Naughton: Relational Databases for Querying XML Documents: Limitations and Opportunities. VLDB 1999 : 302-314 Yihong Zhao , Karthikeyan Ramasamy , Kristin Tufte , Jeffrey F. Naughton: Array-Based Evaluation of Multi-Dimensional Queries in Object-Relational Databases Systems. ICDE 1998 : 241-249 Shivakumar Venkataraman , Jeffrey F. Naughton, Miron Livny : Remote Load-Sensitive Caching for Multi-Server Database Systems. ICDE 1998 : 514-521 Prasad Deshpande , Karthikeyan Ramasamy , Amit Shukla , Jeffrey F. Naughton: Caching Multidimensional Queries Using Chunks. SIGMOD Conference 1998 : 259-270 Yihong Zhao , Prasad Deshpande , Jeffrey F. Naughton, Amit Shukla : Simultaneous Optimization and Evaluation of Multiple Dimensional Queries. SIGMOD Conference 1998 : 271-282 Amit Shukla , Prasad Deshpande , Jeffrey F. Naughton: Materialized View Selection for Multidimensional Datasets. VLDB 1998 : 488-499 Jeffrey F. Naughton, Gerhard Weikum : Guest Editors' Introduction. Distributed and Parallel Databases 6 (1): 5-6 (1998) Philip A. Bernstein , Michael L. Brodie , Stefano Ceri , David J. DeWitt , Michael J. Franklin , Hector Garcia-Molina , Jim Gray , Gerald Held , Joseph M. Hellerstein , H. V. Jagadish , Michael Lesk , David Maier , Jeffrey F. Naughton, Hamid Pirahesh , Michael Stonebraker , Jeffrey D. Ullman : The Asilomar Report on Database Research. SIGMOD Record 27 (4): 74-80 (1998) Shivakumar Venkataraman , Miron Livny , Jeffrey F. Naughton: Memory Management for Scalable Web Data Servers. ICDE 1997 : 510-519 Michael J. Carey , David J. DeWitt , Jeffrey F. Naughton, Mohammad Asgarian , Paul Brown , Johannes Gehrke , Dhaval Shah : The BUCKY Object-Relational Benchmark (Experience Paper). SIGMOD Conference 1997 : 135-146 Yihong Zhao , Prasad Deshpande , Jeffrey F. Naughton: An Array-Based Algorithm for Simultaneous Multidimensional Aggregates. SIGMOD Conference 1997 : 159-170 Jignesh M. Patel , Jie-Bing Yu , Navin Kabra , Kristin Tufte , Biswadeep Nag , Josef Burger , Nancy E. Hall , Karthikeyan Ramasamy , Roger Lueder , Curt Ellmann , Jim Kupsch , Shelly Guo , David J. DeWitt , Jeffrey F. Naughton: Building a Scaleable Geo-Spatial DBMS: Technology, Implementation, and Evaluation. SIGMOD Conference 1997 : 336-347 Prasad Deshpande , Jeffrey F. Naughton, Karthikeyan Ramasamy , Amit Shukla , Kristin Tufte , Yihong Zhao : Cubing Algorithms, Storage Estimation, and Storage and Processing Alternatives for OLAP. IEEE Data Eng. Bull. 20 (1): 3-11 (1997) Joseph M. Hellerstein , Jeffrey F. Naughton: Query Execution Techniques for Caching Expensive Methods. SIGMOD Conference 1996 : 423-434 Sameet Agarwal , Rakesh Agrawal , Prasad Deshpande , Ashish Gupta , Jeffrey F. Naughton, Raghu Ramakrishnan , Sunita Sarawagi : On the Computation of Multidimensional Aggregates. VLDB 1996 : 506-521 Amit Shukla , Prasad Deshpande , Jeffrey F. Naughton, Karthikeyan Ramasamy : Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies. VLDB 1996 : 522-531 Peter J. Haas , Jeffrey F. Naughton, S. Seshadri , Arun N. Swami : Selectivity and Cost Estimation for Joins Based on Random Sampling. J. Comput. Syst. Sci. 52 (3): 550-569 (1996) David J. DeWitt , Jeffrey F. Naughton, John C. Shafer , Shivakumar Venkataraman : Parallelising OODBMS Traversals: A Performance Evaluation VLDB J. 5 (1): 3-18 (1996) Shivakumar Venkataraman , Miron Livny , Jeffrey F. Naughton: The Impact of Data Placement on Memory Management for Multi-Server OODBMS. ICDE 1995 : 355-364 Ambuj Shatdal , Jeffrey F. Naughton: Adaptive Parallel Aggregation Algorithms. SIGMOD Conference 1995 : 104-114 Janet L. Wiener , Jeffrey F. Naughton: OODB Bulk Loading Revisited: The Partitioned-List Approach. VLDB 1995 : 30-41 Peter J. Haas , Jeffrey F. Naughton, S. Seshadri , Lynne Stokes : Sampling-Based Estimation of the Number of Distinct Values of an Attribute. VLDB 1995 : 311-322 Joseph M. Hellerstein , Jeffrey F. Naughton, Avi Pfeffer : Generalized Search Trees for Database Systems. VLDB 1995 : 562-573 Divesh Srivastava , S. Sudarshan , Raghu Ramakrishnan , Jeffrey F. Naughton: Space Optimization in Deductive Databases. ACM Trans. Database Syst. 20 (4): 472-516 (1995) Richard J. Lipton , Jeffrey F. Naughton: Query Size Estimation by Adaptive Sampling. J. Comput. Syst. Sci. 51 (1): 18-25 (1995) S. Seshadri , Jeffrey F. Naughton: On the Expected Size of Recursive Datalog Queries. J. Comput. Syst. Sci. 51 (2): 137-148 (1995) Jeffrey F. Naughton, Raghu Ramakrishnan , Yehoshua Sagiv , Jeffrey D. Ullman : Argument Reduction by Factoring. Theor. Comput. Sci. 146 (1&2): 269-310 (1995) Voon-Fee Yong , Jeffrey F. Naughton, Jie-Bing Yu : Storage Reclamation and Reorganization in Client-Server Persistent Object Stores. ICDE 1994 : 120-131 Michael J. Carey , David J. DeWitt , Chander Kant , Jeffrey F. Naughton: A Status Report on the oo7 OODBMS Benchmarking Effort. OOPSLA 1994 : 414-426 David J. DeWitt , Jeffrey F. Naughton, John C. Shafer , Shivakumar Venkataraman : ParSets for Parallelizing OODBMS Traversals: Implementation and Performance. PDIS 1994 : 111-120 Peter J. Haas , Jeffrey F. Naughton, Arun N. Swami : On the Relative Cost of Sampling for Join Selectivity Estimation. PODS 1994 : 14-24 Michael J. Carey , David J. DeWitt , Michael J. Franklin , Nancy E. Hall , Mark L. McAuliffe , Jeffrey F. Naughton, Daniel T. Schuh , Marvin H. Solomon , C. K. Tan , Odysseas G. Tsatalos , Seth J. White , Michael J. Zwilling : Shoring Up Persistent Applications. SIGMOD Conference 1994 : 383-394 Janet L. Wiener , Jeffrey F. Naughton: Bulk Loading into an OODB: A Performance Study. VLDB 1994 : 120-131 Ambuj Shatdal , Chander Kant , Jeffrey F. Naughton: Cache Conscious Algorithms for Relational Query Processing. VLDB 1994 : 510-521 Kai Li , Jeffrey F. Naughton, James S. Plank : Low-Latency, Concurrent Checkpointing for Parallel Programs. IEEE Trans. Parallel Distrib. Syst. 5 (8): 874-879 (1994) Jeffrey F. Naughton, Raghu Ramakrishnan : How to Forget the Past Without Repeating It. J. ACM 41 (6): 1151-1177 (1994) Michael J. Carey , David J. DeWitt , Jeffrey F. Naughton: The oo7 Benchmark: Current Status & Future Directions. HPTS 1993 : 0- David J. DeWitt , Jeffrey F. Naughton, Joseph Burger : Nested Loops Revisited. PDIS 1993 : 230-242 Peter J. Haas , Jeffrey F. Naughton, S. Seshadri , Arun N. Swami : Fixed-Precision Estimation of Join Selectivity. PODS 1993 : 190-201 Ambuj Shatdal , Jeffrey F. Naughton: Using Shared Virtual Memory for Parallel Join Processing. SIGMOD Conference 1993 : 119-128 Michael J. Carey , David J. DeWitt , Jeffrey F. Naughton: The oo7 Benchmark. SIGMOD Conference 1993 : 12-21 Richard J. Lipton , Jeffrey F. Naughton: Clocked Adversaries for Hashing. Algorithmica 9 (3): 239-252 (1993) Richard J. Lipton , Jeffrey F. Naughton, Donovan A. Schneider , S. Seshadri : Efficient Sampling Strategies for Relational Database Operations. Theor. Comput. Sci. 116 (1&2): 195-226 (1993) S. Seshadri , Jeffrey F. Naughton: Sampling Issues in Parallel Database Systems. EDBT 1992 : 328-343 Manolis M. Tsangaris , Jeffrey F. Naughton: On the Performance of Object Clustering Techniques. SIGMOD Conference 1992 : 144-153 David J. DeWitt , Jeffrey F. Naughton, Donovan A. Schneider , S. Seshadri : Practical Skew Handling in Parallel Joins. VLDB 1992 : 27-40 Jeffrey F. Naughton, Raghu Ramakrishnan : Bottom-Up Evaluation of Logic Programs. Computational Logic - Essays in Honor of Alan Robinson 1991 : 640-700 David J. DeWitt , Jeffrey F. Naughton, Donovan A. Schneider : Parallel Sorting on a Shared-Nothing Architecture using Probabilistic Splitting. PDIS 1991 : 280-291 S. Seshadri , Jeffrey F. Naughton: On the Expected Size of Recursive Datalog Queries. PODS 1991 : 268-279 Manolis M. Tsangaris , Jeffrey F. Naughton: A Stochastic Approach for Clustering in Object Bases. SIGMOD Conference 1991 : 12-21 S. Sudarshan , Divesh Srivastava , Raghu Ramakrishnan , Jeffrey F. Naughton: Space Optimization in the Bottom-Up Evaluation of Logic Programs. SIGMOD Conference 1991 : 68-77 Kai Li , Jeffrey F. Naughton, James S. Plank : Checkpointing Multicomputer Applications. SRDS 1991 : 2-11 David J. DeWitt , Jeffrey F. Naughton, Donovan A. Schneider : An Evaluation of Non-Equijoin Algorithms. VLDB 1991 : 443-452 Jeffrey F. Naughton: One-Sided Recursions. J. Comput. Syst. Sci. 42 (2): 199-236 (1991) Ramsey W. Haddad , Jeffrey F. Naughton: A Counting Algorithm for a Cyclic Binary Query. J. Comput. Syst. Sci. 43 (1): 145-169 (1991) Jeffrey F. Naughton, Yehoshua Sagiv : A Simple Characterization of Uniform Boundedness for a Class of Recursions. J. Log. Program. 10 (1/2/3&4): 233-252 (1991) Jeffrey F. Naughton, S. Seshadri : On Estimating the Size of Projections. ICDT 1990 : 499-513 Richard J. Lipton , Jeffrey F. Naughton: Query Size Estimation by Adaptive Sampling. PODS 1990 : 40-46 Kai Li , Jeffrey F. Naughton, James S. Plank : Real-Time, Concurrent Checkpoint for Parallel Programs. PPOPP 1990 : 79-88 Richard J. Lipton , Jeffrey F. Naughton, Donovan A. Schneider : Practical Selectivity Estimation through Adaptive Sampling. SIGMOD Conference 1990 : 1-11 Jeffrey F. Naughton, Raghu Ramakrishnan : How to Forget the Past Without Repeating It. VLDB 1990 : 278-289 Jeffrey F. Naughton, Raghu Ramakrishnan , Yehoshua Sagiv , Jeffrey D. Ullman : Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules. SIGMOD Conference 1989 : 235-242 Richard J. Lipton , Jeffrey F. Naughton: Estimating the Size of Generalized Transitive Closures. VLDB 1989 : 165-171 Jeffrey F. Naughton, Raghu Ramakrishnan , Yehoshua Sagiv , Jeffrey D. Ullman : Argument Reduction by Factoring. VLDB 1989 : 173-182 Jeffrey F. Naughton: Minimizing function-free recursive inference rules. J. ACM 36 (1): 69-91 (1989) Jeffrey F. Naughton: Data Independent Recursion in Deductive Databases. J. Comput. Syst. Sci. 38 (2): 259-289 (1989) Kai Li , Jeffrey F. Naughton: Multiprocessor Main Memory Transaction Processing. DPDS 1988 : 177-187 Ramsey W. Haddad , Jeffrey F. Naughton: Counting Methods for Cyclic Relations. PODS 1988 : 333-340 Jeffrey F. Naughton: Compiling Separable Recursions. SIGMOD Conference 1988 : 312-319 Jeffrey F. Naughton, Yehoshua Sagiv : A Decidable Class of Bounded Recursions. PODS 1987 : 227-236 Jeffrey F. Naughton: One-Sided Recursions. PODS 1987 : 340-348 Katherine A. Morris , Jeffrey F. Naughton, Yatin P. Saraiya , Jeffrey D. Ullman , Allen Van Gelder : YAWN! (Yet Another Window on NAIL!). IEEE Data Eng. Bull. 10 (4): 28-43 (1987) Jeffrey F. Naughton: Data Independent Recursion in Deductive Databases. PODS 1986 : 267-279 Jeffrey F. Naughton: Redundancy in Function-Free Recursive Rules. SLP 1986 : 236-245 Jeffrey F. Naughton: One-Sided Recursions. XP7.52 Workshop on Database Theory 1986 1 [ 82 ] [ 87 ] [ 88 ] [ 89 ] [ 110 ] 2 [ 61 ] 3 [ 61 ] 4 [ 89 ] 5 [ 66 ] 6 [ 112 ] 7 [ 68 ] [ 85 ] 8 [ 93 ] [ 97 ] 9 [ 68 ] 10 [ 66 ] 11 [ 64 ] [ 103 ] [ 104 ] 12 [ 38 ] 13 [ 92 ] 14 [ 77 ] [ 79 ] 15 [ 35 ] [ 39 ] [ 44 ] [ 47 ] [ 66 ] 16 [ 68 ] 17 [ 92 ] [ 107 ] [ 115 ] 18 [ 105 ] 19 [ 87 ] [ 99 ] 20 [ 87 ] 21 [ 85 ] 22 [ 23 ] [ 28 ] [ 30 ] [ 35 ] [ 38 ] [ 39 ] [ 44 ] [ 46 ] [ 47 ] [ 58 ] [ 64 ] [ 66 ] [ 68 ] [ 75 ] [ 78 ] [ 80 ] [ 87 ] [ 91 ] [ 99 ] [ 104 ] 23 [ 60 ] [ 61 ] [ 63 ] [ 65 ] [ 70 ] [ 71 ] [ 72 ] [ 83 ] [ 84 ] 24 [ 64 ] [ 96 ] [ 98 ] [ 102 ] [ 109 ] [ 111 ] 25 [ 44 ] [ 68 ] 26 [ 87 ] [ 104 ] 27 [ 68 ] 28 [ 100 ] 29 [ 66 ] 30 [ 4 ] 31 [ 68 ] 32 [ 64 ] 33 [ 87 ] 34 [ 61 ] 35 [ 37 ] [ 45 ] [ 54 ] [ 59 ] [ 96 ] 36 [ 8 ] [ 21 ] 37 [ 44 ] [ 64 ] 38 [ 104 ] 39 [ 75 ] 40 [ 68 ] 41 [ 53 ] [ 62 ] [ 68 ] 42 [ 87 ] 43 [ 68 ] 44 [ 64 ] 45 [ 87 ] [ 106 ] [ 108 ] 46 [ 42 ] [ 47 ] 47 [ 81 ] [ 92 ] [ 93 ] [ 97 ] [ 101 ] [ 105 ] [ 113 ] [ 114 ] [ 115 ] 48 [ 86 ] 49 [ 104 ] 50 [ 97 ] 51 [ 77 ] [ 79 ] [ 86 ] [ 87 ] [ 101 ] [ 104 ] [ 107 ] [ 113 ] [ 114 ] [ 115 ] 52 [ 94 ] 53 [ 64 ] 54 [ 68 ] 55 [ 9 ] [ 17 ] [ 24 ] [ 41 ] 56 [ 77 ] [ 79 ] 57 [ 94 ] 58 [ 13 ] [ 16 ] [ 18 ] [ 33 ] [ 34 ] [ 51 ] 59 [ 57 ] [ 67 ] [ 73 ] 60 [ 91 ] 61 [ 64 ] 62 [ 96 ] [ 98 ] [ 102 ] [ 109 ] [ 111 ] 63 [ 77 ] [ 79 ] [ 87 ] [ 90 ] [ 91 ] [ 94 ] 64 [ 68 ] [ 78 ] [ 80 ] [ 87 ] 65 [ 44 ] 66 [ 94 ] 67 [ 4 ] 68 [ 64 ] 69 [ 64 ] [ 81 ] 70 [ 53 ] 71 [ 68 ] [ 94 ] 72 [ 17 ] [ 24 ] [ 41 ] 73 [ 87 ] 74 [ 12 ] [ 14 ] [ 15 ] [ 25 ] [ 29 ] [ 40 ] [ 49 ] [ 52 ] [ 61 ] [ 113 ] [ 114 ] 75 [ 87 ] 76 [ 60 ] [ 63 ] [ 64 ] [ 72 ] [ 74 ] [ 81 ] 77 [ 104 ] 78 [ 100 ] 79 [ 6 ] [ 12 ] [ 14 ] [ 20 ] [ 49 ] 80 [ 4 ] 81 [ 61 ] 82 [ 16 ] [ 23 ] [ 28 ] [ 30 ] [ 33 ] 83 [ 44 ] 84 [ 19 ] [ 27 ] [ 30 ] [ 32 ] [ 33 ] [ 37 ] [ 50 ] [ 54 ] [ 59 ] 85 [ 46 ] [ 58 ] 86 [ 66 ] 87 [ 75 ] [ 78 ] [ 80 ] [ 86 ] [ 87 ] 88 [ 36 ] [ 42 ] [ 56 ] 89 [ 86 ] 90 [ 93 ] 91 [ 60 ] [ 63 ] [ 70 ] [ 71 ] [ 72 ] [ 83 ] 92 [ 44 ] 93 [ 25 ] [ 52 ] 94 [ 54 ] 95 [ 68 ] 96 [ 25 ] [ 52 ] 97 [ 37 ] [ 45 ] [ 59 ] 98 [ 44 ] 99 [ 86 ] 100 [ 87 ] [ 104 ] 101 [ 26 ] [ 31 ] 102 [ 44 ] 103 [ 63 ] [ 64 ] [ 74 ] [ 75 ] [ 78 ] [ 80 ] [ 87 ] 104 [ 4 ] [ 12 ] [ 14 ] [ 49 ] [ 68 ] 105 [ 46 ] [ 57 ] [ 58 ] [ 67 ] [ 73 ] 106 [ 86 ] [ 87 ] [ 95 ] [ 103 ] [ 104 ] [ 108 ] 107 [ 87 ] [ 104 ] 108 [ 102 ] [ 109 ] [ 111 ] 109 [ 69 ] 110 [ 44 ] 111 [ 43 ] [ 55 ] 112 [ 94 ] 113 [ 48 ] 114 [ 48 ] [ 64 ] 115 [ 75 ] [ 87 ] [ 88 ] [ 91 ] 116 [ 63 ] [ 65 ] [ 71 ] [ 74 ] 117 [ 44 ]  ©2004 Association for Computing Machinery |
