![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Prabhakar Raghavan Prabhakar Raghavan: Social Networks and the Web. AWIC 2004 : 1 Jon M. Kleinberg , Christos H. Papadimitriou , Prabhakar Raghavan: Segmentation problems. J. ACM 51 (2): 263-280 (2004) Mayank Bawa , Gurmeet Singh Manku , Prabhakar Raghavan: SETS: search enhanced by topic segmentation. SIGIR 2003 : 306-313 Prabhakar Raghavan: Extracting and Exploiting Structure in Text Search. SIGMOD Conference 2003 : 635 Gurmeet Singh Manku , Mayank Bawa , Prabhakar Raghavan: Symphony: Distributed Hashing in a Small World. USENIX Symposium on Internet Technologies and Systems 2003 Ravi Kumar , Jasmine Novak , Prabhakar Raghavan, Andrew Tomkins : On the bursty evolution of blogspace. WWW 2003 : 568-576 Prabhakar Raghavan: Editorial: Preserving excellence through change. J. ACM 50 (4): 427-428 (2003) Jon M. Kleinberg , Christos H. Papadimitriou , Prabhakar Raghavan: Auditing Boolean attributes. J. Comput. Syst. Sci. 66 (1): 244-253 (2003) Prabhakar Raghavan, Hadas Shachnai , Mira Yaniv : Dynamic schemes for speculative execution of code. Perform. Eval. 53 (2): 125-142 (2003) Christina Yip Chung , Raymond Lieu , Jinhui Liu , Alpha K. Luk , Jianchang Mao , Prabhakar Raghavan: Thematic mapping - from unstructured documents to taxonomies. CIKM 2002 : 608-610 Gopal Pandurangan , Prabhakar Raghavan, Eli Upfal : Using PageRank to Characterize Web Structure. COCOON 2002 : 330-339 Prabhakar Raghavan, Panayiotis Tsaparas : Mining Significant Associations in Large Scale Text Corpora. ICDM 2002 : 402-409 Petros Drineas , Iordanis Kerenidis , Prabhakar Raghavan: Competitive recommendation systems. STOC 2002 : 82-90 Ravi Kumar , Prabhakar Raghavan, Sridhar Rajagopalan , Andrew Tomkins : The Web and Social Networks. IEEE Computer 35 (11): 32-36 (2002) Prabhakar Raghavan: Social Networks: From the Web to the Enterprise. IEEE Internet Computing 6 (1): 91-94 (2002) Yair Bartal , Marek Chrobak , John Noga , Prabhakar Raghavan: More on random walks, electrical networks, and the harmonic k-server algorithm. Inf. Process. Lett. 84 (5): 271-276 (2002) Moses Charikar , Ronald Fagin , Venkatesan Guruswami , Jon M. Kleinberg , Prabhakar Raghavan, Amit Sahai : Query Strategies for Priced Information. J. Comput. Syst. Sci. 64 (4): 785-819 (2002) Evgeny Dantsin , Andreas Goerdt , Edward A. Hirsch , Ravi Kannan , Jon M. Kleinberg , Christos H. Papadimitriou , Prabhakar Raghavan, Uwe Schöning : A deterministic (2-2/(k+1)) n algorithm for k-SAT based on local search. Theor. Comput. Sci. 289 (1): 69-83 (2002) Gopal Pandurangan , Prabhakar Raghavan, Eli Upfal : Building Low-Diameter P2P Networks. FOCS 2001 : 492-499 Man Abrol , Neil Latarche , Uma Mahadevan , Jianchang Mao , Rajat Mukherjee , Prabhakar Raghavan, Michel Tourn , John Wang , Grace Zhang : Navigating large-scale semi-structured data in business portals. VLDB 2001 : 663-666 Prabhakar Raghavan: Social Networks on the Web and in the Enterprise. Web Intelligence 2001 : 58-60 Ravi Kumar , Prabhakar Raghavan, Sridhar Rajagopalan , Andrew Tomkins : On Semi-Automated Web Taxonomy Construction. WebDB 2001 : 91-96 Prabhakar Raghavan: Structured and Unstructured Search in Enterprises. IEEE Data Eng. Bull. 24 (4): 15-18 (2001) Allan Borodin , Jon M. Kleinberg , Prabhakar Raghavan, Madhu Sudan , David P. Williamson : Adversarial queuing theory. J. ACM 48 (1): 13-38 (2001) Ravi Kumar , Prabhakar Raghavan, Sridhar Rajagopalan , Andrew Tomkins : Recommendation Systems: A Probabilistic Analysis. J. Comput. Syst. Sci. 63 (1): 42-61 (2001) Ravi Kumar , Prabhakar Raghavan, Sridhar Rajagopalan , D. Sivakumar , Andrew Tomkins , Eli Upfal : Random graph models for the web graph. FOCS 2000 : 57-65 Prabhakar Raghavan: Graph Structure of the Web: A Survey. LATIN 2000 : 123-125 Ravi Kumar , Prabhakar Raghavan, Sridhar Rajagopalan , D. Sivakumar , Andrew Tomkins , Eli Upfal : The Web as a Graph. PODS 2000 : 1-10 Jon M. Kleinberg , Christos H. Papadimitriou , Prabhakar Raghavan: Auditing Boolean Attributes. PODS 2000 : 86-91 Ronald Fagin , Anna R. Karlin , Jon M. Kleinberg , Prabhakar Raghavan, Sridhar Rajagopalan , Ronitt Rubinfeld , Madhu Sudan , Andrew Tomkins : Random walks with ``back buttons'' (extended abstract). STOC 2000 : 484-493 Moses Charikar , Ronald Fagin , Venkatesan Guruswami , Jon M. Kleinberg , Prabhakar Raghavan, Amit Sahai : Query strategies for priced information (extended abstract). STOC 2000 : 582-591 Rajeev Motwani , Prabhakar Raghavan: Guest Editors' Foreword. Algorithmica 26 (3-4): 311-312 (2000) Andrei Z. Broder , Ravi Kumar , Farzin Maghoul , Prabhakar Raghavan, Sridhar Rajagopalan , Raymie Stata , Andrew Tomkins , Janet L. Wiener : Graph structure in the Web. Computer Networks 33 (1-6): 309-320 (2000) Christos H. Papadimitriou , Prabhakar Raghavan, Hisao Tamaki , Santosh Vempala : Latent Semantic Indexing: A Probabilistic Analysis. J. Comput. Syst. Sci. 61 (2): 217-235 (2000) Anna R. Karlin , Steven J. Phillips , Prabhakar Raghavan: Markov Paging. SIAM J. Comput. 30 (3): 906-922 (2000) David Gibson , Jon M. Kleinberg , Prabhakar Raghavan: Clustering Categorical Data: An Approach Based on Dynamical Systems. VLDB J. 8 (3-4): 222-236 (2000) Jon M. Kleinberg , Ravi Kumar , Prabhakar Raghavan, Sridhar Rajagopalan , Andrew Tomkins : The Web as a Graph: Measurements, Models, and Methods. COCOON 1999 : 1-17 Moses Charikar , Ravi Kumar , Prabhakar Raghavan, Sridhar Rajagopalan , Andrew Tomkins : On targeting Markov segments. STOC 1999 : 99-108 Ravi Kumar , Prabhakar Raghavan, Sridhar Rajagopalan , Andrew Tomkins : Extracting Large-Scale Knowledge Bases from the Web. VLDB 1999 : 639-650 Soumen Chakrabarti , Byron Dom , David Gibson , Ravi Kumar , Prabhakar Raghavan, Sridhar Rajagopalan , Andrew Tomkins : Topic Distillation and Spectral Filtering. Artif. Intell. Rev. 13 (5-6): 409-435 (1999) Sandy Irani , Prabhakar Raghavan: Combinatorial and experimental results for randomized point matching algorithms. Comput. Geom. 12 (1-2): 17-31 (1999) Ravi Kumar , Prabhakar Raghavan, Sridhar Rajagopalan , Andrew Tomkins : Trawling the Web for Emerging Cyber-Communities. Computer Networks 31 (11-16): 1481-1493 (1999) Soumen Chakrabarti , Byron Dom , Ravi Kumar , Prabhakar Raghavan, Sridhar Rajagopalan , Andrew Tomkins , David Gibson , Jon M. Kleinberg : Mining the Web's Link Structure. IEEE Computer 32 (8): 60-67 (1999) Paul Beame , Allan Borodin , Prabhakar Raghavan, Walter L. Ruzzo , Martin Tompa : A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata. SIAM J. Comput. 28 (3): 1051-1072 (1999) Ravi Kumar , Prabhakar Raghavan, Sridhar Rajagopalan , Andrew Tomkins : Recommendation Systems: A Probabilistic Analysis. FOCS 1998 : 664-673 David Gibson , Jon M. Kleinberg , Prabhakar Raghavan: Inferring Web Communities from Link Topology. Hypertext 1998 : 225-234 Prabhakar Raghavan, Hadas Shachnai , Mira Yaniv : Dynamic Schemes for Speculative Execution of Code. MASCOTS 1998 : 309- Christos H. Papadimitriou , Prabhakar Raghavan, Hisao Tamaki , Santosh Vempala : Latent Semantic Indexing: A Probabilistic Analysis. PODS 1998 : 159-168 Rakesh Agrawal , Johannes Gehrke , Dimitrios Gunopulos , Prabhakar Raghavan: Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications. SIGMOD Conference 1998 : 94-105 Sanjeev Arora , Prabhakar Raghavan, Satish Rao : Approximation Schemes for Euclidean k -Medians and Related Problems. STOC 1998 : 106-113 Jon M. Kleinberg , Christos H. Papadimitriou , Prabhakar Raghavan: Segmentation Problems. STOC 1998 : 473-482 David Gibson , Jon M. Kleinberg , Prabhakar Raghavan: Clustering Categorical Data: An Approach Based on Dynamical Systems. VLDB 1998 : 311-322 Soumen Chakrabarti , Byron Dom , Prabhakar Raghavan, Sridhar Rajagopalan , David Gibson , Jon M. Kleinberg : Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text. Computer Networks 30 (1-7): 65-74 (1998) Jon M. Kleinberg , Christos H. Papadimitriou , Prabhakar Raghavan: A Microeconomic View of Data Mining. Data Min. Knowl. Discov. 2 (4): 311-324 (1998) Lydia E. Kavraki , Jean-Claude Latombe , Rajeev Motwani , Prabhakar Raghavan: Randomized Query Processing in Robot Path Planning. J. Comput. Syst. Sci. 57 (1): 50-66 (1998) Prabhakar Raghavan, Eli Upfal : Stochastic Contention Resolution With Short Delays. SIAM J. Comput. 28 (2): 709-719 (1998) Soumen Chakrabarti , Byron Dom , Rakesh Agrawal , Prabhakar Raghavan: Scalable Feature Selection, Classification and Signature Generation for Organizing Large Text Databases into Hierarchical Topic Taxonomies. VLDB J. 7 (3): 163-178 (1998) Jon M. Kleinberg , Rajeev Motwani , Prabhakar Raghavan, Suresh Venkatasubramanian : Storage Management for Evolving Databases. FOCS 1997 : 353-362 Prabhakar Raghavan: Information Retrieval Algorithms: A Survey. SODA 1997 : 11-18 Piotr Indyk , Rajeev Motwani , Prabhakar Raghavan, Santosh Vempala : Locality-Preserving Hashing in Multidimensional Spaces. STOC 1997 : 618-625 Soumen Chakrabarti , Byron Dom , Rakesh Agrawal , Prabhakar Raghavan: Using Taxonomy, Discriminants, and Signatures for Navigating in Text Databases. VLDB 1997 : 446-455 Moses Charikar , Rajeev Motwani , Prabhakar Raghavan, Craig Silverstein : Constrained TSP and Low-Power Computing. WADS 1997 : 104-115 Rajeev Motwani , Prabhakar Raghavan: Randomized Algorithms. The Computer Science and Engineering Handbook 1997 : 141-161 Ashok K. Chandra , Prabhakar Raghavan, Walter L. Ruzzo , Roman Smolensky , Prasoon Tiwari : The Electrical Resistance of a Graph Captures its Commute and Cover Times. Computational Complexity 6 (4): 312-340 (1997) Jérôme Barraquand , Lydia E. Kavraki , Jean-Claude Latombe , Tsai-Yen Li , Rajeev Motwani , Prabhakar Raghavan: A Random Sampling Scheme for Path Planning. I. J. Robotic Res. 16 (6): 759-774 (1997) Allan Borodin , Prabhakar Raghavan, Baruch Schieber , Eli Upfal : How much can hardware help routing? J. ACM 44 (5): 726-741 (1997) Avrim Blum , Prabhakar Raghavan, Baruch Schieber : Navigating in Unfamiliar Geometric Terrain. SIAM J. Comput. 26 (1): 110-137 (1997) Leonidas J. Guibas , Rajeev Motwani , Prabhakar Raghavan: The Robot Localization Problem. SIAM J. Comput. 26 (4): 1120-1138 (1997) Prabhakar Raghavan: Computational Geometry Impact Potential: A Business and Industrial Perspective. CCCG 1996 : 276 Andreas Arning , Rakesh Agrawal , Prabhakar Raghavan: A Linear Method for Deviation Detection in Large Databases. KDD 1996 : 164-169 Allan Borodin , Jon M. Kleinberg , Prabhakar Raghavan, Madhu Sudan , David P. Williamson : Adversarial Queueing Theory. STOC 1996 : 376-385 Sandy Irani , Prabhakar Raghavan: Combinatorial and Experimental Results for Randomized Point Matching Algorithms. Symposium on Computational Geometry 1996 : 68-77 Rajeev Motwani , Prabhakar Raghavan: Randomized Algorithms. ACM Comput. Surv. 28 (1): 33-37 (1996) Sergio A. Felperin , Prabhakar Raghavan, Eli Upfal : A Theory of Wormhole Routing in Parallel Computers. IEEE Trans. Computers 45 (6): 704-713 (1996) Paul Beame , Allan Borodin , Prabhakar Raghavan, Walter L. Ruzzo , Martin Tompa : Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata. Inf. Comput. 130 (2): 101-129 (1996) Rajeev Motwani , Prabhakar Raghavan: Randomized Algorithms. Cambridge University Press 1995 Prabhakar Raghavan, Eli Upfal : Stochastic contention resolution with short delays. STOC 1995 : 229-237 Pankaj K. Agarwal , Prabhakar Raghavan, Hisao Tamaki : Motion planning for a steering-constrained robot through moderate obstacles. STOC 1995 : 343-352 Lydia E. Kavraki , Jean-Claude Latombe , Rajeev Motwani , Prabhakar Raghavan: Randomized query processing in robot path planning (Extended Abstract). STOC 1995 : 353-362 Andrei Z. Broder , Martin E. Dyer , Alan M. Frieze , Prabhakar Raghavan, Eli Upfal : The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height. Inf. Process. Lett. 56 (2): 79-81 (1995) Allan Borodin , Sandy Irani , Prabhakar Raghavan, Baruch Schieber : Competitive Paging with Locality of Reference. J. Comput. Syst. Sci. 50 (2): 244-258 (1995) Prabhakar Raghavan: Robust Algorithms for Packet Routing in a Mesh. Mathematical Systems Theory 28 (1): 1-11 (1995) Christos H. Papadimitriou , Prabhakar Raghavan, Madhu Sudan , Hisao Tamaki : Motion Planning on a Graph (Extended Abstract) FOCS 1994 : 511-520 Prabhakar Raghavan: Randomized Approximation Algorithms in Combinatorial Optimization. FSTTCS 1994 : 300-317 Kazuo Iwano , Prabhakar Raghavan, Hisao Tamaki : The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection. ISAAC 1994 : 29-37 Prabhakar Raghavan, Eli Upfal : Efficient routing in all-optical networks. STOC 1994 : 134-143 Avrim Blum , Prasad Chalasani , Don Coppersmith , William R. Pulleyblank , Prabhakar Raghavan, Madhu Sudan : The minimum latency problem. STOC 1994 : 163-171 Prabhakar Raghavan: Guest Editor's Foreword: Special Issue on On-Line Algorithms. Algorithmica 11 (1): 1 (1994) Andrei Z. Broder , Anna R. Karlin , Prabhakar Raghavan, Eli Upfal : Trading Space for Time in Undirected s-t Connectivity. SIAM J. Comput. 23 (2): 324-334 (1994) Uriel Feige , Prabhakar Raghavan, David Peleg , Eli Upfal : Computing with Noisy Information. SIAM J. Comput. 23 (5): 1001-1018 (1994) Kam-Wing Ng , Prabhakar Raghavan, N. V. Balasubramanian , Francis Y. L. Chin : Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings Springer 1993 Amotz Bar-Noy , Prabhakar Raghavan, Baruch Schieber , Hisao Tamaki : Fast Deflection Routing for Packets and Worms (Extended Summary). PODC 1993 : 75-86 Allan Borodin , Prabhakar Raghavan, Baruch Schieber , Eli Upfal : How much can hardware help routing? STOC 1993 : 573-582 Don Coppersmith , Peter Doyle , Prabhakar Raghavan, Marc Snir : Random Walks on Weighted Graphs and Applications to On-line Algorithms. J. ACM 40 (3): 421-453 (1993) Howard J. Karloff , Prabhakar Raghavan: Randomized Algorithms and Pseudorandom Numbers. J. ACM 40 (3): 454-476 (1993) Anna R. Karlin , Steven J. Phillips , Prabhakar Raghavan: Markov Paging (Extended Abstract) FOCS 1992 : 208-217 Uriel Feige , Prabhakar Raghavan: Exact Analysis of Hot-Potato Routing (Extended Abstract) FOCS 1992 : 553-562 Sergio A. Felperin , Prabhakar Raghavan, Eli Upfal : A Theory of Wormhole Routing in Parallel Computers (Extended Abstract) FOCS 1992 : 563-572 Sergio A. Felperin , Prabhakar Raghavan, Eli Upfal : An Experimental Study of Wormhole Routing in Parallel Computers. Heinz Nixdorf Symposium 1992 : 156-165 Leonidas J. Guibas , Rajeev Motwani , Prabhakar Raghavan: The Robot Localization Problem in Two Dimensions. SODA 1992 : 259-268 Prabhakar Raghavan: Integer Programming in VLSI Design. Discrete Applied Mathematics 40 (1): 29-43 (1992) Alok Aggarwal , Herbert Edelsbrunner , Prabhakar Raghavan, Prasoon Tiwari : Optimal Time Bounds for Some Proximity Problems in the Plane. Inf. Process. Lett. 42 (1): 55-60 (1992) Marshall W. Bern , Howard J. Karloff , Prabhakar Raghavan, Baruch Schieber : Fast Geometric Approximation Techniques and Geometric Embedding Problems. Theor. Comput. Sci. 106 (2): 265-281 (1992) Andrei Z. Broder , Anna R. Karlin , Prabhakar Raghavan, Eli Upfal : On the Parallel Complexity of Evaluating Game Trees. SODA 1991 : 404-413 Allan Borodin , Sandy Irani , Prabhakar Raghavan, Baruch Schieber : Competitive Paging with Locality of Reference (Preliminary Version) STOC 1991 : 249-259 Avrim Blum , Prabhakar Raghavan, Baruch Schieber : Navigating in Unfamiliar Geometric Terrain (Preliminary Version) STOC 1991 : 494-504 Prabhakar Raghavan, Clark D. Thompson : Multiterminal Global Routing: A Deterministic Approximation Scheme. Algorithmica 6 (1): 73-82 (1991) Alok Aggarwal , Prabhakar Raghavan: Deferred Data Structure for the Nearest Neighbor Problem. Inf. Process. Lett. 40 (3): 119-122 (1991) Christos Kaklamanis , Anna R. Karlin , Frank Thomson Leighton , Victor Milenkovic , Prabhakar Raghavan, S. Rao , Clark D. Thomborson , A. Tsantilas : Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract) FOCS 1990 : 285-296 Paul Beame , Allan Borodin , Prabhakar Raghavan, Walter L. Ruzzo , Martin Tompa : Time-Space Tradeoffs for Undirected Graph Traversal FOCS 1990 : 429-438 Uriel Feige , David Peleg , Prabhakar Raghavan, Eli Upfal : Randomized Broadcast in Networks. SIGAL International Symposium on Algorithms 1990 : 128-137 Uriel Feige , David Peleg , Prabhakar Raghavan, Eli Upfal : Computing with Unreliable Information (Preliminary Version) STOC 1990 : 128-137 Don Coppersmith , Peter Doyle , Prabhakar Raghavan, Marc Snir : Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version) STOC 1990 : 369-378 Uriel Feige , David Peleg , Prabhakar Raghavan, Eli Upfal : Randomized Broadcast in Networks. Random Structures and Algorithms 1 (4): 447-460 (1990) Prabhakar Raghavan, Marc Snir : Memory Versus Randomization in On-line Algorithms (Extended Abstract). ICALP 1989 : 687-703 Manuel Blum , Prabhakar Raghavan: Program Correctness: Can One Test For It? IFIP Congress 1989 : 127-134 Prabhakar Raghavan: Robust Algorithms for Packet Routing in a Mesh. SPAA 1989 : 344-350 Andrei Z. Broder , Anna R. Karlin , Prabhakar Raghavan, Eli Upfal : Trading Space for Time in Undirected s-t Connectivity STOC 1989 : 543-549 Ashok K. Chandra , Prabhakar Raghavan, Walter L. Ruzzo , Roman Smolensky , Prasoon Tiwari : The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract) STOC 1989 : 574-586 Marshall W. Bern , Howard J. Karloff , Prabhakar Raghavan, Baruch Schieber : Fast Geometric Approximation Techniques and Geometric Embedding Problems. Symposium on Computational Geometry 1989 : 292-301 Don Coppersmith , Prabhakar Raghavan, Martin Tompa : Parallel Graph Algorithms That Are Efficient on Average Inf. Comput. 81 (3): 318-333 (1989) Alok Aggarwal , Ashok K. Chandra , Prabhakar Raghavan: Energy Consumption in VLSI Circuits (Preliminary Version) STOC 1988 : 205-216 Howard J. Karloff , Prabhakar Raghavan: Randomized Algorithms and Pseudorandom Numbers STOC 1988 : 310-321 Prabhakar Raghavan: Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs. J. Comput. Syst. Sci. 37 (2): 130-143 (1988) Richard M. Karp , Rajeev Motwani , Prabhakar Raghavan: Deferred Data Structuring. SIAM J. Comput. 17 (5): 883-902 (1988) Don Coppersmith , Prabhakar Raghavan, Martin Tompa : Parallel Graph Algorithms that Are Efficient on Average FOCS 1987 : 260-269 Prabhakar Raghavan, Clark D. Thompson : Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7 (4): 365-374 (1987) Antony P.-C Ng , Clark D. Thompson , Prabhakar Raghavan: A language for describing rectilinear Steiner tree configurations. DAC 1986 : 659-662 Prabhakar Raghavan: Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs FOCS 1986 : 10-18 Rajeev Motwani , Prabhakar Raghavan: Deferred Data Structuring: Query-Driven Preprocessing for Geometric Search Problems. Symposium on Computational Geometry 1986 : 303-312 Prabhakar Raghavan, Clark D. Thompson : Provably Good Routing in Graphs: Regular Arrays STOC 1985 : 79-87 1 [ 112 ] 2 [ 54 ] 3 [ 10 ] [ 24 ] [ 30 ] 4 [ 62 ] [ 71 ] [ 75 ] [ 83 ] 5 [ 62 ] 6 [ 82 ] 7 [ 41 ] 8 [ 40 ] 9 [ 67 ] 10 [ 116 ] 11 [ 127 ] [ 129 ] 12 [ 22 ] [ 57 ] [ 88 ] 13 [ 12 ] [ 29 ] 14 [ 26 ] [ 45 ] [ 65 ] 15 [ 16 ] 16 [ 22 ] [ 27 ] [ 39 ] [ 51 ] [ 57 ] [ 61 ] [ 66 ] [ 88 ] [ 108 ] 17 [ 14 ] [ 28 ] [ 43 ] [ 52 ] [ 99 ] 18 [ 71 ] [ 75 ] [ 79 ] [ 89 ] [ 92 ] 19 [ 45 ] 20 [ 10 ] [ 13 ] [ 68 ] 21 [ 70 ] [ 94 ] [ 101 ] [ 115 ] 22 [ 41 ] 23 [ 116 ] 24 [ 122 ] 25 [ 6 ] [ 11 ] [ 19 ] [ 38 ] [ 45 ] 26 [ 114 ] 27 [ 71 ] [ 75 ] [ 79 ] [ 89 ] [ 92 ] 28 [ 19 ] [ 38 ] 29 [ 119 ] 30 [ 52 ] 31 [ 30 ] 32 [ 101 ] [ 102 ] [ 115 ] 33 [ 18 ] [ 20 ] [ 21 ] [ 35 ] [ 42 ] 34 [ 33 ] [ 34 ] [ 58 ] 35 [ 52 ] 36 [ 83 ] 37 [ 79 ] [ 80 ] [ 86 ] [ 89 ] [ 92 ] [ 96 ] 38 [ 114 ] 39 [ 32 ] [ 64 ] 40 [ 83 ] 41 [ 101 ] [ 115 ] 42 [ 114 ] 43 [ 72 ] 44 [ 27 ] [ 51 ] [ 60 ] [ 91 ] 45 [ 47 ] 46 [ 23 ] 47 [ 114 ] 48 [ 14 ] [ 23 ] [ 28 ] [ 36 ] [ 43 ] [ 97 ] [ 102 ] 49 [ 9 ] [ 12 ] [ 29 ] [ 37 ] 50 [ 7 ] 51 [ 53 ] [ 67 ] [ 77 ] 52 [ 119 ] 53 [ 61 ] [ 74 ] [ 78 ] [ 79 ] [ 80 ] [ 81 ] [ 86 ] [ 89 ] [ 95 ] [ 96 ] [ 101 ] [ 102 ] [ 103 ] [ 108 ] [ 114 ] [ 115 ] [ 124 ] [ 130 ] 54 [ 87 ] [ 89 ] [ 90 ] [ 92 ] [ 93 ] [ 94 ] [ 95 ] [ 99 ] [ 104 ] [ 106 ] [ 107 ] [ 110 ] [ 118 ] [ 126 ] 55 [ 112 ] 56 [ 53 ] [ 67 ] [ 77 ] 57 [ 23 ] 58 [ 67 ] 59 [ 122 ] 60 [ 122 ] 61 [ 122 ] 62 [ 99 ] 63 [ 112 ] 64 [ 127 ] [ 129 ] 65 [ 112 ] [ 122 ] 66 [ 23 ] 67 [ 2 ] [ 7 ] [ 32 ] [ 53 ] [ 56 ] [ 59 ] [ 64 ] [ 67 ] [ 69 ] [ 70 ] [ 72 ] [ 74 ] [ 77 ] [ 100 ] 68 [ 112 ] 69 [ 4 ] 70 [ 41 ] 71 [ 116 ] 72 [ 126 ] 73 [ 113 ] [ 121 ] 74 [ 49 ] [ 78 ] [ 81 ] [ 84 ] [ 98 ] [ 103 ] [ 114 ] [ 124 ] [ 130 ] 75 [ 18 ] [ 20 ] [ 21 ] [ 42 ] 76 [ 36 ] [ 97 ] 77 [ 45 ] 78 [ 79 ] [ 87 ] [ 89 ] [ 90 ] [ 92 ] [ 93 ] [ 94 ] [ 95 ] [ 99 ] [ 102 ] [ 104 ] [ 106 ] [ 107 ] [ 110 ] [ 118 ] 79 [ 23 ] 80 [ 82 ] 81 [ 102 ] 82 [ 13 ] [ 22 ] [ 57 ] [ 68 ] [ 88 ] 83 [ 101 ] [ 115 ] 84 [ 12 ] [ 26 ] [ 27 ] [ 29 ] [ 39 ] [ 40 ] [ 51 ] [ 65 ] [ 66 ] 85 [ 114 ] 86 [ 85 ] [ 123 ] 87 [ 70 ] 88 [ 104 ] [ 106 ] 89 [ 13 ] [ 68 ] 90 [ 17 ] [ 19 ] [ 38 ] 91 [ 99 ] 92 [ 45 ] [ 49 ] [ 61 ] [ 102 ] [ 108 ] 93 [ 40 ] [ 47 ] [ 49 ] [ 54 ] [ 84 ] [ 98 ] 94 [ 23 ] 95 [ 1 ] [ 4 ] [ 5 ] [ 25 ] 96 [ 13 ] [ 30 ] [ 68 ] 97 [ 87 ] [ 89 ] [ 90 ] [ 92 ] [ 93 ] [ 94 ] [ 95 ] [ 99 ] [ 102 ] [ 104 ] [ 106 ] [ 107 ] [ 110 ] [ 118 ] [ 126 ] 98 [ 6 ] [ 11 ] [ 22 ] [ 57 ] [ 88 ] 99 [ 112 ] 100 [ 23 ] 101 [ 120 ] 102 [ 14 ] [ 18 ] [ 20 ] [ 21 ] [ 28 ] [ 33 ] [ 34 ] [ 39 ] [ 42 ] [ 43 ] [ 46 ] [ 52 ] [ 55 ] [ 58 ] [ 66 ] [ 76 ] [ 104 ] [ 106 ] [ 113 ] [ 121 ] 103 [ 72 ] [ 84 ] [ 98 ] 104 [ 74 ] 105 [ 112 ] 106 [ 99 ] 107 [ 61 ] [ 108 ] 108 [ 85 ] [ 123 ] 109 [ 112 ] ![]() ©2004 Association for Computing Machinery |