The following pages link to Rati Gelashvili (Q1657198):
Displaying 22 items.
- A complexity-based classification for multiprocessor synchronization (Q1988522) (← links)
- Space lower bounds for the signal detection problem (Q2048203) (← links)
- Fast and Exact Majority in Population Protocols (Q2796240) (← links)
- How To Elect a Leader Faster than a Tournament (Q2796273) (← links)
- Restricted Isometry Property for General p-Norms (Q2976590) (← links)
- Polylogarithmic-Time Leader Election in Population Protocols (Q3449497) (← links)
- Mining Railway Delay Dependencies in Large-Scale Real-World Delay Data (Q3649173) (← links)
- Time-Space Trade-offs in Population Protocols (Q4575918) (← links)
- (Q4608038) (← links)
- (Q5090474) (← links)
- Revisionist Simulations (Q5197668) (← links)
- Why extension-based proofs fail (Q5212839) (← links)
- A Complexity-Based Hierarchy for Multiprocessor Synchronization (Q5361947) (← links)
- Restricted Isometry Property for General p-Norms. (Q5368705) (← links)
- Dynamic Task Allocation in Asynchronous Shared Memory (Q5383990) (← links)
- Brief Announcement: Why Extension-Based Proofs Fail (Q5855206) (← links)
- On the optimal space complexity of consensus for anonymous processes (Q5915696) (← links)
- (Q6061688) (← links)
- Brief Announcement: Fast Graphical Population Protocols (Q6083418) (← links)
- Why Extension-Based Proofs Fail (Q6115415) (← links)
- (Q6128573) (← links)
- Johnson-Lindenstrauss Compression with Neuroscience-Based Constraints (Q6256579) (← links)
