| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Ananth Grama Murali Krishna Ramanathan , Suresh Jagannathan , Ananth Grama: Trace-Based Memory Aliasing Across Program Versions. FASE 2006 : 381-395 Asad Awan , Ronaldo A. Ferreira , Suresh Jagannathan , Ananth Grama: Distributed Uniform Sampling in Unstructured Peer-to-Peer Networks. HICSS 2006 Asad Awan , Ahmed Sameh , Ananth Grama: The Omni Macroprogramming Environment for Sensor Networks. International Conference on Computational Science (3) 2006 : 465-472 Mehmet Koyutürk , Ananth Grama, Wojciech Szpankowski : Assessing Significance of Connectivity and Conservation in Protein Interaction Networks. RECOMB 2006 : 45-59 Christoph Hoffmann , Ahmed Sameh , Ananth Grama: High-Fidelity Simulation of Large-Scale Structures. International Conference on Computational Science (2) 2005 : 664-671 Ronaldo A. Ferreira , Murali Krishna Ramanathan , Asad Awan , Ananth Grama, Suresh Jagannathan : Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks. Peer-to-Peer Computing 2005 : 165-172 Ronaldo A. Ferreira , Murali Krishna Ramanathan , Ananth Grama, Suresh Jagannathan : Randomized Protocols for Duplicate Elimination in Peer-to-Peer Storage Systems. Peer-to-Peer Computing 2005 : 201-208 Mehmet Koyutürk , Ananth Grama, Wojciech Szpankowski : Pairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution. RECOMB 2005 : 48-65 Ioannis Ioannidis , Ananth Grama, Mikhail J. Atallah : Adaptive data structures for IP lookups. ACM Journal of Experimental Algorithms 10 : (2005) Ioannis Ioannidis , Ananth Grama: Level compressed DAGs for lookup tables. Computer Networks 49 (2): 147-160 (2005) Mehmet Koyutürk , Ananth Grama, Naren Ramakrishnan : Compression, Clustering, and Pattern Discovery in Very High-Dimensional Discrete-Attribute Data Sets. IEEE Trans. Knowl. Data Eng. 17 (4): 447-461 (2005) Mehmet Koyutürk , Wojciech Szpankowski , Ananth Grama: Biclustering Gene-Feature Matrices for Statistically Significant Dense Patterns. CSB 2004 : 480-484 Ronaldo A. Ferreira , Ananth Grama, Suresh Jagannathan : Plethora: An EfficientWide-Area Storage System. HiPC 2004 : 252-261 Hemant Mahawar , Vivek Sarin , Ananth Grama: Parallel Performance of Hierarchical Multipole Algorithms for Inductance Extraction. HiPC 2004 : 450-461 Shan Lei , Ananth Grama: Extended Consistent Hashing: An Efficient Framework for Object Location. ICDCS 2004 : 254-262 Bogdan Carbunar , Ioannis Ioannidis , Ananth Grama, Jan Vitek : A Secure Crediting Protocol for Hybrid Cellular and Ad-Hoc Networks. ICETE (3) 2004 : 142-149 Ronaldo A. Ferreira , Suresh Jagannathan , Ananth Grama: Enhancing Locality in Structured Peer-to-Peer Networks. ICPADS 2004 : 25- Bogdan Carbunar , Ananth Grama, Jan Vitek : Distributed and Dynamic Voronoi Overlays for Coverage Detection and Distributed Hash Tables in Ad-Hoc Networks. ICPADS 2004 : 549- Ananth Grama, Vivek Sarin : Impact of far-field interactions on performance of multipole-based preconditioners for sparse linear systems. ICS 2004 : 41-47 Mehmet Koyutürk , Ananth Grama, Wojciech Szpankowski : An efficient algorithm for detecting frequent subgraphs in biological networks. ISMB/ECCB (Supplement of Bioinformatics) 2004 : 200-207 A. Antoulas , D. Sorensen , K. A. Gallivan , Paul Van Dooren , Ananth Grama, Christoph Hoffmann , Ahmed H. Sameh : Model Reduction of Large-Scale Dynamical Systems. International Conference on Computational Science 2004 : 740-747 Jie Chi , Mehmet Koyutürk , Ananth Grama: Conquest: A Distributed Tool for Constructing Summaries of High-Dimensional Discrete Attribute Data Sets. SDM 2004 Mehmet Koyutürk , Ananth Grama, Wojciech Szpankowski : Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments. CSB 2003 : 575-580 Ioannis Ioannidis , Ananth Grama: An Efficient Protocol for Yao?s Millionaires? Problem. HICSS 2003 : 205 Mohamed F. Mokbel , Walid G. Aref , Ananth Grama: Spectral LPM: An Optimal Locality-Preserving Mapping using the Spectral (not Fractal) Order. ICDE 2003 : 699-701 Ioannis Ioannidis , Ananth Grama, Mikhail J. Atallah : Adaptive Data Structures for IP Lookups. INFOCOM 2003 Mehmet Koyutürk , Ananth Grama: PROXIMUS: a framework for analyzing very high dimensional discrete-attributed datasets. KDD 2003 : 147-156 Sreekanth R. Sambavaram , Vivek Sarin , Ahmed H. Sameh , Ananth Grama: Multipole-based preconditioners for large sparse linear systems. Parallel Computing 29 (9): 1261-1273 (2003) Sacha Zyto , Ananth Grama, Wojciech Szpankowski : Semi-discrete Matrix Transforms (SDD) for Image and Video Compression. DCC 2002 : 484 Jie Chi , Alok R. Chaturvedi , Ananth Grama, Shailendra Raj Mehta : Oceanus: A Distributed Web-Based Framework for Execution of Genetic Algorithms. GECCO Late Breaking Papers 2002 : 55-61 Ioannis Ioannidis , Ananth Grama, Mikhail J. Atallah : A Secure Protocol for Computing Dot-Products in Clustered and Distributed Environments. ICPP 2002 : 379-384 Tzvetan Horozov , Ananth Grama, Venu Vasudevan , Sean Landis : MOBY - A Mobile Peer-to-Peer Service and Data Network. ICPP 2002 : 437-444 Mehmet Koyutürk , Ananth Grama, Naren Ramakrishnan : Algebraic Techniques for Analysis of Large Discrete-Valued Datasets. PKDD 2002 : 311-324 Marc Alzina , Wojciech Szpankowski , Ananth Grama: 2D-pattern matching image and video compression: theory, algorithms, and experiments. IEEE Transactions on Image Processing 11 (3): 318-331 (2002) Ananth Grama, David Meyer , Wojciech Szpankowski : Real-Time Decompression of Streaming Video Using Mobile Code. Data Compression Conference 2001 : 496 Ananth Grama, Vipin Kumar , Sanjay Ranka , Vineet Singh : Architecture Independent Analysis of Parallel Programs. International Conference on Computational Science (2) 2001 : 599-608 Dow-Yung Yang , Ananth Grama, Vivek Sarin , Naren Ramakrishnan : Compression of particle data from hierarchical approximate methods. ACM Trans. Math. Softw. 27 (3): 317-339 (2001) Naren Ramakrishnan , Benjamin J. Keller , Batul J. Mirza , Ananth Grama, George Karypis : When being Weak is Brave: Privacy in Recommender Systems CoRR cs.CG/0105028 : (2001) Naren Ramakrishnan , Benjamin J. Keller , Batul J. Mirza , Ananth Grama, George Karypis : Privacy Risks in Recommender Systems. IEEE Internet Computing 5 (6): 54-62 (2001) Dow-Yung Yang , Akshay Johar , Ananth Grama, Wojciech Szpankowski : Summary Structures for Frequency Queries on Large Transaction Sets. Data Compression Conference 2000 : 420-429 Marc Alzina , Wojciech Szpankowski , Ananth Grama: 2D-Pattern Matching Image and Video Compression. Data Compression Conference 1999 : 424-433 Naren Ramakrishnan , Ananth Grama: Data Mining: From Serendipity to Science - Guest Editors' Introduction. IEEE Computer 32 (8): 34-37 (1999) Ananth Grama, Vipin Kumar : State of the Art in Parallel Search Techniques for Discrete Optimization Problems. IEEE Trans. Knowl. Data Eng. 11 (1): 28-35 (1999) Ananth Grama, Vipin Kumar , Ahmed H. Sameh : Scalable Parallel Formulations of the Barnes-Hut Method for n -Body Simulations. Parallel Computing 24 (5-6): 797-822 (1998) Vipin Kumar , George Karypis , Ananth Grama: Role of Message-Passing in Performance Oriented Parallel Programming. PPSC 1997 Ananth Grama, Vipin Kumar , Ahmed H. Sameh : N-Body Simulations Using Message Passsing Parallel Computers. PPSC 1995 : 355-360 Ananth Grama, Vipin Kumar , Ahmed H. Sameh : Parallel Matrix-Vector Product Using Approximate Hierarchical Methods. SC 1995 Vipin Kumar , Ananth Grama, Anshul Gupta , George Karypis : Introduction to Parallel Computing. Benjamin/Cummings 1994 Ananth Grama, Vipin Kumar , Ahmed H. Sameh : Scalable parallel formulations of the Barnes-Hut method for n -body simulations. SC 1994 : 439-448 Vipin Kumar , Ananth Grama, Nageshwara Rao Vempaty : Scalable Load Balancing Techniques for Parallel Computers. J. Parallel Distrib. Comput. 22 (1): 60-79 (1994) Ananth Grama, Vipin Kumar : Scalability Analysis of Partitioning Strategies for Finite Element Graphs: A Summary of Results. SC 1992 : 83-92 1 [ 11 ] [ 18 ] 2 [ 31 ] 3 [ 27 ] 4 [ 21 ] [ 26 ] [ 43 ] 5 [ 46 ] [ 49 ] [ 50 ] 6 [ 34 ] [ 36 ] 7 [ 22 ] 8 [ 22 ] [ 30 ] 9 [ 31 ] 10 [ 35 ] [ 39 ] [ 45 ] [ 46 ] [ 50 ] 11 [ 31 ] 12 [ 4 ] 13 [ 31 ] [ 47 ] 14 [ 20 ] 15 [ 21 ] [ 26 ] [ 28 ] [ 36 ] [ 42 ] [ 43 ] 16 [ 35 ] [ 39 ] [ 45 ] [ 46 ] [ 50 ] [ 51 ] 17 [ 12 ] 18 [ 4 ] [ 7 ] [ 13 ] [ 14 ] 19 [ 13 ] [ 14 ] 20 [ 19 ] [ 25 ] [ 29 ] [ 30 ] [ 32 ] [ 40 ] [ 41 ] [ 44 ] [ 48 ] 21 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 16 ] 22 [ 20 ] 23 [ 37 ] 24 [ 38 ] 25 [ 22 ] 26 [ 17 ] 27 [ 13 ] [ 14 ] 28 [ 27 ] 29 [ 10 ] [ 13 ] [ 14 ] [ 15 ] [ 19 ] [ 41 ] 30 [ 45 ] [ 46 ] [ 51 ] 31 [ 16 ] 32 [ 24 ] 33 [ 47 ] [ 49 ] 34 [ 3 ] [ 5 ] [ 6 ] [ 8 ] [ 24 ] [ 31 ] 35 [ 15 ] [ 24 ] [ 33 ] [ 38 ] 36 [ 16 ] 37 [ 31 ] 38 [ 11 ] [ 12 ] [ 17 ] [ 18 ] [ 23 ] [ 29 ] [ 32 ] [ 40 ] [ 44 ] [ 48 ] 39 [ 20 ] 40 [ 2 ] 41 [ 34 ] [ 36 ] 42 [ 12 ] [ 15 ] 43 [ 23 ]  ©2006 Association for Computing Machinery |
