Prasoon Tiwari

According to our database1, Prasoon Tiwari authored at least 34 papers between 1984 and 2017.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Transforming Electrical Load from an Operational Constraint to a Controllable Resource.
Interfaces, 2017

1999
Efficient Adaptive Media Scaling and Streaming of Layered Multimedia in Heterogeneous Environment.
Proceedings of the IEEE International Conference on Multimedia Computing and Systems, 1999

1997
A Tight Bound for Approximating the Square Root.
Inf. Process. Lett., 1997

The Electrical Resistance of a Graph Captures its Commute and Cover Times.
Comput. Complex., 1997

1996
A parallel MPEG-2 video encoder with look-ahead rate control.
Proceedings of the 1996 IEEE International Conference on Acoustics, 1996

High performance algorithms for MPEG motion estimation.
Proceedings of the 1996 IEEE International Conference on Acoustics, 1996

1994
A Direct Version of Shamir and Snir's Lower Bounds on Monotone Circuit Depth.
Inf. Process. Lett., 1994

Scheduling Parallelizable Tasks to Minimize Average Response Time.
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

Scheduling Malleable and Nonmalleable Parallel Tasks.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993
The Computational Complexity of Universal Hashing.
Theor. Comput. Sci., 1993

An Implementation of the epsilon-Relaxation Algorithm on the CM-5.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

1992
Trade-Offs between Communication and Space.
J. Comput. Syst. Sci., 1992

A problem that is easier to solve on the unit-cost algebraic RAM.
J. Complex., 1992

Optimal Time Bounds for Some Proximity Problems in the Plane.
Inf. Process. Lett., 1992

Fast Exponentiation Using the Truncation Operation.
Comput. Complex., 1992

Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs.
Proceedings of the Algorithm Theory, 1992

Polynomial Root-Finding: Analysis and Computational Investigation of a Parallel Algorithm.
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

1991
Lower Bounds for Computations with the Floor Operation.
SIAM J. Comput., 1991

A Lower Bound for Integer Greatest Common Divisor Computations.
J. ACM, 1991

On the Decidability of Sparse Univariate Polynomial Interpolation.
Comput. Complex., 1991

1990
Simple algorithms for approximating all roots of a polynomial with real roots.
J. Complex., 1990

On the Decidability of Sparse Univariate Polynomial Interpolation (Preliminary Version)
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1989
Tradeoffs Between Communication and Space
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

The Complexity of Approximating the Square Root (Extended Summary)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988
A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real Roots.
SIAM J. Comput., 1988

A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Lower Bounds for Integer Greatest Common Divisor Computations (Extended Summary)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987
Lower bounds on communication complexity in distributed computer networks.
J. ACM, 1987

1986
The Communication Complexity of Distributed Computing and a Parallel Algorithm for Polynomial Roots
PhD thesis, 1986

An Efficient Parallel Algorithm for Shifting the Root of a Depth First Spanning Tree.
J. Algorithms, 1986

Allowable processing orders in the accelerated cascade algorithm.
Discret. Appl. Math., 1986

1985
Decomposition of product graphs into complete bipartite subgraphs.
Discret. Math., 1985

1984
Lower Bounds on Communication Complexity in Distributed Computer Networks (Preliminary Version)
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984


  Loading...