Prasoon Tiwari

Available identifiers

zbMath Open tiwari.prasoonMaRDI QIDQ287182

List of research outcomes

Publication	Date of Publication	Type
Determining DNA sequence similarity using maximum independent set algorithms for interval graphs	2022-12-09	Paper
A tight bound for approximating the square root	2016-05-26	Paper
The electrical resistance of a graph captures its commute and cover times	1999-01-19	Paper
https://portal.mardi4nfdi.de/entity/Q4335207	1997-04-23	Paper
A lower bound for integer greatest common divisor computations	1995-08-31	Paper
A direct version of Shamir and Snir's lower bounds on monotone circuit depth	1994-04-05	Paper
On the decidability of sparse univariate polynomial interpolation	1993-10-10	Paper
Fast exponentiation using the truncation operation	1993-06-29	Paper
The computational complexity of universal hashing	1993-05-16	Paper
A problem that is easier to solve on the unit-cost algebraic RAM	1993-02-22	Paper
Trade-offs between communication and space	1993-01-17	Paper
Optimal time bounds for some proximity problems in the plane	1993-01-16	Paper
Lower Bounds for Computations with the Floor Operation	1991-01-01	Paper
Simple algorithms for approximating all roots of a polynomial with real roots	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4732103	1989-01-01	Paper
A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots	1988-01-01	Paper
Lower bounds on communication complexity in distributed computer networks	1987-01-01	Paper
An efficient parallel algorithm for shifting the root of a depth first spanning tree	1986-01-01	Paper
Allowable processing orders in the accelerated cascade algorithm	1986-01-01	Paper
Decomposition of product graphs into complete bipartite subgraphs	1985-01-01	Paper

Research outcomes over time

This page was built for person: Prasoon Tiwari