| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Maurice Bruynooghe Ofer Arieli , Marc Denecker , Bert Van Nuffelen , Maurice Bruynooghe: Database Repair by Signed Formulae. FoIKS 2004 : 14-30 Nikolay Pelov , Marc Denecker , Maurice Bruynooghe: Partial Stable Models for Logic Programs with Aggregates. LPNMR 2004 : 207-219 Michael Leuschel , Jesper Jørgensen , Wim Vanhoof , Maurice Bruynooghe: Offline specialisation in Prolog using a hand-written compiler generator. TPLP 4 (1-2): 139-191 (2004) Maurice Bruynooghe: Enhancing a search algorithm to perform intelligent backtracking. TPLP 4 (3): 371-380 (2004) Nikolay Pelov , Marc Denecker , Maurice Bruynooghe: Translation of Aggregate Programs to Normal Logic Programs. Answer Set Programming 2003 Raymond Kosala , Maurice Bruynooghe, Jan Van den Bussche , Hendrik Blockeel : Information Extraction from Web Documents Based on Local Unranked Tree Automaton Inference. IJCAI 2003 : 403-408 K. C. Shashidhar , Maurice Bruynooghe, Francky Catthoor , Gerda Janssens : An Automatic Verification Technique for Loop and Data Reuse Transformations based on Geometric Modeling of Programs. J. UCS 9 (3): 248-269 (2003) Maurice Bruynooghe, Luís Moniz Pereira , Jörg H. Siekmann , Maarten H. van Emden : A Portrait of a Scientist as a Computational Logician. Computational Logic: Logic Programming and Beyond 2002 : 1-4 Pieter Bekaert , Bert Van Nuffelen , Maurice Bruynooghe, David Gilis , Marc Denecker : On the Transformation of Object-Oriented Conceptual Models to Logical Theories. ER 2002 : 152-166 Wim Vanhoof , Remko Tronçon , Maurice Bruynooghe: A Fixed Point Semantics for Logic Programs Extended with Cuts. LOPSTR 2002 : 238-257 Raymond Kosala , Jan Van den Bussche , Maurice Bruynooghe, Hendrik Blockeel : Information Extraction in Structured Documents Using Tree Automata Induction. PKDD 2002 : 299-310 Ofer Arieli , Marc Denecker , Bert Van Nuffelen , Maurice Bruynooghe: Repairing Inconsistent Databases: A Model-Theoretic Approach and Abductive Reasoning. Paraconsistent Computational Logic 2002 : 51-65 Maurice Bruynooghe, Michael Codish , Samir Genaim , Wim Vanhoof : Reuse of Results in Termination Analysis of Typed Logic Programs. SAS 2002 : 477-492 Remko Tronçon , Maurice Bruynooghe, Gerda Janssens , Francky Catthoor : Storage Size Reduction by In-place Mapping of Arrays. VMCAI 2002 : 167-181 K. C. Shashidhar , Maurice Bruynooghe, Francky Catthoor , Gerda Janssens : Geometric Model Checking: An Automatic Verification Technique for Loop and Data Reuse Transformations. Electr. Notes Theor. Comput. Sci. 65 (2): (2002) Maurice Bruynooghe, Kung-Kiu Lau : Special Issue on Program Development, Guest Editors' Introduction. TPLP 2 (4-5): 423-424 (2002) Michael Leuschel , Maurice Bruynooghe: Logic program specialisation through partial deduction: Control issues. TPLP 2 (4-5): 461-515 (2002) Maurice Bruynooghe, Wim Vanhoof , Michael Codish : Pos(T): Analyzing Dependencies in Typed Logic Programs. Ershov Memorial Conference 2001 : 406-420 Nancy Mazur , Peter Ross , Gerda Janssens , Maurice Bruynooghe: Practical Aspects for a Working Compile Time Garbage Collection System for Mercury. ICLP 2001 : 105-119 Marc Denecker , Nikolay Pelov , Maurice Bruynooghe: Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates. ICLP 2001 : 212-226 Wim Vanhoof , Maurice Bruynooghe: When Size Does Matter. LOPSTR 2001 : 129-147 Ofer Arieli , Bert Van Nuffelen , Marc Denecker , Maurice Bruynooghe: Coherent Composition of Distributed Knowledge-Bases Through Abduction. LPAR 2001 : 624-638 Wim Vanhoof , Maurice Bruynooghe: Binding-Time Annotations Without Binding-Time Analysis. LPAR 2001 : 707-722 Marc Denecker , Maurice Bruynooghe, V. Wiktor Marek : Logic programming revisited: Logic programs as inductive definitions. ACM Trans. Comput. Log. 2 (4): 623-654 (2001) Jan Ramon , Maurice Bruynooghe: A polynomial time computable metric between point sets. Acta Inf. 37 (10): 765-780 (2001) Nancy Mazur , Gerda Janssens , Maurice Bruynooghe: A Module Based Analysis for Memory Reuse in Mercury. Computational Logic 2000 : 1255-1269 Wim Vanhoof , Maurice Bruynooghe: Towards a modular binding-time analysis for higher-order Mercury. LOPSTR 2000 Nikolay Pelov , Maurice Bruynooghe: Extending constraint logic programming with open functions. PPDP 2000 : 235-244 Danny De Schreye , Maurice Bruynooghe, Bart Demoen , Marc Denecker , Gerda Janssens , Bern Martens : Project Report on LP + : A Second Generation Logic Programming Language. AI Commun. 13 (1): 13-18 (2000) Maurice Bruynooghe: Benelog. AI Commun. 13 (1): 7-8 (2000) Wim Vanhoof , Maurice Bruynooghe: Binding-time Analysis for Mercury. ICLP 1999 : 500-514 Nikolay Pelov , Maurice Bruynooghe: Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog. LPAR 1999 : 358-375 Wim Vanhoof , Maurice Bruynooghe: Towards Modular Binding-Time Analysis for First-order Mercury. Electr. Notes Theor. Comput. Sci. 30 (2): (1999) Maurice Bruynooghe, Henk Vandecasteele , D. Andre de Waal , Marc Denecker : Detecting Unsolvable Queries for Definite Logic Programs Journal of Functional and Logic Programming 1999 (Special Issue 2): (1999) Maurice Bruynooghe, Michael Leuschel , Konstantinos F. Sagonas : A Polyvariant Binding-Time Analysis for Off-line Partial Deduction. ESOP 1998 : 27-41 Jan Ramon , Maurice Bruynooghe: A Framework for Defining Distances Between First-Order Logic Objects. ILP 1998 : 271-280 Maurice Bruynooghe, Henk Vandecasteele , D. Andre de Waal , Marc Denecker : Detecting Unsolvable Queries for Definite Logic Programs. PLILP/ALP 1998 : 118-133 Maurice Bruynooghe, Gerda Janssens , Andreas Kågedal : Live-Structure Analysis for Logic Programming Languages with Declarations. ICLP 1997 : 33-47 Michael Codish , Maurice Bruynooghe, Maria J. García de la Banda , Manuel V. Hermenegildo : Exploiting Goal Independence in the Analysis of Logic Programs. J. Log. Program. 32 (3): 247-261 (1997) Maurice Bruynooghe, Bart Demoen , Dmitri Boulanger , Marc Denecker , Anne Mulkers : A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation. SAS 1996 : 128-142 Maria J. García de la Banda , Manuel V. Hermenegildo , Maurice Bruynooghe, Veroniek Dumortier , Gerda Janssens , Wim Simoens : Global Analysis of Constraint Logic Programs. ACM Trans. Program. Lang. Syst. 18 (5): 564-614 (1996) Michael Codish , Dennis Dams , Gilberto Filé , Maurice Bruynooghe: On the Design of a Correct Freeness Analysis for Logic Programs. J. Log. Program. 28 (3): 181-206 (1996) Anne Mulkers , Wim Simoens , Gerda Janssens , Maurice Bruynooghe: On the Practicality of Abstract Equation Systems. ICLP 1995 : 781-795 Gerda Janssens , Maurice Bruynooghe, Veroniek Dumortier : A Blueprint for an Abstract Machine for Abstract Interpretation of (Constraint) Logic Programs. ILPS 1995 : 336-350 Maurice Bruynooghe, Michael Codish , Anne Mulkers : Abstracting Unification: A Key Step in the Design of Logic Program Analyses. Computer Science Today 1995 : 406-425 Michael Codish , Anne Mulkers , Maurice Bruynooghe, Maria J. García de la Banda , Manuel V. Hermenegildo : Improving Abstract Interpretations by Combining Domains. ACM Trans. Program. Lang. Syst. 17 (1): 28-44 (1995) Lode Missiaen , Maurice Bruynooghe, Marc Denecker : CHICA, an Abductive Planning System Based on Event Calculus. J. Log. Comput. 5 (5): 579-602 (1995) Maurice Bruynooghe, Saumya K. Debray , Manuel V. Hermenegildo , Michael J. Maher : Guest Editors' Introduction: Special Section: Ten Years of Logic Programming. J. Log. Program. 23 (2): 87-88 (1995) Hilde Adé , Luc De Raedt , Maurice Bruynooghe: Declarative Bias for Specific-to-General ILP Systems. Machine Learning 20 (1-2): 119-154 (1995) Dmitri Boulanger , Maurice Bruynooghe: Using Call/Exit Analysis for Logic Program Transformation. LOPSTR 1994 : 36-50 Michael Codish , Maria J. García de la Banda , Maurice Bruynooghe, Manuel V. Hermenegildo : Goal Dependent versus Goal Independent Analysis of Logic Programs. LPAR 1994 : 305-319 Gerda Janssens , Maurice Bruynooghe, Vincent Englebert : Abstracting Numerical Values in CLP(H, N). PLILP 1994 : 400-414 Dmitri Boulanger , Maurice Bruynooghe, Marc Denecker : Abstracting s-semantincs Using A Model-Theoretic Approach. PLILP 1994 : 432-446 Dmitri Boulanger , Maurice Bruynooghe: A Systematic Construction of Abstract Domains SAS 1994 : 61-77 Anne Mulkers , William H. Winsborough , Maurice Bruynooghe: Live-Structure Dataflow Analysis for Prolog. ACM Trans. Program. Lang. Syst. 16 (2): 205-258 (1994) Gunther Sablon , Luc De Raedt , Maurice Bruynooghe: Iterative Versionspaces. Artif. Intell. 69 (1-2): 393-409 (1994) Maurice Bruynooghe, Saumya K. Debray , Manuel V. Hermenegildo , Michael J. Maher : Guest Editor's Introduction. J. Log. Program. 19/20 : 1-3 (1994) Maurice Bruynooghe, Jaan Penjam : Programming Language Implementation and Logic Programming, 5th International Symposium, PLILP'93, Tallinn, Estonia, August 25-27, 1993, Proceedings Springer 1993 Veroniek Dumortier , Gerda Janssens , Maurice Bruynooghe, Michael Codish : Freeness Analysis in the Presence of Numerical Constraints. ICLP 1993 : 100-115 Michael Codish , Dennis Dams , Gilberto Filé , Maurice Bruynooghe: Freeness Analysis for Logic Programs - And Correctness? ICLP 1993 : 116-131 Luc De Raedt , Maurice Bruynooghe: A Theory of Clausal Discovery. IJCAI 1993 : 1058-1063 Dmitri Boulanger , Maurice Bruynooghe: Using Abstract Interpretation for Goal Replacement. LOPSTR 1993 : 210-228 Dmitri Boulanger , Maurice Bruynooghe, Danny De Schreye : Compiling Control Revisited: A New approach Based Upon Abstract Interpretation for Constraint Logic Programs. LPE 1993 : 39-51 Michael Codish , Anne Mulkers , Maurice Bruynooghe, Maria J. García de la Banda , Manuel V. Hermenegildo : Improving Abstract Interpretations by Combining Domains. PEPM 1993 : 194-205 Maurice Bruynooghe, Michael Codish : Freeness, Sharing, Linearity and Correctness - All at Once. WSA 1993 : 153-164 Dmitri Boulanger , Maurice Bruynooghe: Deriving Fold/Unfold Transformations of Logic Programs Using Extended OLDT-Based Abstract Interpretation. J. Symb. Comput. 15 (5/6): 495-521 (1993) Maurice Bruynooghe, Martin Wirsing : Programming Language Implementation and Logic Programming, 4th International Symposium, PLILP'92, Leuven, Belgium, August 26-28, 1992, Proceedings Springer 1992 Marc Denecker , Lode Missiaen , Maurice Bruynooghe: Temporal Reasoning with Abductive Event Calculus. ECAI 1992 : 384-388 Hilde Adé , Luc De Raedt , Maurice Bruynooghe: Inverse Resolution in an Integrated Inductive-Deductive Learning System. ECAI 1992 : 456-457 Bern Martens , Danny De Schreye , Maurice Bruynooghe: Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. FGCS 1992 : 473-480 Danny De Schreye , Kristof Verschaetse , Maurice Bruynooghe: A Framework for Analyzing the Termination of Definite Logic Programs with respect to Call Patterns. FGCS 1992 : 481-488 Dmitri Boulanger , Maurice Bruynooghe: Deriving Transformations for Logic Programs Using Abstract Interpretation. LOPSTR 1992 : 99-117 Maurice Bruynooghe, Gerda Janssens : Propagation: A New Operation in a Framework for Abstract Interpretation of Logic Programs. META 1992 : 294-307 Luc De Raedt , Maurice Bruynooghe: Belief Updating from Integrity Constraints and Queries. Artif. Intell. 53 (2-3): 291-307 (1992) Luc De Raedt , Johan Feyaerts , Maurice Bruynooghe: Acquiring object-knowledge. J. Exp. Theor. Artif. Intell. 4 (3): 213-232 (1992) G. Janssen , Maurice Bruynooghe: Deriving Descriptions of Possible Values of Program Variables by Means of Abstract Interpretation. J. Log. Program. 13 (2&3): 205-258 (1992) Luc De Raedt , Maurice Bruynooghe: Interactive Concept-Learning and Constructive Induction by Analogy. Machine Learning 8 : 107-150 (1992) Maurice Bruynooghe, Danny De Schreye , Bern Martens : A General Criterion for Avoiding Infinite Unfolding during Partial Deduction. New Generation Comput. 11 (1): 47-79 (1992) Maurice Bruynooghe: Intelligent Backtracking Revisted. Computational Logic - Essays in Honor of Alan Robinson 1991 : 166-177 Luc De Raedt , Johan Feyaerts , Maurice Bruynooghe: Acquiring Object-Knowledge for Learning Systems. EWSL 1991 : 245-264 Maurice Bruynooghe, Danny De Schreye , Bern Martens : A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs. ISLP 1991 : 117-131 Luc De Raedt , Maurice Bruynooghe, Bern Martens : Integrity Constraints and Interactive Concept-Learning. ML 1991 : 394-398 Maurice Bruynooghe, Veroniek Dumortier , Gerda Janssens : Improving the Efficiency of Constraint Logic Programming Languages by Deriving Specialized Versions. PDK 1991 : 309-317 Gerda Janssens , Maurice Bruynooghe: On Abstracting the Procedural Behaviour of Logic Programs. RCLP 1991 : 240-262 Danny De Schreye , Bern Martens , Gunther Sablon , Maurice Bruynooghe: Compiling Bottom-up and Mixed Derivations into Top-down Executable Logic Programs. J. Autom. Reasoning 7 (3): 337-358 (1991) Maurice Bruynooghe: A Practical Framework for the Abstract Interpretation of Logic Programs. J. Log. Program. 10 (1/2/3&4): 91-124 (1991) John P. Gallagher , Maurice Bruynooghe: The Derivation of an Algorithm for Program Specialisation. New Generation Comput. 9 (3/4): 305-334 (1991) Luc De Raedt , Maurice Bruynooghe: On Negation and Three-Valued Logic in Interactive Concept-Learning. ECAI 1990 : 207-212 Danny De Schreye , Dirk Pollet , Johan Ronsyn , Maurice Bruynooghe: Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanism. ESOP 1990 : 106-117 Danny De Schreye , Kristof Verschaetse , Maurice Bruynooghe: A Practical Technique for Detecting Non-terminating Queries for a Restricted Class of Horn Clauses, Using Directed, Weighted Graphs. ICLP 1990 : 649-663 Kristof Verschaetse , Danny De Schreye , Maurice Bruynooghe: Generation and Compilation of Efficient Computation Rules. ICLP 1990 : 700-714 John P. Gallagher , Maurice Bruynooghe: The Derivation of an Algorithm for Program Specialisation. ICLP 1990 : 732-746 Anne Mulkers , William H. Winsborough , Maurice Bruynooghe: Analysis of Shared Data Structures for Compile-Time Garbage. ICLP 1990 : 747-762 Veroniek Dumortier , Maurice Bruynooghe: On the Automatic Generation of Events in Delta Prolog. PLILP 1990 : 324-339 Gunther Sablon , Luc De Raedt , Maurice Bruynooghe: Generalizing Multiple Examples in Explanation Based Learning. AII 1989 : 177-183 Maurice Bruynooghe, Danny De Schreye : Some Thoughts on the Role of Examples in Program Transformation and its Relevance for Explanation-based Learning. AII 1989 : 60-77 André Mariën , Gerda Janssens , Anne Mulkers , Maurice Bruynooghe: The Impact of Abstract Interpretation: An Experiment in Code Generation. ICLP 1989 : 33-47 Maurice Bruynooghe, Luc De Raedt , Danny De Schreye : Explanation Based Program Transformation. IJCAI 1989 : 407-412 Luc De Raedt , Maurice Bruynooghe: Towards Friendly Concept-Learners. IJCAI 1989 : 849-858 Luc De Raedt , Maurice Bruynooghe: Constructive Induction by Analogy. ML 1989 : 476-477 Danny De Schreye , Maurice Bruynooghe, Kristof Verschaetse : On the Existence of Nonterminating Queries for a Restricted Class of PROLOG-Clauses. Artif. Intell. 41 (2): 237-248 (1989) Maurice Bruynooghe, Danny De Schreye , Bruno Krekels : Compiling Control. J. Log. Program. 6 (1&2): 135-162 (1989) Danny De Schreye , Maurice Bruynooghe: On the Transformation of Logic Programs with Instantiation Based Computation Rules. J. Symb. Comput. 7 (2): 125-154 (1989) Patrick Weemeeuw , Maurice Bruynooghe, Marleen De Haondt : On Implementing Logic Programming Languages on a Dataflow Architecture. ESOP 1988 : 359-372 Luc De Raedt , Maurice Bruynooghe: On Interactive Concept-Learning and Assimilation. EWSL 1988 : 167-176 Bern Martens , Maurice Bruynooghe: Integrity Constraint Checking in Deductive Databases Using a Rule/Goal Graph. Expert Database Conf. 1988 : 567-601 Maurice Bruynooghe, Gerda Janssens : An Instance of Abstract Interpretation Integrating Type and Mode Inferencing. ICLP/SLP 1988 : 669-683 Danny De Schreye , Maurice Bruynooghe: The Compilation of Forward Checking Regimes through Meta-Interpretation and Transformation. META 1988 : 217-231 Danny De Schreye , Maurice Bruynooghe: An Application of Abstract Interpretation in Source Level Program Transformation. PLILP 1988 : 35-57 Maurice Bruynooghe, Gerda Janssens , Alain Callebaut , Bart Demoen : Abstract Interpretation: Towards the Global Optimization of Prolog Programs. SLP 1987 : 192-204 Willem Rosiers , Maurice Bruynooghe: Empirical Study of some Constraints Satisfaction Algorithms. AIMSA 1986 : 173-180 Maurice Bruynooghe: Is Logic Programming ``Real'' Programming? AIMSA 1986 : 81-91 Maurice Bruynooghe, Danny De Schreye , Bruno Krekels : Compiling Control. SLP 1986 : 70-77 Edwin Pittomvils , Maurice Bruynooghe, Yves D. Willems : Towards a Real-Time Garbage Collector for Prolog. SLP 1985 : 185-198 Raf Venken , Maurice Bruynooghe, Luc Dekeyser , Bruno Krekels : The Centralized Scheduler vs. the Distributed Specialists: Towards a Flexible Controller in Prolog for Expert Systems. Wissensbasierte Systeme 1985 : 370-383 Maurice Bruynooghe, Luís Moniz Pereira : Deduction Revision by Intelligent Backtracking. Implementations of Prolog 1984 : 194-215 Maurice Bruynooghe: Garbage Collection in Prolog Interpreters. Implementations of Prolog 1984 : 259-267 Maurice Bruynooghe: Adding Redundancy to Obtain more Reliable and Readable Prolog Programs. ICLP 1982 : 129-133 Maurice Bruynooghe: A Note on Garbage-Collection in Prolog Interpreters. ICLP 1982 : 52-55 Maurice Bruynooghe: Solving Combinatorial Search Problems by Intelligent Backtracking. Inf. Process. Lett. 12 (1): 36-39 (1981) Maurice Bruynooghe: Analysis of Dependencies to Improve the Behaviour of Logic Programs. CADE 1980 : 293-305 1 [ 53 ] [ 73 ] 2 [ 100 ] [ 110 ] [ 121 ] 3 [ 58 ] [ 71 ] [ 76 ] [ 81 ] [ 83 ] 4 [ 113 ] 5 [ 111 ] [ 116 ] 6 [ 50 ] [ 56 ] [ 59 ] [ 60 ] [ 68 ] [ 69 ] [ 72 ] [ 82 ] 7 [ 111 ] [ 116 ] 8 [ 12 ] 9 [ 107 ] [ 108 ] [ 115 ] 10 [ 57 ] [ 58 ] [ 62 ] [ 63 ] [ 71 ] [ 76 ] [ 77 ] [ 80 ] [ 83 ] [ 104 ] [ 109 ] 11 [ 62 ] [ 80 ] 12 [ 65 ] [ 74 ] 13 [ 7 ] 14 [ 12 ] [ 82 ] [ 93 ] 15 [ 54 ] [ 69 ] [ 75 ] [ 82 ] [ 85 ] [ 88 ] [ 93 ] [ 98 ] [ 100 ] [ 102 ] [ 110 ] [ 113 ] [ 117 ] [ 120 ] [ 121 ] 16 [ 28 ] [ 39 ] [ 63 ] [ 78 ] [ 81 ] 17 [ 114 ] 18 [ 70 ] 19 [ 42 ] [ 47 ] 20 [ 62 ] [ 80 ] 21 [ 30 ] [ 35 ] 22 [ 109 ] 23 [ 113 ] 24 [ 18 ] 25 [ 58 ] [ 65 ] [ 71 ] [ 74 ] [ 76 ] [ 81 ] [ 83 ] 26 [ 46 ] 27 [ 12 ] [ 15 ] [ 25 ] [ 38 ] [ 39 ] [ 49 ] [ 63 ] [ 70 ] [ 78 ] [ 79 ] [ 81 ] [ 84 ] [ 93 ] [ 96 ] [ 103 ] [ 107 ] [ 108 ] [ 115 ] 28 [ 119 ] 29 [ 84 ] 30 [ 111 ] [ 116 ] 31 [ 7 ] [ 9 ] [ 20 ] 32 [ 106 ] 33 [ 87 ] [ 105 ] [ 119 ] 34 [ 65 ] [ 74 ] 35 [ 98 ] 36 [ 25 ] 37 [ 16 ] [ 37 ] [ 40 ] [ 41 ] [ 44 ] [ 52 ] [ 93 ] 38 [ 96 ] [ 103 ] 39 [ 54 ] [ 75 ] 40 [ 25 ] [ 29 ] [ 58 ] [ 67 ] [ 76 ] [ 77 ] [ 79 ] [ 82 ] 41 [ 100 ] [ 110 ] [ 113 ] [ 121 ] 42 [ 90 ] [ 94 ] [ 102 ] [ 117 ] [ 120 ] 43 [ 64 ] 44 [ 6 ] [ 114 ] 45 [ 8 ] 46 [ 33 ] 47 [ 17 ] [ 22 ] [ 23 ] [ 24 ] [ 27 ] [ 34 ] [ 40 ] [ 42 ] [ 45 ] [ 47 ] [ 48 ] [ 53 ] [ 61 ] [ 66 ] [ 73 ] 48 [ 86 ] [ 97 ] 49 [ 33 ] 50 [ 11 ] 51 [ 103 ] 52 [ 27 ] [ 37 ] [ 66 ] 53 [ 87 ] 54 [ 9 ] [ 13 ] [ 14 ] [ 19 ] [ 20 ] [ 21 ] [ 24 ] [ 26 ] [ 31 ] [ 32 ] [ 33 ] [ 37 ] [ 41 ] [ 44 ] [ 51 ] [ 52 ] [ 59 ] [ 93 ] 55 [ 107 ] [ 115 ] 56 [ 114 ] 57 [ 79 ] [ 81 ] 58 [ 108 ] [ 112 ] 59 [ 85 ] [ 88 ] 60 [ 89 ] [ 91 ] [ 95 ] [ 99 ] [ 101 ] [ 104 ] [ 109 ] [ 112 ] [ 119 ] 61 [ 7 ] 62 [ 21 ] [ 31 ] [ 32 ] [ 51 ] 63 [ 85 ] [ 88 ] 64 [ 18 ] 65 [ 8 ] 66 [ 29 ] [ 67 ] 67 [ 55 ]  ©2004 Association for Computing Machinery |
