Justin Kopinsky

ORCID

Publication Activity (10 Years)

Years Active: 2014-2020
Publications (10 Years): 18

Top Venues

Massachusetts Institute of Technology, Cambridge, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, USA

PHD

Publications

Erik D. Demaine, Justin Kopinsky, Jayson Lynch
Recursed is not Recursive: A Jarring Result. CoRR (2020)
Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Roderick Kimball, Justin Kopinsky
Path Puzzles: Discrete Tomography with a Path Constraint is Hard. Graphs Comb. 36 (2) (2020)
Erik D. Demaine, Justin Kopinsky, Jayson Lynch
Recursed Is Not Recursive: A Jarring Result. ISAAC (2020)
Hugo A. Akitaya, Cordelia Avery, Joseph Bergeron, Erik D. Demaine, Justin Kopinsky, Jason S. Ku
Infinite All-Layers Simple Foldability. Graphs Comb. 36 (2) (2020)
Zachary Abel, Jeffrey Bosboom, Michael J. Coulombe, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy, Clemens Thielen
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. Theor. Comput. Sci. 839 (2020)
Mark Kurtz, Justin Kopinsky, Rati Gelashvili, Alexander Matveev, John Carr, Michael Goin, William M. Leiserson, Sage Moore, Nir Shavit, Dan Alistarh
Inducing and Exploiting Activation Sparsity for Fast Inference on Deep Neural Networks. ICML (2020)
Hugo A. Akitaya, Cordelia Avery, Joseph Bergeron, Erik D. Demaine, Justin Kopinsky, Jason S. Ku
Infinite All-Layers Simple Foldability. CoRR (2019)
Dan Alistarh, Trevor Brown, Justin Kopinsky, Jerry Zheng Li, Giorgi Nadiradze
Distributionally Linearizable Data Structures. SPAA (2018)
Zachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. CoRR (2018)
Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms. CoRR (2018)
Dan Alistarh, Trevor Brown, Justin Kopinsky, Jerry Zheng Li, Giorgi Nadiradze
Distributionally Linearizable Data Structures. CoRR (2018)
Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Roderick Kimball, Justin Kopinsky
Path Puzzles: Discrete Tomography with a Path Constraint is Hard. CoRR (2018)
Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, Nir Shavit
Inherent limitations of hybrid transactional memory. Distributed Comput. 31 (3) (2018)
Zachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. FUN (2018)
Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms. PODC (2018)
Dan Alistarh, Justin Kopinsky, Jerry Li, Giorgi Nadiradze
The Power of Choice in Priority Scheduling. CoRR (2017)
Dan Alistarh, Justin Kopinsky, Jerry Li, Giorgi Nadiradze
The Power of Choice in Priority Scheduling. PODC (2017)
Adam Hesterberg, Justin Kopinsky
The Parameterized Complexity of Ricochet Robots. J. Inf. Process. 25 (2017)
Dan Alistarh, Justin Kopinsky, Jerry Li, Nir Shavit
The SprayList: a scalable relaxed priority queue. PPOPP (2015)
Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, Nir Shavit
Inherent Limitations of Hybrid Transactional Memory. DISC (2015)
Dan Alistarh, Justin Kopinsky, Alexander Matveev, Nir Shavit
The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm. CoRR (2014)
Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, Nir Shavit
Inherent Limitations of Hybrid Transactional Memory. CoRR (2014)
Dan Alistarh, Justin Kopinsky, Alexander Matveev, Nir Shavit
The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm. ICDCS (2014)

Justin Kopinsky.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Justin Kopinsky