jix.one
| 1. 9. 2021 | Proving 50-Year-Old Sorting Networks Optimal: Part 2 – jix.one |
| 4. 5. 2021 | Proving 50-Year-Old Sorting Networks Optimal: Part 1 – jix.one |
| 3. 10. 2020 | The Assembly Language of Satisfiability – jix.one |
| 4. 5. 2019 | Varisat 0.2.0 Released – jix.one |
| 26. 4. 2019 | Refactoring Varisat: 5. Incremental Solving and Proofs – jix.one |
| 21. 3. 2019 | Refactoring Varisat: 4. Heuristics – jix.one |
| 18. 3. 2019 | Refactoring Varisat: 3. Conflict Driven Clause Learning – jix.one |
| 2. 3. 2019 | Refactoring Varisat: 2. Clause Storage and Unit Propagation – jix.one |
| 3. 2. 2019 | Refactoring Varisat: 1. Basics and Parsing – jix.one |
| 24. 12. 2018 | Introducing partial_ref – jix.one |
| 7. 12. 2018 | Encoding Matrix Rank for SAT Solvers – jix.one |
| 14. 9. 2018 | Varisat 0.1.3: LRAT Generation and Proof Trimming – jix.one |
| 20. 5. 2018 | Introducing Varisat – jix.one |
| 23. 12. 2017 | Not Even Coppersmith’s Attack – jix.one |
| 16. 5. 2017 | Pushing Polygons on the Mega Drive – jix.one |