Justin Kopinsky

Most-cited papers

Inducing and Exploiting Activation Sparsity for Fast Inference on Deep Neural Networks
Mark Kurtz, Justin Kopinsky, Rati Gelashvili, A. Matveev +6 more
2020International Conference on Machine Learning176 citations
Semantic Scholar
The SprayList: a scalable relaxed priority queue
Dan Alistarh, Justin Kopinsky, Jerry Li, N. Shavit
2015ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming118 citations Open access
Semantic Scholar
Distributionally Linearizable Data Structures
Dan Alistarh, Trevor Brown, Justin Kopinsky, J. Li +1 more
2018ACM Symposium on Parallelism in Algorithms and Architectures35 citations Open access
Semantic Scholar
The Power of Choice in Priority Scheduling
Dan Alistarh, Justin Kopinsky, Jerry Li, Giorgi Nadiradze
2017ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing35 citations Open access
Semantic Scholar
Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference
Mark Kurtz, Justin Kopinsky, Rati Gelashvili, A. Matveev +6 more
202018 citations
Semantic Scholar
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
Zachary Abel, Jeffrey Bosboom, Michael J. Coulombe, E. Demaine +6 more
2018Fun with Algorithms12 citations Open access
Semantic Scholar
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms
Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze
2018ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing11 citations Open access
Semantic Scholar
Inherent limitations of hybrid transactional memory
Dan Alistarh, Justin Kopinsky, P. Kuznetsov, Srivatsan Ravi +1 more
2014Distributed computing10 citations Open access
Semantic Scholar
Path Puzzles: Discrete Tomography with a Path Constraint is Hard
Jeffrey Bosboom, E. Demaine, M. Demaine, Adam Hesterberg +2 more
2018Graphs and Combinatorics9 citations Open access
Semantic Scholar
The Parameterized Complexity of Ricochet Robots
Adam Hesterberg, Justin Kopinsky
2017Journal of Information Processing6 citations Open access
Semantic Scholar
Fast long lived renaming
Justin Kopinsky
20145 citations
Semantic Scholar
Recursed is not Recursive: A Jarring Result
E. Demaine, Justin Kopinsky, J. Lynch
2020International Symposium on Algorithms and Computation4 citations
Semantic Scholar
Relaxed concurrent ordering structures
Justin Kopinsky
20184 citations
Semantic Scholar
Infinite All-Layers Simple Foldability
H. Akitaya, C. Avery, Josephat Bergeron, E. Demaine +2 more
2019Graphs and Combinatorics3 citations Open access
Semantic Scholar
Inherent limitations of hybrid transactional memory
Dan Alistarh, Justin Kopinsky, P. Kuznetsov, Srivatsan Ravi +1 more
2017Distributed computing1 citations
Semantic Scholar
The SprayList : a scalable relaxed priority queue Citation
Dan Alistarh, Justin Kopinsky, N. Shavit
20141 citations
Semantic Scholar
The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm
Dan Alistarh, Justin Kopinsky, A. Matveev, N. Shavit
2014IEEE International Conference on Distributed Computing Systems0 citations Open access
Semantic Scholar