MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Sairam Subramanian" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

10 documents found, showing 1 through 10.

ATOM

Path Caching: A Technique for Optimal External Searching
by Sridhar Ramaswamy, Sridhar Ramaswamy, Sairam Subramanian, Sairam Subramanian — 1994 — In Proc. ACM Symp. Principles of Database Systems
…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
by Philip N. Klein, Sairam Subramanian — 1997 — Journal of Algorithms
… 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
by Philip N. Klein, Sairam Subramanian — 1993
… 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
by Philip N. Klein, Philip N. Klein, Sairam Subramanian, Sairam Subramanian — 1993
… 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
by Sairam Subramanian, Sairam Subramanian, Philip N. Klein, Roberto Tamassia, Jeffrey S. Vitter — 1995
…Parallel and Dynamic Shortest-Path Algorithms for Sparse Graphs Sairam Subramanian Department…
Add To MetaCart

Path Caching: A Technique for Optimal External Searching
by Exte Nd Ed, Sridhar Ramaswamy, Sairam Subramanian — 1994 — In Proc. ACM Symp. Principles of Database Systems
…. 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
by Philip Klein Brown, Satish Rao, Monika Rauch, Sairam Subramanian — 1994 — Journal of Computer and System Sciences
… 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
by Sairam Subramanian, Sairam Subramanian, Roberto Tamassia, Roberto Tamassia, Jeffrey Scott Vitter, Jeffrey Scott Vitter — 1995 — Algorithmica
… 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
by Monika R. Henzinger, Philip Klein, Satish Rao, Sairam Subramanian — 1994 — Journal of Computer and System Sciences
… 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
by Peter Bro Miltersen, Sairam Subramanian, Jeffrey Scott Vitter, Roberto Tamassia — 1994
…Complexity Models for Incremental Computation Peter Bro Miltersen y Sairam Subramanian z…
Cited by 34 (4 self) – Add To MetaCart

Showing 1 through 10.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB