publication venue for
- Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields. 45:1433-1447. 2016
- Link Reversal Routing with Binary Link Labels: Work Complexity. 42:634-661. 2013
- EFFICIENT STREAM SAMPLING FOR VARIANCE-OPTIMAL ESTIMATION OF SUBSET SUMS. 40:1402-1431. 2011
-
An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to $mathbf{VP}
eqmathbf{VNP}$. 40:1179-1209. 2011 - Multiwriter Consistency Conditions for Shared Memory Registers. 40:28-62. 2011
- Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms. 38:2526-2547. 2009
- Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. 37:1077-1106. 2007
- The Rectilinear Steiner Arborescence Problem Is NP-Complete. 35:729-740. 2005
- The Impact of Timing Knowledge on the Session Problem. 32:1007-1039. 2003
- A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling. 31:1-17. 2001
- Diagnosis of Wiring Networks: An Optimal Randomized Algorithm for Finding Connected Components of Unknown Graphs. 28:1541-1551. 1999
- Circuit Bottom Fan-in and Computational Power. 27:341-355. 1998
- A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees. 27:302-316. 1998
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds. 27:247-290. 1998
- Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies. 27:65-89. 1998
- The Maximum Partition Matching Problem with Applications. 28:935-954. 1998
- On the Amount of Nondeterminism and the Power of Verifying. 26:733-750. 1997
- Bounds on the Costs of Multivalued Register Implementations. 23:335-354. 1994
- Reversal Complexity. 20:622-638. 1991