default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrasoon Tiwari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j18]Rajesh Tyagi, Weiwei Chen, Jason Black, Prasoon Tiwari, Bernard Lecours, Jamison Shaver:
Transforming Electrical Load from an Operational Constraint to a Controllable Resource. Interfaces 47(4): 292-304 (2017)
1990 – 1999
- 1999
- [c19]Wei Zhao, Marc Willebeek-LeMair, Prasoon Tiwari:
Efficient Adaptive Media Scaling and Streaming of Layered Multimedia in Heterogeneous Environment. ICMCS, Vol. 2 1999: 377-381 - 1997
- [j17]Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo
, Roman Smolensky, Prasoon Tiwari:
The Electrical Resistance of a Graph Captures its Commute and Cover Times. Comput. Complex. 6(4): 312-340 (1997) - [j16]Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
A Tight Bound for Approximating the Square Root. Inf. Process. Lett. 63(4): 211-213 (1997) - 1996
- [c18]Elliot N. Linzer, Prasoon Tiwari, Mohammad Zubair:
High performance algorithms for MPEG motion estimation. ICASSP 1996: 1934-1937 - [c17]Prasoon Tiwari, Eric Viscito:
A parallel MPEG-2 video encoder with look-ahead rate control. ICASSP 1996: 1994-1997 - 1994
- [j15]Prasoon Tiwari, Martin Tompa:
A Direct Version of Shamir and Snir's Lower Bounds on Monotone Circuit Depth. Inf. Process. Lett. 49(5): 243-248 (1994) - [c16]Walter Ludwig, Prasoon Tiwari:
Scheduling Malleable and Nonmalleable Parallel Tasks. SODA 1994: 167-176 - [c15]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. SPAA 1994: 200-209 - 1993
- [j14]Yishay Mansour, Noam Nisan, Prasoon Tiwari:
The Computational Complexity of Universal Hashing. Theor. Comput. Sci. 107(1): 121-133 (1993) - [c14]B. Narendran, Renato De Leone, Prasoon Tiwari:
An Implementation of the epsilon-Relaxation Algorithm on the CM-5. SPAA 1993: 183-192 - 1992
- [j13]Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
Fast Exponentiation Using the Truncation Operation. Comput. Complex. 2: 244-255 (1992) - [j12]Alok Aggarwal, Herbert Edelsbrunner, Prabhakar Raghavan, Prasoon Tiwari:
Optimal Time Bounds for Some Proximity Problems in the Plane. Inf. Process. Lett. 42(1): 55-60 (1992) - [j11]Prasoon Tiwari:
A problem that is easier to solve on the unit-cost algebraic RAM. J. Complex. 8(4): 393-397 (1992) - [j10]Tak Wah Lam, Prasoon Tiwari, Martin Tompa:
Trade-Offs between Communication and Space. J. Comput. Syst. Sci. 45(3): 296-315 (1992) - [c13]B. Narendran, Prasoon Tiwari:
Polynomial Root-Finding: Analysis and Computational Investigation of a Parallel Algorithm. SPAA 1992: 178-187 - [c12]Deborah Joseph, Joao Meidanis, Prasoon Tiwari:
Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs. SWAT 1992: 326-337 - 1991
- [j9]Allan Borodin, Prasoon Tiwari:
On the Decidability of Sparse Univariate Polynomial Interpolation. Comput. Complex. 1: 67-90 (1991) - [j8]Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
A Lower Bound for Integer Greatest Common Divisor Computations. J. ACM 38(2): 453-471 (1991) - [j7]Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
Lower Bounds for Computations with the Floor Operation. SIAM J. Comput. 20(2): 315-327 (1991) - 1990
- [j6]Michael Ben-Or, Prasoon Tiwari:
Simple algorithms for approximating all roots of a polynomial with real roots. J. Complex. 6(4): 417-442 (1990) - [c11]Yishay Mansour, Noam Nisan, Prasoon Tiwari:
The Computational Complexity of Universal Hashing. SCT 1990: 90 - [c10]Yishay Mansour, Noam Nisan, Prasoon Tiwari:
The Computational Complexity of Universal Hashing. STOC 1990: 235-243 - [c9]Allan Borodin, Prasoon Tiwari:
On the Decidability of Sparse Univariate Polynomial Interpolation (Preliminary Version). STOC 1990: 535-545
1980 – 1989
- 1989
- [c8]Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
The Complexity of Approximating the Square Root (Extended Summary). FOCS 1989: 325-330 - [c7]Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
Lower Bounds for Computations with the Floor Operation. ICALP 1989: 559-573 - [c6]Tak Wah Lam, Prasoon Tiwari, Martin Tompa:
Tradeoffs Between Communication and Space. STOC 1989: 217-226 - [c5]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). STOC 1989: 574-586 - 1988
- [j5]Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari:
A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real Roots. SIAM J. Comput. 17(6): 1081-1092 (1988) - [c4]Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
Lower Bounds for Integer Greatest Common Divisor Computations (Extended Summary). FOCS 1988: 54-63 - [c3]Michael Ben-Or, Prasoon Tiwari:
A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract). STOC 1988: 301-309 - 1987
- [j4]Prasoon Tiwari:
Lower bounds on communication complexity in distributed computer networks. J. ACM 34(4): 921-938 (1987) - 1986
- [b1]Prasoon Tiwari:
The Communication Complexity of Distributed Computing and a Parallel Algorithm for Polynomial Roots. University of Illinois Urbana-Champaign, USA, 1986 - [j3]Alan J. Goldman, Prasoon Tiwari:
Allowable processing orders in the accelerated cascade algorithm. Discret. Appl. Math. 13(2-3): 213-221 (1986) - [j2]Prasoon Tiwari:
An Efficient Parallel Algorithm for Shifting the Root of a Depth First Spanning Tree. J. Algorithms 7(1): 105-119 (1986) - [c2]Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari:
A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots. STOC 1986: 340-349 - 1985
- [j1]Bruce Reznick, Prasoon Tiwari, Douglas B. West:
Decomposition of product graphs into complete bipartite subgraphs. Discret. Math. 57(1-2): 189-193 (1985) - 1984
- [c1]Prasoon Tiwari:
Lower Bounds on Communication Complexity in Distributed Computer Networks (Preliminary Version). FOCS 1984: 109-117
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
