( en | de | ru )

 

Disambiguation of "Kopinsky, Justin"

Author of the publication

copydeleteadd this publication to your clipboard
Infinite All-Layers Simple Foldability.

, , , , , and . Graphs Comb., 36 (2): 231-244 (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Justin Lang

Justin Winter

Justin Möhring

Justin Vollmann

Justin Bayer

 

Other publications of authors with the same name

Inducing and Exploiting Activation Sparsity for Fast Inference on Deep Neural Networks., , , , , , , , , and . ICML, volume 119 of Proceedings of Machine Learning Research, page 5533-5543. PMLR, (2020)The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm., , , and . ICDCS, page 348-357. IEEE Computer Society, (2014)Path Puzzles: Discrete Tomography with a Path Constraint is Hard., , , , , and . Graphs Comb., 36 (2): 251-267 (2020)Infinite All-Layers Simple Foldability., , , , , and . Graphs Comb., 36 (2): 231-244 (2020)Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible., , , , , , , and . FUN, volume 100 of LIPIcs, page 3:1-3:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The SprayList: a scalable relaxed priority queue., , , and . PPoPP, page 11-20. ACM, (2015)Inherent Limitations of Hybrid Transactional Memory., , , , and . DISC, volume 9363 of Lecture Notes in Computer Science, page 185-199. Springer, (2015)The Power of Choice in Priority Scheduling., , , and . PODC, page 283-292. ACM, (2017)Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms., , , and . PODC, page 377-386. ACM, (2018)Distributionally Linearizable Data Structures., , , , and . SPAA, page 133-142. ACM, (2018)