Travelled to:1 × Italy
4 × USA
Collaborated with:M.Ben-Or Y.Mansour A.Borodin N.Nisan B.Schieber T.W.Lam M.Tompa E.Feig D.Kozen A.K.Chandra P.Raghavan W.L.Ruzzo R.Smolensky
Talks about:algorithm (2) polynomi (2) interpol (2) comput (2) spars (2) root (2) determinist (1) polynomin (1) multivari (1) tradeoff (1)
Person: Prasoon Tiwari
DBLP: Tiwari:Prasoon
Contributed to:
1990
1989198919881986Wrote 7 papers:
- STOC-1990-BorodinT #decidability #on the #polynomial
- On the Decidability of Sparse Univariate Polynomial Interpolation (AB, PT), pp. 535–545.
- STOC-1990-MansourNT #complexity
- The Computational Complexity of Universal Hashing (YM, NN, PT), pp. 235–243.
- ICALP-1989-MansourST #bound
- Lower Bounds for Computations with the Floor Operation (YM, BS, PT), pp. 559–573.
- STOC-1989-ChandraRRST #graph
- The Electrical Resistance of a Graph Captures its Commute and Cover Times (AKC, PR, WLR, RS, PT), pp. 574–586.
- STOC-1989-LamTT #communication #trade-off
- Tradeoffs Between Communication and Space (TWL, PT, MT), pp. 217–226.
- STOC-1988-Ben-OrT #algorithm #multi
- A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (MBO, PT), pp. 301–309.
- STOC-1986-Ben-OrFKT #algorithm #parallel #performance #polynomial
- A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots (MBO, EF, DK, PT), pp. 340–349.