Sairam Subramanian

According to our database, Sairam Subramanian authored at least 14 papers between 1993 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2012

Modular Design of Artificial Tissue Homeostasis: Robust Control through Synthetic Cellular Heterogeneity.

Miles Miller, Marc Hafner, Eduardo D. Sontag, Noah Davidsohn, Sairam Subramanian, Priscilla E. M. Purnick, Douglas A. Lauffenburger, Ron Weiss

PLoS Comput. Biol., 2012

2005

Engineering a 1: 2 Bio-multiplexer for controlled stem cell differentiation.

Sairam Subramanian, Ihor Lemischka, Ron Weiss

Proceedings of the Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference Workshops & Poster Abstracts, 2005

1999

Demand modeling and growth planning for TDMA-based wireless networks.

Carlos L. García, Hakan Ernam, Will Egner, Sairam Subramanian

Proceedings of the 1999 IEEE Wireless Communications and Networking Conference, 1999

1998

A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs.

Philip N. Klein, Sairam Subramanian

Algorithmica, 1998

1997

Faster Shortest-Path Algorithms for Planar Graphs.

Monika Rauch Henzinger, Philip N. Klein, Satish Rao, Sairam Subramanian

J. Comput. Syst. Sci., 1997

A Randomized Parallel Algorithm for Single-Source Shortest Paths.

Philip N. Klein, Sairam Subramanian

J. Algorithms, 1997

1995

An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs.

Sairam Subramanian, Roberto Tamassia, Jeffrey Scott Vitter

Algorithmica, 1995

The P-range Tree: A New Data Structure for Range Searching in Secondary Memory.

Sairam Subramanian, Sridhar Ramaswamy

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1994

Complexity Models for Incremental Computation.

Peter Bro Miltersen, Sairam Subramanian, Jeffrey Scott Vitter, Roberto Tamassia

Theor. Comput. Sci., 1994

Path Caching: A Technique for Optimal External Searching.

Sridhar Ramaswamy, Sairam Subramanian

Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1994

Critical-Path-Based Message Logging for incremental Replay of Message-Passing Programs.

Robert H. B. Netzer, Sairam Subramanian, Jian Xu

Proceedings of the 14th International Conference on Distributed Computing Systems, 1994

1993

A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs.

Philip N. Klein, Sairam Subramanian

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

A linear-processor polylog-time algorithm for shortest paths in planar graphs

Philip N. Klein, Sairam Subramanian

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

A Fully Dynamic Data Structure for Reachability in Planar Digraphs.

Sairam Subramanian

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993