Justin Kopinsky
From MaRDI portal
Person:2196562
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Recursed Is Not Recursive: A Jarring Result (available as arXiv preprint) | 2023-11-14 | Paper |
| Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible Theoretical Computer Science | 2020-09-03 | Paper |
| Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible (available as arXiv preprint) | 2020-08-11 | Paper |
| Infinite all-layers simple foldability Graphs and Combinatorics | 2020-04-03 | Paper |
| Path puzzles: discrete tomography with a path constraint is hard Graphs and Combinatorics | 2020-04-03 | Paper |
| Relaxed schedulers can efficiently parallelize iterative algorithms Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| The power of choice in priority scheduling Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Research outcomes over time
This page was built for person: Justin Kopinsky
