![]() | 2009 | |
---|---|---|
78 | ![]() ![]() ![]() ![]() ![]() ![]() | Ananth Grama, Vipin Kumar: Load Balancing for Parallel Optimization Techniques. Encyclopedia of Optimization 2009: 1905-1911 |
77 | ![]() ![]() ![]() ![]() ![]() ![]() | Bogdan Carbunar, Murali Krishna Ramanathan, Mehmet Koyutürk, Suresh Jagannathan, Ananth Grama: Efficient tag detection in RFID systems. J. Parallel Distrib. Comput. 69(2): 180-196 (2009) |
2008 | ||
76 | ![]() ![]() ![]() ![]() ![]() ![]() | Jayesh Pandey, Mehmet Koyutürk, Shankar Subramaniam, Ananth Grama: Functional coherence in domain interaction networks. ECCB 2008: 28-34 |
75 | ![]() ![]() ![]() ![]() ![]() ![]() | Asad Awan, Suresh Jagannathan, Ananth Grama: Scalable Data Collection in Sensor Networks. HiPC 2008: 415-426 |
74 | ![]() ![]() ![]() ![]() ![]() ![]() | Jayesh Pandey, Mehmet Koyutürk, Wojciech Szpankowski, Ananth Grama: Annotating Pathways of Interaction Networks. Pacific Symposium on Biocomputing 2008: 153-165 |
73 | ![]() ![]() ![]() ![]() ![]() ![]() | Murali Krishna Ramanathan, Mehmet Koyutürk, Ananth Grama, Suresh Jagannathan: PHALANX: a graph-theoretic framework for test case prioritization. SAC 2008: 667-673 |
72 | ![]() ![]() ![]() ![]() ![]() ![]() | Murali Krishna Ramanathan, Koushik Sen, Ananth Grama, Suresh Jagannathan: Protocol Inference Using Static Path Profiles. SAS 2008: 78-92 |
71 | ![]() ![]() ![]() ![]() ![]() ![]() | Ronaldo A. Ferreira, Mehmet Koyutürk, Suresh Jagannathan, Ananth Grama: Semantic indexing in structured peer-to-peer networks. J. Parallel Distrib. Comput. 68(1): 64-77 (2008) |
2007 | ||
70 | ![]() ![]() ![]() ![]() ![]() ![]() | Asad Awan, Suresh Jagannathan, Ananth Grama: Macroprogramming heterogeneous sensor networks using cosmos. EuroSys 2007: 159-172 |
69 | ![]() ![]() ![]() ![]() ![]() ![]() | Murali Krishna Ramanathan, Ananth Grama, Suresh Jagannathan: Path-Sensitive Inference of Function Precedence Protocols. ICSE 2007: 240-250 |
68 | ![]() ![]() ![]() ![]() ![]() ![]() | Jayesh Pandey, Mehmet Koyutürk, Yohan Kim, Wojciech Szpankowski, Shankar Subramaniam, Ananth Grama: Functional annotation of regulatory pathways. ISMB/ECCB (Supplement of Bioinformatics) 2007: 377-386 |
67 | ![]() ![]() ![]() ![]() ![]() ![]() | Asad Awan, Ahmed H. Sameh, Suresh Jagannathan, Ananth Grama: Building Verifiable Sensing Applications Through Temporal Logic Specification. International Conference on Computational Science (1) 2007: 1205-1212 |
66 | ![]() ![]() ![]() ![]() ![]() ![]() | Murali Krishna Ramanathan, Ananth Grama, Suresh Jagannathan: Static specification inference using predicate mining. PLDI 2007: 123-134 |
65 | ![]() ![]() ![]() ![]() ![]() ![]() | Murali Krishna Ramanathan, Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Grama, Wojciech Szpankowski: Randomized leader election. Distributed Computing 19(5-6): 403-418 (2007) |
64 | ![]() ![]() ![]() ![]() ![]() ![]() | Ronaldo A. Ferreira, Murali Krishna Ramanathan, Ananth Grama, Suresh Jagannathan: Randomized Protocols for Duplicate Elimination in Peer-to-Peer Storage Systems. IEEE Trans. Parallel Distrib. Syst. 18(5): 686-696 (2007) |
63 | ![]() ![]() ![]() ![]() ![]() ![]() | Mehmet Koyutürk, Wojciech Szpankowski, Ananth Grama: Assessing Significance of Connectivity and Conservation in Protein Interaction Networks. Journal of Computational Biology 14(6): 747-764 (2007) |
2006 | ||
62 | ![]() ![]() ![]() ![]() ![]() ![]() | Murali Krishna Ramanathan, Ananth Grama, Suresh Jagannathan: Sieve: A Tool for Automatically Detecting Variations Across Program Versions. ASE 2006: 241-252 |
61 | ![]() ![]() ![]() ![]() ![]() ![]() | Murali Krishna Ramanathan, Suresh Jagannathan, Ananth Grama: Trace-Based Memory Aliasing Across Program Versions. FASE 2006: 381-395 |
60 | ![]() ![]() ![]() ![]() ![]() ![]() | Asad Awan, Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Grama: Distributed Uniform Sampling in Unstructured Peer-to-Peer Networks. HICSS 2006 |
59 | ![]() ![]() ![]() ![]() ![]() ![]() | Asad Awan, Ahmed H. Sameh, Ananth Grama: The Omni Macroprogramming Environment for Sensor Networks. International Conference on Computational Science (3) 2006: 465-472 |
58 | ![]() ![]() ![]() ![]() ![]() ![]() | Mehmet Koyutürk, Ananth Grama, Wojciech Szpankowski: Assessing Significance of Connectivity and Conservation in Protein Interaction Networks. RECOMB 2006: 45-59 |
57 | ![]() ![]() ![]() ![]() ![]() ![]() | Mehmet Koyutürk, Ananth Grama, Naren Ramakrishnan: Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis. ACM Trans. Math. Softw. 32(1): 33-69 (2006) |
56 | ![]() ![]() ![]() ![]() ![]() ![]() | Jie Chi, Mehmet Koyutürk, Ananth Grama: CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets. Algorithmica 45(3): 377-401 (2006) |
55 | ![]() ![]() ![]() ![]() ![]() ![]() | Yohan Kim, Mehmet Koyutürk, Umut Topkara, Ananth Grama, Shankar Subramaniam: Inferring functional information from domain co-evolution. Bioinformatics 22(1): 40-49 (2006) |
54 | ![]() ![]() ![]() ![]() ![]() ![]() | Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Grama: Locality in structured peer-to-peer networks. J. Parallel Distrib. Comput. 66(2): 257-273 (2006) |
53 | ![]() ![]() ![]() ![]() ![]() ![]() | Mehmet Koyutürk, Yohan Kim, Umut Topkara, Shankar Subramaniam, Wojciech Szpankowski, Ananth Grama: Pairwise Alignment of Protein Interaction Networks. Journal of Computational Biology 13(2): 182-199 (2006) |
52 | ![]() ![]() ![]() ![]() ![]() ![]() | Mehmet Koyutürk, Yohan Kim, Shankar Subramaniam, Wojciech Szpankowski, Ananth Grama: Detecting Conserved Interaction Patterns in Biological Networks. Journal of Computational Biology 13(7): 1299-1322 (2006) |
51 | ![]() ![]() ![]() ![]() ![]() ![]() | Asad Awan, Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Grama: Unstructured peer-to-peer networks for sharing processor cycles. Parallel Computing 32(2): 115-135 (2006) |
50 | ![]() ![]() ![]() ![]() ![]() ![]() | Bogdan Carbunar, Ananth Grama, Jan Vitek, Octavian Carbunar: Redundancy and coverage detection in sensor networks. TOSN 2(1): 94-128 (2006) |
2005 | ||
49 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph Hoffmann, Ahmed H. Sameh, Ananth Grama: High-Fidelity Simulation of Large-Scale Structures. International Conference on Computational Science (2) 2005: 664-671 |
48 | ![]() ![]() ![]() ![]() ![]() ![]() | 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 |
47 | ![]() ![]() ![]() ![]() ![]() ![]() | 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 |
46 | ![]() ![]() ![]() ![]() ![]() ![]() | Mehmet Koyutürk, Ananth Grama, Wojciech Szpankowski: Pairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution. RECOMB 2005: 48-65 |
45 | ![]() ![]() ![]() ![]() ![]() ![]() | Ioannis Ioannidis, Ananth Grama, Mikhail J. Atallah: Adaptive data structures for IP lookups. ACM Journal of Experimental Algorithmics 10: (2005) |
44 | ![]() ![]() ![]() ![]() ![]() ![]() | Ioannis Ioannidis, Ananth Grama: Level compressed DAGs for lookup tables. Computer Networks 49(2): 147-160 (2005) |
43 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
2004 | ||
42 | ![]() ![]() ![]() ![]() ![]() ![]() | Mehmet Koyutürk, Wojciech Szpankowski, Ananth Grama: Biclustering Gene-Feature Matrices for Statistically Significant Dense Patterns. CSB 2004: 480-484 |
41 | ![]() ![]() ![]() ![]() ![]() ![]() | Ronaldo A. Ferreira, Ananth Grama, Suresh Jagannathan: Plethora: An EfficientWide-Area Storage System. HiPC 2004: 252-261 |
40 | ![]() ![]() ![]() ![]() ![]() ![]() | Hemant Mahawar, Vivek Sarin, Ananth Grama: Parallel Performance of Hierarchical Multipole Algorithms for Inductance Extraction. HiPC 2004: 450-461 |
39 | ![]() ![]() ![]() ![]() ![]() ![]() | Shan Lei, Ananth Grama: Extended Consistent Hashing: An Efficient Framework for Object Location. ICDCS 2004: 254-262 |
38 | ![]() ![]() ![]() ![]() ![]() ![]() | Bogdan Carbunar, Ioannis Ioannidis, Ananth Grama, Jan Vitek: A Secure Crediting Protocol for Hybrid Cellular and Ad-Hoc Networks. ICETE (3) 2004: 142-149 |
37 | ![]() ![]() ![]() ![]() ![]() ![]() | Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Grama: Enhancing Locality in Structured Peer-to-Peer Networks. ICPADS 2004: 25- |
36 | ![]() ![]() ![]() ![]() ![]() ![]() | 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- |
35 | ![]() ![]() ![]() ![]() ![]() ![]() | Ananth Grama, Vivek Sarin: Impact of far-field interactions on performance of multipole-based preconditioners for sparse linear systems. ICS 2004: 41-47 |
34 | ![]() ![]() ![]() ![]() ![]() ![]() | 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 |
33 | ![]() ![]() ![]() ![]() ![]() ![]() | A. Antoulas, Danny C. Sorensen, Kyle 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 |
32 | ![]() ![]() ![]() ![]() ![]() ![]() | Jie Chi, Mehmet Koyutürk, Ananth Grama: Conquest: A Distributed Tool for Constructing Summaries of High-Dimensional Discrete Attribute Data Sets. SDM 2004 |
2003 | ||
31 | ![]() ![]() ![]() ![]() ![]() ![]() | Mehmet Koyutürk, Ananth Grama, Wojciech Szpankowski: Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments. CSB 2003: 575-580 |
30 | ![]() ![]() ![]() ![]() ![]() ![]() | Ioannis Ioannidis, Ananth Grama: An Efficient Protocol for Yao?s Millionaires? Problem. HICSS 2003: 205 |
29 | ![]() ![]() ![]() ![]() ![]() ![]() | 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 |
28 | ![]() ![]() ![]() ![]() ![]() ![]() | Ioannis Ioannidis, Ananth Grama, Mikhail J. Atallah: Adaptive Data Structures for IP Lookups. INFOCOM 2003 |
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Mehmet Koyutürk, Ananth Grama: PROXIMUS: a framework for analyzing very high dimensional discrete-attributed datasets. KDD 2003: 147-156 |
26 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
2002 | ||
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Sacha Zyto, Ananth Grama, Wojciech Szpankowski: Semi-discrete Matrix Transforms (SDD) for Image and Video Compression. DCC 2002: 484 |
24 | ![]() ![]() ![]() ![]() ![]() ![]() | 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 |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Ioannis Ioannidis, Ananth Grama, Mikhail J. Atallah: A Secure Protocol for Computing Dot-Products in Clustered and Distributed Environments. ICPP 2002: 379-384 |
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Tzvetan Horozov, Ananth Grama, Venu Vasudevan, Sean Landis: MOBY - A Mobile Peer-to-Peer Service and Data Network. ICPP 2002: 437-444 |
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Mehmet Koyutürk, Ananth Grama, Naren Ramakrishnan: Algebraic Techniques for Analysis of Large Discrete-Valued Datasets. PKDD 2002: 311-324 |
20 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
2001 | ||
19 | ![]() ![]() ![]() ![]() ![]() ![]() | Ananth Grama, David Meyer, Wojciech Szpankowski: Real-Time Decompression of Streaming Video Using Mobile Code. Data Compression Conference 2001: 496 |
18 | ![]() ![]() ![]() ![]() ![]() ![]() | Ananth Grama, Vipin Kumar, Sanjay Ranka, Vineet Singh: Architecture Independent Analysis of Parallel Programs. International Conference on Computational Science (2) 2001: 599-608 |
17 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
16 | ![]() ![]() ![]() ![]() ![]() ![]() | Naren Ramakrishnan, Ananth Grama: Mining scientific data. Advances in Computers 55: 120-171 (2001) |
15 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
14 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
2000 | ||
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciech Szpankowski: Summary Structures for Frequency Queries on Large Transaction Sets. Data Compression Conference 2000: 420-429 |
1999 | ||
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Marc Alzina, Wojciech Szpankowski, Ananth Grama: 2D-Pattern Matching Image and Video Compression. Data Compression Conference 1999: 424-433 |
11 | ![]() ![]() ![]() ![]() ![]() ![]() | Naren Ramakrishnan, Ananth Grama: Data Mining: From Serendipity to Science - Guest Editors' Introduction. IEEE Computer 32(8): 34-37 (1999) |
10 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
1998 | ||
9 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
1997 | ||
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Vipin Kumar, George Karypis, Ananth Grama: Role of Message-Passing in Performance Oriented Parallel Programming. PPSC 1997 |
1995 | ||
7 | ![]() ![]() ![]() ![]() ![]() ![]() | Ananth Grama, Vipin Kumar, Ahmed H. Sameh: N-Body Simulations Using Message Passsing Parallel Computers. PPSC 1995: 355-360 |
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Ananth Grama, Vipin Kumar, Ahmed H. Sameh: Parallel Matrix-Vector Product Using Approximate Hierarchical Methods. SC 1995 |
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Ananth Grama, Vipin Kumar: Parallel Search Algorithms for Discrete Optimization Problems. INFORMS Journal on Computing 7(4): 365-385 (1995) |
1994 | ||
4 | ![]() ![]() ![]() ![]() ![]() ![]() | Vipin Kumar, Ananth Grama, Anshul Gupta, George Karypis: Introduction to Parallel Computing. Benjamin/Cummings 1994 |
3 | ![]() ![]() ![]() ![]() ![]() ![]() | Ananth Grama, Vipin Kumar, Ahmed H. Sameh: Scalable parallel formulations of the Barnes-Hut method for n-body simulations. SC 1994: 439-448 |
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Vipin Kumar, Ananth Grama, Nageshwara Rao Vempaty: Scalable Load Balancing Techniques for Parallel Computers. J. Parallel Distrib. Comput. 22(1): 60-79 (1994) |
1992 | ||
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Ananth Grama, Vipin Kumar: Scalability Analysis of Partitioning Strategies for Finite Element Graphs: A Summary of Results. SC 1992: 83-92 |