Sotabase

Career

· PhD Student, Columbia University2020–
· PhD Student, University of Toronto2019–2020
· B.Sc., Technion-Israel Institute of Technology
· M.Sc., Technion-Israel Institute of Technology

Publications (23)

Classification of distributed binary labeling problems
International Symposium on Distributed Computing · 2019
49
cited
Hardness of Distributed Optimization
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing · 2019
41
cited
Unitary Complexity and the Uhlmann Transformation Problem
arXiv.org · 2023
36
cited
Distributed weighted min-cut in nearly-optimal time
Symposium on the Theory of Computing · 2020
24
cited
Cut Query Algorithms with Star Contraction
IEEE Annual Symposium on Foundations of Computer Science · 2022
22
cited
Nearly Optimal Communication and Query Complexity of Bipartite Matching
IEEE Annual Symposium on Foundations of Computer Science · 2022
20
cited
Distributed Distance Approximation
International Conference on Principles of Distributed Systems · 2020
13
cited
Brief Announcement: Classification of Distributed Binary Labeling Problems
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing · 2020
9
cited
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing · 2020
5
cited
Double and Triple Node-Erasure-Correcting Codes Over Complete Graphs
IEEE Transactions on Information Theory · 2020
5
cited
Good things come to those who wait: Dishonest-Majority Coin-Flipping Requires Delay Functions
IACR Cryptology ePrint Archive · 2024
4
cited
Dynamically Available Common Subset
IACR Cryptology ePrint Archive · 2025
3
cited
Optimal Good-Case Latency for Sleepy Consensus
IACR Cryptology ePrint Archive · 2025
2
cited
The Latency Cost Of Censorship Resistance
IACR Cryptology ePrint Archive · 2025
2
cited
A Simple Algorithm for Dynamic Carpooling with Recourse
arXiv.org · 2024
1
cited
Double and Triple Node-Erasure-Correcting Codes over Graphs
International Symposium on Information Theory · 2018
1
cited
Good Things Come to Those Who Wait - Dishonest-Majority Coin-Flipping Requires Delay Functions
International Conference on the Theory and Application of Cryptographic Techniques · 2025
How Much Public Randomness Do Modern Consensus Protocols Need?
IACR Cryptology ePrint Archive · 2024
Juggernaut: Efficient Crypto-Agnostic Byzantine Agreement
IACR Cryptology ePrint Archive · 2024
Lifeline: Optimal Byzantine Agreement Under Minimal Synchrony
IACR Cryptology ePrint Archive · 2025
Sotabase
Yuval Efron | Researcher Profile | Sotabase | Sotabase