AbstractThis paper discusses the probe complexity of randomized algorithms and the deterministic average case probe complexity for some classes of nondominated coteries, including majority, crumbling walls, tree, wheel and hierarchical quorum systems, and presents upper and lower bounds for the probe complexity of quorum systems in these classes
In this dissertation we consider two different notions of randomness and their applications to probl...
There has been a common perception that computational complexity is a theory of "bad news" because i...
grantor: University of TorontoThis thesis studies models and limitations of non-uniform co...
We investigate issues related to the probe complexity of quorum systems and their implementation in ...
It is considered good distributed computing practice to devise object implementations that tolerate ...
Abstract With n servers that independently fail with probability of p < 0.5, it is well known tha...
Abstract-The tree quorum algorithm (TQA) uses a tree structure to generate intersecting (tree) quoru...
It is considered good distributed computing practice to devise object implementations that tolerate ...
Abstract. A.C. Yao proved that in the decision-tree model the average complexity of the best determi...
In this thesis we examine some of the central problems in the theory of computational complexity, l...
The communication complexity of fundamental problems in distributed computing on an asynchronous rin...
In this study, we develop a technique to measure randomness and complexity for various systems. The ...
AbstractA quorum system is a collection of sets (quorums) every two of which intersect. Quorum syste...
AbstractA quorum system is a set system in which any two subsets have nonempty intersection. Quorum ...
This dissertation explores the multifaceted interplay between efficient computation and probability ...
In this dissertation we consider two different notions of randomness and their applications to probl...
There has been a common perception that computational complexity is a theory of "bad news" because i...
grantor: University of TorontoThis thesis studies models and limitations of non-uniform co...
We investigate issues related to the probe complexity of quorum systems and their implementation in ...
It is considered good distributed computing practice to devise object implementations that tolerate ...
Abstract With n servers that independently fail with probability of p < 0.5, it is well known tha...
Abstract-The tree quorum algorithm (TQA) uses a tree structure to generate intersecting (tree) quoru...
It is considered good distributed computing practice to devise object implementations that tolerate ...
Abstract. A.C. Yao proved that in the decision-tree model the average complexity of the best determi...
In this thesis we examine some of the central problems in the theory of computational complexity, l...
The communication complexity of fundamental problems in distributed computing on an asynchronous rin...
In this study, we develop a technique to measure randomness and complexity for various systems. The ...
AbstractA quorum system is a collection of sets (quorums) every two of which intersect. Quorum syste...
AbstractA quorum system is a set system in which any two subsets have nonempty intersection. Quorum ...
This dissertation explores the multifaceted interplay between efficient computation and probability ...
In this dissertation we consider two different notions of randomness and their applications to probl...
There has been a common perception that computational complexity is a theory of "bad news" because i...
grantor: University of TorontoThis thesis studies models and limitations of non-uniform co...
DOI
Add to ORKG