Shiva Chaudhuri

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Prefix graphs and their applications Graph-Theoretic Concepts in Computer Science	2024-01-05	Paper
Optimal parallel shortest paths in small treewidth digraphs Lecture Notes in Computer Science	2023-05-08	Paper
The randomized complexity of maintaining the minimum Algorithm Theory — SWAT'96	2022-12-09	Paper
(Probabilistic) recurrence relations revisited LATIN '95: Theoretical Informatics	2022-08-16	Paper
Shortest path queries in digraphs of small treewidth Automata, Languages and Programming	2019-01-10	Paper
All-pairs min-cut in sparse networks Lecture Notes in Computer Science	2017-01-19	Paper
The p-neighbor k-center problem Information Processing Letters	2016-06-09	Paper
Shortest paths in digraphs of small treewidth. I: Sequential algorithms Algorithmica	2001-05-17	Paper
A lower bound for area-universal graphs Information Processing Letters	2000-08-02	Paper
scientific article; zbMATH DE number 1256702 (Why is no real title available?)	1999-08-08	Paper
scientific article; zbMATH DE number 1256716 (Why is no real title available?)	1999-05-18	Paper
Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms Theoretical Computer Science	1999-01-12	Paper
All-Pairs Min-Cut in Sparse Networks Journal of Algorithms	1998-11-11	Paper
Probabilistic recurrence relations revisited Theoretical Computer Science	1998-07-22	Paper
The complexity of parallel prefix problems on small domains Information and Computation	1998-06-02	Paper
scientific article; zbMATH DE number 1002203 (Why is no real title available?)	1997-04-22	Paper
Sensitive functions and approximate problems Information and Computation	1996-07-03	Paper
Tight Bounds on Oblivious Chaining SIAM Journal on Computing	1995-04-06	Paper

Research outcomes over time

This page was built for person: Shiva Chaudhuri