I. V. Ramakrishnan Papers on DiSC'04 On the complexity of schema inference from web pages in the presence of nullable data attributes On Precision and Recall of Multi-Attribute Data Extraction from Semistructured Sources Publications Note: Links lead to the DBLP on the Web. I. V. Ramakrishnan Giridhar Pemmasani , Hai-Feng Guo , Yifei Dong , C. R. Ramakrishnan , I. V. Ramakrishnan: Online Justification for Tabled Logic Programs. FLOPS 2004 : 24-38 Nikeeta Julasana , Akshat Khandelwal , Anupama Lolage , Prabhdeep Singh , Priyanka Vasudevan , Hasan Davulcu , I. V. Ramakrishnan: WinAgent: a system for creating and executing personal information assistants using a web browser. Intelligent User Interfaces 2004 : 356-357 Guizhen Yang , I. V. Ramakrishnan, Michael Kifer : On the complexity of schema inference from web pages in the presence of nullable data attributes. CIKM 2003 : 224-231 Saikat Mukherjee , Guizhen Yang , Wenfang Tan , I. V. Ramakrishnan: Automatic Discovery of Semantic Structures in HTML Documents. ICDAR 2003 : 245-249 Guizhen Yang , Saikat Mukherjee , I. V. Ramakrishnan: On Precision and Recall of Multi-Attribute Data Extraction from Semistructured Sources. ICDM 2003 : 395-402 Giridhar Pemmasani , Hai-Feng Guo , Yifei Dong , C. R. Ramakrishnan , I. V. Ramakrishnan: Online Justification for Tabled Logic Programs. ICLP 2003 : 500-501 Saikat Mukherjee , Guizhen Yang , I. V. Ramakrishnan: Automatic Annotation of Content-Rich HTML Documents: Structural and Semantic Analysis. International Semantic Web Conference 2003 : 533-549 Hasan Davulcu , Srinivas Vadrevu , Saravanakumar Nagarajan , I. V. Ramakrishnan: OntoMiner: Bootstrapping and Populating Ontologies from Domain-Specific Web Sites. IEEE Intelligent Systems 18 (5): 24-33 (2003) Hasan Davulcu , Saikat Mukherjee , I. V. Ramakrishnan: Extraction Techniques for Mining Services from Web Sources. ICDM 2002 : 601-604 Giridhar Pemmasani , C. R. Ramakrishnan , I. V. Ramakrishnan: Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints. ICLP 2002 : 100-114 Hai-Feng Guo , C. R. Ramakrishnan , I. V. Ramakrishnan: Justification Based on Program Transformation. LOPSTR 2002 : 158-159 Hasan Davulcu , Saikat Mukherjee , I. V. Ramakrishnan: A Clustering Technique for Mining Data from Text Tables. SDM 2002 Hasan Davulcu , Saikat Mukherjee , Arvind Seth , I. V. Ramakrishnan: CuTeX: a system for extracting data from text tables. SIGIR 2002 : 457 Prashant Choudhari , Hasan Davulcu , Abhishek Joglekar , Akshay More , Saikat Mukherjee , Supriya Patil , I. V. Ramakrishnan: YellowPager: a tool for ontology-based mining of service directories from web sources. SIGIR 2002 : 458 Abhik Roychoudhury , K. Narayan Kumar , C. R. Ramakrishnan , I. V. Ramakrishnan: Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs. Int. J. Found. Comput. Sci. 13 (3): 387-403 (2002) I. V. Ramakrishnan: Practical Aspects of Declarative Languages, Third International Symposium, PADL 2001, Las Vegas, Nevada, March 11-12, 2001, Proceedings Springer 2001 Abhik Roychoudhury , I. V. Ramakrishnan: Automated Inductive Verification of Parameterized Protocols. CAV 2001 : 25-37 Hai-Feng Guo , C. R. Ramakrishnan , I. V. Ramakrishnan: Speculative Beats Conservative Justification. ICLP 2001 : 150-165 Samik Basu , Madhavan Mukund , C. R. Ramakrishnan , I. V. Ramakrishnan, Rakesh M. Verma : Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming. ICLP 2001 : 166-180 I. V. Ramakrishnan, R. C. Sekar , Andrei Voronkov : Term Indexing. Handbook of Automated Reasoning 2001 : 1853-1964 R. Ramesh , I. V. Ramakrishnan, R. C. Sekar : Automata-driven efficient subterm unification. Theor. Comput. Sci. 254 (1-2): 187-223 (2001) C. R. Ramakrishnan , I. V. Ramakrishnan, Scott A. Smolka , Yifei Dong , Xiaoqun Du , Abhik Roychoudhury , V. N. Venkatakrishnan : XMC: A Logic-Programming-Based Verification Toolset. CAV 2000 : 576-580 Hasan Davulcu , Guizhen Yang , Michael Kifer , I. V. Ramakrishnan: Design and Implementation of the Physical Layer in WebBases: The XRover Experience. Computational Logic 2000 : 1094-1105 Leo Bachmair , I. V. Ramakrishnan, Ashish Tiwari , Laurent Vigneron : Congruence Closure Modulo Associativity and Commutativity. FroCos 2000 : 245-259 I. V. Ramakrishnan: Current Trends in Logic Programming: Prospects and Promises. PADL 2000 : 324 Hasan Davulcu , Guizhen Yang , Michael Kifer , I. V. Ramakrishnan: Computational Aspects of Resilient Data Extraction from Semistructured Sources. PODS 2000 : 136-144 Abhik Roychoudhury , C. R. Ramakrishnan , I. V. Ramakrishnan: Justifying proofs using memo tables. PPDP 2000 : 178-189 Abhik Roychoudhury , K. Narayan Kumar , C. R. Ramakrishnan , I. V. Ramakrishnan, Scott A. Smolka : Verification of Parameterized Systems Using Logic Program Transformations. TACAS 2000 : 172-187 Abhik Roychoudhury , K. Narayan Kumar , C. R. Ramakrishnan , I. V. Ramakrishnan: Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs. ASIAN 1999 : 322-333 Ernie Johnson , C. R. Ramakrishnan , I. V. Ramakrishnan, Prasad Rao : A Space Efficient Engine for Subsumption-Based Tabled Evaluation of Logic Programs. Fuji International Symposium on Functional and Logic Programming 1999 : 284-300 Abhik Roychoudhury , K. Narayan Kumar , I. V. Ramakrishnan: Generalized Unfold/fold Transformation Systems for Normal Logic Programs. ICLP 1999 : 616 Abhik Roychoudhury , K. Narayan Kumar , C. R. Ramakrishnan , I. V. Ramakrishnan: A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs. PPDP 1999 : 396-413 Hasan Davulcu , Michael Kifer , L. Robert Pokorny , C. R. Ramakrishnan , I. V. Ramakrishnan, Steven Dawson : Modeling and Analysis of Interactions in Virtual Enterprises. RIDE 1999 : 12-18 Leo Bachmair , C. R. Ramakrishnan , I. V. Ramakrishnan, Ashish Tiwari : Normalization via Rewrite Closures. RTA 1999 : 190-204 Hasan Davulcu , Juliana Freire , Michael Kifer , I. V. Ramakrishnan: A Layered Architecture for Querying Dynamic Web Content. SIGMOD Conference 1999 : 491-502 Yifei Dong , Xiaoqun Du , Y. S. Ramakrishna , C. R. Ramakrishnan , I. V. Ramakrishnan, Scott A. Smolka , Oleg Sokolsky , Eugene W. Stark , David Scott Warren : Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools. TACAS 1999 : 74-88 I. V. Ramakrishnan, Prasad Rao , Konstantinos F. Sagonas , Terrance Swift , David Scott Warren : Efficient Access Mechanisms for Tabled Logic Programs. J. Log. Program. 38 (1): 31-54 (1999) Abhik Roychoudhury , C. R. Ramakrishnan , I. V. Ramakrishnan, R. C. Sekar : A Conservative Technique to Improve Deterministic Evaluation of Logic Programs. ICCL 1998 : 196-205 Prasad Rao , C. R. Ramakrishnan , I. V. Ramakrishnan: On the Optimality of Scheduling Strategies in Subsumption-based Tabled Resolution. IJCSLP 1998 : 310-324 Baoqiu Cui , Yifei Dong , Xiaoqun Du , K. Narayan Kumar , C. R. Ramakrishnan , I. V. Ramakrishnan, Abhik Roychoudhury , Scott A. Smolka , David Scott Warren : Logic Programming and Model Checking. PLILP/ALP 1998 : 1-20 Hasan Davulcu , Michael Kifer , C. R. Ramakrishnan , I. V. Ramakrishnan: Logic Based Modeling and Analysis of Workflows. PODS 1998 : 25-33 Abhik Roychoudhury , C. R. Ramakrishnan , I. V. Ramakrishnan, Scott A. Smolka : Tabulation-based Induction Proofs with Application to Automated Verification. TAPD 1998 : 83-88 Y. S. Ramakrishna , C. R. Ramakrishnan , I. V. Ramakrishnan, Scott A. Smolka , Terrance Swift , David Scott Warren : Efficient Model Checking Using Tabled Resolution. CAV 1997 : 143-154 R. C. Sekar , I. V. Ramakrishnan, Prateek Mishra : On the power and limitations of strictness analysis. J. ACM 44 (3): 505-525 (1997) Owen Kaser , C. R. Ramakrishnan , I. V. Ramakrishnan, R. C. Sekar : EQUALS - A Fast Parallel Implementation of a Lazy Language. J. Funct. Program. 7 (2): 183-217 (1997) Leo Bachmair , Ta Chen , C. R. Ramakrishnan , I. V. Ramakrishnan: Subsumption Algorithms Based on Search Trees. CAAP 1996 : 135-148 Prasad Rao , C. R. Ramakrishnan , I. V. Ramakrishnan: A Thread in Time Saves Tabling Time. JICSLP 1996 : 112-126 I. V. Ramakrishnan, Prasad Rao , Konstantinos F. Sagonas , Terrance Swift , David Scott Warren : Efficient Tabling Mechanisms for Logic Programs. ICLP 1995 : 697-711 Leo Bachmair , Ta Chen , I. V. Ramakrishnan, Siva Anantharaman , Jacques Chabin : Experiments with Associative-Commutative Discrimination Nets. IJCAI 1995 : 348-355 Steven Dawson , C. R. Ramakrishnan , I. V. Ramakrishnan, Terrance Swift : Optimizing Clause Resolution: Beyond Unification Factoring. ILPS 1995 : 194-208 C. R. Ramakrishnan , I. V. Ramakrishnan, R. C. Sekar : A Symbolic Constraint Solving Framework for Analysis of Logic Programs. PEPM 1995 : 12-23 Steven Dawson , C. R. Ramakrishnan , I. V. Ramakrishnan: Design and Implementation of Jump Tables for Fast Indexing of Logic Programs PLILP 1995 : 133-150 Steven Dawson , C. R. Ramakrishnan , I. V. Ramakrishnan, Konstantinos F. Sagonas , Steven Skiena , Terrance Swift , David Scott Warren : Unification Factoring for Efficient Execution of Logic Programs. POPL 1995 : 247-258 R. C. Sekar , I. V. Ramakrishnan: Fast Strictness Analysis Based on Demand Propagation. ACM Trans. Program. Lang. Syst. 17 (6): 896-937 (1995) R. Ramesh , I. V. Ramakrishnan, David Scott Warren : Automata-Driven Indexing of Prolog Clauses. J. Log. Program. 23 (2): 151-202 (1995) R. C. Sekar , R. Ramesh , I. V. Ramakrishnan: Adaptive Pattern Matching. SIAM J. Comput. 24 (6): 1207-1234 (1995) R. Ramesh , I. V. Ramakrishnan, R. C. Sekar : Automata-Driven Efficient Subterm Unification. FSTTCS 1994 : 288-299 Prasad Rao , I. V. Ramakrishnan, Terrance Swift , David Scott Warren : Dynamic Argument Reduction for In-memory Data Queries. Workshop on Deductive Databases and Logic Programming 1994 : 117-129 Ta Chen , I. V. Ramakrishnan, R. Ramesh : Multistage Indexing for Speeding Prolog Executions. Softw., Pract. Exper. 24 (12): 1097-1119 (1994) Steven Dawson , C. R. Ramakrishnan , I. V. Ramakrishnan, R. C. Sekar : Extracting Determinacy in Logic Programs. ICLP 1993 : 424-438 Leo Bachmair , Ta Chen , I. V. Ramakrishnan: Associative-Commutative Discrimination Nets. TAPSOFT 1993 : 61-74 R. C. Sekar , I. V. Ramakrishnan: Programming in Equational Logic: Beyond Strong Sequentiality Inf. Comput. 104 (1): 78-109 (1993) R. C. Sekar , I. V. Ramakrishnan: Programming with Equations: A Framework for Lazy Parallel Evaluation. CADE 1992 : 618-632 R. C. Sekar , R. Ramesh , I. V. Ramakrishnan: Adaptive Pattern Matching. ICALP 1992 : 247-260 Ta Chen , I. V. Ramakrishnan, R. Ramesh : Multistage Indexing Algorithms for Speeding Prolog Execution. JICSLP 1992 : 639-653 Owen Kaser , Shaunak Pawagi , C. R. Ramakrishnan , I. V. Ramakrishnan, R. C. Sekar : Fast Parallel Implementation of Lazy Languages - The EQUALS Experience. LISP and Functional Programming 1992 : 335-344 Rakesh M. Verma , I. V. Ramakrishnan: Tight Complexity Bounds for Term Matching Problems Inf. Comput. 101 (1): 33-69 (1992) R. Ramesh , I. V. Ramakrishnan: Nonlinear Pattern Matching in Trees. J. ACM 39 (2): 295-316 (1992) R. C. Sekar , Prateek Mishra , I. V. Ramakrishnan: On the Power and Limitation of Strictness Analysis Based on Abstract Interpretation. POPL 1991 : 37-48 R. Ramesh , I. V. Ramakrishnan: Incremental Techniques for Efficient Normalization of Nonlinear Rewrite Systems. RTA 1991 : 335-347 P. S. Gopalakrishnan , I. V. Ramakrishnan, Laveen N. Kanal : Approximate Algorithms for the Knapsack Problem on Parallel Computers Inf. Comput. 91 (2): 155-171 (1991) Rakesh M. Verma , I. V. Ramakrishnan: Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems. ICALP 1990 : 370-385 R. C. Sekar , I. V. Ramakrishnan: Programming in Equational Logic: Beyond Strong Sequentiality LICS 1990 : 230-241 R. C. Sekar , Shaunak Pawagi , I. V. Ramakrishnan: Small Domains Spell Fast Strictness Analysis. POPL 1990 : 169-183 R. Ramesh , I. V. Ramakrishnan, David Scott Warren : Automata-Driven Indexing of Prolog Clauses. POPL 1990 : 281-291 R. Ramesh , I. V. Ramakrishnan: Parallel Tree Pattern Matching. J. Symb. Comput. 9 (4): 485-501 (1990) R. C. Sekar , Shaunak Pawagi , I. V. Ramakrishnan: Transforming Strongly Sequential Rewrite Systems with Constructors for Efficient parallel Execution. RTA 1989 : 404-418 Rakesh M. Verma , I. V. Ramakrishnan: Some Complexity Theoretic Aspects of AC Rewriting. STACS 1989 : 407-420 Peter J. Varman , I. V. Ramakrishnan: Optimal Matrix Multiplication on Fault-Tolerant VLSI Arrays. IEEE Trans. Computers 38 (2): 278-283 (1989) Rajiv Gupta , Alessandro Zorat , I. V. Ramakrishnan: Reconfigurable Multipipelines for Vector Supercomputers. IEEE Trans. Computers 38 (9): 1297-1307 (1989) R. Ramesh , Rakesh M. Verma , Krishnaprasad Thirunarayan , I. V. Ramakrishnan: Term Matching on Parallel Computers. J. Log. Program. 6 (3): 213-228 (1989) Rakesh M. Verma , I. V. Ramakrishnan: Optimal Time Bounds for Parallel Term Matching. CADE 1988 : 694-703 R. Ramesh , I. V. Ramakrishnan: Nonlinear Pattern Matching in Trees. ICALP 1988 : 473-488 R. Ramesh , Rakesh M. Verma , Krishnaprasad Thirunarayan , I. V. Ramakrishnan: Term Matching on Parallel Computers. ICALP 1987 : 336-346 R. Ramesh , I. V. Ramakrishnan: Optimal Speedups for Parallel Pattern Matching in Trees. RTA 1987 : 274-285 Gurdip Singh , Scott A. Smolka , I. V. Ramakrishnan: Distributed Algorithms for Tree Pattern Matching. WDAG 1987 : 92-107 Shaunak Pawagi , P. S. Gopalakrishnan , I. V. Ramakrishnan: Computing Dominators in Parallel. Inf. Process. Lett. 24 (4): 217-221 (1987) Rakesh M. Verma , Krishnaprasad Thirunarayan , I. V. Ramakrishnan: An Efficient Parallel Algorithm for Term Matching. FSTTCS 1986 : 504-518 Peter J. Varman , I. V. Ramakrishnan: A Fault-Tolerant VLSI Matrix Multiplier. ICPP 1986 : 351-357 P. S. Gopalakrishnan , I. V. Ramakrishnan, Laveen N. Kanal : Parallel Approximate Algorithms for the 0-1 Knapsack Problem. ICPP 1986 : 444-451 Shaunak Pawagi , P. S. Gopalakrishnan , I. V. Ramakrishnan: A Parallel Algorithm for Dominators. ICPP 1986 : 877-879 Peter J. Varman , I. V. Ramakrishnan: Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays. IEEE Trans. Computers 35 (11): 989-996 (1986) I. V. Ramakrishnan, Donald S. Fussell , Abraham Silberschatz : Mapping Homogeneous Graphs on Linear Arrays. IEEE Trans. Computers 35 (3): 189-209 (1986) Shaunak Pawagi , I. V. Ramakrishnan: An O(log n) Algorithm for Parallel Update of Minimum Spanning Trees. Inf. Process. Lett. 22 (5): 223-229 (1986) Deepak D. Sherlekar , Shaunak Pawagi , I. V. Ramakrishnan: O(1) Parallel Time Incremental Graph Algorithms. FSTTCS 1985 : 477-495 Peter J. Varman , I. V. Ramakrishnan: On Matrix Multiplication Using Array Processors. ICALP 1985 : 487-496 Shaunak Pawagi , I. V. Ramakrishnan: Parallel Updates of Graph Properties in Logarithmic Time. ICPP 1985 : 186-193 I. V. Ramakrishnan, Peter J. Varman : An Optimal Family of Matrix Multiplication Algorithms on Linear Arrays. ICPP 1985 : 376-383 P. S. Gopalakrishnan , I. V. Ramakrishnan, Laveen N. Kanal : Computing Tree Functions on Mesh-Connected Computers. ICPP 1985 : 703-710 P. S. Gopalakrishnan , I. V. Ramakrishnan, Laveen N. Kanal : An Efficient Connected Components Algorithm on a Mesh-Connected Computer. ICPP 1985 : 711-714 I. V. Ramakrishnan: On Mapping Cube Graphs onto VLSI Arrays. FSTTCS 1984 : 296-316 I. V. Ramakrishnan, Peter J. Varman : Modular Matrix Multiplication on a Linear Array. ISCA 1984 : 232-238 Peter J. Varman , I. V. Ramakrishnan, Donald S. Fussell : A Robust Matrix-Multiplication Array. IEEE Trans. Computers 33 (10): 919-922 (1984) I. V. Ramakrishnan, Peter J. Varman : Modular Matrix Multiplication on a Linear Array. IEEE Trans. Computers 33 (11): 952-958 (1984) I. V. Ramakrishnan, Donald S. Fussell , Abraham Silberschatz : On Mapping Homogeneous Graphs on a Linear Array-Processor Model. ICPP 1983 : 440-447 I. V. Ramakrishnan, James C. Browne : A Paradigm for the Design of Parallel Algorithms with Applications. IEEE Trans. Software Eng. 9 (4): 411-415 (1983) 1 [ 58 ] 2 [ 46 ] [ 58 ] [ 61 ] [ 73 ] [ 83 ] 3 [ 88 ] 4 [ 1 ] 5 [ 58 ] 6 [ 42 ] [ 46 ] [ 48 ] [ 58 ] [ 61 ] 7 [ 93 ] 8 [ 67 ] 9 [ 66 ] [ 72 ] [ 74 ] [ 81 ] [ 84 ] [ 93 ] [ 94 ] [ 95 ] [ 98 ] [ 99 ] [ 105 ] 10 [ 47 ] [ 54 ] [ 55 ] [ 57 ] [ 74 ] 11 [ 67 ] [ 71 ] [ 85 ] [ 101 ] [ 106 ] 12 [ 67 ] [ 71 ] [ 85 ] 13 [ 72 ] 14 [ 2 ] [ 4 ] [ 14 ] 15 [ 7 ] [ 8 ] [ 16 ] [ 17 ] [ 20 ] [ 36 ] 16 [ 89 ] [ 96 ] [ 101 ] [ 106 ] 17 [ 27 ] 18 [ 93 ] 19 [ 77 ] 20 [ 105 ] 21 [ 7 ] [ 8 ] [ 17 ] [ 36 ] 22 [ 41 ] [ 62 ] 23 [ 105 ] 24 [ 66 ] [ 72 ] [ 74 ] [ 81 ] [ 84 ] [ 104 ] 25 [ 67 ] [ 75 ] [ 76 ] [ 78 ] [ 79 ] [ 92 ] 26 [ 105 ] 27 [ 38 ] [ 63 ] 28 [ 93 ] 29 [ 93 ] [ 94 ] [ 95 ] [ 98 ] [ 100 ] [ 102 ] [ 103 ] 30 [ 88 ] 31 [ 99 ] 32 [ 93 ] 33 [ 10 ] [ 12 ] [ 13 ] [ 16 ] [ 20 ] [ 30 ] [ 33 ] [ 41 ] 34 [ 97 ] [ 101 ] [ 106 ] 35 [ 74 ] 36 [ 64 ] [ 71 ] 37 [ 41 ] [ 47 ] [ 54 ] [ 55 ] [ 56 ] [ 57 ] [ 60 ] [ 61 ] [ 62 ] [ 64 ] [ 65 ] [ 66 ] [ 67 ] [ 68 ] [ 69 ] [ 71 ] [ 73 ] [ 74 ] [ 75 ] [ 77 ] [ 78 ] [ 79 ] [ 80 ] [ 85 ] [ 88 ] [ 89 ] [ 92 ] [ 96 ] [ 97 ] [ 101 ] [ 106 ] 38 [ 22 ] [ 23 ] [ 24 ] [ 26 ] [ 31 ] [ 32 ] [ 37 ] [ 39 ] [ 42 ] [ 43 ] [ 48 ] [ 50 ] [ 51 ] [ 52 ] [ 86 ] 39 [ 49 ] [ 59 ] [ 60 ] [ 68 ] [ 70 ] [ 77 ] 40 [ 65 ] [ 67 ] [ 69 ] [ 75 ] [ 76 ] [ 78 ] [ 79 ] [ 80 ] [ 85 ] [ 90 ] [ 92 ] 41 [ 54 ] [ 59 ] [ 70 ] 42 [ 30 ] [ 33 ] [ 34 ] [ 38 ] [ 41 ] [ 43 ] [ 44 ] [ 45 ] [ 47 ] [ 50 ] [ 51 ] [ 53 ] [ 56 ] [ 62 ] [ 63 ] [ 69 ] [ 86 ] [ 87 ] 43 [ 94 ] 44 [ 12 ] 45 [ 2 ] [ 14 ] 46 [ 21 ] 47 [ 105 ] 48 [ 54 ] 49 [ 21 ] [ 64 ] [ 65 ] [ 67 ] [ 71 ] [ 79 ] [ 85 ] 50 [ 71 ] 51 [ 71 ] 52 [ 49 ] [ 54 ] [ 57 ] [ 59 ] [ 64 ] [ 70 ] 53 [ 103 ] 54 [ 19 ] [ 23 ] [ 26 ] 55 [ 73 ] [ 83 ] 56 [ 99 ] 57 [ 3 ] [ 4 ] [ 5 ] [ 9 ] [ 11 ] [ 15 ] [ 18 ] [ 28 ] 58 [ 105 ] 59 [ 85 ] 60 [ 19 ] [ 23 ] [ 25 ] [ 26 ] [ 29 ] [ 35 ] [ 40 ] [ 88 ] 61 [ 83 ] 62 [ 87 ] 63 [ 32 ] [ 49 ] [ 52 ] [ 54 ] [ 59 ] [ 64 ] [ 67 ] [ 70 ] [ 71 ] 64 [ 81 ] [ 84 ] [ 100 ] [ 102 ] [ 103 ] [ 104 ] 65 [ 27 ] ©2004 Association for Computing Machinery