Sairam Subramanian

Publication Activity (10 Years)

Years Active: 1993-2012
Publications (10 Years): 0

Top Topics

Data Acquisition

Computationally Efficient

Top Venues

PLoS Comput. Biol.

Publications

Miles Miller, Marc Hafner, Eduardo D. Sontag, Noah Davidsohn, Sairam Subramanian, Priscilla E. M. Purnick, Douglas A. Lauffenburger, Ron Weiss
Modular Design of Artificial Tissue Homeostasis: Robust Control through Synthetic Cellular Heterogeneity. PLoS Comput. Biol. 8 (7) (2012)
Sairam Subramanian, Ihor Lemischka, Ron Weiss
Engineering a 1: 2 Bio-multiplexer for controlled stem cell differentiation. CSB Workshops (2005)
Carlos L. García, Hakan Ernam, Will Egner, Sairam Subramanian
Demand modeling and growth planning for TDMA-based wireless networks. WCNC (1999)
Philip N. Klein, Sairam Subramanian
A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs. Algorithmica 22 (3) (1998)
Monika Rauch Henzinger, Philip N. Klein, Satish Rao, Sairam Subramanian
Faster Shortest-Path Algorithms for Planar Graphs. J. Comput. Syst. Sci. 55 (1) (1997)
Philip N. Klein, Sairam Subramanian
A Randomized Parallel Algorithm for Single-Source Shortest Paths. J. Algorithms 25 (2) (1997)
Sairam Subramanian, Roberto Tamassia, Jeffrey Scott Vitter
An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs. Algorithmica 14 (4) (1995)
Sairam Subramanian, Sridhar Ramaswamy
The P-range Tree: A New Data Structure for Range Searching in Secondary Memory. SODA (1995)
Peter Bro Miltersen, Sairam Subramanian, Jeffrey Scott Vitter, Roberto Tamassia
Complexity Models for Incremental Computation. Theor. Comput. Sci. 130 (1) (1994)
Robert H. B. Netzer, Sairam Subramanian, Jian Xu
Critical-Path-Based Message Logging for incremental Replay of Message-Passing Programs. ICDCS (1994)
Philip N. Klein, Satish Rao, Monika Rauch Henzinger, Sairam Subramanian
Faster shortest-path algorithms for planar graphs. STOC (1994)
Sridhar Ramaswamy, Sairam Subramanian
Path Caching: A Technique for Optimal External Searching. PODS (1994)
Sairam Subramanian
A Fully Dynamic Data Structure for Reachability in Planar Digraphs. ESA (1993)
Philip N. Klein, Sairam Subramanian
A linear-processor polylog-time algorithm for shortest paths in planar graphs FOCS (1993)
Philip N. Klein, Sairam Subramanian
A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs. WADS (1993)