The Random Bit Complexity of Mobile Robots Scattering.
- Published in:
- International Journal of Foundations of Computer Science, 2017, v. 28, n. 2, p. 111, doi. 10.1142/S0129054117500083
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 2017 AND VI 28 AND IP 2
Results: 6
1
2
Query-Optimal Partially Persistent B-Trees with Constant Worst-Case Update Time.
- Published in:
- International Journal of Foundations of Computer Science, 2017, v. 28, n. 2, p. 141, doi. 10.1142/S0129054117500101
- By:
- Publication type:
- Article
3
Regular Sequences and the Joint Spectral Radius.
- Published in:
- International Journal of Foundations of Computer Science, 2017, v. 28, n. 2, p. 135, doi. 10.1142/S0129054117500095
- By:
- Publication type:
- Article
4
Identifying Generalized Reed-Muller Codewords by Quantum Queries.
- Published in:
- International Journal of Foundations of Computer Science, 2017, v. 28, n. 2, p. 185, doi. 10.1142/S0129054117500125
- By:
- Publication type:
- Article
5
Deterministic Construction of Compressed Sensing Matrices from Codes.
- Published in:
- International Journal of Foundations of Computer Science, 2017, v. 28, n. 2, p. 99, doi. 10.1142/S0129054117500071
- By:
- Publication type:
- Article
6
Some Enumeration Results on Binary 2<sup>n</sup>-Periodic Sequences.
- Published in:
- International Journal of Foundations of Computer Science, 2017, v. 28, n. 2, p. 171, doi. 10.1142/S0129054117500113
- By:
- Publication type:
- Article