Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Tiwari, Prasoon"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A tight bound for approximating the square root
Nader H. Bshouty
,
Yishay Mansour
,
Baruch Schieber
,
Prasoon Tiwari
Information Processing Letters
63
(4), 1997, pp. 211-213
Scheduling malleable and nonmalleable parallel tasks
Walter Ludwig
,
Prasoon Tiwari
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 167-176
A direct version of Shamir and Snir's lower bounds on monotone circuit depth
Prasoon Tiwari
,
Martin Tompa
Information Processing Letters
49
, 1994, pp. 243-248
Scheduling parallelizable tasks to minimize average response time
John Turek
,
Walter Ludwig
,
Joel L. Wolf
,
Lisa Fleischer
,
Prasoon Tiwari
,
Jason Glasgow
,
Uwe Schwiegelshohn
,
Philip S. Yu
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'94 (Cape May, New Jersey, June 27-29, 1994)
, 1994, pp. 200-209
The computational complexity of universal hashing
Yishay Mansour
,
Noam Nisan
,
Prasoon Tiwari
Theoretical Computer Science
107
, 1993, pp. 121-133
Optimal time bounds for some proximity problems in the plane
Alok Aggarwal
,
Herbert Edelsbrunner
,
Prabhakar Raghavan
,
Prasoon Tiwari
Information Processing Letters
42
, 1992, pp. 55-60
Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
Deborah Joseph
,
Joao Meidanis
,
Prasoon Tiwari
Lecture Notes in Computer Science
621
, 1992, pp. 326-337
Trade-offs between communication and space
Tak Lam
,
Prasoon Tiwari
,
Martin Tompa
Journal of Computer and System Sciences
45
, 1992, pp. 296-315
Polynomial root-finding: Analysis and computational investigation of a parallel algorithm
B. Narendran
,
Prasoon Tiwari
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'92 (San Diego, California, June 29 - July 1, 1992)
, 1992, pp. 178-187
A problem that is easier to solve on the unit-cost algebraic RAM
Prasoon Tiwari
Journal of Complexity
8
(4), 1992, pp. 393-397
Lower bounds for computations with the floor operation
Yishay Mansour
,
Baruch Schieber
,
Prasoon Tiwari
SIAM Journal on Computing
20
(2), 1991, April, pp. 315-327
Simple algorithms for approximating all roots of a polynomial with real roots
Michael Ben-Or
,
Prasoon Tiwari
Journal of Complexity
6
, 1990, pp. 417-442
The electrical resistance of a graph captures its commute and cover times
Ashok K. Chandra
,
Prabhakar Raghavan
,
Walter L. Ruzzo
,
Roman Smolensky
,
Prasoon Tiwari
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, STOC'89 (Seattle, Washington, May 15-17, 1989)
, 1989, pp. 574-586
Tradeoffs between communication and space
Tak Lam
,
Prasoon Tiwari
,
Martin Tompa
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, STOC'89 (Seattle, Washington, May 15-17, 1989)
, 1989, pp. 217-226
A fast parallel algorithm for determining all roots of a polynomial with real roots
Michael Ben-Or
,
Ephraim Feig
,
Dexter Kozen
,
Prasoon Tiwari
SIAM Journal on Computing
17
, 1988, pp. 1081-1092
A deterministic algorithm for sparse multivariate polynomial interpolation
Michael Ben-Or
,
Prasoon Tiwari
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC'88 (Chicago, IL, May 2-4, 1988)
, 1988, pp. 301-309
Lower bounds on communication complexity in distributed computer networks
Prasoon Tiwari
Journal of the ACM
34
(4), 1987, October, pp. 921-938
Allowable processing orders in the accelerated cascade algorithm
A.J. Goldman
,
Prasoon Tiwari
Discrete Applied Mathematics
13
, 1986, pp. 213-221
An efficient parallel algorithm for shifting the root of a depth first spanning tree
Prasoon Tiwari
Journal of Algorithms
7
, 1986, pp. 105-119