| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Suresh Venkatasubramanian Jatin Chhugani , Budirijanto Purnomo , Shankar Krishnan , Jonathan Cohen , Suresh Venkatasubramanian, David S. Johnson , Subodh Kumar : vLOD: High-Fidelity Walkthrough of Large Virtual Environments. IEEE Trans. Vis. Comput. Graph. 11 (1): 35-47 (2005) David S. Johnson , Shankar Krishnan , Jatin Chhugani , Subodh Kumar , Suresh Venkatasubramanian: Compressing Large Boolean Matrices using Reordering Techniques. VLDB 2004 : 13-23 Alon Efrat , Piotr Indyk , Suresh Venkatasubramanian: Pattern Matching for Sets of Segments. Algorithmica 40 (3): 147-160 (2004) Pankaj K. Agarwal , Shankar Krishnan , Nabil H. Mustafa , Suresh Venkatasubramanian: Streaming Geometric Optimization Using Graphics Hardware. ESA 2003 : 544-555 Sudipto Guha , Shankar Krishnan , Kamesh Munagala , Suresh Venkatasubramanian: Application of the two-sided depth test to CSG rendering. SI3D 2003 : 177-180 Martin Gavrilov , Piotr Indyk , Rajeev Motwani , Suresh Venkatasubramanian: Combinatorial and Experimental Methods for Approximate Point Pattern Matching. Algorithmica 38 (1): 59-90 (2003) Suresh Venkatasubramanian: The Graphics Card as a Streaming Computer CoRR cs.GR/0310002 : (2003) Piotr Indyk , Suresh Venkatasubramanian: Approximate congruence in nearly linear time. Comput. Geom. 24 (2): 115-128 (2003) Shankar Krishnan , Nabil H. Mustafa , Suresh Venkatasubramanian: Hardware-assisted computation of depth contours. SODA 2002 : 558-567 Alon Efrat , Piotr Indyk , Suresh Venkatasubramanian: Pattern matching for sets of segments. SODA 2001 : 295-304 Nabil H. Mustafa , Eleftherios Koutsofios , Shankar Krishnan , Suresh Venkatasubramanian: Hardware-assisted view-dependent map simplification. Symposium on Computational Geometry 2001 : 50-59 Piotr Indyk , Suresh Venkatasubramanian: Approximate congruence in nearly linear time. SODA 2000 : 354-360 Adam L. Buchsbaum , Michael Goldwasser , Suresh Venkatasubramanian, Jeffery Westbrook : On external memory graph traversal. SODA 2000 : 859-860 Alon Efrat , Piotr Indyk , Suresh Venkatasubramanian: Pattern Matching for sets of segments CoRR cs.CG/0009013 : (2000) Piotr Indyk , Rajeev Motwani , Suresh Venkatasubramanian: Geometric Matching Under Noise: Combinatorial Bounds and Algorithms. SODA 1999 : 457-465 Martin Gavrilov , Piotr Indyk , Rajeev Motwani , Suresh Venkatasubramanian: Geometric Pattern Matching: A Performance Study. Symposium on Computational Geometry 1999 : 79-85 Roy Goldman , Narayanan Shivakumar , Suresh Venkatasubramanian, Hector Garcia-Molina : Proximity Search in Databases. VLDB 1998 : 26-37 Paul W. Finn , Lydia E. Kavraki , Jean-Claude Latombe , Rajeev Motwani , Christian R. Shelton , Suresh Venkatasubramanian, A. Yao : RAPID: Randomized pharmacophore identification for drug design. Comput. Geom. 10 (4): 263-272 (1998) Krishna Bharat , Andrei Z. Broder , Monika Rauch Henzinger , Puneet Kumar , Suresh Venkatasubramanian: The Connectivity Server: Fast Access to Linkage Information on the Web. Computer Networks 30 (1-7): 469-477 (1998) Jon M. Kleinberg , Rajeev Motwani , Prabhakar Raghavan , Suresh Venkatasubramanian: Storage Management for Evolving Databases. FOCS 1997 : 353-362 Paul W. Finn , Lydia E. Kavraki , Jean-Claude Latombe , Rajeev Motwani , Christian R. Shelton , Suresh Venkatasubramanian, A. Yao : RAPID: Randomized Pharmacophore Identification for Drug Design. Symposium on Computational Geometry 1997 : 324-333 Paul W. Finn , Dan Halperin , Lydia E. Kavraki , Jean-Claude Latombe , Rajeev Motwani , Christian R. Shelton , Suresh Venkatasubramanian: Geometric Manipulation of Flexible Ligands. WACG 1996 : 67-78 Narayanan Shivakumar , Suresh Venkatasubramanian: Efficient Indexing for Broadcast Based Wireless Systems. MONET 1 (4): 433-446 (1996) Suresh Venkatasubramanian, Kamala Krithivasan , C. Pandu Rangan : Algorithms for Weighted Graph Problems on The Modified Cellular Graph Automaton. ITA 23 (3): 251-279 (1989) 1 [ 21 ] 2 [ 6 ] 3 [ 6 ] 4 [ 12 ] 5 [ 23 ] [ 24 ] 6 [ 24 ] 7 [ 11 ] [ 15 ] [ 22 ] 8 [ 3 ] [ 4 ] [ 7 ] 9 [ 8 ] 10 [ 9 ] [ 19 ] 11 [ 8 ] 12 [ 12 ] 13 [ 20 ] 14 [ 3 ] 15 [ 6 ] 16 [ 9 ] [ 10 ] [ 11 ] [ 13 ] [ 15 ] [ 17 ] [ 19 ] [ 22 ] 17 [ 23 ] [ 24 ] 18 [ 3 ] [ 4 ] [ 7 ] 19 [ 5 ] 20 [ 14 ] 21 [ 14 ] [ 16 ] [ 20 ] [ 21 ] [ 23 ] [ 24 ] 22 [ 1 ] 23 [ 6 ] 24 [ 23 ] [ 24 ] 25 [ 3 ] [ 4 ] [ 7 ] 26 [ 3 ] [ 4 ] [ 5 ] [ 7 ] [ 9 ] [ 10 ] [ 19 ] 27 [ 20 ] 28 [ 14 ] [ 16 ] [ 21 ] 29 [ 24 ] 30 [ 5 ] 31 [ 1 ] 32 [ 3 ] [ 4 ] [ 7 ] 33 [ 2 ] [ 8 ] 34 [ 12 ] 35 [ 4 ] [ 7 ]  ©2005 Association for Computing Machinery |
