Searching for authors named "Shiva Chaudhuri" – sorted by Relevance.
-
Generalized k-Center Problems
- Generalized k-Center Problems Shiva Chaudhuri Naveen Garg R. Ravi y Abstract The k
- Add To MetaCart
-
The p-Neighbor k-Center Problem
- The p-Neighbor k-Center Problem Shiva Chaudhuri Naveen Garg R. Ravi y Abstract The k
- Cited by 8 (0 self) – Add To MetaCart
-
(Probabilistic) Recurrence Relations Revisited
- (Probabilistic) Recurrence Relations Revisited Shiva Chaudhuri 1? and Devdatt Dubhashi 2?? 1
- Cited by 7 (3 self) – Add To MetaCart
-
A Lower Bound for Linear Approximate Compaction
- A Lower Bound for Linear Approximate Compaction Shiva Chaudhuri Max-Planck-Institut fur Informatik
- Cited by 4 (1 self) – Add To MetaCart
-
Prefix Graphs and Their Applications
- Prefix Graphs and Their Applications ? Shiva Chaudhuri and Torben Hagerup Max-Planck-Institut fur
- Cited by 1 (1 self) – Add To MetaCart
-
Deterministic restrictions in circuit complexity
- Abstract Deterministic Restrictions in Circuit Complexity Shiva Chaudhuri ∗† Jaikumar
- Cited by 9 (1 self) – Add To MetaCart
-
Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms
- Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms Shiva Chaudhuri
- Add To MetaCart
-
Approximate and Exact Deterministic Parallel Selection
- Approximate and Exact Deterministic Parallel Selection Shiva Chaudhuri 1 Torben Hagerup 2
- Cited by 15 (2 self) – Add To MetaCart
-
The Complexity of Parallel Prefix Problems on Small Domains
- The Complexity of Parallel Prefix Problems on Small Domains Shiva P. Chaudhuri Jaikumar
- Cited by 3 (1 self) – Add To MetaCart
-
Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms
- Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms Shiva Chaudhuri
- Cited by 16 (2 self) – Add To MetaCart

