Justin Kopinsky

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