Searching for authors named "Sairam Subramanian" – sorted by Relevance.
-
Path Caching: A Technique for Optimal External Searching
- Path Caching: A Technique for Optimal External Searching Sridhar Ramaswamy and Sairam Subramanian
- Cited by 48 (5 self) – Add To MetaCart
-
A randomized parallel algorithm for single-source shortest paths
- Sairam Subramanian Department of Computer Science Brown University, Providence, RI Abstract We give a
- Cited by 11 (1 self) – Add To MetaCart
-
A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
- University Sairam Subramanian y Brown University Abstract In this paper we give a fully dynamic
- Cited by 10 (0 self) – Add To MetaCart
-
A Linear-Processor Polylog-Time Algorithm for Shortest Paths in Planar Graphs
- and Sairam Subramanian Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93
- Cited by 15 (6 self) – Add To MetaCart
-
Parallel and Dynamic Shortest-Path Algorithms for Sparse Graphs
- Parallel and Dynamic Shortest-Path Algorithms for Sparse Graphs Sairam Subramanian Department
- Add To MetaCart
-
Path Caching: A Technique for Optimal External Searching
- . of PODS-94) Sridhar Ramaswamy Brown University sr@(email omitted); Sairam Subramanian y Brown University
- Add To MetaCart
-
Faster Shortest-Path Algorithms for Planar Graphs
- Brown University Satish Rao NEC Research Institute Monika Rauch y Cornell University Sairam
- Add To MetaCart
-
An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs
- in Planar Layered Digraphs Sairam Subramanian Roberto Tamassia Department of Computer Science Brown
- Cited by 1 (0 self) – Add To MetaCart
-
Faster Shortest-Path Algorithms for Planar Graphs
- NEC Research Institute Sairam Subramanian z Bell Northern Research Abstract We give a linear
- Cited by 99 (7 self) – Add To MetaCart
-
Complexity Models for Incremental Computation
- Complexity Models for Incremental Computation Peter Bro Miltersen y Sairam Subramanian z
- Cited by 34 (4 self) – Add To MetaCart

