# Prasoon Tiwari

According to our database

Collaborative distances:

^{1}, Prasoon Tiwari authored at least 34 papers between 1984 and 2017.Collaborative distances:

## 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

Inf. Process. Lett., 1997

Comput. Complex., 1997

1996

Proceedings of the 1996 IEEE International Conference on Acoustics, 1996

Proceedings of the 1996 IEEE International Conference on Acoustics, 1996

1994

Inf. Process. Lett., 1994

Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993

Theor. Comput. Sci., 1993

Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

1992

J. Comput. Syst. Sci., 1992

J. Complex., 1992

Inf. Process. Lett., 1992

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

SIAM J. Comput., 1991

J. ACM, 1991

Comput. Complex., 1991

1990

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

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

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

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987

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

Discret. Appl. Math., 1986

1985

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