| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Subhash Suri Divyakant Agrawal , Amr El Abbadi , Subhash Suri: Attribute-Based Access to Distributed Data over P2P Networks. DNIS 2005 : 244-263 Nisheeth Shrivastava , John Hershberger , Subhash Suri, Csaba D. Tóth : Space Complexity of Hierarchical Heavy Hitters in Multi-Dimensional Data Streams. PODS 2005 Jack Snoeyink , Subhash Suri, George Varghese : A lower bound for multicast key distribution. Computer Networks 47 (3): 429-441 (2005) Anshul Kothari , Tuomas Sandholm , Subhash Suri: Solving Combinatorial Exchanges: Optimality via a Few Partial Bids. AAMAS 2004 : 1418-1419 Subhash Suri, Csaba D. Tóth , Yunhong Zhou : Uncoordinated Load Balancing and Congestion Games in P2P Systems. IPTPS 2004 : 123-130 John Hershberger , Nisheeth Shrivastava , Subhash Suri, Csaba D. Tóth : Adaptive Spatial Partitioning for Multidimensional Data Streams. ISAAC 2004 : 522-533 John Hershberger , Subhash Suri: Adaptive Sampling for Geometric Problems over Data Streams. PODS 2004 : 252-262 Subhash Suri, Csaba D. Tóth , Yunhong Zhou : Selfish load balancing and atomic congestion games. SPAA 2004 : 188-195 Subhash Suri, Csaba D. Tóth , Yunhong Zhou : Range counting over multidimensional data streams. Symposium on Computational Geometry 2004 : 160-169 John Hershberger , Subhash Suri, Csaba D. Tóth : Binary space partitions of orthogonal subdivisions. Symposium on Computational Geometry 2004 : 230-238 Nisheeth Shrivastava , Chiranjeeb Buragohain , Divyakant Agrawal , Subhash Suri: Medians and Beyond: New Aggregation Techniques for Sensor Networks CoRR cs.DC/0408039 : (2004) Priyank Ramesh Warkhede , Subhash Suri, George Varghese : Multiway range trees: scalable IP lookup with fast updates. Computer Networks 44 (3): 289-303 (2004) Samphel Norden , Milind M. Buddhikot , Marcel Waldvogel , Subhash Suri: Routing bandwidth-guaranteed paths with restoration in label-switched networks . Computer Networks 46 (2): 197-218 (2004) Subhash Suri: Guest Editor's Foreword. Discrete & Computational Geometry 31 (1): 1 (2004) Anshul Kothari , David C. Parkes , Subhash Suri: Approximately-strategyproof and tractable multi-unit auctions. ACM Conference on Electronic Commerce 2003 : 166-175 Anshul Kothari , Tuomas Sandholm , Subhash Suri: Solving combinatorial exchanges: optimality via a few partial bids. ACM Conference on Electronic Commerce 2003 : 236-237 John Hershberger , Matthew Maxel , Subhash Suri: Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation. ALENEX 2003 : 26-36 Amit Jardosh , Elizabeth M. Belding-Royer , Kevin C. Almeroth , Subhash Suri: Towards realistic mobility models for mobile ad hoc networks. MOBICOM 2003 : 217-229 Anshul Kothari , Divyakant Agrawal , Abhishek Gupta , Subhash Suri: Range Addressable Network: A P2P Cache Architecture for Data Ranges. Peer-to-Peer Computing 2003 : 14-22 Chiranjeeb Buragohain , Divyakant Agrawal , Subhash Suri: A Game Theoretic Framework for Incentives in P2P Systems. Peer-to-Peer Computing 2003 : 48-56 John Hershberger , Subhash Suri: Binary space partitions for 3D subdivisions. SODA 2003 : 100-108 John Hershberger , Subhash Suri, Amit Bhosle : On the Difficulty of Some Shortest Path Problems. STACS 2003 : 343-354 Anshul Kothari , Subhash Suri, Yunhong Zhou : Bandwidth-Constrained Allocation in Grid Computing. WADS 2003 : 67-78 Subhash Suri, Tuomas Sandholm , Priyank Ramesh Warkhede : Compressing Two-Dimensional Routing Tables. Algorithmica 35 (4): 287-300 (2003) Tuomas Sandholm , Subhash Suri: BOB: Improved winner determination in combinatorial auctions and generalizations. Artif. Intell. 145 (1-2): 33-58 (2003) Chiranjeeb Buragohain , Divyakant Agrawal , Subhash Suri: A Game Theoretic Framework for Incentives in P2P Systems CoRR cs.GT/0310039 : (2003) Yunhong Zhou , Subhash Suri: Geometric permutations of balls with bounded size disparity. Comput. Geom. 26 (1): 3-20 (2003) Subhash Suri, Marcel Waldvogel , Daniel Bauer , Priyank Ramesh Warkhede : Profile-based routing and traffic engineering. Computer Communications 26 (4): 351-365 (2003) Meir Katchalski , Subhash Suri, Yunhong Zhou : A Constant Bound for Geometric Permutations of Disjoint Unit Balls. Discrete & Computational Geometry 29 (2): 161-173 (2003) Tuomas Sandholm , Subhash Suri, Andrew Gilpin , David Levine : Winner determination in combinatorial auction generalizations. AAMAS 2002 : 69-76 John Hershberger , Subhash Suri: Erratum to "Vickrey Pricing and Shortest Paths: What is an Edge Worth?". FOCS 2002 : 809- Tuomas Sandholm , Subhash Suri: Market Clearing with Supply and Demand Curves. ISAAC 2002 : 600-611 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) Yunhong Zhou , Subhash Suri: Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions. SIAM J. Comput. 31 (5): 1339-1357 (2002) Pankaj K. Agarwal , Therese C. Biedl , Sylvain Lazard , Steve Robbins , Subhash Suri, Sue Whitesides : Curvature-Constrained Shortest Paths in a Convex Polygon. SIAM J. Comput. 31 (6): 1814-1851 (2002) Yunhong Zhou , Subhash Suri: Geometric permutations of balls with bounded size disparity. CCCG 2001 : 177-180 John Hershberger , Subhash Suri: Vickrey Prices and Shortest Paths: What is an Edge Worth?. FOCS 2001 : 252-259 Lili Qiu , George Varghese , Subhash Suri: Fast Firewall Implementations for Software and Hardware-Based Routers. ICNP 2001 : 241-250 Samphel Norden , Milind M. Buddhikot , Marcel Waldvogel , Subhash Suri: Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks. ICNP 2001 : 71- Tuomas Sandholm , Subhash Suri, Andrew Gilpin , David Levine : CABOB: A Fast Optimal Algorithm for Combinatorial Auctions. IJCAI 2001 : 1102-1108 Tuomas Sandholm , Subhash Suri: Market Clearability. IJCAI 2001 : 1145-1151 Priyank Ramesh Warkhede , Subhash Suri, George Varghese : Fast Packet Classification for Two-Dimensional Conflict-Free Filters. INFOCOM 2001 : 1434-1443 Jack Snoeyink , Subhash Suri, George Varghese : A Lower Bound for Multicast Key Distribution. INFOCOM 2001 : 422-431 Subhash Suri, Marcel Waldvogel , Priyank Ramesh Warkhede : Profile-Based Routing: A New Framework for MPLS Traffic Engineering. QofIS 2001 : 138-157 Lili Qiu , George Varghese , Subhash Suri: Fast firewall implementations for software-based and hardware-based routers. SIGMETRICS/Performance 2001 : 344-345 John Hershberger , Subhash Suri: Simplified kinetic connectivity for rectangles and hypercubes. SODA 2001 : 158-167 Yunhong Zhou , Subhash Suri: Shape sensitive geometric permutations. SODA 2001 : 234-243 Leonidas J. Guibas , John Hershberger , Subhash Suri, Li Zhang : Kinetic Connectivity for Unit Disks. Discrete & Computational Geometry 25 (4): 591-610 (2001) Tuomas Sandholm , Subhash Suri: Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations. AAAI/IAAI 2000 : 90-97 Yunhong Zhou , Subhash Suri: Collision Detection Using Bounding Boxes: Convexity Helps. ESA 2000 : 437-448 Hari Adiseshu Hari , Subhash Suri, Guru M. Parulkar : Detecting and Resolving Packet Filter Conflicts. INFOCOM 2000 : 1203-1212 Yunhong Zhou , Subhash Suri: Algorithms for minimum volume enclosing simplex in R 3 . SODA 2000 : 500-509 Subhash Suri, Tuomas Sandholm , Priyank Ramesh Warkhede : Optimal Flow Aggregation. SWAT 2000 : 462-475 Leonidas J. Guibas , John Hershberger , Subhash Suri, Li Zhang : Kinetic connectivity for unit disks. Symposium on Computational Geometry 2000 : 331-340 Leonidas J. Guibas , John Hershberger , Subhash Suri: Morphing Simple Polygons. Discrete & Computational Geometry 24 (1): 1-34 (2000) Sally A. Goldman , Jyoti Parwatikar , Subhash Suri: Online Scheduling with Hard Deadlines. J. Algorithms 34 (2): 370-389 (2000) Adam Smith , Subhash Suri: Rectangular Tiling in Multidimensional Arrays. J. Algorithms 37 (2): 451-467 (2000) Milind M. Buddhikot , Subhash Suri, Marcel Waldvogel : Space Decomposition Techniques for Fast Layer-4 Switching. Protocols for High-Speed Networks 1999 : 25-42 Venkatachary Srinivasan , Subhash Suri, George Varghese : Packet Classification Using Tuple Space Search. SIGCOMM 1999 : 135-146 Adam Smith , Subhash Suri: Rectangular Tiling in Multi-dimensional Arrays. SODA 1999 : 786-794 Yunhong Zhou , Subhash Suri: Analysis of a Bounding Box Heuristic for Object Intersection. SODA 1999 : 830-839 Subhash Suri, George Varghese : Packet Filtering in High Speed Networks. SODA 1999 : 969-970 John Hershberger , Subhash Suri: Kinetic Connectivity of Rectangles. Symposium on Computational Geometry 1999 : 237-246 Subhash Suri, Philip M. Hubbard , John F. Hughes : Analyzing bounding boxes for object intersection. ACM Trans. Graph. 18 (3): 257-277 (1999) Yunhong Zhou , Subhash Suri: Analysis of a bounding box heuristic for object intersection. J. ACM 46 (6): 833-857 (1999) John Hershberger , Subhash Suri: An Optimal Algorithm for Euclidean Shortest Paths in the Plane. SIAM J. Comput. 28 (6): 2215-2256 (1999) Venkatachary Srinivasan , George Varghese , Subhash Suri, Marcel Waldvogel : Fast and Scalable Layer Four Switching. SIGCOMM 1998 : 191-202 Subhash Suri, Philip M. Hubbard , John F. Hughes : Collision Detection in Aspect and Scale Bounded Polyhedra. SODA 1998 : 127-136 Pankaj K. Agarwal , Therese C. Biedl , Sylvain Lazard , Steve Robbins , Subhash Suri, Sue Whitesides : Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). Symposium on Computational Geometry 1998 : 392-401 John Hershberger , Subhash Suri: Practical methods for approximating shortest paths on a convex polytope in R3. Comput. Geom. 10 (1): 31-46 (1998) Pankaj K. Agarwal , Marc J. van Kreveld , Subhash Suri: Label placement by maximum independent set in rectangles. Comput. Geom. 11 (3-4): 209-218 (1998) Nader H. Bshouty , Sally A. Goldman , H. David Mathias , Subhash Suri, Hisao Tamaki : Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. J. ACM 45 (5): 863-890 (1998) Pankaj K. Agarwal , Subhash Suri: Surface Approximation and Geometric Partitions. SIAM J. Comput. 27 (4): 1016-1035 (1998) Pankaj K. Agarwal , Marc J. van Kreveld , Subhash Suri: Label placement by maximum independent set in rectangles. CCCG 1997 Subhash Suri, George Varghese , Girish P. Chandranmenon : Leap Forward Virtual Clock: A New Fair Queueing Scheme with Guaranteed Delays and Throughput Fairness. INFOCOM 1997 : 557-565 Subhash Suri, George Varghese , Girish P. Chandranmenon : Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness. PODC 1997 : 281 John Hershberger , Subhash Suri: Efficient Breakout Routing in Printed Circuit Boards. Symposium on Computational Geometry 1997 : 460-462 Sally A. Goldman , Jyoti Parwatikar , Subhash Suri: On-line Scheduling with Hard Deadlines (Extended Abstract). WADS 1997 : 258-271 John Hershberger , Subhash Suri: Efficient Breakout Routing in Printed Circuit Boards (Extended Abstract). WADS 1997 : 462-471 John Hershberger , Subhash Suri: Finding a Shortest Diagonal of a Simple Polygon in Linear Time. Comput. Geom. 7 : 149-160 (1997) Joseph S. B. Mitchell , David M. Mount , Subhash Suri: Query-Sensitive Ray Shooting. Int. J. Comput. Geometry Appl. 7 (4): 317-347 (1997) J. Andrew Fingerhut , Subhash Suri, Jonathan S. Turner : Designing Least-Cost Nonblocking Broadband Networks. J. Algorithms 24 (2): 287-309 (1997) John Hershberger , Subhash Suri: Matrix Searching with the Shortest-Path Metric. SIAM J. Comput. 26 (6): 1612-1634 (1997) Tetsuo Asano , Yoshihide Igarashi , Hiroshi Nagamochi , Satoru Miyano , Subhash Suri: Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings Springer 1996 Nader H. Bshouty , Sally A. Goldman , H. David Mathias , Subhash Suri, Hisao Tamaki : Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. STOC 1996 : 151-160 Pankaj K. Agarwal , Subhash Suri: Simple and Practical Geometric Algorithms. ACM Comput. Surv. 28 (4es): 16 (1996) John Hershberger , Subhash Suri: Off-Line Maintenance of Planar Configurations. J. Algorithms 21 (3): 453-475 (1996) Marshall W. Bern , David Eppstein , Leonidas J. Guibas , John Hershberger , Subhash Suri, Jan Wolter : The Centroid of Points with Approximate Weights. ESA 1995 : 460-472 John Hershberger , Subhash Suri: Morphing Binary Trees. SODA 1995 : 396-404 John Hershberger , Subhash Suri: Practical Methods for Approximating Shortest Paths on a Convex Polytope in R³. SODA 1995 : 447-456 Pankaj K. Agarwal , Boris Aronov , Subhash Suri: Stabbing Triangulations by Lines in 3D. Symposium on Computational Geometry 1995 : 267-276 Joseph S. B. Mitchell , Subhash Suri: Separation and Approximation of Polyhedral Objects. Comput. Geom. 5 : 95-114 (1995) Noga Alon , Sridhar Rajagopalan , Subhash Suri: Long Non-Crossing Configurations in the Plane. Fundam. Inform. 22 (4): 385-394 (1995) Esther M. Arkin , Joseph S. B. Mitchell , Subhash Suri: Logarithmic-time link path queries in a simple polygon. Int. J. Comput. Geometry Appl. 5 (4): 369-395 (1995) John Hershberger , Subhash Suri: A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. J. Algorithms 18 (3): 403-431 (1995) Subhash Suri, David Tipper , Gopal Meempat : A Comparative Evaluation of Space Priority Strategies in ATM Networks. INFOCOM 1994 : 516-523 Pankaj K. Agarwal , Subhash Suri: Surface Approximation and Geometric Partitions. SODA 1994 : 24-33 Joseph S. B. Mitchell , David M. Mount , Subhash Suri: Query-Sensitive Ray Shooting. Symposium on Computational Geometry 1994 : 359-368 Pankaj K. Agarwal , Noga Alon , Boris Aronov , Subhash Suri: Can Visibility Graphs Be Represented Compactly?. Discrete & Computational Geometry 12 : 347-365 (1994) John Hershberger , Monika Rauch , Subhash Suri: Data Structures for Two-Edge Connectivity in Planar Graphs. Theor. Comput. Sci. 130 (1): 139-161 (1994) John Hershberger , Subhash Suri: Efficient Computation of Euclidean Shortest Paths in the Plane FOCS 1993 : 508-517 John Hershberger , Subhash Suri: A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. SODA 1993 : 54-63 John Hershberger , Subhash Suri: Matrix searching with the shortest path metric. STOC 1993 : 485-494 Noga Alon , Sridhar Rajagopalan , Subhash Suri: Long Non-Crossing Configurations in the Plane. Symposium on Computational Geometry 1993 : 257-263 Pankaj K. Agarwal , Noga Alon , Boris Aronov , Subhash Suri: Can Visibility Graphs be Represented Compactly? Symposium on Computational Geometry 1993 : 338-347 Pankaj K. Agarwal , Boris Aronov , Micha Sharir , Subhash Suri: Selecting Distances in the Plane. Algorithmica 9 (5): 495-514 (1993) David P. Dobkin , John Hershberger , David G. Kirkpatrick , Subhash Suri: Computing the Intersection-Depth of Polyhedra. Algorithmica 9 (6): 518-533 (1993) Esther M. Arkin , Joseph S. B. Mitchell , Subhash Suri: Optimal Link Path Queries in a Simple Polygon. SODA 1992 : 269-279 Joseph S. B. Mitchell , Subhash Suri: Separation and Approximation of Polyhedral Objects. SODA 1992 : 296-306 John Hershberger , Monika Rauch , Subhash Suri: Fully Dynamic 2-Edge-Connectivity in Planar Graphs. SWAT 1992 : 233-244 John Hershberger , Subhash Suri: Applications of a Semi-Dynamic Convex Hull Algorithm. BIT 32 (2): 249-267 (1992) Clyde L. Monma , Subhash Suri: Transitions in Geometric Minimum Spanning Trees. Discrete & Computational Geometry 8 : 265-293 (1992) John Hershberger , Subhash Suri: Offline Maintenance of Planar Configurations. SODA 1991 : 32-41 Clyde L. Monma , Subhash Suri: Transitions in Geometric Minimum Spanning Trees (Extended Abstract). Symposium on Computational Geometry 1991 : 239-249 Pankaj K. Agarwal , Jirí Matousek , Subhash Suri: Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions. WADS 1991 : 105-116 Pankaj K. Agarwal , Jirí Matousek , Subhash Suri: Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions. Comput. Geom. 1 : 189-201 (1991) David P. Dobkin , Subhash Suri: Maintenance of Geometric Extrema. J. ACM 38 (2): 275-298 (1991) Alok Aggarwal , Hiroshi Imai , Naoki Katoh , Subhash Suri: Finding k Points with Minimum Diameter and Related Problems. J. Algorithms 12 (1): 38-56 (1991) John Hershberger , Subhash Suri: Finding Tailored Partitions. J. Algorithms 12 (3): 431-463 (1991) Odile Marcotte , Subhash Suri: Fast Matching Algorithms for Points on a Polygon. SIAM J. Comput. 20 (3): 405-422 (1991) David P. Dobkin , John Hershberger , David G. Kirkpatrick , Subhash Suri: Implicitly Searching Convolutions and Computing Depth of Collision. SIGAL International Symposium on Algorithms 1990 : 165-180 John Hershberger , Subhash Suri: Applications of a Semi-Dynamic Convex Hull Algorithm. SWAT 1990 : 380-392 Pankaj K. Agarwal , Boris Aronov , Micha Sharir , Subhash Suri: Selecting Distances in the Plane. Symposium on Computational Geometry 1990 : 321-331 Clyde L. Monma , Mike Paterson , Subhash Suri, F. Frances Yao : Computing Euclidean Maximum Spanning Trees. Algorithmica 5 (3): 407-419 (1990) Jörg-Rüdiger Sack , Subhash Suri: An Optimal Algorithm for Detecting Weak Visibility of a Polygon. IEEE Trans. Computers 39 (10): 1213-1219 (1990) Alok Aggarwal , Subhash Suri: Computing the Longest Diagonal of a Simple Polygon. Inf. Process. Lett. 35 (1): 13-18 (1990) David P. Dobkin , Subhash Suri: Dynamically Computing the Maxima of Decomposable Functions, with Applications FOCS 1989 : 488-493 Odile Marcotte , Subhash Suri: Fast Matching Algorithms for Points on a Polygon (Extended Abstract) FOCS 1989 : 60-65 John Hershberger , Subhash Suri: Finding Tailored Partitions. Symposium on Computational Geometry 1989 : 255-265 Alok Aggarwal , Hiroshi Imai , Naoki Katoh , Subhash Suri: Fining k Points with Minimum Spanning Trees and Related Problems. Symposium on Computational Geometry 1989 : 283-291 Odile Marcotte , Subhash Suri: On Geometric Matching. Symposium on Computational Geometry 1989 : 302-314 Alok Aggarwal , Shlomo Moran , Peter W. Shor , Subhash Suri: Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version). WADS 1989 : 115-134 Alok Aggarwal , Heather Booth , Joseph O'Rourke , Subhash Suri, Chee-Keng Yap : Finding Minimal Convex Nested Polygons Inf. Comput. 83 (1): 98-110 (1989) Subhash Suri: Computing Geodesic Furthest Neighbors in Simple Polygons. J. Comput. Syst. Sci. 39 (2): 220-235 (1989) Jörg-Rüdiger Sack , Subhash Suri: An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary Version). STACS 1988 : 312-321 Clyde L. Monma , Mike Paterson , Subhash Suri, F. Frances Yao : Computing Euclidean Maximum Spanning Trees. Symposium on Computational Geometry 1988 : 241-251 William Lenhart , Richard Pollack , Jörg-Rüdiger Sack , Raimund Seidel , Micha Sharir , Subhash Suri, Godfried T. Toussaint , Sue Whitesides , Chee-Keng Yap : Computing the Link Center of a Simple Polygon. Discrete & Computational Geometry 3 : 281-293 (1988) William Lenhart , Richard Pollack , Jörg-Rüdiger Sack , Raimund Seidel , Micha Sharir , Subhash Suri, Godfried T. Toussaint , Sue Whitesides , Chee-Keng Yap : Computing the Link Center of a Simple Polygon. Symposium on Computational Geometry 1987 : 1-10 Alok Aggarwal , Subhash Suri: Fast Algorithms for Computing the Largest Empty Rectangle. Symposium on Computational Geometry 1987 : 278-290 Subhash Suri: The All-Geodesic-Furthest Neighbor Problem for Simple Polygons. Symposium on Computational Geometry 1987 : 64-75 Subhash Suri, Joseph O'Rourke : Worst-Case Optimal Algorithms for Constructing Visibility Polygons with Holes. Symposium on Computational Geometry 1986 : 14-23 Joseph O'Rourke , Subhash Suri, Heather Booth : Shortest Paths on Polyhedral Surfaces. STACS 1985 : 243-254 1 [ 142 ] 2 [ 20 ] [ 27 ] [ 28 ] [ 37 ] [ 38 ] [ 44 ] [ 46 ] [ 52 ] [ 57 ] [ 69 ] [ 70 ] [ 72 ] [ 74 ] [ 108 ] [ 110 ] 3 [ 4 ] [ 10 ] [ 11 ] [ 13 ] [ 17 ] [ 25 ] 4 [ 117 ] [ 123 ] [ 124 ] [ 132 ] [ 142 ] 5 [ 125 ] 6 [ 38 ] [ 39 ] [ 44 ] [ 50 ] 7 [ 35 ] [ 49 ] 8 [ 20 ] [ 37 ] [ 38 ] [ 44 ] [ 52 ] 9 [ 59 ] 10 [ 115 ] 11 [ 125 ] 12 [ 55 ] 13 [ 121 ] 14 [ 74 ] [ 108 ] 15 [ 1 ] [ 10 ] 16 [ 58 ] [ 71 ] 17 [ 85 ] [ 104 ] [ 130 ] 18 [ 117 ] [ 123 ] [ 132 ] 19 [ 67 ] [ 68 ] 20 [ 16 ] [ 22 ] [ 26 ] [ 36 ] 21 [ 110 ] 22 [ 55 ] 23 [ 110 ] 24 [ 61 ] 25 [ 103 ] [ 113 ] 26 [ 58 ] [ 65 ] [ 71 ] [ 87 ] 27 [ 55 ] [ 88 ] [ 89 ] [ 95 ] [ 110 ] 28 [ 124 ] 29 [ 110 ] 30 [ 92 ] 31 [ 14 ] [ 21 ] [ 22 ] [ 24 ] [ 30 ] [ 32 ] [ 33 ] [ 36 ] [ 40 ] [ 41 ] [ 42 ] [ 43 ] [ 48 ] [ 53 ] [ 54 ] [ 55 ] [ 56 ] [ 60 ] [ 63 ] [ 64 ] [ 66 ] [ 73 ] [ 77 ] [ 80 ] [ 88 ] [ 89 ] [ 95 ] [ 97 ] [ 106 ] [ 110 ] [ 112 ] [ 121 ] [ 122 ] [ 126 ] [ 133 ] [ 136 ] [ 137 ] [ 141 ] 32 [ 75 ] [ 79 ] 33 [ 75 ] [ 79 ] 34 [ 59 ] 35 [ 13 ] [ 25 ] 36 [ 110 ] 37 [ 125 ] 38 [ 110 ] 39 [ 114 ] 40 [ 13 ] [ 25 ] 41 [ 110 ] 42 [ 22 ] [ 36 ] 43 [ 110 ] 44 [ 120 ] [ 124 ] [ 127 ] [ 128 ] [ 139 ] 45 [ 69 ] [ 72 ] 46 [ 74 ] [ 108 ] 47 [ 5 ] [ 6 ] 48 [ 103 ] [ 113 ] 49 [ 110 ] 50 [ 110 ] 51 [ 12 ] [ 15 ] [ 23 ] 52 [ 58 ] [ 71 ] 53 [ 27 ] [ 28 ] 54 [ 126 ] 55 [ 47 ] 56 [ 110 ] 57 [ 110 ] 58 [ 34 ] [ 35 ] [ 45 ] [ 49 ] [ 51 ] [ 62 ] 59 [ 59 ] 60 [ 7 ] [ 19 ] [ 29 ] [ 31 ] 61 [ 11 ] 62 [ 45 ] [ 62 ] [ 110 ] 63 [ 110 ] 64 [ 59 ] 65 [ 104 ] [ 130 ] 66 [ 1 ] [ 2 ] [ 10 ] 67 [ 110 ] 68 [ 128 ] 69 [ 92 ] 70 [ 65 ] [ 87 ] 71 [ 7 ] [ 19 ] 72 [ 5 ] [ 6 ] 73 [ 98 ] [ 105 ] 74 [ 39 ] [ 50 ] 75 [ 33 ] [ 43 ] 76 [ 74 ] [ 108 ] 77 [ 5 ] [ 6 ] [ 8 ] [ 18 ] 78 [ 110 ] 79 [ 90 ] [ 94 ] [ 102 ] [ 103 ] [ 111 ] [ 113 ] [ 118 ] [ 119 ] [ 127 ] [ 139 ] 80 [ 5 ] [ 6 ] 81 [ 5 ] [ 6 ] [ 20 ] [ 37 ] 82 [ 11 ] 83 [ 132 ] [ 137 ] [ 141 ] 84 [ 83 ] [ 86 ] 85 [ 100 ] [ 110 ] [ 140 ] 86 [ 76 ] [ 84 ] 87 [ 58 ] [ 71 ] 88 [ 47 ] 89 [ 133 ] [ 134 ] [ 135 ] [ 137 ] [ 138 ] [ 141 ] 90 [ 5 ] [ 6 ] 91 [ 61 ] 92 [ 67 ] [ 68 ] [ 76 ] [ 81 ] [ 84 ] [ 98 ] [ 100 ] [ 101 ] [ 105 ] [ 131 ] [ 140 ] 93 [ 76 ] [ 85 ] [ 99 ] [ 104 ] [ 115 ] [ 130 ] 94 [ 90 ] [ 99 ] [ 101 ] [ 115 ] [ 119 ] [ 131 ] 95 [ 5 ] [ 6 ] [ 74 ] [ 108 ] 96 [ 110 ] 97 [ 55 ] 98 [ 7 ] [ 19 ] 99 [ 5 ] [ 6 ] [ 10 ] 100 [ 89 ] [ 95 ] 101 [ 78 ] [ 82 ] [ 91 ] [ 93 ] [ 96 ] [ 107 ] [ 109 ] [ 114 ] [ 116 ] [ 120 ] [ 134 ] [ 135 ] [ 138 ]  ©2005 Association for Computing Machinery |
