Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Sairam Subramanian
@article{DBLP:journals/ploscb/MillerHSDSPLW12,
author = {Miles Miller and
Marc Hafner and
Eduardo D. Sontag and
Noah Davidsohn and
Sairam Subramanian and
Priscilla E. M. Purnick and
Douglas A. Lauffenburger and
Ron Weiss},
title = {Modular Design of Artificial Tissue Homeostasis: Robust Control through
Synthetic Cellular Heterogeneity},
journal = {PLoS Comput. Biol.},
volume = {8},
number = {7},
year = {2012},
url = {https://doi.org/10.1371/journal.pcbi.1002579},
doi = {10.1371/JOURNAL.PCBI.1002579},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ploscb/MillerHSDSPLW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csb/SubramanianLW05,
author = {Sairam Subramanian and
Ihor Lemischka and
Ron Weiss},
title = {Engineering a 1: 2 Bio-multiplexer for controlled stem cell differentiation},
booktitle = {Fourth International {IEEE} Computer Society Computational Systems
Bioinformatics Conference Workshops {\&} Poster Abstracts, {CSB}
2005 Workshops, Stanford, CA, USA, August 8-11, 2005},
pages = {262},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CSBW.2005.62},
doi = {10.1109/CSBW.2005.62},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/csb/SubramanianLW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wcnc/GarciaEES99,
author = {Carlos L. Garc{\'{\i}}a and
Hakan Ernam and
Will Egner and
Sairam Subramanian},
title = {Demand modeling and growth planning for TDMA-based wireless networks},
booktitle = {1999 {IEEE} Wireless Communications and Networking Conference, {WCNC}
1999, September 21-24, 1999, New Orleans, Louisiana, {USA}},
pages = {433--436},
publisher = {{IEEE}},
year = {1999},
url = {https://doi.org/10.1109/WCNC.1999.797862},
doi = {10.1109/WCNC.1999.797862},
timestamp = {Wed, 16 Oct 2019 14:14:50 +0200},
biburl = {https://dblp.org/rec/conf/wcnc/GarciaEES99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KleinS98,
author = {Philip N. Klein and
Sairam Subramanian},
title = {A Fully Dynamic Approximation Scheme for Shortest Paths in Planar
Graphs},
journal = {Algorithmica},
volume = {22},
number = {3},
pages = {235--249},
year = {1998},
url = {https://doi.org/10.1007/PL00009223},
doi = {10.1007/PL00009223},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KleinS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KleinS97,
author = {Philip N. Klein and
Sairam Subramanian},
title = {A Randomized Parallel Algorithm for Single-Source Shortest Paths},
journal = {J. Algorithms},
volume = {25},
number = {2},
pages = {205--220},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0888},
doi = {10.1006/JAGM.1997.0888},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KleinS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HenzingerKRS97,
author = {Monika Rauch Henzinger and
Philip N. Klein and
Satish Rao and
Sairam Subramanian},
title = {Faster Shortest-Path Algorithms for Planar Graphs},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {1},
pages = {3--23},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1493},
doi = {10.1006/JCSS.1997.1493},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HenzingerKRS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SubramanianTV95,
author = {Sairam Subramanian and
Roberto Tamassia and
Jeffrey Scott Vitter},
title = {An Efficient Parallel Algorithm for Shortest Paths in Planar Layered
Digraphs},
journal = {Algorithmica},
volume = {14},
number = {4},
pages = {322--339},
year = {1995},
url = {https://doi.org/10.1007/BF01294130},
doi = {10.1007/BF01294130},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/SubramanianTV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/SubramanianR95,
author = {Sairam Subramanian and
Sridhar Ramaswamy},
editor = {Kenneth L. Clarkson},
title = {The P-range Tree: {A} New Data Structure for Range Searching in Secondary
Memory},
booktitle = {Proceedings of the Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
22-24 January 1995. San Francisco, California, {USA}},
pages = {378--387},
publisher = {{ACM/SIAM}},
year = {1995},
url = {http://dl.acm.org/citation.cfm?id=313651.313769},
timestamp = {Thu, 05 Jul 2018 07:29:25 +0200},
biburl = {https://dblp.org/rec/conf/soda/SubramanianR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MiltersenSVT94,
author = {Peter Bro Miltersen and
Sairam Subramanian and
Jeffrey Scott Vitter and
Roberto Tamassia},
title = {Complexity Models for Incremental Computation},
journal = {Theor. Comput. Sci.},
volume = {130},
number = {1},
pages = {203--236},
year = {1994},
url = {https://doi.org/10.1016/0304-3975(94)90159-7},
doi = {10.1016/0304-3975(94)90159-7},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MiltersenSVT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcs/NetzerSX94,
author = {Robert H. B. Netzer and
Sairam Subramanian and
Jian Xu},
title = {Critical-Path-Based Message Logging for incremental Replay of Message-Passing
Programs},
booktitle = {Proceedings of the 14th International Conference on Distributed Computing
Systems, Poznan, Poland, June 21-24, 1994},
pages = {404--413},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/ICDCS.1994.302444},
doi = {10.1109/ICDCS.1994.302444},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdcs/NetzerSX94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/RamaswamyS94,
author = {Sridhar Ramaswamy and
Sairam Subramanian},
editor = {Victor Vianu},
title = {Path Caching: {A} Technique for Optimal External Searching},
booktitle = {Proceedings of the Thirteenth {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, May 24-26, 1994, Minneapolis, Minnesota,
{USA}},
pages = {25--35},
publisher = {{ACM} Press},
year = {1994},
url = {https://doi.org/10.1145/182591.182595},
doi = {10.1145/182591.182595},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/RamaswamyS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KleinRRS94,
author = {Philip N. Klein and
Satish Rao and
Monika Rauch and
Sairam Subramanian},
editor = {Frank Thomson Leighton and
Michael T. Goodrich},
title = {Faster shortest-path algorithms for planar graphs},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of
Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec,
Canada},
pages = {27--37},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/195058.195092},
doi = {10.1145/195058.195092},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KleinRRS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Subramanian93,
author = {Sairam Subramanian},
editor = {Thomas Lengauer},
title = {A Fully Dynamic Data Structure for Reachability in Planar Digraphs},
booktitle = {Algorithms - {ESA} '93, First Annual European Symposium, Bad Honnef,
Germany, September 30 - October 2, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {726},
pages = {372--383},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57273-2\_72},
doi = {10.1007/3-540-57273-2\_72},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/Subramanian93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KleinS93,
author = {Philip N. Klein and
Sairam Subramanian},
title = {A linear-processor polylog-time algorithm for shortest paths in planar
graphs},
booktitle = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
California, USA, 3-5 November 1993},
pages = {259--270},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SFCS.1993.366861},
doi = {10.1109/SFCS.1993.366861},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KleinS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/KleinS93,
author = {Philip N. Klein and
Sairam Subramanian},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths
in Planar Graphs},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {442--451},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_269},
doi = {10.1007/3-540-57155-8\_269},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/KleinS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-07 22:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
