Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Shiva Chaudhuri
@article{DBLP:journals/algorithmica/ChaudhuriSWZ00,
author = {Shiva Chaudhuri and
K. V. Subrahmanyam and
Frank Wagner and
Christos D. Zaroliagis},
title = {Computing Mimicking Networks},
journal = {Algorithmica},
volume = {26},
number = {1},
pages = {31--49},
year = {2000},
url = {https://doi.org/10.1007/s004539910003},
doi = {10.1007/S004539910003},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChaudhuriSWZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChaudhuriZ00,
author = {Shiva Chaudhuri and
Christos D. Zaroliagis},
title = {Shortest Paths in Digraphs of Small Treewidth. Part {I:} Sequential
Algorithms},
journal = {Algorithmica},
volume = {27},
number = {3},
pages = {212--226},
year = {2000},
url = {https://doi.org/10.1007/s004530010016},
doi = {10.1007/S004530010016},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChaudhuriZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChaudhuriGR98,
author = {Shiva Chaudhuri and
Naveen Garg and
R. Ravi},
title = {The \emph{p}-Neighbor \emph{k}-Center Problem},
journal = {Inf. Process. Lett.},
volume = {65},
number = {3},
pages = {131--134},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00224-X},
doi = {10.1016/S0020-0190(97)00224-X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChaudhuriGR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ArikatiCZ98,
author = {Srinivasa Rao Arikati and
Shiva Chaudhuri and
Christos D. Zaroliagis},
title = {All-Pairs Min-Cut in Sparse Networks},
journal = {J. Algorithms},
volume = {29},
number = {1},
pages = {82--110},
year = {1998},
url = {https://doi.org/10.1006/jagm.1998.0961},
doi = {10.1006/JAGM.1998.0961},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/ArikatiCZ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChaudhuriZ98,
author = {Shiva Chaudhuri and
Christos D. Zaroliagis},
title = {Shortest Paths in Digraphs of Small Treewdith. Part {II:} Optimal
Parallel Algorithms},
journal = {Theor. Comput. Sci.},
volume = {203},
number = {2},
pages = {205--223},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(98)00021-8},
doi = {10.1016/S0304-3975(98)00021-8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ChaudhuriZ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChaudhuriSWZ98,
author = {Shiva Chaudhuri and
K. V. Subrahmanyam and
Frank Wagner and
Christos D. Zaroliagis},
editor = {Kim Guldstrand Larsen and
Sven Skyum and
Glynn Winskel},
title = {Computing Mimicking Networks},
booktitle = {Automata, Languages and Programming, 25th International Colloquium,
ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1443},
pages = {556--567},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055084},
doi = {10.1007/BFB0055084},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChaudhuriSWZ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/ChaudhuriR97,
author = {Shiva Chaudhuri and
Jaikumar Radhakrishnan},
title = {The Complexity of Parallel Prefix Problems on Small Domains},
journal = {Inf. Comput.},
volume = {138},
number = {1},
pages = {1--22},
year = {1997},
url = {https://doi.org/10.1006/inco.1997.2654},
doi = {10.1006/INCO.1997.2654},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/ChaudhuriR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChaudhuriD97,
author = {Shiva Chaudhuri and
Devdatt P. Dubhashi},
title = {Probabilistic Recurrence Relations Revisited},
journal = {Theor. Comput. Sci.},
volume = {181},
number = {1},
pages = {45--56},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00261-7},
doi = {10.1016/S0304-3975(96)00261-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChaudhuriD97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Chaudhuri96,
author = {Shiva Chaudhuri},
title = {Sensitive Functions and Approximate Problems},
journal = {Inf. Comput.},
volume = {126},
number = {2},
pages = {161--168},
year = {1996},
url = {https://doi.org/10.1006/inco.1996.0043},
doi = {10.1006/INCO.1996.0043},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Chaudhuri96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/BrodalCR96,
author = {Gerth St{\o}lting Brodal and
Shiva Chaudhuri and
Jaikumar Radhakrishnan},
title = {The Randomized Complexity of Maintaining the Minimum},
journal = {Nord. J. Comput.},
volume = {3},
number = {4},
pages = {337--351},
year = {1996},
timestamp = {Mon, 24 Jul 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/njc/BrodalCR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppl/ChaudhuriDZ96,
author = {Shiva Chaudhuri and
Yannis Dimopoulos and
Christos D. Zaroliagis},
title = {On the Parallel Complexity of Acyclic Logic Programs},
journal = {Parallel Process. Lett.},
volume = {6},
number = {2},
pages = {223--230},
year = {1996},
url = {https://doi.org/10.1142/S0129626496000224},
doi = {10.1142/S0129626496000224},
timestamp = {Tue, 24 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ppl/ChaudhuriDZ96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChaudhuriR96,
author = {Shiva Chaudhuri and
Jaikumar Radhakrishnan},
editor = {Gary L. Miller},
title = {Deterministic Restrictions in Circuit Complexity},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM} Symposium on the Theory
of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996},
pages = {30--36},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/237814.237824},
doi = {10.1145/237814.237824},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChaudhuriR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BrodalCR96,
author = {Gerth St{\o}lting Brodal and
Shiva Chaudhuri and
Jaikumar Radhakrishnan},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {The Randomized Complexity of Maintaining the Minimum},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {4--15},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_116},
doi = {10.1007/3-540-61422-2\_116},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/BrodalCR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-004,
author = {Shiva Chaudhuri and
Jaikumar Radhakrishnan},
title = {Deterministic Restrictions in Circuit Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-004}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-004/index.html},
eprinttype = {ECCC},
eprint = {TR96-004},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChaudhuriZ95,
author = {Shiva Chaudhuri and
Christos D. Zaroliagis},
editor = {Paul G. Spirakis},
title = {Optimal Parallel Shortest Paths in Small Treewidth Digraphs},
booktitle = {Algorithms - {ESA} '95, Third Annual European Symposium, Corfu, Greece,
September 25-27, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {979},
pages = {31--45},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60313-1\_132},
doi = {10.1007/3-540-60313-1\_132},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/ChaudhuriZ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/ArikatiCZ95,
author = {Srinivasa Rao Arikati and
Shiva Chaudhuri and
Christos D. Zaroliagis},
editor = {P. S. Thiagarajan},
title = {All-Pairs Min-Cut in Sparse Networks},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
15th Conference, Bangalore, India, December 18-20, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1026},
pages = {363--376},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60692-0\_61},
doi = {10.1007/3-540-60692-0\_61},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/ArikatiCZ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChaudhuriZ95,
author = {Shiva Chaudhuri and
Christos D. Zaroliagis},
editor = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
Ferenc G{\'{e}}cseg},
title = {Shortest Path Queries in Digraphs of Small Treewidth},
booktitle = {Automata, Languages and Programming, 22nd International Colloquium,
ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {944},
pages = {244--255},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60084-1\_78},
doi = {10.1007/3-540-60084-1\_78},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChaudhuriZ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/ChaudhuriD95,
author = {Shiva Chaudhuri and
Devdatt P. Dubhashi},
editor = {Ricardo A. Baeza{-}Yates and
Eric Goles Ch. and
Patricio V. Poblete},
title = {(Probabilistic) Recurrence Realtions Revisited},
booktitle = {{LATIN} '95: Theoretical Informatics, Second Latin American Symposium,
Valpara{\'{\i}}so, Chile, April 3-7, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {911},
pages = {207--219},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-59175-3\_90},
doi = {10.1007/3-540-59175-3\_90},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/ChaudhuriD95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BilardiCDM94,
author = {Gianfranco Bilardi and
Shiva Chaudhuri and
Devdatt P. Dubhashi and
Kurt Mehlhorn},
title = {A Lower Bound for Area-Universal Graphs},
journal = {Inf. Process. Lett.},
volume = {51},
number = {2},
pages = {101--105},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00070-0},
doi = {10.1016/0020-0190(94)00070-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BilardiCDM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Chaudhuri94,
author = {Shiva Chaudhuri},
title = {Tight Pounds on Oblivious Chaining},
journal = {{SIAM} J. Comput.},
volume = {23},
number = {6},
pages = {1253--1265},
year = {1994},
url = {https://doi.org/10.1137/S0097539792230277},
doi = {10.1137/S0097539792230277},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Chaudhuri94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ChaudhuriH94,
author = {Shiva Chaudhuri and
Torben Hagerup},
editor = {Ernst W. Mayr and
Gunther Schmidt and
Gottfried Tinhofer},
title = {Prefix Graphs and Their Applications},
booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop,
{WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {903},
pages = {206--218},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-59071-4\_49},
doi = {10.1007/3-540-59071-4\_49},
timestamp = {Sun, 02 Oct 2022 16:17:33 +0200},
biburl = {https://dblp.org/rec/conf/wg/ChaudhuriH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Chaudhuri93,
author = {Shiva Chaudhuri},
title = {Sensitive Functions and Approximate Problems},
booktitle = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
California, USA, 3-5 November 1993},
pages = {186--193},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SFCS.1993.366868},
doi = {10.1109/SFCS.1993.366868},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Chaudhuri93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/Chaudhuri93,
author = {Shiva Chaudhuri},
title = {A Lower Bound for Linear Approximate Compaction},
booktitle = {Second Israel Symposium on Theory of Computing Systems, {ISTCS} 1993,
Natanya, Israel, June 7-9, 1993, Proceedings},
pages = {25--32},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/ISTCS.1993.253487},
doi = {10.1109/ISTCS.1993.253487},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/istcs/Chaudhuri93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ChaudhuriHR93,
author = {Shiva Chaudhuri and
Torben Hagerup and
Rajeev Raman},
editor = {Andrzej M. Borzyszkowski and
Stefan Sokolowski},
title = {Approximate and Exact Deterministic Parallel Selection},
booktitle = {Mathematical Foundations of Computer Science 1993, 18th International
Symposium, MFCS'93, Gdansk, Poland, August 30 - September 3, 1993,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {711},
pages = {352--361},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57182-5\_27},
doi = {10.1007/3-540-57182-5\_27},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ChaudhuriHR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChaudhuriR92,
author = {Shiva Chaudhuri and
Jaikumar Radhakrishnan},
title = {The Complexity of Parallel Prefix Problems on Small Domains},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
Pennsylvania, USA, 24-27 October 1992},
pages = {638--647},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SFCS.1992.267787},
doi = {10.1109/SFCS.1992.267787},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChaudhuriR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/Chaudhuri91,
author = {Shiva Chaudhuri},
editor = {Tom Leighton},
title = {Tight Bounds for the Chaining Problem},
booktitle = {Proceedings of the 3rd Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '91, Hilton Head, South Carolina, USA, July
21-24, 1991},
pages = {62--70},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/113379.113385},
doi = {10.1145/113379.113385},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/Chaudhuri91.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-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
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:
