Search results
Results: 130
Number of items: 130
-
Bergstra, J. A., & Middelburg, C. A. (2016). On instruction sets for Boolean registers in program algebra. Scientific Annals of Computer Science, 26(1), 1-26. https://doi.org/10.7561/SACS.2016.1.1 -
Bergstra, J. A., & Middelburg, C. A. (2015). On algorithmic equivalence of instruction sequences for computing bit string functions. Fundamenta Informaticae, 138(4), 411-434. https://doi.org/10.3233/FI-2015-1219
-
Bergstra, J. A., & Middelburg, C. A. (2015). On instruction sets for Boolean registers in program algebra. ArXiv. https://arxiv.org/abs/1502.00238v1
-
Bergstra, J. A., & Middelburg, C. A. (2015). Probabilistic thread algebra. Scientific Annals of Computer Science, 25(2), 211-243. https://doi.org/10.7561/SACS.2015.2.211
-
Bergstra, J. A., & Middelburg, C. A. (2015). Division by zero in non-involutive meadows. Journal of Applied Logic, 13(1), 1-12. https://doi.org/10.1016/j.jal.2014.10.001
-
Bergstra, J. A., & Middelburg, C. A. (2014). Instruction sequence size complexity of parity. ArXiv. https://arxiv.org/abs/1412.6787v1
-
Bergstra, J. A., & Middelburg, C. A. (2014). A Thread Algebra with Probabilistic Features. Informatics Institute, University of Amsterdam. http://arxiv.org/abs/1409.6873
-
Bergstra, J. A., & Middelburg, C. A. (2014). A Hoare-like logic of asserted single-pass instruction sequences. ArXiv. http://arxiv.org/abs/1408.2955v1
-
Bergstra, J. A., & Middelburg, C. A. (2014). On algorithmic equivalence of instruction sequences for computing bit string functions. ArXiv. http://arxiv.org/abs/1402.4950v2
-
Bergstra, J., & Middelburg, C. (2014). Instruction sequence based non-uniform complexity classes. Scientific Annals of Computer Science, 24(1), 47-89. https://doi.org/10.7561/SACS.2014.1.47
Page 4 of 13