Sairam Subramanian

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