| Inducing and exploiting activation sparsity for fast inference on deep neural networks M Kurtz, J Kopinsky, R Gelashvili, A Matveev, J Carr, M Goin, W Leiserson, ... International Conference on Machine Learning, 5533-5543, 2020 | 170 | 2020 |
| The spraylist: A scalable relaxed priority queue D Alistarh, J Kopinsky, J Li, N Shavit Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of …, 2015 | 151 | 2015 |
| Distributionally linearizable data structures D Alistarh, T Brown, J Kopinsky, JZ Li, G Nadiradze Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018 | 37 | 2018 |
| The power of choice in priority scheduling D Alistarh, J Kopinsky, J Li, G Nadiradze Proceedings of the ACM Symposium on Principles of Distributed Computing, 283-292, 2017 | 35 | 2017 |
| System and method for executing convolution in a neural network J Kopinsky US Patent 11,544,559, 2023 | 19 | 2023 |
| Relaxed schedulers can efficiently parallelize iterative algorithms D Alistarh, T Brown, J Kopinsky, G Nadiradze Proceedings of the 2018 ACM symposium on principles of distributed computing …, 2018 | 18 | 2018 |
| Systems and methods for generation of sparse code for convolutional neural networks A Zlateski, J Kopinsky US Patent 11,216,732, 2022 | 14 | 2022 |
| Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible Z Abel, J Bosboom, M Coulombe, ED Demaine, L Hamilton, A Hesterberg, ... Theoretical Computer Science 839, 41-102, 2020 | 13 | 2020 |
| Path puzzles: Discrete tomography with a path constraint is hard J Bosboom, ED Demaine, ML Demaine, A Hesterberg, R Kimball, ... Graphs and Combinatorics 36 (2), 251-267, 2020 | 10 | 2020 |
| Inherent limitations of hybrid transactional memory D Alistarh, J Kopinsky, P Kuznetsov, S Ravi, N Shavit International Symposium on Distributed Computing, 185-199, 2015 | 9 | 2015 |
| Inherent limitations of hybrid transactional memory D Alistarh, J Kopinsky, P Kuznetsov, S Ravi, N Shavit Distributed Computing 31, 167-185, 2018 | 7 | 2018 |
| The parameterized complexity of ricochet robots A Hesterberg, J Kopinsky Journal of Information Processing 25, 716-723, 2017 | 7 | 2017 |
| Infinite all-layers simple foldability HA Akitaya, C Avery, J Bergeron, ED Demaine, J Kopinsky, JS Ku Graphs and Combinatorics 36, 231-244, 2020 | 5 | 2020 |
| System and method of accelerating execution of a neural network A Matveev, D Alistarh, J Kopinsky, R Gelashvili, M Kurtz, N Shavit US Patent 11,195,095, 2021 | 4 | 2021 |
| Recursed is not recursive: A jarring result E Demaine, J Kopinsky, J Lynch arXiv preprint arXiv:2002.05131, 2020 | 4 | 2020 |
| Relaxed concurrent ordering structures J Kopinsky Massachusetts Institute of Technology, 2018 | 4 | 2018 |
| MazezaM levels with exponentially long solutions A Greenblatt, J Kopinsky, B North, M Tyrrell, A Williams 20th Japan Conference on Discrete and Computational Geometry, Graphs, and …, 2017 | 4 | 2017 |
| System and method of accelerating execution of a neural network A Matveev, D Alistarh, J Kopinsky, R Gelashvili, M Kurtz, N Shavit US Patent 11,797,855, 2023 | | 2023 |
| Systems and methods for generation of sparse code for convolutional neural networks A Zlateski, J Kopinsky US Patent 10,963,787, 2021 | | 2021 |
| 9th International Conference on Fun with Algorithms (FUN 2018) M Farach-Colton, K Sugihara, Z Abel, J Bosboom, ED Demaine, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2018 | | 2018 |
Dan AlistarhIST AustriaVerified email at ist.ac.at