Prasoon Tiwari - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 38 from 38

2017

Transforming Electrical Load from an Operational Constraint to a Controllable ResourceRajesh Tyagi, Weiwei Chen, Jason Black, Prasoon Tiwari, Bernard Lecours, Jamison Shaver. interfaces, 47(4):292-304, 2017. [doi]

1999

Efficient Adaptive Media Scaling and Streaming of Layered Multimedia in Heterogeneous EnvironmentWei Zhao, Marc Willebeek-LeMair, Prasoon Tiwari. icmcs 1999: 377-381 [doi]

1997

A Tight Bound for Approximating the Square RootNader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari. ipl, 63(4):211-213, 1997. [doi]

The Electrical Resistance of a Graph Captures its Commute and Cover TimesAshok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari. cc, 6(4):312-340, 1997.

1996

High performance algorithms for MPEG motion estimationElliot N. Linzer, Prasoon Tiwari, Mohammad Zubair. icassp 1996: 1934-1937 [doi]

A parallel MPEG-2 video encoder with look-ahead rate controlPrasoon Tiwari, Eric Viscito. icassp 1996: 1994-1997 [doi]

1994

Scheduling Malleable and Nonmalleable Parallel TasksWalter Ludwig, Prasoon Tiwari. soda 1994: 167-176

A Direct Version of Shamir and Snir s Lower Bounds on Monotone Circuit DepthPrasoon Tiwari, Martin Tompa. ipl, 49(5):243-248, 1994.

Scheduling Parallelizable Tasks to Minimize Average Response TimeJohn Turek, Walter Ludwig, Joel L. Wolf, Lisa Fleischer, Prasoon Tiwari, Jason Glasgow, Uwe Schwiegelshohn, Philip S. Yu. spaa 1994: 200-209 [doi]

1993

The Computational Complexity of Universal HashingYishay Mansour, Noam Nisan, Prasoon Tiwari. TCS, 107(1):121-133, 1993.

An Implementation of the epsilon-Relaxation Algorithm on the CM-5B. Narendran, Renato De Leone, Prasoon Tiwari. spaa 1993: 183-192 [doi]

1992

1991

On the Decidability of Sparse Univariate Polynomial InterpolationAllan Borodin, Prasoon Tiwari. cc, 1:67-90, 1991.

Lower Bounds for Computations with the Floor OperationYishay Mansour, Baruch Schieber, Prasoon Tiwari. SICOMP, 20(2):315-327, 1991.

A Lower Bound for Integer Greatest Common Divisor ComputationsYishay Mansour, Baruch Schieber, Prasoon Tiwari. JACM, 38(2):453-471, 1991. [doi]

1990

Simple algorithms for approximating all roots of a polynomial with real rootsMichael Ben-Or, Prasoon Tiwari. jc, 6(4):417-442, 1990. [doi]

On the Decidability of Sparse Univariate Polynomial Interpolation (Preliminary Version)Allan Borodin, Prasoon Tiwari. stoc 1990: 535-545

The Computational Complexity of Universal HashingYishay Mansour, Noam Nisan, Prasoon Tiwari. stoc 1990: 235-243

The Computational Complexity of Universal HashingYishay Mansour, Noam Nisan, Prasoon Tiwari. cocoon 1990: 90

1989

1988

A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract)Michael Ben-Or, Prasoon Tiwari. stoc 1988: 301-309

A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real RootsMichael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari. SICOMP, 17(6):1081-1092, 1988.

Lower Bounds for Integer Greatest Common Divisor Computations (Extended Summary)Yishay Mansour, Baruch Schieber, Prasoon Tiwari. focs 1988: 54-63

1987

Lower bounds on communication complexity in distributed computer networksPrasoon Tiwari. JACM, 34(4):921-938, 1987. [doi]

1986

A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real RootsMichael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari. stoc 1986: 340-349

Allowable processing orders in the accelerated cascade algorithmA. J. Goldman, Prasoon Tiwari. DAM, 13(2-3):213-221, 1986. [doi]

An Efficient Parallel Algorithm for Shifting the Root of a Depth First Spanning TreePrasoon Tiwari. jal, 7(1):105-119, 1986.

The Communication Complexity of Distributed Computing and a Parallel Algorithm for Polynomial RootsPrasoon Tiwari. PhD thesis, University of Illinois Urbana-Champaign, USA, 1986. [doi]

1985

Decomposition of product graphs into complete bipartite subgraphsBruce Reznick, Prasoon Tiwari, Douglas B. West. DM, 57(1-2):189-193, 1985. [doi]

1984

Lower Bounds on Communication Complexity in Distributed Computer Networks (Preliminary Version)Prasoon Tiwari. focs 1984: 109-117

Sign in or sign up to see more results.

runs on WebDSL