Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Abhiram G. Ranade
2000 – 2009
- 2008
[j12]Devdatta Gangal, Abhiram G. Ranade: Precedence constrained scheduling in (2 - 7/(3p+1)) optimal. J. Comput. Syst. Sci. 74(7): 1139-1146 (2008)- [j11]
- 2007
- [j10]Abhiram G. Ranade, Srikanth S. Mahabalarao, Satyen Kale: A variation on SVD based image compression. Image Vision Comput. 25(6): 771-777 (2007)
- 2003
- [j9]Abhiram G. Ranade: Scheduling loosely connected task graphs. J. Comput. Syst. Sci. 67(1): 198-208 (2003)
- 2000
- [c20]Abhiram G. Ranade, Sonal Kothari, Raghavendra Udupa: Register Efficient Mergesorting. HiPC 2000: 96-103
- [c19]
1990 – 1999
- 1999
- [c18]
- 1998
- [j8]Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade: Tight Bounds on Parallel List Marking. J. Parallel Distrib. Comput. 51(2): 75-88 (1998)
- 1996
- [j7]Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe: On Bufferless Routing of Variable Length Messages in Leveled Networks. IEEE Trans. Computers 45(6): 714-729 (1996)
- [c17]
- 1995
- [j6]Valerie E. Taylor, Abhiram G. Ranade, David G. Messerschmitt: SPAR: A New Architecture for Large Finite Element Computations. IEEE Trans. Computers 44(4): 531-545 (1995)
- [c16]Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade: Tight Bounds on Parallel List Marking. Euro-Par 1995: 231-242
- 1994
- [j5]Frank Thomson Leighton, Bruce M. Maggs, Abhiram G. Ranade, Satish Rao: Randomized Routing and Sorting on Fixed-Connection Networks. J. Algorithms 17(1): 157-205 (1994)
- [j4]Abhiram G. Ranade: Optimal Speedup for Backtrack Search on a Butterfly Network. Mathematical Systems Theory 27(1): 85-101 (1994)
- [c15]Abhiram G. Ranade, Saul Schleimer, Daniel Shawcross Wilkerson: Nearly Tight Bounds for Wormhole Routing. FOCS 1994: 347-355
- 1993
- [j3]Sandeep N. Bhatt, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg: Scattering and Gathering Messages in Networks of Processors. IEEE Trans. Computers 42(8): 938-949 (1993)
- [c14]Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe: On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract). ESA 1993: 49-60
- [c13]David T. Blackston, Abhiram G. Ranade: SnakeSort: A Family of Simle Optimal Randomized Sorting Algorithms. ICPP 1993: 201-204
- [c12]M. T. Raghunath, Abhiram G. Ranade: Designing interconnection networks for multi-level packaging. SC 1993: 772-781
- [c11]Bob Boothe, Abhiram G. Ranade: Performance on a Bandwidth Constrained Network: How much bandwidth do we need? SC 1993: 906-915
- 1992
- [j2]Frank Thomson Leighton, Mark Newman, Abhiram G. Ranade, Eric J. Schwabe: Dynamic Tree Embeddings in Butterflies and Hypercubes. SIAM J. Comput. 21(4): 639-654 (1992)
- [c10]Bob Boothe, Abhiram G. Ranade: Improved Multithreading Techniques for Hiding Communication Latency in Multiprocessors. ISCA 1992: 214-223
- [c9]Abhiram G. Ranade: A Framework for Analyzing Locality and Portability Issues in Parallel Computing. Heinz Nixdorf Symposium 1992: 185-194
- [c8]
- 1991
- [j1]
- [c7]Valerie E. Taylor, Abhiram G. Ranade, David G. Messerschmitt: Three-dimensional finite-element analyses: implications for computer architectures. SC 1991: 786-795
- [c6]
- 1990
- [c5]M. T. Raghunath, Abhiram G. Ranade: A Simulation-Based Comparison of Interconnection Networks. SPDP 1990: 98-105
1980 – 1989
- 1989
- [c4]Frank Thomson Leighton, Mark Newman, Abhiram G. Ranade, Eric J. Schwabe: Dynamic Tree Embeddings in Butterflies and Hypercubes. SPAA 1989: 224-234
- 1987
- [c3]
- [c2]Abhiram G. Ranade, S. Lennart Johnsson: The Communication Efficiency fo Meshes, Boolean Cubes and Cube Connected Cycles for Wafer Scale Integraton. ICPP 1987: 479-482
- 1985
- [c1]Abhiram G. Ranade: Interconnection Networks And Parallel Memory Organizations For Array Processing. ICPP 1985: 41-47
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-01 20:00 CET by the dblp team