Dan Alistarh
Dan Alistarh
IST Austria
在 csail.mit.edu 的電子郵件地址已通過驗證 - 首頁
標題引用次數年份
QSGD: Communication-efficient SGD via gradient quantization and encoding
D Alistarh, D Grubic, J Li, R Tomioka, M Vojnovic
Advances in Neural Information Processing Systems, 1709-1720, 2017
150*2017
The SprayList: A scalable relaxed priority queue
D Alistarh, J Kopinsky, J Li, N Shavit
ACM SIGPLAN Notices 50 (8), 11-20, 2015
672015
Fast and exact majority in population protocols
D Alistarh, R Gelashvili, M Vojnović
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015
622015
Zipml: Training linear models with end-to-end low precision, and a little bit of deep learning
H Zhang, J Li, K Kara, D Alistarh, J Liu, C Zhang
Proceedings of the 34th International Conference on Machine Learning-Volume …, 2017
61*2017
Time-space trade-offs in population protocols
D Alistarh, J Aspnes, D Eisenstat, R Gelashvili, RL Rivest
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
522017
Tight bounds for asynchronous renaming
D Alistarh, J Aspnes, K Censor-Hillel, S Gilbert, R Guerraoui
Journal of the ACM (JACM) 61 (3), 18, 2014
52*2014
Model compression via distillation and quantization
A Polino, R Pascanu, D Alistarh
ICLR 2018, 2018
502018
Polylogarithmic-time leader election in population protocols
D Alistarh, R Gelashvili
International Colloquium on Automata, Languages, and Programming, 479-491, 2015
462015
Fast randomized test-and-set and renaming
D Alistarh, H Attiya, S Gilbert, A Giurgiu, R Guerraoui
International Symposium on Distributed Computing, 94-108, 2010
442010
Space-optimal majority in population protocols
D Alistarh, J Aspnes, R Gelashvili
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
39*2018
Stacktrack: An automated transactional approach to concurrent memory reclamation
D Alistarh, P Eugster, M Herlihy, A Matveev, N Shavit
Proceedings of the Ninth European Conference on Computer Systems, 25, 2014
382014
Are lock-free concurrent algorithms practically wait-free?
D Alistarh, K Censor-Hillel, N Shavit
Journal of the ACM (JACM) 63 (4), 31, 2016
362016
Sub-logarithmic test-and-set against a weak adversary
D Alistarh, J Aspnes
International Symposium on Distributed Computing, 97-109, 2011
362011
Optimal-time adaptive strong renaming, with applications to counting
D Alistarh, J Aspnes, K Censor-Hillel, S Gilbert, M Zadimoghaddam
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011
312011
FPGA-accelerated dense linear machine learning: A precision-convergence trade-off
K Kara, D Alistarh, G Alonso, O Mutlu, C Zhang
2017 IEEE 25th Annual International Symposium on Field-Programmable Custom …, 2017
262017
Byzantine stochastic gradient descent
D Alistarh, Z Allen-Zhu, J Li
Advances in Neural Information Processing Systems, 4613-4623, 2018
222018
How to allocate tasks asynchronously
D Alistarh, MA Bender, S Gilbert, R Guerraoui
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 331-340, 2012
192012
Threadscan: Automatic and scalable memory reclamation
D Alistarh, W Leiserson, A Matveev, N Shavit
ACM Transactions on Parallel Computing (TOPC) 4 (4), 18, 2018
182018
How efficient can gossip be?(on the cost of resilient information exchange)
D Alistarh, S Gilbert, R Guerraoui, M Zadimoghaddam
International Colloquium on Automata, Languages, and Programming, 115-126, 2010
162010
The convergence of sparsified gradient methods
D Alistarh, T Hoefler, M Johansson, N Konstantinov, S Khirirat, C Renggli
Advances in Neural Information Processing Systems, 5973-5983, 2018
152018
系統目前無法執行作業,請稍後再試。
文章 1–20