default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRati Gelashvili
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Faith Ellen
, Rati Gelashvili, Leqi Zhu:
Revisionist Simulations: A New Approach to Proving Space Lower Bounds. SIAM J. Comput. 53(4): 1039-1084 (2024)- [i21]George Mitenkov, Igor Kabiljo, Zekun Li, Alexander Spiegelman, Satyanarayana Vusirikala, Zhuolun Xiang, Aleksandar Zlateski, Nuno P. Lopes, Rati Gelashvili:
Deferred Objects to Enhance Smart Contract Programming with Optimistic Parallel Execution. CoRR abs/2405.06117 (2024) - 2023
- [j7]Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
Why Extension-Based Proofs Fail. SIAM J. Comput. 52(4): 913-944 (2023) - [c24]Rati Gelashvili, Alexander Spiegelman, Zhuolun Xiang, George Danezis, Zekun Li, Dahlia Malkhi, Yu Xia, Runtian Zhou:
Block-STM: Scaling Blockchain Execution by Turning Ordering Curse to a Performance Blessing. PPoPP 2023: 232-244 - [i20]Alexander Spiegelman, Balaji Aurn, Rati Gelashvili, Zekun Li:
Shoal: Improving DAG-BFT Latency And Robustness. CoRR abs/2306.03058 (2023) - 2022
- [c23]Shir Cohen, Rati Gelashvili, Eleftherios Kokoris-Kogias, Zekun Li, Dahlia Malkhi, Alberto Sonnino, Alexander Spiegelman:
Be Aware of Your Leaders. Financial Cryptography 2022: 279-295 - [c22]Rati Gelashvili, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander Spiegelman, Zhuolun Xiang:
Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback. Financial Cryptography 2022: 296-315 - [c21]Rati Gelashvili, Guy Goren, Alexander Spiegelman:
Short Paper: On Game-Theoretically-Fair Leader Election. Financial Cryptography 2022: 531-538 - [i19]Rati Gelashvili, Alexander Spiegelman, Zhuolun Xiang, George Danezis, Zekun Li, Yu Xia, Runtian Zhou, Dahlia Malkhi:
Block-STM: Scaling Blockchain Execution by Turning Ordering Curse to a Performance Blessing. CoRR abs/2203.06871 (2022) - 2021
- [j6]Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu:
Space Lower Bounds for the Signal Detection Problem. Theory Comput. Syst. 65(4): 687-705 (2021) - [c20]Dan Alistarh, Rati Gelashvili, Joel Rybicki:
Fast Graphical Population Protocols. OPODIS 2021: 14:1-14:18 - [c19]Rati Gelashvili, Lefteris Kokoris-Kogias, Alexander Spiegelman, Zhuolun Xiang:
Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol. PODC 2021: 187-190 - [c18]Dan Alistarh, Rati Gelashvili, Giorgi Nadiradze:
Lower Bounds for Shared-Memory Leader Election Under Bounded Write Contention. DISC 2021: 4:1-4:17 - [c17]Dan Alistarh, Rati Gelashvili, Joel Rybicki:
Brief Announcement: Fast Graphical Population Protocols. DISC 2021: 43:1-43:4 - [i18]Dan Alistarh, Rati Gelashvili, Joel Rybicki:
Fast Graphical Population Protocols. CoRR abs/2102.08808 (2021) - [i17]Rati Gelashvili, Lefteris Kokoris-Kogias, Alexander Spiegelman, Zhuolun Xiang:
Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol. CoRR abs/2103.03181 (2021) - [i16]Rati Gelashvili, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander Spiegelman, Zhuolun Xiang:
Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback. CoRR abs/2106.10362 (2021) - [i15]Dan Alistarh, Rati Gelashvili, Giorgi Nadiradze:
Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention. CoRR abs/2108.02802 (2021) - [i14]Shir Cohen, Rati Gelashvili, Lefteris Kokoris-Kogias, Zekun Li, Dahlia Malkhi, Alberto Sonnino, Alexander Spiegelman:
Be Aware of Your Leaders. CoRR abs/2110.00960 (2021) - 2020
- [j5]Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu:
A complexity-based classification for multiprocessor synchronization. Distributed Comput. 33(2): 125-144 (2020) - [c16]Mark Kurtz, Justin Kopinsky, Rati Gelashvili, Alexander Matveev, John Carr, Michael Goin, William M. Leiserson, Sage Moore, Nir Shavit, Dan Alistarh:
Inducing and Exploiting Activation Sparsity for Fast Inference on Deep Neural Networks. ICML 2020: 5533-5543 - [c15]Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
Brief Announcement: Why Extension-Based Proofs Fail. PODC 2020: 54-56
2010 – 2019
- 2019
- [c14]Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu:
Space Lower Bounds for the Signal Detection Problem. STACS 2019: 26:1-26:13 - [c13]Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
Why extension-based proofs fail. STOC 2019: 986-996 - [i13]Rati Gelashvili, Nir Shavit, Aleksandar Zlateski:
L3 Fusion: Fast Transformed Convolutions on CPUs. CoRR abs/1912.02165 (2019) - 2018
- [j4]Rati Gelashvili:
On the optimal space complexity of consensus for anonymous processes. Distributed Comput. 31(4): 317-326 (2018) - [j3]Dan Alistarh, Rati Gelashvili:
Recent Algorithmic Advances in Population Protocols. SIGACT News 49(3): 63-73 (2018) - [c12]Faith Ellen, Rati Gelashvili, Leqi Zhu:
Revisionist Simulations: A New Approach to Proving Space Lower Bounds. PODC 2018: 61-70 - [c11]Dan Alistarh, James Aspnes, Rati Gelashvili:
Space-Optimal Majority in Population Protocols. SODA 2018: 2221-2239 - [i12]Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
Why Extension-Based Proofs Fail. CoRR abs/1811.01421 (2018) - 2017
- [b1]Rati Gelashvili:
On the complexity of synchronization. Massachusetts Institute of Technology, Cambridge, USA, 2017 - [c10]Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest:
Time-Space Trade-offs in Population Protocols. SODA 2017: 2560-2579 - [c9]Rati Gelashvili, Idit Keidar, Alexander Spiegelman, Roger Wattenhofer:
Brief Announcement: Towards Reduced Instruction Sets for Synchronization. DISC 2017: 53:1-53:4 - [i11]Dan Alistarh, James Aspnes, Rati Gelashvili:
Space-Optimal Majority in Population Protocols. CoRR abs/1704.04947 (2017) - [i10]Rati Gelashvili, Idit Keidar, Alexander Spiegelman, Roger Wattenhofer:
Towards Reduced Instruction Sets for Synchronization. CoRR abs/1705.02808 (2017) - [i9]Faith Ellen, Rati Gelashvili, Leqi Zhu:
Revisionist Simulations: A New Approach to Proving Space Lower Bounds. CoRR abs/1711.02455 (2017) - 2016
- [j2]Zeyuan Allen Zhu, Rati Gelashvili, Ilya P. Razenshteyn:
Restricted Isometry Property for General p-Norms. IEEE Trans. Inf. Theory 62(10): 5839-5854 (2016) - [c8]Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu:
A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract]. PODC 2016: 289-298 - [i8]Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest:
Time-Space Trade-offs in Population Protocols. CoRR abs/1602.08032 (2016) - [i7]Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu:
A Complexity-Based Hierarchy for Multiprocessor Synchronization. CoRR abs/1607.06139 (2016) - 2015
- [j1]Hillel Avni, Rati Gelashvili:
DISC 2015 Review. SIGACT News 46(4): 103-106 (2015) - [c7]Zeyuan Allen Zhu, Rati Gelashvili, Ilya P. Razenshteyn:
Restricted Isometry Property for General p-Norms. SoCG 2015: 451-460 - [c6]Dan Alistarh, Rati Gelashvili:
Polylogarithmic-Time Leader Election in Population Protocols. ICALP (2) 2015: 479-491 - [c5]Dan Alistarh, Rati Gelashvili, Milan Vojnovic:
Fast and Exact Majority in Population Protocols. PODC 2015: 47-56 - [c4]Dan Alistarh, Rati Gelashvili, Adrian Vladu:
How To Elect a Leader Faster than a Tournament. PODC 2015: 365-374 - [c3]Rati Gelashvili:
On the Optimal Space Complexity of Consensus for Anonymous Processes. DISC 2015: 452-466 - [i6]Dan Alistarh, Rati Gelashvili:
Polylogarithmic-Time Leader Election in Population Protocols Using Polylogarithmic States. CoRR abs/1502.05745 (2015) - [i5]Rati Gelashvili:
Optimal Space Complexity of Consensus for Anonymous Processes. CoRR abs/1506.06817 (2015) - 2014
- [c2]Rati Gelashvili, Mohsen Ghaffari, Jerry Li, Nir Shavit:
On the Importance of Registers for Computability. OPODIS 2014: 171-185 - [c1]Dan Alistarh, James Aspnes, Michael A. Bender, Rati Gelashvili, Seth Gilbert:
Dynamic Task Allocation in Asynchronous Shared Memory. SODA 2014: 416-435 - [i4]Zeyuan Allen Zhu, Rati Gelashvili, Ilya P. Razenshteyn:
The Restricted Isometry Property for the General p-Norms. CoRR abs/1407.2178 (2014) - [i3]Rati Gelashvili, Mohsen Ghaffari, Jerry Li, Nir Shavit:
On the Importance of Registers for Computability. CoRR abs/1411.0168 (2014) - [i2]Dan Alistarh, Rati Gelashvili, Adrian Vladu:
How to Elect a Leader Faster than a Tournament. CoRR abs/1411.1001 (2014) - [i1]Zeyuan Allen Zhu, Rati Gelashvili, Silvio Micali, Nir Shavit:
Johnson-Lindenstrauss Compression with Neuroscience-Based Constraints. CoRR abs/1411.5383 (2014)
2000 – 2009
- 2009
- [p1]Holger Flier, Rati Gelashvili, Thomas Graffagnino, Marc Nunkesser:
Mining Railway Delay Dependencies in Large-Scale Real-World Delay Data. Robust and Online Large-Scale Optimization 2009: 354-368
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
