A quadratic speedup theorem for iterative arrays.
- Published in:
- Acta Informatica, 2002, v. 38, n. 11/12, p. 847, doi. 10.1007/s002360200092
- By:
- Publication type:
- Article
Works matching IS 00015903 AND DT 2002 AND VI 38 AND IP 11/12
Results: 6
1
2
Comparing the worst-case efficiency of asynchronous systems with PAFAS.
- Published in:
- Acta Informatica, 2002, v. 38, n. 11/12, p. 735, doi. 10.1007/s00236-002-0094-3
- By:
- Publication type:
- Article
3
Acknowledgement to Referees.
- Published in:
- Acta Informatica, 2002, v. 38, n. 11/12, p. 859, doi. 10.1007/s00236-002-0100-9
- Publication type:
- Article
4
On the complexity of the identification problem in Hamming spaces.
- Published in:
- Acta Informatica, 2002, v. 38, n. 11/12, p. 839, doi. 10.1007/s00236-002-0093-4
- By:
- Publication type:
- Article
5
The size of random bucket trees via urn models.
- Published in:
- Acta Informatica, 2002, v. 38, n. 11/12, p. 813, doi. 10.1007/s00236-002-0096-1
- By:
- Publication type:
- Article
6
Gray visiting Motzkins.
- Published in:
- Acta Informatica, 2002, v. 38, n. 11/12, p. 793, doi. 10.1007/s00236-002-0097-0
- By:
- Publication type:
- Article