Rati Gelashvili

Orcid: 0000-0002-6151-1061

According to our database1, Rati Gelashvili authored at least 36 papers between 2009 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Why Extension-Based Proofs Fail.
SIAM J. Comput., August, 2023

Shoal: Improving DAG-BFT Latency And Robustness.
CoRR, 2023

Block-STM: Scaling Blockchain Execution by Turning Ordering Curse to a Performance Blessing.
Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2023

2022
Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback.
Proceedings of the Financial Cryptography and Data Security, 2022

Short Paper: On Game-Theoretically-Fair Leader Election.
Proceedings of the Financial Cryptography and Data Security, 2022

Be Aware of Your Leaders.
Proceedings of the Financial Cryptography and Data Security, 2022

2021
Space Lower Bounds for the Signal Detection Problem.
Theory Comput. Syst., 2021

Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol.
CoRR, 2021

Brief Announcement: Fast Graphical Population Protocols.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Lower Bounds for Shared-Memory Leader Election Under Bounded Write Contention.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Fast Graphical Population Protocols.
Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

2020
A complexity-based classification for multiprocessor synchronization.
Distributed Comput., 2020

Brief Announcement: Why Extension-Based Proofs Fail.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Inducing and Exploiting Activation Sparsity for Fast Inference on Deep Neural Networks.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
L3 Fusion: Fast Transformed Convolutions on CPUs.
CoRR, 2019

2018
Recent Algorithmic Advances in Population Protocols.
SIGACT News, 2018

On the optimal space complexity of consensus for anonymous processes.
Distributed Comput., 2018

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

Revisionist Simulations: A New Approach to Proving Space Lower Bounds.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
On the complexity of synchronization.
PhD thesis, 2017

Towards Reduced Instruction Sets for Synchronization.
CoRR, 2017

Brief Announcement: Towards Reduced Instruction Sets for Synchronization.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

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

2016
Restricted Isometry Property for General p-Norms.
IEEE Trans. Inf. Theory, 2016

A Complexity-Based Hierarchy for Multiprocessor Synchronization.
CoRR, 2016

A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract].
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015
DISC 2015 Review.
SIGACT News, 2015

Polylogarithmic-Time Leader Election in Population Protocols Using Polylogarithmic States.
CoRR, 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

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

2014
Johnson-Lindenstrauss Compression with Neuroscience-Based Constraints.
CoRR, 2014

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

On the Importance of Registers for Computability.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2009
Mining Railway Delay Dependencies in Large-Scale Real-World Delay Data.
Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009


  Loading...