The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Abhiram G. Ranade: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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). [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:49-60 [Conf]
  2. Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade
    Tight Bounds on Parallel List Marking. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1995, pp:231-242 [Conf]
  3. Abhiram G. Ranade
    How to emulate shared memory (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:185-194 [Conf]
  4. Abhiram G. Ranade, Saul Schleimer, Daniel Shawcross Wilkerson
    Nearly Tight Bounds for Wormhole Routing [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:347-355 [Conf]
  5. Abhiram G. Ranade, Sonal Kothari, Raghavendra Udupa
    Register Efficient Mergesorting. [Citation Graph (0, 0)][DBLP]
    HiPC, 2000, pp:96-103 [Conf]
  6. Abhiram G. Ranade
    Bandwidth Efficient Parallel Computation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:4-23 [Conf]
  7. David T. Blackston, Abhiram G. Ranade
    SnakeSort: A Family of Simle Optimal Randomized Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    ICPP, 1993, pp:201-204 [Conf]
  8. Abhiram G. Ranade
    Interconnection Networks And Parallel Memory Organizations For Array Processing. [Citation Graph (0, 0)][DBLP]
    ICPP, 1985, pp:41-47 [Conf]
  9. Abhiram G. Ranade, S. Lennart Johnsson
    The Communication Efficiency fo Meshes, Boolean Cubes and Cube Connected Cycles for Wafer Scale Integraton. [Citation Graph (0, 0)][DBLP]
    ICPP, 1987, pp:479-482 [Conf]
  10. Bob Boothe, Abhiram G. Ranade
    Improved Multithreading Techniques for Hiding Communication Latency in Multiprocessors. [Citation Graph (0, 0)][DBLP]
    ISCA, 1992, pp:214-223 [Conf]
  11. Abhiram G. Ranade
    A Framework for Analyzing Locality and Portability Issues in Parallel Computing. [Citation Graph (0, 0)][DBLP]
    Heinz Nixdorf Symposium, 1992, pp:185-194 [Conf]
  12. Bob Boothe, Abhiram G. Ranade
    Performance on a Bandwidth Constrained Network: How much bandwidth do we need? [Citation Graph (0, 0)][DBLP]
    SC, 1993, pp:906-915 [Conf]
  13. M. T. Raghunath, Abhiram G. Ranade
    Designing interconnection networks for multi-level packaging. [Citation Graph (0, 0)][DBLP]
    SC, 1993, pp:772-781 [Conf]
  14. Valerie E. Taylor, Abhiram G. Ranade, David G. Messerschmitt
    Three-dimensional finite-element analyses: implications for computer architectures. [Citation Graph (0, 0)][DBLP]
    SC, 1991, pp:786-795 [Conf]
  15. Mayur Datar, Abhiram G. Ranade
    Commuting with delay prone buses. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:22-29 [Conf]
  16. Kamesh Munagala, Abhiram G. Ranade
    I/O-Complexity of Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:687-694 [Conf]
  17. Frank Thomson Leighton, Mark Newman, Abhiram G. Ranade, Eric J. Schwabe
    Dynamic Tree Embeddings in Butterflies and Hypercubes. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:224-234 [Conf]
  18. Abhiram G. Ranade
    Optimal Speedup for Backtrack Search on a butterfly Network. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:40-48 [Conf]
  19. Abhiram G. Ranade
    Maintaining Dynamic Ordered Sets on Processor Networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:127-137 [Conf]
  20. M. T. Raghunath, Abhiram G. Ranade
    A Simulation-Based Comparison of Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    SPDP, 1990, pp:98-105 [Conf]
  21. Abhiram G. Ranade, Srikanth S. Mahabalarao, Satyen Kale
    A variation on SVD based image compression. [Citation Graph (0, 0)][DBLP]
    Image Vision Comput., 2007, v:25, n:6, pp:771-777 [Journal]
  22. Frank Thomson Leighton, Bruce M. Maggs, Abhiram G. Ranade, Satish Rao
    Randomized Routing and Sorting on Fixed-Connection Networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:1, pp:157-205 [Journal]
  23. Abhiram G. Ranade
    Scheduling loosely connected task graphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:1, pp:198-208 [Journal]
  24. Abhiram G. Ranade
    How to Emulate Shared Memory. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:42, n:3, pp:307-326 [Journal]
  25. Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade
    Tight Bounds on Parallel List Marking. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:51, n:2, pp:75-88 [Journal]
  26. Abhiram G. Ranade
    Optimal Speedup for Backtrack Search on a Butterfly Network. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:1, pp:85-101 [Journal]
  27. Frank Thomson Leighton, Mark Newman, Abhiram G. Ranade, Eric J. Schwabe
    Dynamic Tree Embeddings in Butterflies and Hypercubes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:4, pp:639-654 [Journal]
  28. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:6, pp:714-729 [Journal]
  29. Sandeep N. Bhatt, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg
    Scattering and Gathering Messages in Networks of Processors. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1993, v:42, n:8, pp:938-949 [Journal]
  30. Valerie E. Taylor, Abhiram G. Ranade, David G. Messerschmitt
    SPAR: A New Architecture for Large Finite Element Computations. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1995, v:44, n:4, pp:531-545 [Journal]

Search in 0.021secs, Finished in 0.023secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002