dblp.uni-trier.dewww.uni-trier.de

Prasoon Tiwari

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

1999
33EEWei 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
32 Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari: The Electrical Resistance of a Graph Captures its Commute and Cover Times. Computational Complexity 6(4): 312-340 (1997)
31EENader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari: A Tight Bound for Approximating the Square Root. Inf. Process. Lett. 63(4): 211-213 (1997)
1994
30 Walter Ludwig, Prasoon Tiwari: Scheduling Malleable and Nonmalleable Parallel Tasks. SODA 1994: 167-176
29EEJohn 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
28 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)
1993
27EEB. Narendran, Renato De Leone, Prasoon Tiwari: An Implementation of the epsilon-Relaxation Algorithm on the CM-5. SPAA 1993: 183-192
26 Yishay Mansour, Noam Nisan, Prasoon Tiwari: The Computational Complexity of Universal Hashing. Theor. Comput. Sci. 107(1): 121-133 (1993)
1992
25EEB. Narendran, Prasoon Tiwari: Polynomial Root-Finding: Analysis and Computational Investigation of a Parallel Algorithm. SPAA 1992: 178-187
24 Deborah Joseph, Joao Meidanis, Prasoon Tiwari: Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs. SWAT 1992: 326-337
23 Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari: Fast Exponentiation Using the Truncation Operation. Computational Complexity 2: 244-255 (1992)
22 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)
21EEPrasoon Tiwari: A problem that is easier to solve on the unit-cost algebraic RAM. J. Complexity 8(4): 393-397 (1992)
20 Tak Wah Lam, Prasoon Tiwari, Martin Tompa: Trade-Offs between Communication and Space. J. Comput. Syst. Sci. 45(3): 296-315 (1992)
1991
19 Allan Borodin, Prasoon Tiwari: On the Decidability of Sparse Univariate Polynomial Interpolation. Computational Complexity 1: 67-90 (1991)
18EEYishay Mansour, Baruch Schieber, Prasoon Tiwari: A Lower Bound for Integer Greatest Common Divisor Computations. J. ACM 38(2): 453-471 (1991)
17 Yishay Mansour, Baruch Schieber, Prasoon Tiwari: Lower Bounds for Computations with the Floor Operation. SIAM J. Comput. 20(2): 315-327 (1991)
1990
16 Yishay Mansour, Noam Nisan, Prasoon Tiwari: The Computational Complexity of Universal Hashing STOC 1990: 235-243
15 Allan Borodin, Prasoon Tiwari: On the Decidability of Sparse Univariate Polynomial Interpolation (Preliminary Version) STOC 1990: 535-545
14 Yishay Mansour, Noam Nisan, Prasoon Tiwari: The Computational Complexity of Universal Hashing. Structure in Complexity Theory Conference 1990: 90
13EEMichael Ben-Or, Prasoon Tiwari: Simple algorithms for approximating all roots of a polynomial with real roots. J. Complexity 6(4): 417-442 (1990)
1989
12 Yishay Mansour, Baruch Schieber, Prasoon Tiwari: The Complexity of Approximating the Square Root (Extended Summary) FOCS 1989: 325-330
11 Yishay Mansour, Baruch Schieber, Prasoon Tiwari: Lower Bounds for Computations with the Floor Operation. ICALP 1989: 559-573
10 Tak Wah Lam, Prasoon Tiwari, Martin Tompa: Tradeoffs Between Communication and Space STOC 1989: 217-226
9 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
8 Yishay Mansour, Baruch Schieber, Prasoon Tiwari: Lower Bounds for Integer Greatest Common Divisor Computations (Extended Summary) FOCS 1988: 54-63
7 Michael Ben-Or, Prasoon Tiwari: A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract) STOC 1988: 301-309
6 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)
1987
5EEPrasoon Tiwari: Lower bounds on communication complexity in distributed computer networks. J. ACM 34(4): 921-938 (1987)
1986
4 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
3 Prasoon Tiwari: An Efficient Parallel Algorithm for Shifting the Root of a Depth First Spanning Tree. J. Algorithms 7(1): 105-119 (1986)
1985
2EEBruce Reznick, Prasoon Tiwari, Douglas B. West: Decomposition of product graphs into complete bipartite subgraphs. Discrete Mathematics 57(1-2): 189-193 (1985)
1984
1 Prasoon Tiwari: Lower Bounds on Communication Complexity in Distributed Computer Networks (Preliminary Version) FOCS 1984: 109-117

Coauthor Index

1Alok Aggarwal [22]
2Michael Ben-Or [4] [6] [7] [13]
3Allan Borodin [15] [19]
4Nader H. Bshouty [23] [31]
5Ashok K. Chandra [9] [32]
6Herbert Edelsbrunner [22]
7Ephraim Feig [4] [6]
8Lisa Fleischer [29]
9Jason Glasgow [29]
10Deborah Joseph [24]
11Dexter Kozen [4] [6]
12Tak Wah Lam [10] [20]
13Renato De Leone [27]
14Walter Ludwig [29] [30]
15Yishay Mansour [8] [11] [12] [14] [16] [17] [18] [23] [26] [31]
16João Meidanis (Joao Meidanis) [24]
17B. Narendran [25] [27]
18Noam Nisan [14] [16] [26]
19Prabhakar Raghavan [9] [22] [32]
20Bruce Reznick [2]
21Walter L. Ruzzo [9] [32]
22Baruch Schieber [8] [11] [12] [17] [18] [23] [31]
23Uwe Schwiegelshohn [29]
24Roman Smolensky [9] [32]
25Martin Tompa [10] [20] [28]
26John Turek [29]
27Douglas B. West [2]
28Marc Willebeek-LeMair [33]
29Joel L. Wolf [29]
30Philip S. Yu [29]
31Wei Zhao [33]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)