Justin Kopinsky

Orcid: 0000-0003-2062-0998

According to our database1, Justin Kopinsky authored at least 14 papers between 2014 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.
Theor. Comput. Sci., 2020

Path Puzzles: Discrete Tomography with a Path Constraint is Hard.
Graphs Comb., 2020

Infinite All-Layers Simple Foldability.
Graphs Comb., 2020

Recursed Is Not Recursive: A Jarring Result.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Inducing and Exploiting Activation Sparsity for Fast Inference on Deep Neural Networks.
Proceedings of the 37th International Conference on Machine Learning, 2020

2018
Relaxed concurrent ordering structures.
PhD thesis, 2018

Inherent limitations of hybrid transactional memory.
Distributed Comput., 2018

Distributionally Linearizable Data Structures.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017
The Parameterized Complexity of Ricochet Robots.
J. Inf. Process., 2017

The Power of Choice in Priority Scheduling.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2015
The SprayList: a scalable relaxed priority queue.
Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2015

2014
The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm.
Proceedings of the IEEE 34th International Conference on Distributed Computing Systems, 2014


  Loading...