default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeqi Zhu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Shang-En Huang
, Seth Pettie, Leqi Zhu:
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection. J. ACM 71(2): 12:1-12:37 (2024)- [j7]Faith Ellen, Rati Gelashvili, Leqi Zhu:
Revisionist Simulations: A New Approach to Proving Space Lower Bounds. SIAM J. Comput. 53(4): 1039-1084 (2024) - [c11]Yixuan Jin, Rui Ye, Leqi Zhu:
Application of Quantum Annealing Algorithm in The Combined Optimization of Credit Score Cards. CACML 2024: 460-464 - [i7]Monika Henzinger, A. R. Sricharan, Leqi Zhu:
Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph. CoRR abs/2402.18020 (2024) - 2023
- [j6]Ya-guang Guo, Qian Yin, Yixiong Wang, Jun Xu, Leqi Zhu:
Efficiency and optimization of government service resource allocation in a cloud computing environment. J. Cloud Comput. 12(1): 18 (2023) - [j5]Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
Why Extension-Based Proofs Fail. SIAM J. Comput. 52(4): 913-944 (2023) - [c10]Shang-En Huang, Seth Pettie, Leqi Zhu:
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection. SODA 2023: 4335-4353 - 2022
- [c9]Shang-En Huang, Seth Pettie, Leqi Zhu:
Byzantine agreement in polynomial time with near-optimal resilience. STOC 2022: 502-514 - [i6]Shang-En Huang, Seth Pettie, Leqi Zhu:
Byzantine Agreement in Polynomial Time with Near-Optimal Resilience. CoRR abs/2202.13452 (2022) - [i5]Shang-En Huang, Seth Pettie, Leqi Zhu:
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection. CoRR abs/2206.15335 (2022) - 2021
- [j4]Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu:
Space Lower Bounds for the Signal Detection Problem. Theory Comput. Syst. 65(4): 687-705 (2021) - [j3]Leqi Zhu:
A Tight Space Bound for Consensus. SIAM J. Comput. 50(3) (2021) - 2020
- [j2]Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu:
A complexity-based classification for multiprocessor synchronization. Distributed Comput. 33(2): 125-144 (2020) - [c8]Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
Brief Announcement: Why Extension-Based Proofs Fail. PODC 2020: 54-56
2010 – 2019
- 2019
- [b1]Leqi Zhu:
On the Space Complexity of Colourless Tasks. University of Toronto, Canada, 2019 - [c7]Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu:
Space Lower Bounds for the Signal Detection Problem. STACS 2019: 26:1-26:13 - [c6]Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
Why extension-based proofs fail. STOC 2019: 986-996 - 2018
- [c5]Faith Ellen, Rati Gelashvili, Leqi Zhu:
Revisionist Simulations: A New Approach to Proving Space Lower Bounds. PODC 2018: 61-70 - [i4]Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
Why Extension-Based Proofs Fail. CoRR abs/1811.01421 (2018) - 2017
- [j1]Shan Luo, Leqi Zhu, Kaspar Althoefer, Hongbin Liu:
Knock-Knock: Acoustic object recognition by using stacked denoising autoencoders. Neurocomputing 267: 18-24 (2017) - [i3]Shan Luo, Leqi Zhu, Kaspar Althoefer, Hongbin Liu:
Knock-Knock: Acoustic Object Recognition by using Stacked Denoising Autoencoders. CoRR abs/1708.04432 (2017) - [i2]Faith Ellen, Rati Gelashvili, Leqi Zhu:
Revisionist Simulations: A New Approach to Proving Space Lower Bounds. CoRR abs/1711.02455 (2017) - 2016
- [c4]Leqi Zhu:
Brief Announcement: A Tight Space Bound for Consensus. PODC 2016: 147-149 - [c3]Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu:
A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract]. PODC 2016: 289-298 - [c2]Leqi Zhu:
A tight space bound for consensus. STOC 2016: 345-350 - [i1]Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu:
A Complexity-Based Hierarchy for Multiprocessor Synchronization. CoRR abs/1607.06139 (2016) - 2015
- [c1]Leqi Zhu, Faith Ellen:
Atomic Snapshots from Small Registers. OPODIS 2015: 17:1-17:16
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 19:26 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:
