| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. S. Muthukrishnan Funda Ergün , S. Muthukrishnan, Süleyman Cenk Sahinalp : Sublinear Methods for Detecting Periodic Trends in Data Streams. LATIN 2004 : 16-28 Graham Cormode , S. Muthukrishnan: An Improved Data Stream Summary: The Count-Min Sketch and Its Applications. LATIN 2004 : 29-38 Graham Cormode , Flip Korn , S. Muthukrishnan, Divesh Srivastava : Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data. SIGMOD Conference 2004 Theodore Johnson , Graham Cormode , Flip Korn , S. Muthukrishnan, Oliver Spatscheck , Divesh Srivastava : Holistic UDAFs at streaming speeds. SIGMOD Conference 2004 Richard Cole , Zvi Galil , Ramesh Hariharan , S. Muthukrishnan, Kunsoo Park : Parallel two dimensional witness computation. Inf. Comput. 188 (1): 20-67 (2004) Graham Cormode , S. Muthukrishnan: Estimating Dominance Norms of Multiple Data Streams. ESA 2003 : 148-160 Funda Ergün , S. Muthukrishnan, Süleyman Cenk Sahinalp : Comparing Sequences with Segment Rearrangements. FSTTCS 2003 : 183-194 S. Muthukrishnan, Martin Strauss : Maintenance of Multidimensional Histograms. FSTTCS 2003 : 352-362 Graham Cormode , S. Muthukrishnan: What's hot and what's not: tracking most frequent items dynamically. PODS 2003 : 296-306 Flip Korn , S. Muthukrishnan, Yunyue Zhu : IPSOFACTO: A Visual Correlation Tool for Aggregate Network Traffic Data. SIGMOD Conference 2003 : 677 S. Muthukrishnan, Martin Strauss : Rangesum histograms. SODA 2003 : 233-242 Anna C. Gilbert , S. Muthukrishnan, Martin Strauss : Approximation of functions over redundant dictionaries using coherence. SODA 2003 : 243-252 S. Muthukrishnan: Data streams: algorithms and applications. SODA 2003 : 413-413 S. Muthukrishnan, Torsten Suel , Radek Vingralek : Inferring tree topologies using flow tests. SODA 2003 : 828-829 Graham Cormode , Flip Korn , S. Muthukrishnan, Divesh Srivastava : Finding Hierarchical Heavy Hitters in Data Streams. VLDB 2003 : 464-475 Flip Korn , S. Muthukrishnan, Yunyue Zhu : Checks and Balances: Monitoring Data Quality Problems in Network Traffic Databases. VLDB 2003 : 536-547 Graham Cormode , Mayur Datar , Piotr Indyk , S. Muthukrishnan: Comparing Data Streams Using Hamming Norms (How to Zero In). IEEE Trans. Knowl. Data Eng. 15 (3): 529-540 (2003) Anna C. Gilbert , Yannis Kotidis , S. Muthukrishnan, Martin Strauss : One-Pass Wavelet Decompositions of Data Streams. IEEE Trans. Knowl. Data Eng. 15 (3): 541-554 (2003) Rohit Ananthakrishna , Abhinandan Das , Johannes Gehrke , Flip Korn , S. Muthukrishnan, Divesh Srivastava : Efficient Approximation of Correlated Sums on Data Streams. IEEE Trans. Knowl. Data Eng. 15 (3): 569-572 (2003) Piotr Berman , Bhaskar DasGupta , S. Muthukrishnan: Approximation algorithms for MAX-MIN tiling. J. Algorithms 47 (2): 122-134 (2003) Zhiyuan Chen , Flip Korn , Nick Koudas , S. Muthukrishnan: Generalized substring selectivity estimation. J. Comput. Syst. Sci. 66 (1): 98-132 (2003) Paolo Ferragina , Nick Koudas , S. Muthukrishnan, Divesh Srivastava : Two-dimensional substring indexing. J. Comput. Syst. Sci. 66 (4): 763-774 (2003) S. Muthukrishnan, Süleyman Cenk Sahinalp : Simple and Practical Sequence Nearest Neighbors with Block Operations. CPM 2002 : 262-278 Pankaj K. Agarwal , Sathish Govindarajan , S. Muthukrishnan: Range Searching in Categorical Data: Colored Range Searching on Grid. ESA 2002 : 17-28 Mayur Datar , S. Muthukrishnan: Estimating Rarity and Similarity over Data Stream Windows. ESA 2002 : 323-334 Valentina Ciriani , Paolo Ferragina , Fabrizio Luccio , S. Muthukrishnan: Static Optimality Theorem for External Memory String Access. FOCS 2002 : 219-227 Sudipto Guha , Piotr Indyk , S. Muthukrishnan, Martin Strauss : Histogramming Data Streams with Fast Per-Item Processing. ICALP 2002 : 681-692 Graham Cormode , Piotr Indyk , Nick Koudas , S. Muthukrishnan: Fast Mining of Massive Tabular Data via Approximate Distance Computations. ICDE 2002 : 605- S. Muthukrishnan, Süleyman Cenk Sahinalp : An Improved Algorithm for Sequence Comparison with Block Reversals. LATIN 2002 : 319-325 Tamraparni Dasu , Theodore Johnson , S. Muthukrishnan, Vladislav Shkapenyuk : Mining database structure; or, how to build a data quality browser. SIGMOD Conference 2002 : 240-251 Piotr Berman , Bhaskar DasGupta , S. Muthukrishnan: Slice and dice: a simple, improved approximate tiling recipe. SODA 2002 : 455-464 S. Muthukrishnan: Efficient algorithms for document retrieval problems. SODA 2002 : 657-666 Graham Cormode , S. Muthukrishnan: The string edit distance matching problem with moves. SODA 2002 : 667-676 Piotr Berman , Bhaskar DasGupta , S. Muthukrishnan: Simple approximation algorithm for nonoverlapping local alignments. SODA 2002 : 677-678 Michael A. Bender , S. Muthukrishnan, Rajmohan Rajaraman : Improved algorithms for stretch scheduling. SODA 2002 : 762-771 Luca Becchetti , Suhas N. Diggavi , Stefano Leonardi , Alberto Marchetti-Spaccamela , S. Muthukrishnan, Thyagarajan Nandagopal , Andrea Vitaletti : Parallel scheduling problems in next generation wireless networks. SPAA 2002 : 238-247 Anna C. Gilbert , Sudipto Guha , Piotr Indyk , S. Muthukrishnan, Martin Strauss : Near-optimal sparse fourier representations via sampling. STOC 2002 : 152-161 Anna C. Gilbert , Sudipto Guha , Piotr Indyk , Yannis Kotidis , S. Muthukrishnan, Martin Strauss : Fast, small-space algorithms for approximate histogram maintenance. STOC 2002 : 389-398 Graham Cormode , Mayur Datar , Piotr Indyk , S. Muthukrishnan: Comparing Data Streams Using Hamming Norms (How to Zero In). VLDB 2002 : 335-345 Anna C. Gilbert , Yannis Kotidis , S. Muthukrishnan, Martin Strauss : How to Summarize the Universe: Dynamic Maintenance of Quantiles. VLDB 2002 : 454-465 Flip Korn , S. Muthukrishnan, Divesh Srivastava : Reverse Nearest Neighbor Aggregates Over Data Streams. VLDB 2002 : 814-825 Pankaj K. Agarwal , Leonidas J. Guibas , Herbert Edelsbrunner , Jeff Erickson , Michael Isard , Sariel Har-Peled , John Hershberger , Christian S. Jensen , Lydia E. Kavraki , Patrice Koehl , Ming Lin , Dinesh Manocha , Dimitris N. Metaxas , Brian Mirtich , David M. Mount , S. Muthukrishnan, Dinesh K. Pai , Elisha Sacks , Jack Snoeyink , Subhash Suri , Ouri Wolfson : Algorithmic issues in modeling motion. ACM Comput. Surv. 34 (4): 550-572 (2002) S. Muthukrishnan, Rajmohan Rajaraman : An Adversarial Model for Distributed Dynamic Load Balancing. Journal of Interconnection Networks 3 (1-2): 35-47 (2002) Piotr Berman , Bhaskar DasGupta , S. Muthukrishnan: Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms. SIAM J. Discrete Math. 15 (2): 252-267 (2002) Graham Cormode , S. Muthukrishnan, Süleyman Cenk Sahinalp : Permutation Editing and Matching via Embeddings. ICALP 2001 : 481-492 Zhiyuan Chen , H. V. Jagadish , Flip Korn , Nick Koudas , S. Muthukrishnan, Raymond T. Ng , Divesh Srivastava : Counting Twig Matches in a Tree. ICDE 2001 : 595-604 Rittwik Jana , Theodore Johnson , S. Muthukrishnan, Andrea Vitaletti : Location based services in a wireless WAN using cellular digital packet data (CDPD). MobiDE 2001 : 74-80 Darin Nelson , S. Muthukrishnan: Design issues in multimedia messaging for next generation wireless systems. MobiDE 2001 : 98-103 Anna C. Gilbert , Yannis Kotidis , S. Muthukrishnan, Martin Strauss : Optimal and Approximate Computation of Summary Statistics for Range Aggregates. PODS 2001 Paolo Ferragina , Nick Koudas , S. Muthukrishnan, Divesh Srivastava : Two-dimensional Substring Indexing. PODS 2001 Piotr Berman , Bhaskar DasGupta , S. Muthukrishnan, Suneeta Ramaswami : Improved approximation algorithms for rectangle tiling and packing. SODA 2001 : 427-436 David Eppstein , S. Muthukrishnan: Internet packet filter management and rectangle geometry. SODA 2001 : 827-835 Luis Gravano , Panagiotis G. Ipeirotis , H. V. Jagadish , Nick Koudas , S. Muthukrishnan, Divesh Srivastava : Approximate String Joins in a Database (Almost) for Free. VLDB 2001 : 491-500 Anna C. Gilbert , Yannis Kotidis , S. Muthukrishnan, Martin Strauss : Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries. VLDB 2001 : 79-88 Luis Gravano , Panagiotis G. Ipeirotis , H. V. Jagadish , Nick Koudas , S. Muthukrishnan, Lauri Pietarinen , Divesh Srivastava : Using q-grams in a DBMS for Approximate String Processing. IEEE Data Eng. Bull. 24 (4): 28-34 (2001) Piotr Berman , Bhaskar DasGupta , S. Muthukrishnan, Suneeta Ramaswami : Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles. J. Algorithms 41 (2): 443-470 (2001) Anja Feldmann , S. Muthukrishnan: Tradeoffs for Packet Classification. INFOCOM 2000 : 1193-1202 Volkan Ozdemir , S. Muthukrishnan, Injong Rhee : Scalable, Low-Overhead Network Delay Estimation. INFOCOM 2000 : 1343-1350 Injong Rhee , Srinath R. Joshi , Minsuk Lee , S. Muthukrishnan, Volkan Ozdemir : Layered Multicast Recovery. INFOCOM 2000 : 805-813 Nick Koudas , S. Muthukrishnan, Divesh Srivastava : Optimal Histograms for Hierarchical Range Queries. PODS 2000 : 196-204 Zhiyuan Chen , Flip Korn , Nick Koudas , S. Muthukrishnan: Selectivity Estimation for Boolean Queries. PODS 2000 : 216-225 Flip Korn , S. Muthukrishnan: Influence Sets Based on Reverse Nearest Neighbor Queries. SIGMOD Conference 2000 : 201-212 Adam L. Buchsbaum , Donald F. Caldwell , Kenneth Ward Church , Glenn S. Fowler , S. Muthukrishnan: Engineering the compression of massive tables: an experimental approach. SODA 2000 : 175-184 Z. Cohen , Yossi Matias , S. Muthukrishnan, Süleyman Cenk Sahinalp , Jacob Ziv : On the temporal HZY compression scheme. SODA 2000 : 185-186 Luca Becchetti , Stefano Leonardi , S. Muthukrishnan: Scheduling to minimize average stretch without migration. SODA 2000 : 548-557 Yair Bartal , S. Muthukrishnan: Minimizing maximum response time in scheduling broadcasts. SODA 2000 : 558-559 S. Muthukrishnan, Süleyman Cenk Sahinalp : Approximate nearest neighbors and sequence comparison with block operations. STOC 2000 : 416-424 Piotr Indyk , Nick Koudas , S. Muthukrishnan: Identifying Representative Trends in Massive Time Series Data Sets Using Sketches. VLDB 2000 : 363-372 Martin Farach-Colton , Paolo Ferragina , S. Muthukrishnan: On the sorting-complexity of suffix tree construction. J. ACM 47 (6): 987-1011 (2000) S. Muthukrishnan: Simple Optimal Parallel Multiple Pattern Matching. J. Algorithms 34 (1): 1-13 (2000) S. Muthukrishnan, Rajmohan Rajaraman , Anthony Shaheen , Johannes Gehrke : Online Scheduling to Minimize Average Stretch. FOCS 1999 : 433-442 S. Muthukrishnan, Viswanath Poosala , Torsten Suel : On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications. ICDT 1999 : 236-256 Sachin More , S. Muthukrishnan, Elizabeth A. M. Shriver : Efficient Sequencing Tape-Resident Jobs. PODS 1999 : 33-43 S. Muthukrishnan, Mike Paterson , Süleyman Cenk Sahinalp , Torsten Suel : Compact Grid Layouts of Multi-Level Networks. STOC 1999 : 455-463 Paolo Ferragina , S. Muthukrishnan, Mark de Berg : Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems. STOC 1999 : 483-491 H. V. Jagadish , Nick Koudas , S. Muthukrishnan: Mining Deviants in a Time Series Database. VLDB 1999 : 102-113 Bhaskar Ghosh , Frank Thomson Leighton , Bruce M. Maggs , S. Muthukrishnan, C. Greg Plaxton , Rajmohan Rajaraman , Andréa W. Richa , Robert Endre Tarjan , David Zuckerman : Tight Analyses of Two Local Load Balancing Algorithms. SIAM J. Comput. 29 (1): 29-64 (1999) Yossi Matias , S. Muthukrishnan, Süleyman Cenk Sahinalp , Jacob Ziv : Augmenting Suffix Trees, with Applications. ESA 1998 : 67-78 Martin Farach , Paolo Ferragina , S. Muthukrishnan: Overcoming the Memory Bottleneck in Suffix Tree Construction. FOCS 1998 : 174-185 S. Muthukrishnan: Randomization in Parallel Stringology. IPPS/SPDP Workshops 1998 : 361-362 Swarup Acharya , S. Muthukrishnan: Scheduling On-Demand Broadcasts: New Metrics and Algorithms. MOBICOM 1998 : 43-54 S. Muthukrishnan, Torsten Suel : Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow. RANDOM 1998 : 369-384 Michael A. Bender , Soumen Chakrabarti , S. Muthukrishnan: Flow and Stretch Metrics for Scheduling Continuous Job Streams. SODA 1998 : 270-279 Sanjeev Khanna , S. Muthukrishnan, Mike Paterson : On Approximating Rectangle Tiling and Packing. SODA 1998 : 384-393 Shimon Even , S. Muthukrishnan, Mike Paterson , Süleyman Cenk Sahinalp : Layout of the Batcher Bitonic Sorter (Extended Abstract). SPAA 1998 : 172-181 S. Muthukrishnan, Rajmohan Rajaraman : An Adversarial Model for Distributed Dynamic Load Balancing. SPAA 1998 : 47-54 H. V. Jagadish , Nick Koudas , S. Muthukrishnan, Viswanath Poosala , Kenneth C. Sevcik , Torsten Suel : Optimal Histograms with Quality Guarantees. VLDB 1998 : 275-286 Maxime Crochemore , Leszek Gasieniec , Ramesh Hariharan , S. Muthukrishnan, Wojciech Rytter : A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching. SIAM J. Comput. 27 (3): 668-681 (1998) S. Muthukrishnan, Bhaskar Ghosh , Martin H. Schultz : First- and Second-Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing. Theory Comput. Syst. 31 (4): 331-354 (1998) K. Cirino , S. Muthukrishnan, N. S. Narayanaswamy , H. Ramesh : Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds. FSTTCS 1997 : 37-53 Sanjeev Khanna , S. Muthukrishnan, Steven Skiena : Efficient Array Partitioning. ICALP 1997 : 616-626 Ralf Diekmann , S. Muthukrishnan, Madhu V. Nayakkankuppam : Engineering Diffusive Load Balancing Algorithms Using Experiments. IRREGULAR 1997 : 111-122 Richa Agarwala , Serafim Batzoglou , Vlado Dancík , Scott E. Decatur , Martin Farach , Sridhar Hannenhalli , S. Muthukrishnan, Steven Skiena : Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model. RECOMB 1997 : 1-2 S. Muthukrishnan, Laxmi Parida : Towards constructing physical maps by optical mapping (extended abstract): an effective, simple, combinatorial approach. RECOMB 1997 : 209-219 S. Muthukrishnan: Detecting False Matches in String-Matching Algorithms. Algorithmica 18 (4): 512-520 (1997) Martin Farach , S. Muthukrishnan: Optimal Parallel Randomized Renaming. Inf. Process. Lett. 61 (1): 7-10 (1997) Vlado Dancík , Sridhar Hannenhalli , S. Muthukrishnan: Hardness of Flip-Cut Problems from Optical Mapping. Journal of Computational Biology 4 (2): 119-126 (1997) Richa Agarwala , Serafim Batzoglou , Vlado Dancík , Scott E. Decatur , Sridhar Hannenhalli , Martin Farach , S. Muthukrishnan, Steven Skiena : Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model. Journal of Computational Biology 4 (3): 275-296 (1997) Martin Farach , S. Muthukrishnan: Perfect Hashing for Strings: Formalization and Algorithms. CPM 1996 : 130-140 Paolo Ferragina , S. Muthukrishnan: Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract). ESA 1996 : 107-120 Martin Farach , S. Muthukrishnan: Optimal Logarithmic Time Randomized Suffix Tree Construction. ICALP 1996 : 550-561 S. Muthukrishnan, Martin Müller II : Time and Space Efficient Method-Lookup for Object-Oriented Programs (Extended Abstract). SODA 1996 : 42-51 Soumen Chakrabarti , S. Muthukrishnan: Resource Scheduling for Parallel Database and Scientific Applications. SPAA 1996 : 329-335 Bhaskar Ghosh , S. Muthukrishnan, Martin H. Schultz : First and Second Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing (Extended Abstract). SPAA 1996 : 72-81 Bhaskar Ghosh , S. Muthukrishnan: Dynamic Load Balancing by Random Matchings. J. Comput. Syst. Sci. 53 (3): 357-370 (1996) Vineet Bafna , S. Muthukrishnan, R. Ravi : Computing Similarity between RNA Strings. CPM 1995 : 1-16 S. Muthukrishnan: New Results and Open Problems Related to Non-Standard Stringology. CPM 1995 : 298-317 Martin Farach , S. Muthukrishnan: Optimal Parallel Dictionary Matching and Compression (Extended Abstract). SPAA 1995 : 244-253 Bhaskar Ghosh , Frank Thomson Leighton , Bruce M. Maggs , S. Muthukrishnan, C. Greg Plaxton , Rajmohan Rajaraman , Andréa W. Richa , Robert Endre Tarjan , David Zuckerman : Tight analyses of two local load balancing algorithms. STOC 1995 : 548-558 S. Muthukrishnan, H. Ramesh : String Matching Under a General Matching Relation Inf. Comput. 122 (1): 140-148 (1995) Ramesh Hariharan , S. Muthukrishnan: Optimal Parallel Algorithms for Prefix Matching. ICALP 1994 : 203-214 S. Muthukrishnan: On Optimal Strategies for Searching in Presence of Errors. SODA 1994 : 680-689 Bhaskar Ghosh , S. Muthukrishnan: Dynamic Load Balancing in Parallel and Distributed Networks by Random Matchings (Extended Abstract). SPAA 1994 : 226-235 S. Muthukrishnan, Krishna V. Palem : Non-standard stringology: algorithms and complexity. STOC 1994 : 770-779 Amihood Amir , Martin Farach , S. Muthukrishnan: Alphabet Dependence in Parameterized Matching. Inf. Process. Lett. 49 (3): 111-115 (1994) S. Muthukrishnan: Detecting False Matches in String Matching Algorithms. CPM 1993 : 164-178 Richard Cole , Maxime Crochemore , Zvi Galil , Leszek Gasieniec , Ramesh Hariharan , S. Muthukrishnan, Kunsoo Park , Wojciech Rytter : Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions FOCS 1993 : 248-258 S. Muthukrishnan, Krishna V. Palem : Highly Efficient Dictionary Matching in Parallel. SPAA 1993 : 69-78 S. Muthukrishnan, H. Ramesh : String Matching Under a General Matching Relation. FSTTCS 1992 : 356-367 1 [ 39 ] 2 [ 78 ] [ 96 ] 3 [ 22 ] [ 27 ] 4 [ 5 ] 5 [ 101 ] 6 [ 14 ] 7 [ 54 ] 8 [ 22 ] [ 27 ] 9 [ 55 ] [ 84 ] 10 [ 37 ] [ 85 ] 11 [ 45 ] 12 [ 64 ] [ 69 ] [ 76 ] [ 86 ] [ 89 ] [ 100 ] 13 [ 57 ] 14 [ 57 ] 15 [ 17 ] [ 37 ] 16 [ 59 ] [ 74 ] [ 99 ] 17 [ 57 ] 18 [ 94 ] 19 [ 30 ] 20 [ 56 ] 21 [ 3 ] [ 115 ] 22 [ 75 ] [ 81 ] [ 87 ] [ 92 ] [ 103 ] [ 105 ] [ 111 ] [ 114 ] [ 116 ] [ 117 ] [ 118 ] 23 [ 3 ] [ 32 ] 24 [ 22 ] [ 23 ] [ 27 ] 25 [ 101 ] 26 [ 64 ] [ 69 ] [ 76 ] [ 86 ] [ 89 ] [ 100 ] 27 [ 90 ] 28 [ 81 ] [ 95 ] [ 103 ] 29 [ 22 ] [ 27 ] 30 [ 28 ] 31 [ 84 ] 32 [ 78 ] 33 [ 68 ] 34 [ 113 ] [ 119 ] 35 [ 78 ] 36 [ 35 ] 37 [ 5 ] [ 12 ] [ 19 ] [ 21 ] [ 22 ] [ 24 ] [ 27 ] [ 41 ] 38 [ 51 ] 39 [ 63 ] 40 [ 20 ] [ 41 ] [ 45 ] [ 51 ] [ 70 ] [ 94 ] [ 98 ] 41 [ 57 ] 42 [ 3 ] [ 115 ] 43 [ 3 ] [ 32 ] 44 [ 49 ] [ 101 ] 45 [ 7 ] [ 11 ] [ 15 ] [ 16 ] [ 31 ] [ 43 ] 46 [ 66 ] [ 71 ] [ 80 ] [ 82 ] [ 83 ] [ 102 ] [ 108 ] 47 [ 96 ] 48 [ 65 ] [ 67 ] 49 [ 82 ] [ 83 ] [ 93 ] 50 [ 78 ] 51 [ 22 ] [ 23 ] [ 27 ] 52 [ 78 ] 53 [ 3 ] [ 9 ] [ 32 ] [ 115 ] 54 [ 78 ] 55 [ 52 ] [ 81 ] [ 82 ] [ 83 ] [ 92 ] [ 93 ] [ 103 ] 56 [ 65 ] [ 67 ] 57 [ 78 ] 58 [ 33 ] [ 44 ] [ 65 ] [ 67 ] [ 74 ] 59 [ 73 ] 60 [ 78 ] 61 [ 73 ] [ 90 ] [ 116 ] 62 [ 61 ] 63 [ 78 ] 64 [ 29 ] [ 36 ] 65 [ 78 ] 66 [ 58 ] [ 59 ] [ 74 ] [ 79 ] [ 99 ] [ 101 ] [ 104 ] [ 105 ] [ 110 ] [ 116 ] [ 117 ] 67 [ 66 ] [ 71 ] [ 80 ] [ 82 ] [ 102 ] 68 [ 33 ] [ 44 ] [ 52 ] [ 59 ] [ 60 ] [ 65 ] [ 67 ] [ 70 ] [ 74 ] [ 92 ] [ 98 ] [ 99 ] 69 [ 61 ] 70 [ 11 ] [ 43 ] 71 [ 55 ] [ 84 ] 72 [ 78 ] 73 [ 94 ] 74 [ 11 ] [ 43 ] 75 [ 78 ] 76 [ 84 ] 77 [ 42 ] [ 56 ] 78 [ 78 ] 79 [ 78 ] 80 [ 47 ] 81 [ 78 ] 82 [ 18 ] 83 [ 84 ] 84 [ 30 ] 85 [ 28 ] 86 [ 72 ] 87 [ 74 ] 88 [ 61 ] [ 62 ] 89 [ 78 ] 90 [ 2 ] [ 6 ] 91 [ 26 ] 92 [ 3 ] [ 115 ] 93 [ 35 ] [ 36 ] [ 46 ] 94 [ 65 ] 95 [ 11 ] [ 43 ] 96 [ 33 ] [ 48 ] 97 [ 11 ] [ 34 ] [ 43 ] [ 49 ] [ 77 ] [ 85 ] 98 [ 64 ] [ 69 ] 99 [ 1 ] [ 10 ] [ 30 ] 100 [ 14 ] 101 [ 61 ] [ 62 ] 102 [ 11 ] [ 43 ] 103 [ 3 ] [ 32 ] 104 [ 78 ] 105 [ 35 ] [ 42 ] [ 46 ] [ 53 ] [ 56 ] [ 75 ] [ 91 ] [ 97 ] [ 113 ] [ 119 ] 106 [ 16 ] [ 31 ] 107 [ 33 ] 108 [ 49 ] 109 [ 90 ] 110 [ 47 ] 111 [ 22 ] [ 27 ] [ 29 ] 112 [ 78 ] 113 [ 116 ] 114 [ 60 ] [ 65 ] [ 67 ] [ 70 ] [ 74 ] [ 79 ] [ 98 ] [ 101 ] [ 105 ] [ 116 ] [ 117 ] 115 [ 66 ] [ 71 ] [ 80 ] [ 82 ] [ 83 ] [ 93 ] [ 102 ] [ 108 ] [ 109 ] [ 112 ] 116 [ 33 ] [ 38 ] [ 46 ] [ 48 ] [ 106 ] 117 [ 78 ] 118 [ 11 ] [ 43 ] 119 [ 106 ] 120 [ 73 ] [ 84 ] 121 [ 78 ] 122 [ 104 ] [ 110 ] 123 [ 42 ] [ 56 ] 124 [ 11 ] [ 43 ]  ©2004 Association for Computing Machinery |
