Special Issue on Randomized Computing.
- Published in:
- International Journal of Foundations of Computer Science, 2000, v. 11, n. 2, p. 205, doi. 10.1142/S0129054100000120
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 2000 AND VI 11 AND IP 2
Results: 8
1
2
Connectivity Properties in Random Regular Graphs with Edge Faults.
- Published in:
- International Journal of Foundations of Computer Science, 2000, v. 11, n. 2, p. 247, doi. 10.1142/S0129054100000156
- By:
- Publication type:
- Article
3
The Operators min and max on the Polynomial Hierarchy.
- Published in:
- International Journal of Foundations of Computer Science, 2000, v. 11, n. 2, p. 315, doi. 10.1142/S0129054100000181
- By:
- Publication type:
- Article
4
A Method for Evaluating the Expected Load of Dynamic Tree Embeddings in Hypercubes.
- Published in:
- International Journal of Foundations of Computer Science, 2000, v. 11, n. 2, p. 207, doi. 10.1142/S0129054100000132
- By:
- Publication type:
- Article
5
On the Dealer's Randomness Required in Perfect Secret Sharing Schemes with Access Structures of Constant Rank.
- Published in:
- International Journal of Foundations of Computer Science, 2000, v. 11, n. 2, p. 263, doi. 10.1142/S0129054100000168
- By:
- Publication type:
- Article
6
Languages for Reactive Specifications: Synchrony vs Asynchrony.
- Published in:
- International Journal of Foundations of Computer Science, 2000, v. 11, n. 2, p. 283, doi. 10.1142/S012905410000017X
- By:
- Publication type:
- Article
7
Finding Small Equivalent Decision Trees is Hard.
- Published in:
- International Journal of Foundations of Computer Science, 2000, v. 11, n. 2, p. 343, doi. 10.1142/S0129054100000193
- By:
- Publication type:
- Article
8
Random Seeking: A General, Efficient and Informed Randomized Scheme for Dynamic Load Balancing.
- Published in:
- International Journal of Foundations of Computer Science, 2000, v. 11, n. 2, p. 231, doi. 10.1142/S0129054100000144
- By:
- Publication type:
- Article