Share This Author
An improved exponential-time algorithm for k-SAT
- R. Paturi, P. Pudlák, M. Saks, F. Zane
- Computer ScienceProceedings 39th Annual Symposium on Foundations…
- 1 May 2005
It is shown that, for each k, the running time of ResolveSat on a k-CNF formula is significantly better than 2/sup n/, even in the worst case, and the idea of succinctly encoding satisfying solutions can be applied to obtain lower bounds on circuit site.
The cell probe complexity of dynamic data structures
New lower and upper bounds on the time per operation are proved to implement solutions to some familiar dynamic data structure problems including list representation, subset ranking, partial sums, and the set union problem.
Low diameter graph decompositions
It is shown that this trade-off between the number of blocks and the diameter is nearly best possible, for two families of graphs: the first consists of skeletons of certain triangulations of a simplex and the second consists of grid graphs with added diagonals.
An optimal on-line algorithm for metrical task system
A general model for the processing of sequences of tasks is introduced, and a general on-line decision algorithm is developed, which is shown that, for an important class of special cases, this algorithm is optimal among all on- line algorithms.
Wait-free k-set agreement is impossible: the topology of public knowledge
It is shown that for any k<n, there is no deterministic wait-free protocol for n processors that solves the k-set agreement problem, and a topological structure is revealed that reveals a close analogy between the impossibility ofWait-free k- set agreement and the Brouwer fixed point theorem for thek-dimensional ball.
Probabilistic Boolean decision trees and the complexity of evaluating game trees
- M. Saks, A. Wigderson
- Computer Science27th Annual Symposium on Foundations of Computer…
- 27 October 1986
A randomized variant of alphabeta pruning is analyzed, it is shown that it is considerably faster than the deterministic one in worst case, and it is proved optimal for uniform trees.
Weak monotonicity suffices for truthfulness on convex domains
The more general result is shown, conjectured by Lavi, Mu'alem and Nisan, that weak monotonicity is sufficient for functions defined on any convex domain.
An optimal online algorithm for metrical task systems
A general model for the processing of sequences of tasks and a general online decision algorithm are introduced and it is shown that this algorithm is optimal among all online algorithms.