10608 search results - page 163 / 2122 » Complexity of O'Hara's Algorithm |
136
click to vote
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
130
click to vote
SBCCI
2009
ACM
15 years 8 months ago
2009
ACM
The multiplication of a variable by multiple constants, i.e., the multiple constant multiplications (MCM), has been a central operation and performance bottleneck in many applicat...
115
Voted
WDAG
1990
Springer
15 years 7 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
122
click to vote
IJAC
2007
15 years 3 months ago
2007
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
255
click to vote
STOC
2012
ACM
13 years 5 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...