Shiva Chaudhuri

According to our database1, Shiva Chaudhuri authored at least 20 papers between 1991 and 2000.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2000
Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms.
Algorithmica, 2000

1998
Shortest Paths in Digraphs of Small Treewdith. Part II: Optimal Parallel Algorithms.
Theor. Comput. Sci., 1998

The <i>p</i>-Neighbor <i>k</i>-Center Problem.
Inf. Process. Lett., 1998

Computing Mimicking Networks.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
Probabilistic Recurrence Relations Revisited.
Theor. Comput. Sci., 1997

1996
On the Parallel Complexity of Acyclic Logic Programs.
Parallel Process. Lett., 1996

The Randomized Complexity of Maintaining the Minimum.
Proceedings of the Algorithm Theory, 1996

Deterministic Restrictions in Circuit Complexity.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995
(Probabilistic) Recurrence Realtions Revisited.
Proceedings of the LATIN '95: Theoretical Informatics, 1995

Shortest Path Queries in Digraphs of Small Treewidth.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

All-Pairs Min-Cut in Sparse Networks.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

Optimal Parallel Shortest Paths in Small Treewidth Digraphs.
Proceedings of the Algorithms, 1995

1994
Tight Pounds on Oblivious Chaining.
SIAM J. Comput., 1994

A Lower Bound for Area-Universal Graphs.
Inf. Process. Lett., 1994

Prefix Graphs and Their Applications.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

1993
Approximate and Exact Deterministic Parallel Selection.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

A Lower Bound for Linear Approximate Compaction.
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

Sensitive Functions and Approximate Problems
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
The Complexity of Parallel Prefix Problems on Small Domains
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
Tight Bounds for the Chaining Problem.
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991


  Loading...