2168 search results - page 2 / 434 » Randomized Algorithms and Complexity Theory |
DFG
1992
Springer
14 years 3 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
SPAA
2010
ACM
13 years 11 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
KES
2010
Springer
13 years 9 months ago
2010
Springer
We develop a methodology to grasp temporal trend in a stock market that changes year to year, or sometimes within a year depending on numerous factors. For this purpose, we employ ...
CSL
1990
Springer
14 years 2 months ago
1990
Springer
This is an attempt to simplify and justify the notions of deterministicand randomized reductions, an attempt to derive these notions from (more or less) rst principles.
JCST
2010
13 years 5 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...