Prasoon Tiwari

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
Determining DNA sequence similarity using maximum independent set algorithms for interval graphs Algorithm Theory — SWAT '92	2022-12-09	Paper
A tight bound for approximating the square root Information Processing Letters	2016-05-26	Paper
The electrical resistance of a graph captures its commute and cover times Computational Complexity	1999-01-19	Paper
scientific article; zbMATH DE number 1003247 (Why is no real title available?)	1997-04-23	Paper
A lower bound for integer greatest common divisor computations Journal of the ACM	1995-08-31	Paper
A direct version of Shamir and Snir's lower bounds on monotone circuit depth Information Processing Letters	1994-04-05	Paper
On the decidability of sparse univariate polynomial interpolation Computational Complexity	1993-10-10	Paper
Fast exponentiation using the truncation operation Computational Complexity	1993-06-29	Paper
The computational complexity of universal hashing Theoretical Computer Science	1993-05-16	Paper
A problem that is easier to solve on the unit-cost algebraic RAM Journal of Complexity	1993-02-22	Paper
Trade-offs between communication and space Journal of Computer and System Sciences	1993-01-17	Paper
Optimal time bounds for some proximity problems in the plane Information Processing Letters	1993-01-16	Paper
Lower Bounds for Computations with the Floor Operation SIAM Journal on Computing	1991-01-01	Paper
Simple algorithms for approximating all roots of a polynomial with real roots Journal of Complexity	1990-01-01	Paper
scientific article; zbMATH DE number 4117838 (Why is no real title available?)	1989-01-01	Paper
A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots SIAM Journal on Computing	1988-01-01	Paper
Lower bounds on communication complexity in distributed computer networks Journal of the ACM	1987-01-01	Paper
Allowable processing orders in the accelerated cascade algorithm Discrete Applied Mathematics	1986-01-01	Paper
An efficient parallel algorithm for shifting the root of a depth first spanning tree Journal of Algorithms	1986-01-01	Paper
Decomposition of product graphs into complete bipartite subgraphs Discrete Mathematics	1985-01-01	Paper

Research outcomes over time

This page was built for person: Prasoon Tiwari