default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShiva Chaudhuri
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
[j12]Shiva Chaudhuri, K. V. Subrahmanyam
, Frank Wagner, Christos D. Zaroliagis:
Computing Mimicking Networks. Algorithmica 26(1): 31-49 (2000)- [j11]Shiva Chaudhuri, Christos D. Zaroliagis:
Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms. Algorithmica 27(3): 212-226 (2000)
1990 – 1999
- 1998
- [j10]Shiva Chaudhuri, Naveen Garg, R. Ravi:
The p-Neighbor k-Center Problem. Inf. Process. Lett. 65(3): 131-134 (1998) - [j9]Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis:
All-Pairs Min-Cut in Sparse Networks. J. Algorithms 29(1): 82-110 (1998) - [j8]Shiva Chaudhuri, Christos D. Zaroliagis:
Shortest Paths in Digraphs of Small Treewdith. Part II: Optimal Parallel Algorithms. Theor. Comput. Sci. 203(2): 205-223 (1998) - [c13]Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis:
Computing Mimicking Networks. ICALP 1998: 556-567 - 1997
- [j7]Shiva Chaudhuri, Jaikumar Radhakrishnan:
The Complexity of Parallel Prefix Problems on Small Domains. Inf. Comput. 138(1): 1-22 (1997) - [j6]Shiva Chaudhuri, Devdatt P. Dubhashi:
Probabilistic Recurrence Relations Revisited. Theor. Comput. Sci. 181(1): 45-56 (1997) - 1996
- [j5]Shiva Chaudhuri:
Sensitive Functions and Approximate Problems. Inf. Comput. 126(2): 161-168 (1996) - [j4]Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan:
The Randomized Complexity of Maintaining the Minimum. Nord. J. Comput. 3(4): 337-351 (1996) - [j3]Shiva Chaudhuri, Yannis Dimopoulos, Christos D. Zaroliagis:
On the Parallel Complexity of Acyclic Logic Programs. Parallel Process. Lett. 6(2): 223-230 (1996) - [c12]Shiva Chaudhuri, Jaikumar Radhakrishnan:
Deterministic Restrictions in Circuit Complexity. STOC 1996: 30-36 - [c11]Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan:
The Randomized Complexity of Maintaining the Minimum. SWAT 1996: 4-15 - [i1]Shiva Chaudhuri, Jaikumar Radhakrishnan:
Deterministic Restrictions in Circuit Complexity. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [c10]Shiva Chaudhuri, Christos D. Zaroliagis:
Optimal Parallel Shortest Paths in Small Treewidth Digraphs. ESA 1995: 31-45 - [c9]Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis:
All-Pairs Min-Cut in Sparse Networks. FSTTCS 1995: 363-376 - [c8]Shiva Chaudhuri, Christos D. Zaroliagis:
Shortest Path Queries in Digraphs of Small Treewidth. ICALP 1995: 244-255 - [c7]Shiva Chaudhuri, Devdatt P. Dubhashi:
(Probabilistic) Recurrence Realtions Revisited. LATIN 1995: 207-219 - 1994
- [j2]Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn:
A Lower Bound for Area-Universal Graphs. Inf. Process. Lett. 51(2): 101-105 (1994) - [j1]Shiva Chaudhuri:
Tight Pounds on Oblivious Chaining. SIAM J. Comput. 23(6): 1253-1265 (1994) - [c6]Shiva Chaudhuri, Torben Hagerup:
Prefix Graphs and Their Applications. WG 1994: 206-218 - 1993
- [c5]Shiva Chaudhuri:
Sensitive Functions and Approximate Problems. FOCS 1993: 186-193 - [c4]Shiva Chaudhuri:
A Lower Bound for Linear Approximate Compaction. ISTCS 1993: 25-32 - [c3]Shiva Chaudhuri, Torben Hagerup, Rajeev Raman:
Approximate and Exact Deterministic Parallel Selection. MFCS 1993: 352-361 - 1992
- [c2]Shiva Chaudhuri, Jaikumar Radhakrishnan:
The Complexity of Parallel Prefix Problems on Small Domains. FOCS 1992: 638-647 - 1991
- [c1]Shiva Chaudhuri:
Tight Bounds for the Chaining Problem. SPAA 1991: 62-70
Coauthor Index
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
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:
