![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Sairam Subramanian
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [j6]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)
2000 – 2009
- 2005
- [c9]Sairam Subramanian, Ihor Lemischka, Ron Weiss:
Engineering a 1: 2 Bio-multiplexer for controlled stem cell differentiation. CSB Workshops 2005: 262
1990 – 1999
- 1999
- [c8]Carlos L. García, Hakan Ernam, Will Egner, Sairam Subramanian:
Demand modeling and growth planning for TDMA-based wireless networks. WCNC 1999: 433-436 - 1998
- [j5]Philip N. Klein, Sairam Subramanian:
A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs. Algorithmica 22(3): 235-249 (1998) - 1997
- [j4]Philip N. Klein, Sairam Subramanian:
A Randomized Parallel Algorithm for Single-Source Shortest Paths. J. Algorithms 25(2): 205-220 (1997) - [j3]Monika Rauch Henzinger, Philip N. Klein, Satish Rao, Sairam Subramanian:
Faster Shortest-Path Algorithms for Planar Graphs. J. Comput. Syst. Sci. 55(1): 3-23 (1997) - 1995
- [j2]Sairam Subramanian, Roberto Tamassia, Jeffrey Scott Vitter
:
An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs. Algorithmica 14(4): 322-339 (1995) - [c7]Sairam Subramanian, Sridhar Ramaswamy:
The P-range Tree: A New Data Structure for Range Searching in Secondary Memory. SODA 1995: 378-387 - 1994
- [j1]Peter Bro Miltersen, Sairam Subramanian, Jeffrey Scott Vitter
, Roberto Tamassia:
Complexity Models for Incremental Computation. Theor. Comput. Sci. 130(1): 203-236 (1994) - [c6]Robert H. B. Netzer, Sairam Subramanian, Jian Xu:
Critical-Path-Based Message Logging for incremental Replay of Message-Passing Programs. ICDCS 1994: 404-413 - [c5]Sridhar Ramaswamy, Sairam Subramanian:
Path Caching: A Technique for Optimal External Searching. PODS 1994: 25-35 - [c4]Philip N. Klein, Satish Rao, Monika Rauch, Sairam Subramanian:
Faster shortest-path algorithms for planar graphs. STOC 1994: 27-37 - 1993
- [c3]Sairam Subramanian:
A Fully Dynamic Data Structure for Reachability in Planar Digraphs. ESA 1993: 372-383 - [c2]Philip N. Klein, Sairam Subramanian:
A linear-processor polylog-time algorithm for shortest paths in planar graphs. FOCS 1993: 259-270 - [c1]Philip N. Klein, Sairam Subramanian:
A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs. WADS 1993: 442-451
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint