| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Richard M. Karp Jeremy Elson , Richard M. Karp, Christos H. Papadimitriou , Scott Shenker : Global Synchronization in Sensornets. LATIN 2004 : 609-624 Richard M. Karp: The Role of Experimental Algorithms in Genomics. WEA 2004 : 299-300 Richard M. Karp: The Role of Algorithmic Research in Computational Genomics. CSB 2003 : 10-12 Eric P. Xing , Wei Wu , Michael I. Jordan , Richard M. Karp: LOGOS: a modular Bayesian model for de novo motif detection. CSB 2003 : 266-276 Ananth Rao , Karthik Lakshminarayanan , Sonesh Surana , Richard M. Karp, Ion Stoica : Load Balancing in Structured P2P Systems. IPTPS 2003 : 68-79 Eran Halperin , Jeremy Buhler , Richard M. Karp, Robert Krauthgamer , B. Westover : Detecting protein sequence conservation via metric embeddings. ISMB (Supplement of Bioinformatics) 2003 : 122-129 Roded Sharan , Ivan Ovcharenko , Asa Ben-Hur , Richard M. Karp: CREME: a framework for identifying cis-regulatory modules in human-mouse conserved segments. ISMB (Supplement of Bioinformatics) 2003 : 283-291 Richard M. Karp, Claire Kenyon : A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding. RANDOM-APPROX 2003 : 329-340 Richard M. Karp: Large scale reconstruction of haplotypes from genotype data. RECOMB 2003 : 104-113 Micah Adler , Eran Halperin , Richard M. Karp, Vijay V. Vazirani : A stochastic process on the hypercube with applications to peer-to-peer networks. STOC 2003 : 575-584 Richard M. Karp, Scott Shenker , Christos H. Papadimitriou : A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst. 28 : 51-55 (2003) Ilan Adler , Hyun-Soo Ahn , Richard M. Karp, Sheldon M. Ross : Coalescing times for IID random variables with applications to population biology. Random Structures and Algorithms 23 (2): 155-166 (2003) Sylvia Ratnasamy , Mark Handley , Richard M. Karp, Scott Shenker : Topologically-Aware Overlay Construction and Server Selection. INFOCOM 2002 Amir Ben-Dor , Benny Chor , Richard M. Karp, Zohar Yakhini : Discovering local structure in gene expression data: the order-preserving submatrix problem. RECOMB 2002 : 49-57 Amir Ben-Dor , Richard M. Karp, Benno Schwikowski , Ron Shamir : The restriction scaffold problem. RECOMB 2002 : 58-66 Aditya Akella , Srinivasan Seshan , Richard M. Karp, Scott Shenker , Christos H. Papadimitriou : Selfish behavior and stability of the internet: a game-theoretic analysis of TCP. SIGCOMM 2002 : 117-130 Paul Beame , Richard M. Karp, Toniann Pitassi , Michael E. Saks : The Efficiency of Resolution and Davis--Putnam Procedures. SIAM J. Comput. 31 (4): 1048-1075 (2002) Jack Edmonds , Richard M. Karp: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. Combinatorial Optimization 2001 : 31-33 Eric P. Xing , Michael I. Jordan , Richard M. Karp: Feature selection for high-dimensional genomic microarray data. ICML 2001 : 601-608 Eric P. Xing , Richard M. Karp: CLIFF: clustering of high-dimensional microarray data via iterative feature filtering using normalized cuts. ISMB (Supplement of Bioinformatics) 2001 : 306-315 Sylvia Ratnasamy , Mark Handley , Richard M. Karp, Scott Shenker : Application-Level Multicast Using Content-Addressable Networks. Networked Group Communication 2001 : 14-29 Sylvia Ratnasamy , Paul Francis , Mark Handley , Richard M. Karp, Scott Schenker : A scalable content-addressable network. SIGCOMM 2001 : 161-172 Richard M. Karp: The Genomics Revolution and its Challenges for Algorithmic Research. Current Trends in Theoretical Computer Science 2001 : 631-642 Ran El-Yaniv , Amos Fiat , Richard M. Karp, G. Turpin : Optimal Search and One-Way Trading Online Algorithms. Algorithmica 30 (1): 101-139 (2001) Anne Condon , Richard M. Karp: Algorithms for graph partitioning on the planted partition model. Random Structures and Algorithms 18 (2): 116-140 (2001) Richard M. Karp, Christian Schindelhauer , Scott Shenker , Berthold Vöcking : Randomized Rumor Spreading. FOCS 2000 : 565-574 Richard M. Karp, Elias Koutsoupias , Christos H. Papadimitriou , Scott Shenker : Optimization Problems in Congestion Control. FOCS 2000 : 66-74 Richard M. Karp: The Genomics Revolution and Its Challenges for Algorithmic Research. ICALP 2000 : 428 Amir Ben-Dor , Richard M. Karp, Benno Schwikowski , Zohar Yakhini : Universal DNA tag systems: a combinatorial design scheme. RECOMB 2000 : 65-75 Richard M. Karp, Ron Shamir : Algorithms for Optical Mapping. Journal of Computational Biology 7 (1-2): 303-316 (2000) Amir Ben-Dor , Richard M. Karp, Benno Schwikowski , Zohar Yakhini : Universal DNA Tag Systems: A Combinatorial Design Scheme. Journal of Computational Biology 7 (3-4): 503-519 (2000) Richard M. Karp, Itsik Pe'er , Ron Shamir : An Algorithm Combining Discrete and Continuous Methods for Optical Mapping. Journal of Computational Biology 7 (5): 745-760 (2000) Paul Dagum , Richard M. Karp, Michael Luby , Sheldon Ross : An Optimal Algorithm for Monte Carlo Estimation. SIAM J. Comput. 29 (5): 1484-1496 (2000) Micah Adler , John W. Byers , Richard M. Karp: Parallel Sorting with Limited Bandwidth. SIAM J. Comput. 29 (6): 1997-2015 (2000) Richard M. Karp, Itsik Pe'er , Ron Shamir : An Algorithm Combining Discrete and Continuous Methods for Optical Mapping. ISMB 1999 : 159-168 Anne Condon , Richard M. Karp: Algorithms for Graph Partitioning on the Planted Partition Model. RANDOM-APPROX 1999 : 221-232 Richard M. Karp, Roland Stoughton , Ka Yee Yeung : Algorithms for choosing differential gene expression experiments. RECOMB 1999 : 208-217 Daniel P. Fasulo , Tao Jiang , Richard M. Karp, Reuben Settergren , Edward C. Thayer : An Algorithmic Approach to Multiple Complete Digest Mapping. Journal of Computational Biology 6 (2): 187-208 (1999) Richard M. Karp, Claire Kenyon , Orli Waarts : Error-resilient DNA computation. Random Structures and Algorithms 15 (3-4): 450-466 (1999) Richard M. Karp, Ron Shamir : Algorithms for optical mapping. RECOMB 1998 : 117-124 Daniel P. Fasulo , Tao Jiang , Richard M. Karp, Nitin Sharma : Constructing maps using the span and inclusion relations. RECOMB 1998 : 64-73 Richard M. Karp: Random Graphs, Random Walks, Differential Equations and the Probabilistic Analysis of Algorithms. STACS 1998 : 1-2 Paul Beame , Richard M. Karp, Toniann Pitassi , Michael E. Saks : On the Complexity of Unsatisfiability Proofs for Random k -CNF Formulas. STOC 1998 : 561-571 Tao Jiang , Richard M. Karp: Mapping Clones with a Given Ordering or Interleaving. Algorithmica 21 (3): 262-284 (1998) Dan Gusfield , Richard M. Karp, Lusheng Wang , Paul Stelling : Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem. Discrete Applied Mathematics 88 (1-3): 167-180 (1998) Richard M. Karp, Yangun Zhang : On Parallel Evaluation of Game Trees. J. ACM 45 (6): 1050-1075 (1998) Oren Zamir , Oren Etzioni , Omid Madani , Richard M. Karp: Fast and Intuitive Clustering of Web Documents. KDD 1997 : 287-290 Daniel P. Fasulo , Tao Jiang , Richard M. Karp, Reuben Settergren , Edward C. Thayer : An algorithmic approach to multiple complete digest mapping. RECOMB 1997 : 118-127 Tao Jiang , Richard M. Karp: Mapping clones with a given ordering or interleaving (abstract). RECOMB 1997 : 162 Tao Jiang , Richard M. Karp: Mapping Clones with a Given Ordering or Interleaving (Extended Abstract). SODA 1997 : 400-409 Johannes Blömer , Richard M. Karp, Emo Welzl : The rank of sparse random matrices over finite fields. Random Structures and Algorithms 10 (4): 407-419 (1997) Dan Gusfield , Richard M. Karp, Lusheng Wang , Paul Stelling : Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem. CPM 1996 : 304-319 Oren Etzioni , Steve Hanks , Tao Jiang , Richard M. Karp, Omid Madani , Orli Waarts : Efficient Information Gathering on the Internet (extended abstract). FOCS 1996 : 234-243 Richard M. Karp, Claire Kenyon , Orli Waarts : Error-Resilient DNA Computation. SODA 1996 : 458-467 Richard M. Karp, Michael Luby , Friedhelm Meyer auf der Heide : Efficient PRAM Simulation on a Distributed Memory Machine. Algorithmica 16 (4/5): 517-542 (1996) Helmut Alt , Leonidas J. Guibas , Kurt Mehlhorn , Richard M. Karp, Avi Wigderson : A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica 16 (4/5): 543-547 (1996) David E. Culler , Richard M. Karp, David A. Patterson , Abhijit Sahay , Eunice E. Santos , Klaus E. Schauser , Ramesh Subramonian , Thorsten von Eicken : LogP: A Practical Model of Parallel Computation. Commun. ACM 39 (11): 78-85 (1996) Paul Dagum , Richard M. Karp, Michael Luby , Sheldon Ross : An Optimal Algorithm for Monte Carlo Estimation (Extended Abstract). FOCS 1995 : 142-149 Richard M. Karp, Orli Waarts , Geoffrey Zweig : The Bit Vector Intersection Problem (Preliminary Version). FOCS 1995 : 621-630 Richard M. Karp: Modeling parallel communication. IPPS 1995 : 2- Micah Adler , John W. Byers , Richard M. Karp: Scheduling Parallel Communication: The h-relation Problem. MFCS 1995 : 1-20 Micah Adler , John W. Byers , Richard M. Karp: Parallel Sorting with Limited Bandwidth. SPAA 1995 : 129-136 Farid Alizadeh , Richard M. Karp, Lee Aaron Newberg , Deborah K. Weisser : Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology. Algorithmica 13 (1/2): 52-76 (1995) Richard M. Karp, Lee Aaron Newberg : An algorithm for analysing probed partial digestion experiments. Computer Applications in the Biosciences 11 (3): 229-235 (1995) Farid Alizadeh , Richard M. Karp, Deborah K. Weisser , Geoffrey Zweig : Physical Mapping of Chromosomes Using Unique Probes. Journal of Computational Biology 2 (2): 159-184 (1995) Richard M. Karp, Yanjun Zhang : Bounded Branching Process AND/OR Tree Evaluation. Random Structures and Algorithms 7 (2): 97-116 (1995) Noga Alon , Richard M. Karp, David Peleg , Douglas West : A Graph-Theoretic Game and Its Application to the k-Server Problem. SIAM J. Comput. 24 (1): 78-100 (1995) Alan M. Frieze , Richard M. Karp, Bruce A. Reed : When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? SIAM J. Comput. 24 (3): 484-493 (1995) Farid Alizadeh , Richard M. Karp, Deborah K. Weisser , Geoffrey Zweig : Physical Mapping of Chromosomes Using Unique Probes. SODA 1994 : 489-500 Micah Adler , Peter Gemmell , Mor Harchol-Balter , Richard M. Karp, Claire Kenyon : Selection in the Presence of Noise: The Design of Playoff Systems. SODA 1994 : 564-572 Shai Ben-David , Allan Borodin , Richard M. Karp, Gábor Tardos , Avi Wigderson : On the Power of Randomization in On-Line Algorithms. Algorithmica 11 (1): 2-14 (1994) Lisa Hellerstein , Garth A. Gibson , Richard M. Karp, Randy H. Katz , David A. Patterson : Coding Techniques for Handling Failures in Large Disk Arrays. Algorithmica 12 (2/3): 182-208 (1994) Richard M. Karp: Probabilistic Recurrence Relations. J. ACM 41 (6): 1136-1150 (1994) Ran El-Yaniv , Richard M. Karp: The Mortgage Problem. ISTCS 1993 : 304-312 David E. Culler , Richard M. Karp, David A. Patterson , Abhijit Sahay , Klaus E. Schauser , Eunice Santos , Ramesh Subramonian , Thorsten von Eicken : LogP: Towards a Realistic Model of Parallel Computation. PPOPP 1993 : 1-12 Farid Alizadeh , Richard M. Karp, Lee Aaron Newberg , Deborah K. Weisser : Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology. SODA 1993 : 371-381 Richard M. Karp, Abhijit Sahay , Eunice E. Santos , Klaus E. Schauser : Optimal Broadcast and Summation in the LogP Model. SPAA 1993 : 142-153 Richard M. Karp: Mapping the genome: some combinatorial problems arising in molecular biology. STOC 1993 : 278-285 Richard M. Karp: A Generalization of Binary Search. WADS 1993 : 27-34 Richard M. Karp, Yanjun Zhang : Randomized Parallel Algorithms for Backtrack Search and Branch-and-Bound Computation. J. ACM 40 (3): 765-789 (1993) Narendra Karmarkar , Richard M. Karp, Richard J. Lipton , László Lovász , Michael Luby : A Monte-Carlo Algorithm for Estimating the Permanent. SIAM J. Comput. 22 (2): 284-293 (1993) Ran El-Yaniv , Amos Fiat , Richard M. Karp, G. Turpin : Competitive Analysis of Financial Games FOCS 1992 : 327-333 Richard M. Karp: On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future? IFIP Congress (1) 1992 : 416-429 Alan M. Frieze , Richard M. Karp, Bruce A. Reed : When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? IPCO 1992 : 453-461 Richard M. Karp, Michael Luby , Friedhelm Meyer auf der Heide : Efficient PRAM Simulation on a Distributed Memory Machine STOC 1992 : 318-326 Richard M. Karp: Three-Stage Generalized Connectors. SIAM J. Discrete Math. 5 (2): 259-272 (1992) Richard M. Karp: Probabilistic Recurrence Relations STOC 1991 : 190-197 Sally Floyd , Richard M. Karp: FFD Bin Packing for Item Sizes with Uniform Distributions on [0, 1/2]. Algorithmica 6 (2): 222-240 (1991) Phillip B. Gibbons , Richard M. Karp, Vijaya Ramachandran , Danny Soroker , Robert Endre Tarjan : Transitive Compaction in Parallel via Branchings. J. Algorithms 12 (1): 110-125 (1991) Amos Fiat , Richard M. Karp, Michael Luby , Lyle A. McGeoch , Daniel Dominic Sleator , Neal E. Young : Competitive Paging Algorithms. J. Algorithms 12 (4): 685-699 (1991) Richard M. Karp, Umesh V. Vazirani , Vijay V. Vazirani : An Optimal Algorithm for On-line Bipartite Matching STOC 1990 : 352-358 Shai Ben-David , Allan Borodin , Richard M. Karp, Gábor Tardos , Avi Wigderson : On the Power of Randomization in Online Algorithms (Extended Abstract) STOC 1990 : 379-386 Richard M. Karp, Vijaya Ramachandran : Parallel Algorithms for Shared-Memory Machines. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990 : 869-942 Richard M. Karp: The Transitive Closure of a Random Digraph. Random Structures and Algorithms 1 (1): 73-94 (1990) Garth A. Gibson , Lisa Hellerstein , Richard M. Karp, Randy H. Katz , David A. Patterson : Failure Correction Techniques for Large Disk Arrays. ASPLOS 1989 : 123-132 Richard M. Karp, Yanjun Zhang : On Parallel Evaluation of Game Trees. SPAA 1989 : 409-420 Richard M. Karp, Michael Luby , Neal Madras : Monte-Carlo Approximation Algorithms for Enumeration Problems. J. Algorithms 10 (3): 429-448 (1989) Phillip B. Gibbons , Richard M. Karp, Gary L. Miller , Danny Soroker : Subtree Isomorphism is in Random NC. AWOC 1988 : 43-52 Richard M. Karp, Yanjun Zhang : A Randomized Parallel Branch-and-Bound Procedure STOC 1988 : 290-300 Richard M. Karp, Eli Upfal , Avi Wigderson : The Complexity of Parallel Search. J. Comput. Syst. Sci. 36 (2): 225-253 (1988) Richard M. Karp, Rajeev Motwani , Prabhakar Raghavan : Deferred Data Structuring. SIAM J. Comput. 17 (5): 883-902 (1988) Richard M. Karp, Frank Thomson Leighton , Ronald L. Rivest , Clark D. Thompson , Umesh V. Vazirani , Vijay V. Vazirani : Global Wire Routing in Two-Dimensional Arrays. Algorithmica 2 : 113-129 (1987) Richard M. Karp, Michael O. Rabin : Efficient Randomized Pattern-Matching Algorithms. IBM Journal of Research and Development 31 (2): 249-260 (1987) Richard M. Karp, Michael E. Saks , Avi Wigderson : On a Search Problem Related to Branch-and-Bound Procedures FOCS 1986 : 19-28 Sally Floyd , Richard M. Karp: FFD Bin Packing for Item Sizes with Distributions on [0,1/2] FOCS 1986 : 322-330 Richard M. Karp, Eli Upfal , Avi Wigderson : Constructing a perfect matching is in random NC. Combinatorica 6 (1): 35-48 (1986) Richard M. Karp: Combinatorics, Complexity, and Randomness. Commun. ACM 29 (2): 97-109 (1986) Richard M. Karp, Eli Upfal , Avi Wigderson : The Complexity of Parallel Computation on Matroids FOCS 1985 : 541-550 Richard M. Karp, Eli Upfal , Avi Wigderson : Constructing a Perfect Matching is in Random NC STOC 1985 : 22-32 Richard M. Karp, Eli Upfal , Avi Wigderson : Are Search and Decision Problems Computationally Equivalent? STOC 1985 : 464-475 Richard M. Karp, Avi Wigderson : A Fast Parallel Algorithm for the Maximal Independent Set Problem J. ACM 32 (4): 762-773 (1985) Richard M. Karp, Avi Wigderson : A Fast Parallel Algorithm for the Maximal Independent Set Problem STOC 1984 : 266-272 Richard M. Karp, Michael Luby , Alberto Marchetti-Spaccamela : A Probabilistic Analysis of Multidimensional Bin Packing Problems STOC 1984 : 289-298 Richard M. Karp, Frank Thomson Leighton , Ronald L. Rivest , Clark D. Thompson , Umesh V. Vazirani , Vijay V. Vazirani : Global Wire Routing in Two-Dimensional Arrays (Extended Abstract) FOCS 1983 : 453-459 Richard M. Karp, Michael Luby : Monte-Carlo Algorithms for Enumeration and Reliability Problems FOCS 1983 : 56-64 Richard M. Karp, Judea Pearl : Searching for an Optimal Path in a Tree with Random Costs. Artif. Intell. 21 (1-2): 99-116 (1983) Danny Dolev , Shimon Even , Richard M. Karp: On the Security of Ping-Pong Protocols. CRYPTO 1982 : 177-186 Narendra Karmarkar , Richard M. Karp: An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem FOCS 1982 : 312-320 Danny Dolev , Shimon Even , Richard M. Karp: On the Security of Ping-Pong Protocols Information and Control 55 (1-3): 57-68 (1982) Richard M. Karp, Christos H. Papadimitriou : On Linear Characterizations of Combinatorial Optimization Problems. SIAM J. Comput. 11 (4): 620-632 (1982) Richard M. Karp, Michael Sipser : Maximum Matchings in Sparse Random Graphs FOCS 1981 : 364-375 Manuel Blum , Richard M. Karp, Oliver Vornberger , Christos H. Papadimitriou , Mihalis Yannakakis : The Complexity of Testing Whether a Graph is a Superconcentrator. Inf. Process. Lett. 13 (4/5): 164-167 (1981) Richard M. Karp, Christos H. Papadimitriou : On Linear Characterizations of Combinatorial Optimization Problems FOCS 1980 : 1-9 Richard M. Karp, Richard J. Lipton : Some Connections between Nonuniform and Uniform Complexity Classes STOC 1980 : 302-309 Richard M. Karp, Robert Endre Tarjan : Linear Expected-Time Algorithms for Connectivity Problems (Extended Abstract) STOC 1980 : 368-377 Richard M. Karp, Robert Endre Tarjan : Linear Expected-Time Algorithms for Connectivity Problems. J. Algorithms 1 (4): 374-393 (1980) Romas Aleliunas , Richard M. Karp, Richard J. Lipton , László Lovász , Charles Rackoff : Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems FOCS 1979 : 218-223 Richard M. Karp: Recent Advances in the Probabilistic Analysis of Graph-Theoretic Algorithms (Abstract). ICALP 1979 : 338-339 Richard M. Karp: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem. SIAM J. Comput. 8 (4): 561-573 (1979) Richard M. Karp, A. C. McKellar , C. K. Wong : Near-Optimal Solutions to a 2-Dimensional Placement Problem. SIAM J. Comput. 4 (3): 271-286 (1975) John E. Hopcroft , Richard M. Karp: An n 5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM J. Comput. 2 (4): 225-231 (1973) Richard M. Karp, Raymond E. Miller , Arnold L. Rosenberg : Rapid Identification of Repeated Patterns in Strings, Trees and Arrays STOC 1972 : 125-136 Jack Edmonds , Richard M. Karp: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. J. ACM 19 (2): 248-264 (1972) David Gale , Richard M. Karp: A Phenomenon in the Theory of Sorting. J. Comput. Syst. Sci. 6 (2): 103-115 (1972) John E. Hopcroft , Richard M. Karp: A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs FOCS 1971 : 122-125 David Gale , Richard M. Karp: A Phenomenon in the Theory of Sorting FOCS 1970 : 51-59 Richard M. Karp, Raymond E. Miller : Parallel Program Schemata. J. Comput. Syst. Sci. 3 (2): 147-195 (1969) Richard M. Karp, Raymond E. Miller : Parallel Program Schemata: A Mathematical Model for Parallel Computation FOCS 1967 : 55-61 Richard M. Karp: Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines. J. ACM 14 (3): 478-489 (1967) Richard M. Karp, Raymond E. Miller , Shmuel Winograd : The Organization of Computations for Uniform Recurrence Equations. J. ACM 14 (3): 563-590 (1967) L. P. Horwitz , Richard M. Karp, Raymond E. Miller , Shmuel Winograd : Index Register Allocation. J. ACM 13 (1): 43-61 (1966) Michael Held , Richard M. Karp: The Construction of Discrete Dynamic Programming Algorithms. IBM Systems Journal 4 (2): 136-147 (1965) Richard M. Karp, F. E. McFarlin , J. P. Roth , J. R. Wilts : A computer program for the synthesis of combinational switching circuits FOCS 1961 : 182-194 Richard M. Karp: A Note on the Applicaton of Graph Theory to Digital Computer Programming Information and Control 3 (2): 179-190 (1960) 1 [ 133 ] 2 [ 75 ] [ 83 ] [ 84 ] [ 111 ] [ 135 ] 3 [ 133 ] 4 [ 129 ] 5 [ 18 ] 6 [ 69 ] [ 76 ] [ 80 ] [ 82 ] 7 [ 78 ] 8 [ 89 ] 9 [ 102 ] [ 128 ] 10 [ 53 ] [ 74 ] 11 [ 114 ] [ 116 ] [ 130 ] [ 131 ] 12 [ 138 ] 13 [ 94 ] 14 [ 23 ] 15 [ 53 ] [ 74 ] 16 [ 139 ] 17 [ 83 ] [ 84 ] [ 111 ] 18 [ 131 ] 19 [ 109 ] [ 120 ] 20 [ 70 ] [ 88 ] 21 [ 87 ] [ 112 ] 22 [ 26 ] [ 28 ] 23 [ 12 ] [ 127 ] 24 [ 70 ] [ 88 ] 25 [ 63 ] [ 71 ] [ 121 ] 26 [ 144 ] 27 [ 92 ] [ 98 ] 28 [ 26 ] [ 28 ] 29 [ 97 ] [ 104 ] [ 107 ] 30 [ 55 ] [ 63 ] [ 121 ] 31 [ 40 ] [ 57 ] 32 [ 123 ] 33 [ 61 ] [ 77 ] 34 [ 9 ] [ 11 ] 35 [ 75 ] 36 [ 47 ] [ 56 ] 37 [ 50 ] [ 73 ] 38 [ 89 ] 39 [ 93 ] [ 100 ] 40 [ 135 ] [ 139 ] 41 [ 123 ] [ 124 ] [ 132 ] 42 [ 92 ] 43 [ 75 ] 44 [ 60 ] [ 90 ] 45 [ 3 ] 46 [ 50 ] [ 73 ] 47 [ 10 ] [ 14 ] 48 [ 4 ] 49 [ 92 ] [ 95 ] [ 96 ] [ 97 ] [ 101 ] [ 104 ] [ 107 ] 50 [ 126 ] [ 141 ] 51 [ 27 ] [ 64 ] 52 [ 50 ] [ 73 ] 53 [ 75 ] [ 91 ] [ 106 ] [ 137 ] 54 [ 118 ] 55 [ 139 ] 56 [ 140 ] 57 [ 31 ] [ 43 ] 58 [ 18 ] [ 21 ] [ 64 ] 59 [ 18 ] [ 64 ] 60 [ 30 ] [ 32 ] [ 48 ] [ 55 ] [ 60 ] [ 64 ] [ 87 ] [ 90 ] [ 112 ] 61 [ 92 ] [ 98 ] 62 [ 48 ] 63 [ 32 ] 64 [ 2 ] 65 [ 55 ] 66 [ 15 ] 67 [ 89 ] 68 [ 47 ] 69 [ 4 ] [ 5 ] [ 7 ] [ 8 ] [ 13 ] 70 [ 44 ] 71 [ 69 ] [ 81 ] [ 82 ] 72 [ 138 ] 73 [ 22 ] [ 23 ] [ 25 ] [ 118 ] [ 129 ] [ 134 ] [ 144 ] 74 [ 50 ] [ 70 ] [ 73 ] [ 88 ] 75 [ 110 ] [ 113 ] 76 [ 29 ] 77 [ 78 ] 78 [ 102 ] [ 128 ] 79 [ 42 ] 80 [ 18 ] 81 [ 44 ] 82 [ 52 ] [ 56 ] 83 [ 140 ] 84 [ 123 ] [ 124 ] [ 132 ] 85 [ 61 ] [ 77 ] 86 [ 31 ] [ 43 ] 87 [ 13 ] 88 [ 87 ] [ 112 ] 89 [ 133 ] 90 [ 2 ] 91 [ 68 ] [ 70 ] [ 88 ] 92 [ 41 ] [ 102 ] [ 128 ] 93 [ 70 ] 94 [ 68 ] [ 88 ] 95 [ 68 ] [ 70 ] [ 88 ] 96 [ 123 ] 97 [ 119 ] 98 [ 114 ] [ 116 ] [ 130 ] 99 [ 129 ] 100 [ 97 ] [ 107 ] 101 [ 105 ] [ 110 ] [ 113 ] [ 115 ] [ 130 ] 102 [ 138 ] 103 [ 104 ] 104 [ 118 ] [ 119 ] [ 124 ] [ 129 ] [ 132 ] [ 134 ] [ 144 ] 105 [ 24 ] 106 [ 55 ] 107 [ 47 ] [ 56 ] 108 [ 93 ] [ 100 ] 109 [ 140 ] 110 [ 108 ] 111 [ 70 ] [ 88 ] 112 [ 140 ] 113 [ 53 ] [ 74 ] 114 [ 19 ] [ 20 ] [ 56 ] 115 [ 97 ] [ 107 ] 116 [ 31 ] [ 43 ] 117 [ 63 ] [ 121 ] 118 [ 35 ] [ 36 ] [ 37 ] [ 39 ] [ 45 ] 119 [ 31 ] [ 43 ] [ 54 ] 120 [ 31 ] [ 43 ] [ 54 ] [ 135 ] 121 [ 119 ] 122 [ 23 ] 123 [ 86 ] [ 91 ] [ 92 ] [ 106 ] 124 [ 93 ] [ 100 ] 125 [ 69 ] [ 76 ] [ 80 ] [ 82 ] 126 [ 94 ] 127 [ 78 ] 128 [ 139 ] 129 [ 33 ] [ 34 ] [ 35 ] [ 36 ] [ 37 ] [ 39 ] [ 41 ] [ 45 ] [ 53 ] [ 74 ] [ 89 ] 130 [ 2 ] 131 [ 4 ] [ 5 ] 132 [ 15 ] 133 [ 141 ] 134 [ 125 ] [ 126 ] [ 141 ] 135 [ 114 ] [ 116 ] [ 131 ] 136 [ 23 ] 137 [ 108 ] 138 [ 55 ] 139 [ 98 ] 140 [ 99 ] 141 [ 46 ] [ 49 ] [ 65 ] [ 79 ] 142 [ 76 ] [ 80 ] [ 86 ]  ©2004 Association for Computing Machinery |
