Leqi Zhu

Follow

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Revisionist Simulations: A New Approach to Proving Space Lower Bounds	2024	Faith Ellen Rati Gelashvili Leqi Zhu
+ PDF Chat	Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph	2024	Monika Henzinger A. R. Sricharan Leqi Zhu
+	Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection	2024	Shang-En Huang Seth Pettie Leqi Zhu
+ PDF Chat	Why Extension-Based Proofs Fail	2023	Dan Alistarh James Aspnes Faith Ellen Rati Gelashvili Leqi Zhu
+ PDF Chat	Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection	2023	Shang-En Huang Seth Pettie Leqi Zhu
+ PDF Chat	Byzantine agreement in polynomial time with near-optimal resilience	2022	Shang-En Huang Seth Pettie Leqi Zhu
+	Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection	2022	Shang-En Huang Seth Pettie Leqi Zhu
+	Why extension-based proofs fail	2019	Dan Alistarh James Aspnes Faith Ellen Rati Gelashvili Leqi Zhu
+	Why Extension-Based Proofs Fail	2018	Dan Alistarh James Aspnes Faith Ellen Rati Gelashvili Leqi Zhu
+	Revisionist Simulations: A New Approach to Proving Space Lower Bounds	2017	Faith Ellen Rati Gelashvili Leqi Zhu
+	A Complexity-Based Hierarchy for Multiprocessor Synchronization	2016	Faith Ellen Rati Gelashvili Nir Shavit Leqi Zhu
+	A Complexity-Based Hierarchy for Multiprocessor Synchronization	2016	Faith Ellen Rati Gelashvili Nir Shavit Leqi Zhu

Common Coauthors

Coauthor	Papers Together
Rati Gelashvili	7
Faith Ellen	7
Shang-En Huang	4
Seth Pettie	4
James Aspnes	3
Dan Alistarh	3
Nir Shavit	2
A. R. Sricharan	1
Monika Henzinger	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	On the Optimal Space Complexity of Consensus for Anonymous Processes	2015	Rati Gelashvili	3
+ PDF Chat	Fast asynchronous Byzantine agreement and leader election with full information	2010	Bruce M. Kapron David Kempe Valerie King Jared Saia Vishal Sanwalani	2
+	The influence of variables on Boolean functions	1988	J. Kahn Gil Kalai Nathan Linial	2
+ PDF Chat	A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip	2020	Iftach Haitner Yonatan Karidi-Heller	2
+ PDF Chat	The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement	2011	Allison Lewko	2
+	On the Optimal Space Complexity of Consensus for Anonymous Processes	2015	Rati Gelashvili	1
+	A Complexity-Based Hierarchy for Multiprocessor Synchronization	2016	Faith Ellen Rati Gelashvili Nir Shavit Leqi Zhu	1
+ PDF Chat	An Almost-Optimally Fair Three-Party Coin-Flipping Protocol	2017	Iftach Haitner Eliad Tsfadia	1
+ PDF Chat	On the Complexity of Fair Coin Flipping	2018	Iftach Haitner Nikolaos Makriyannis Eran Omri	1
+ PDF Chat	Hardness of Distributed Optimization	2019	Nir Bacrach Keren Censor-Hillel Michal Dory Yuval Efron Dean Leitersdorf Ami Paz	1
+	Countries with potential data misreport based on Benford’s law	2021	Ahmad Kilani Georgios P. Georgiou	1
+ PDF Chat	On the use of Benford's law to detect GAN-generated images	2021	Nicolò Bonettini Paolo Bestagini Simone Milani Stefano Tubaro	1
+	Fair Coin Flipping: Tighter Analysis and the Many-Party Case	2017	Niv Buchbinder Iftach Haitner Nissan Levi Eliad Tsfadia	1
+ PDF Chat	Byzantine agreement in polynomial time with near-optimal resilience	2022	Shang-En Huang Seth Pettie Leqi Zhu	1
+ PDF Chat	Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection	2023	Shang-En Huang Seth Pettie Leqi Zhu	1
+ PDF Chat	A generalized asynchronous computability theorem	2014	Eli Gafni Petr Kuznetsov Ciprian Manolescu	1
+	A classification of wait-free loop agreement tasks	2002	Maurice Herlihy Sergio Rajsbaum	1
+	An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience	2008	Ittai Abraham Danny Dolev Joseph Y. Halpern	1
+ PDF Chat	Randomized protocols for asynchronous consensus	2003	James Aspnes	1