The SCEAS System
| |||||||

## Search the dblp DataBase
Prasoon Tiwari:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Yishay Mansour, Noam Nisan, Prasoon Tiwari
**The Computational Complexity of Universal Hashing.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1990, pp:90- [Conf] - Yishay Mansour, Baruch Schieber, Prasoon Tiwari
**Lower Bounds for Integer Greatest Common Divisor Computations (Extended Summary)**[Citation Graph (0, 0)][DBLP] FOCS, 1988, pp:54-63 [Conf] - Yishay Mansour, Baruch Schieber, Prasoon Tiwari
**The Complexity of Approximating the Square Root (Extended Summary)**[Citation Graph (0, 0)][DBLP] FOCS, 1989, pp:325-330 [Conf] - Prasoon Tiwari
**Lower Bounds on Communication Complexity in Distributed Computer Networks (Preliminary Version)**[Citation Graph (0, 0)][DBLP] FOCS, 1984, pp:109-117 [Conf] - Yishay Mansour, Baruch Schieber, Prasoon Tiwari
**Lower Bounds for Computations with the Floor Operation.**[Citation Graph (0, 0)][DBLP] ICALP, 1989, pp:559-573 [Conf] - Wei Zhao, Marc Willebeek-LeMair, Prasoon Tiwari
**Efficient Adaptive Media Scaling and Streaming of Layered Multimedia in Heterogeneous Environment.**[Citation Graph (0, 0)][DBLP] ICMCS, Vol. 2, 1999, pp:377-381 [Conf] - Walter Ludwig, Prasoon Tiwari
**Scheduling Malleable and Nonmalleable Parallel Tasks.**[Citation Graph (0, 0)][DBLP] SODA, 1994, pp:167-176 [Conf] - B. Narendran, Renato De Leone, Prasoon Tiwari
**An Implementation of the epsilon-Relaxation Algorithm on the CM-5.**[Citation Graph (0, 0)][DBLP] SPAA, 1993, pp:183-192 [Conf] - B. Narendran, Prasoon Tiwari
**Polynomial Root-Finding: Analysis and Computational Investigation of a Parallel Algorithm.**[Citation Graph (0, 0)][DBLP] SPAA, 1992, pp:178-187 [Conf] - John Turek, Walter Ludwig, Joel L. Wolf, Lisa Fleischer, Prasoon Tiwari, Jason Glasgow, Uwe Schwiegelshohn, Philip S. Yu
**Scheduling Parallelizable Tasks to Minimize Average Response Time.**[Citation Graph (0, 0)][DBLP] SPAA, 1994, pp:200-209 [Conf] - Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari
**A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots**[Citation Graph (0, 0)][DBLP] STOC, 1986, pp:340-349 [Conf] - Michael Ben-Or, Prasoon Tiwari
**A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract)**[Citation Graph (0, 0)][DBLP] STOC, 1988, pp:301-309 [Conf] - Allan Borodin, Prasoon Tiwari
**On the Decidability of Sparse Univariate Polynomial Interpolation (Preliminary Version)**[Citation Graph (0, 0)][DBLP] STOC, 1990, pp:535-545 [Conf] - Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari
**The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract)**[Citation Graph (0, 0)][DBLP] STOC, 1989, pp:574-586 [Conf] - Tak Wah Lam, Prasoon Tiwari, Martin Tompa
**Tradeoffs Between Communication and Space**[Citation Graph (0, 0)][DBLP] STOC, 1989, pp:217-226 [Conf] - Yishay Mansour, Noam Nisan, Prasoon Tiwari
**The Computational Complexity of Universal Hashing**[Citation Graph (0, 0)][DBLP] STOC, 1990, pp:235-243 [Conf] - Deborah Joseph, Joao Meidanis, Prasoon Tiwari
**Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs.**[Citation Graph (0, 0)][DBLP] SWAT, 1992, pp:326-337 [Conf] - Allan Borodin, Prasoon Tiwari
**On the Decidability of Sparse Univariate Polynomial Interpolation.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1991, v:1, n:, pp:67-90 [Journal] - Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari
**Fast Exponentiation Using the Truncation Operation.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1992, v:2, n:, pp:244-255 [Journal] - Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari
**The Electrical Resistance of a Graph Captures its Commute and Cover Times.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1997, v:6, n:4, pp:312-340 [Journal] - Alok Aggarwal, Herbert Edelsbrunner, Prabhakar Raghavan, Prasoon Tiwari
**Optimal Time Bounds for Some Proximity Problems in the Plane.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1992, v:42, n:1, pp:55-60 [Journal] - Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari
**A Tight Bound for Approximating the Square Root.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:63, n:4, pp:211-213 [Journal] - Prasoon Tiwari, Martin Tompa
**A Direct Version of Shamir and Snir's Lower Bounds on Monotone Circuit Depth.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1994, v:49, n:5, pp:243-248 [Journal] - Yishay Mansour, Baruch Schieber, Prasoon Tiwari
**A Lower Bound for Integer Greatest Common Divisor Computations.**[Citation Graph (0, 0)][DBLP] J. ACM, 1991, v:38, n:2, pp:453-471 [Journal] - Prasoon Tiwari
**Lower bounds on communication complexity in distributed computer networks.**[Citation Graph (0, 0)][DBLP] J. ACM, 1987, v:34, n:4, pp:921-938 [Journal] - Prasoon Tiwari
**An Efficient Parallel Algorithm for Shifting the Root of a Depth First Spanning Tree.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1986, v:7, n:1, pp:105-119 [Journal] - Michael Ben-Or, Prasoon Tiwari
**Simple algorithms for approximating all roots of a polynomial with real roots.**[Citation Graph (0, 0)][DBLP] J. Complexity, 1990, v:6, n:4, pp:417-442 [Journal] - Prasoon Tiwari
**A problem that is easier to solve on the unit-cost algebraic RAM.**[Citation Graph (0, 0)][DBLP] J. Complexity, 1992, v:8, n:4, pp:393-397 [Journal] - Tak Wah Lam, Prasoon Tiwari, Martin Tompa
**Trade-Offs between Communication and Space.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1992, v:45, n:3, pp:296-315 [Journal] - Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari
**A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real Roots.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1988, v:17, n:6, pp:1081-1092 [Journal] - Yishay Mansour, Baruch Schieber, Prasoon Tiwari
**Lower Bounds for Computations with the Floor Operation.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1991, v:20, n:2, pp:315-327 [Journal] - Yishay Mansour, Noam Nisan, Prasoon Tiwari
**The Computational Complexity of Universal Hashing.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1993, v:107, n:1, pp:121-133 [Journal] - Bruce Reznick, Prasoon Tiwari, Douglas B. West
**Decomposition of product graphs into complete bipartite subgraphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1985, v:57, n:1-2, pp:189-193 [Journal]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |