| Transforming Electrical Load from an Operational Constraint to a Controllable Resource | 0 | 0.34 | 2017 |
| Efficient Adaptive Media Scaling and Streaming of Layered Multimedia in Heterogeneous Environment | 9 | 1.22 | 1999 |
| A tight bound for approximating the square root | 1 | 0.37 | 1997 |
| The electrical resistance of a graph captures its commute and cover times | 164 | 40.32 | 1997 |
| A direct version of Shamir and Snir's lower bounds on monotone circuit depth | 12 | 1.76 | 1994 |
| Scheduling parallel tasks to minimize average response time | 29 | 3.23 | 1994 |
| Scheduling malleable and nonmalleable parallel tasks | 51 | 3.78 | 1994 |
| An implementation of the &egr;-relaxation algorithm on the CM-5 | 0 | 0.34 | 1993 |
| The computational complexity of universal hashing | 95 | 15.29 | 1993 |
| Optimal time bounds for some proximity problems in the plane | 12 | 1.08 | 1992 |
| Polynomial root-finding: analysis and computational investigation of a parallel algorithm | 5 | 0.54 | 1992 |
| Fast Exponentiation Using the Truncation Operation | 5 | 0.49 | 1992 |
| Trade-offs between communication and space | 8 | 1.31 | 1992 |
| Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs | 21 | 1.39 | 1992 |
| A problem that is easier to solve on the unit-cost algebraic RAM | 22 | 1.50 | 1992 |
| A lower bound for integer greatest common divisor computations | 16 | 2.45 | 1991 |
| On the Decidability of Sparse Univariate Polynomial Interpolation (Preliminary Version) | 4 | 1.29 | 1990 |
| Simple algorithms for approximating all roots of a polynomial with real roots | 23 | 2.76 | 1990 |
| Lower bounds for computations with the floor operation | 18 | 2.11 | 1989 |
| Tradeoffs between communication and space | 8 | 2.61 | 1989 |
| The Complexity of Approximating the Square Root (Extended Summary) | 2 | 0.54 | 1989 |
| The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract) | 2 | 0.53 | 1989 |
| Lower Bounds for Integer Greatest Common Divisor Computations (Extended Summary) | 0 | 0.34 | 1988 |
| A fast parallel algorithm for determining all roots of a polynomial with real roots | 28 | 3.07 | 1988 |
| A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract) | 19 | 3.48 | 1988 |
| Lower bounds on communication complexity in distributed computer networks | 25 | 2.46 | 1987 |
| An efficient parallel algorithm for shifting the root of a depth first spanning tree | 6 | 0.71 | 1986 |
| Decomposition Of Product Graphs Into Complete Bipartite Subgraphs | 3 | 0.70 | 1985 |
| Lower Bounds on Communication Complexity in Distributed Computer Networks (Preliminary Version) | 4 | 0.84 | 1984 |
