Dan Alistarh

According to our database1, Dan Alistarh authored at least 81 papers between 2008 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
ThreadScan: Automatic and Scalable Memory Reclamation.
TOPC, 2018

Inherent limitations of hybrid transactional memory.
Distributed Computing, 2018

Communication-efficient randomized consensus.
Distributed Computing, 2018

Distributed Learning over Unreliable Networks.
CoRR, 2018

The Convergence of Sparsified Gradient Methods.
CoRR, 2018

Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.
CoRR, 2018

Distributionally Linearizable Data Structures.
CoRR, 2018

The Transactional Conflict Problem.
CoRR, 2018

Byzantine Stochastic Gradient Descent.
CoRR, 2018

The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.
CoRR, 2018

SparCML: High-Performance Sparse Communication for Machine Learning.
CoRR, 2018

Model compression via distillation and quantization.
CoRR, 2018

Compressive Sensing with Low Precision Data Representation: Radio Astronomy and Beyond.
CoRR, 2018

DataBright: Towards a Global Exchange for Decentralized Data Ownership and Trusted Computation.
CoRR, 2018

The Transactional Conflict Problem.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Distributionally Linearizable Data Structures.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Space-Optimal Majority in Population Protocols.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

A Brief Tutorial on Distributed and Concurrent Machine Learning.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Session details: Session 1B: Shared Memory Theory.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Brief Announcement: Performance Prediction for Coarse-Grained Locking.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.
Proceedings of the 21th International Conference on Extending Database Technology, 2018

2017
Lease/Release: Architectural Support for Scaling Contended Data Structures.
TOPC, 2017

The Power of Choice in Priority Scheduling.
CoRR, 2017

Robust Detection in Leak-Prone Population Protocols.
CoRR, 2017

Space-Optimal Majority in Population Protocols.
CoRR, 2017

Time-Space Trade-offs in Population Protocols.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

The Power of Choice in Priority Scheduling.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

ZipML: Training Linear Models with End-to-End Low Precision, and a Little Bit of Deep Learning.
Proceedings of the 34th International Conference on Machine Learning, 2017

FPGA-Accelerated Dense Linear Machine Learning: A Precision-Convergence Trade-Off.
Proceedings of the 25th IEEE Annual International Symposium on Field-Programmable Custom Computing Machines, 2017

Forkscan: Conservative Memory Reclamation for Modern Operating Systems.
Proceedings of the Twelfth European Conference on Computer Systems, 2017

Robust Detection in Leak-Prone Population Protocols.
Proceedings of the DNA Computing and Molecular Programming - 23rd International Conference, 2017

Towards unlicensed cellular networks in TV white spaces.
Proceedings of the 13th International Conference on emerging Networking EXperiments and Technologies, 2017

2016
Are Lock-Free Concurrent Algorithms Practically Wait-Free?
J. ACM, 2016

ZipML: An End-to-end Bitwise Framework for Dense Generalized Linear Models.
CoRR, 2016

Time-Space Trade-offs in Population Protocols.
CoRR, 2016

QSGD: Randomized Quantization for Communication-Optimal Stochastic Gradient Descent.
CoRR, 2016

Lease/release: architectural support for scaling contended data structures.
Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2016

2015
The Renaming Problem: Recent Developments and Open Questions.
Bulletin of the EATCS, 2015

Polylogarithmic-Time Leader Election in Population Protocols Using Polylogarithmic States.
CoRR, 2015

A High-Radix, Low-Latency Optical Switch for Data Centers.
Computer Communication Review, 2015

Inherent Limitations of Hybrid Transactional Memory.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

ThreadScan: Automatic and Scalable Memory Reclamation.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

A High-Radix, Low-Latency Optical Switch for Data Centers.
Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, 2015

The SprayList: a scalable relaxed priority queue.
Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2015

Lock-Free Algorithms under Stochastic Schedulers.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

How To Elect a Leader Faster than a Tournament.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Fast and Exact Majority in Population Protocols.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Streaming Min-max Hypergraph Partitioning.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Polylogarithmic-Time Leader Election in Population Protocols.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Tight Bounds for Asynchronous Renaming.
J. ACM, 2014

The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm.
CoRR, 2014

Inherent Limitations of Hybrid Transactional Memory.
CoRR, 2014

How to Elect a Leader Faster than a Tournament.
CoRR, 2014

Communication-Efficient Randomized Consensus.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Are lock-free concurrent algorithms practically wait-free?
Proceedings of the Symposium on Theory of Computing, 2014

Dynamic Task Allocation in Asynchronous Shared Memory.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Balls-into-leaves: sub-logarithmic renaming in synchronous message-passing systems.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Brief announcement: are lock-free concurrent algorithms practically wait-free?
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm.
Proceedings of the IEEE 34th International Conference on Distributed Computing Systems, 2014

StackTrack: an automated transactional approach to concurrent memory reclamation.
Proceedings of the Ninth Eurosys Conference 2014, 2014

Distributed Algorithms.
Proceedings of the Computing Handbook, 2014

2013
Are Lock-Free Concurrent Algorithms Practically Wait-Free?
CoRR, 2013

Randomized loose renaming in O(log log n) time.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012
Generating Fast Indulgent Algorithms.
Theory Comput. Syst., 2012

Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.
Algorithmica, 2012

On the cost of composing shared-memory algorithms.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Early Deciding Synchronous Renaming in O( logf ) Rounds or Less.
Proceedings of the Structural Information and Communication Complexity, 2012

How to Allocate Tasks Asynchronously.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
Sub-logarithmic Test-and-Set against a Weak Adversary.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Optimal-time adaptive strong renaming, with applications to counting.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Generating Fast Indulgent Algorithms.
Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

The Complexity of Renaming.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
Brief Announcement: New Bounds for Partially Synchronous Set Agreement.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Fast Randomized Test-and-Set and Renaming.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Securing every bit: authenticated broadcast in radio networks.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange).
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
How to Solve Consensus in the Smallest Window of Synchrony.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008


  Loading...