The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Sairam Subramanian: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sridhar Ramaswamy, Sairam Subramanian
    Path Caching: A Technique for Optimal External Searching. [Citation Graph (12, 16)][DBLP]
    PODS, 1994, pp:25-35 [Conf]
  2. Sairam Subramanian, Sridhar Ramaswamy
    The P-range Tree: A New Data Structure for Range Searching in Secondary Memory. [Citation Graph (7, 0)][DBLP]
    SODA, 1995, pp:378-387 [Conf]
  3. Peter Bro Miltersen, Sairam Subramanian, Jeffrey Scott Vitter, Roberto Tamassia
    Complexity Models for Incremental Computation. [Citation Graph (3, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:130, n:1, pp:203-236 [Journal]
  4. Philip N. Klein, Satish Rao, Monika Rauch Henzinger, Sairam Subramanian
    Faster shortest-path algorithms for planar graphs. [Citation Graph (2, 0)][DBLP]
    STOC, 1994, pp:27-37 [Conf]
  5. Sairam Subramanian, Ihor Lemischka, Ron Weiss
    Engineering a 1: 2 Bio-multiplexer for controlled stem cell differentiation. [Citation Graph (0, 0)][DBLP]
    CSB Workshops, 2005, pp:262- [Conf]
  6. Sairam Subramanian
    A Fully Dynamic Data Structure for Reachability in Planar Digraphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:372-383 [Conf]
  7. Philip N. Klein, Sairam Subramanian
    A linear-processor polylog-time algorithm for shortest paths in planar graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:259-270 [Conf]
  8. Robert H. B. Netzer, Sairam Subramanian, Jian Xu
    Critical-Path-Based Message Logging for incremental Replay of Message-Passing Programs. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1994, pp:404-413 [Conf]
  9. Philip N. Klein, Sairam Subramanian
    A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:442-451 [Conf]
  10. Philip N. Klein, Sairam Subramanian
    A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:3, pp:235-249 [Journal]
  11. Sairam Subramanian, Roberto Tamassia, Jeffrey Scott Vitter
    An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:14, n:4, pp:322-339 [Journal]
  12. Philip N. Klein, Sairam Subramanian
    A Randomized Parallel Algorithm for Single-Source Shortest Paths. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:25, n:2, pp:205-220 [Journal]
  13. Monika Rauch Henzinger, Philip N. Klein, Satish Rao, Sairam Subramanian
    Faster Shortest-Path Algorithms for Planar Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:55, n:1, pp:3-23 [Journal]

Search in 0.001secs, Finished in 0.002secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002