71228 search results - page 386 / 14246 » Algorithms |
167
click to vote
STOC
1994
ACM
15 years 11 months ago
1994
ACM
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
189
Voted
SWAT
1994
Springer
15 years 11 months ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
227
click to vote
VISUALIZATION
1992
IEEE
15 years 11 months ago
1992
IEEE
algorithms as networks of modules. The data flow architecture is popular because of the flexibility of mixing calculation modules with display modules, and because of its easy grap...
153
click to vote
FUN
2007
Springer
15 years 11 months ago
2007
Springer
A spoonerism is a sentence in some natural language where the swapping of two letters results in a new sentence with a different meaning. In this paper, we give some efficient algo...
168
click to vote
AAIM
2006
Springer
15 years 11 months ago
2006
Springer
We investigate LP-polytopes generated by mean payoff games and their properties, including the existence of tight feasible solutions of bounded size. We suggest a new associated al...