Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Leqi Zhu
@article{DBLP:journals/corr/abs-2402-18020, author = {Monika Henzinger and A. R. Sricharan and Leqi Zhu}, title = {Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph}, journal = {CoRR}, volume = {abs/2402.18020}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2402.18020}, doi = {10.48550/ARXIV.2402.18020}, eprinttype = {arXiv}, eprint = {2402.18020}, timestamp = {Tue, 26 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2402-18020.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcloudc/GuoYWXZ23, author = {Ya{-}guang Guo and Qian Yin and Yixiong Wang and Jun Xu and Leqi Zhu}, title = {Efficiency and optimization of government service resource allocation in a cloud computing environment}, journal = {J. Cloud Comput.}, volume = {12}, number = {1}, pages = {18}, year = {2023}, url = {https://doi.org/10.1186/s13677-023-00400-2}, doi = {10.1186/S13677-023-00400-2}, timestamp = {Wed, 15 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcloudc/GuoYWXZ23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/AlistarhAEGZ23, author = {Dan Alistarh and James Aspnes and Faith Ellen and Rati Gelashvili and Leqi Zhu}, title = {Why Extension-Based Proofs Fail}, journal = {{SIAM} J. Comput.}, volume = {52}, number = {4}, pages = {913--944}, year = {2023}, url = {https://doi.org/10.1137/20m1375851}, doi = {10.1137/20M1375851}, timestamp = {Thu, 31 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/AlistarhAEGZ23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/HuangPZ23, author = {Shang{-}En Huang and Seth Pettie and Leqi Zhu}, editor = {Nikhil Bansal and Viswanath Nagarajan}, title = {Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection}, booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2023, Florence, Italy, January 22-25, 2023}, pages = {4335--4353}, publisher = {{SIAM}}, year = {2023}, url = {https://doi.org/10.1137/1.9781611977554.ch165}, doi = {10.1137/1.9781611977554.CH165}, timestamp = {Fri, 17 Feb 2023 09:28:57 +0100}, biburl = {https://dblp.org/rec/conf/soda/HuangPZ23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HuangPZ22, author = {Shang{-}En Huang and Seth Pettie and Leqi Zhu}, editor = {Stefano Leonardi and Anupam Gupta}, title = {Byzantine agreement in polynomial time with near-optimal resilience}, booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022}, pages = {502--514}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3519935.3520015}, doi = {10.1145/3519935.3520015}, timestamp = {Tue, 27 Dec 2022 09:06:31 +0100}, biburl = {https://dblp.org/rec/conf/stoc/HuangPZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2202-13452, author = {Shang{-}En Huang and Seth Pettie and Leqi Zhu}, title = {Byzantine Agreement in Polynomial Time with Near-Optimal Resilience}, journal = {CoRR}, volume = {abs/2202.13452}, year = {2022}, url = {https://arxiv.org/abs/2202.13452}, eprinttype = {arXiv}, eprint = {2202.13452}, timestamp = {Wed, 02 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2202-13452.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2206-15335, author = {Shang{-}En Huang and Seth Pettie and Leqi Zhu}, title = {Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection}, journal = {CoRR}, volume = {abs/2206.15335}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2206.15335}, doi = {10.48550/ARXIV.2206.15335}, eprinttype = {arXiv}, eprint = {2206.15335}, timestamp = {Mon, 04 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2206-15335.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/EllenGWZ21, author = {Faith Ellen and Rati Gelashvili and Philipp Woelfel and Leqi Zhu}, title = {Space Lower Bounds for the Signal Detection Problem}, journal = {Theory Comput. Syst.}, volume = {65}, number = {4}, pages = {687--705}, year = {2021}, url = {https://doi.org/10.1007/s00224-020-09993-6}, doi = {10.1007/S00224-020-09993-6}, timestamp = {Tue, 15 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/EllenGWZ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Zhu21, author = {Leqi Zhu}, title = {A Tight Space Bound for Consensus}, journal = {{SIAM} J. Comput.}, volume = {50}, number = {3}, year = {2021}, url = {https://doi.org/10.1137/16M1096785}, doi = {10.1137/16M1096785}, timestamp = {Wed, 14 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Zhu21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dc/EllenGSZ20, author = {Faith Ellen and Rati Gelashvili and Nir Shavit and Leqi Zhu}, title = {A complexity-based classification for multiprocessor synchronization}, journal = {Distributed Comput.}, volume = {33}, number = {2}, pages = {125--144}, year = {2020}, url = {https://doi.org/10.1007/s00446-019-00361-3}, doi = {10.1007/S00446-019-00361-3}, timestamp = {Thu, 09 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dc/EllenGSZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/AlistarhAEGZ20, author = {Dan Alistarh and James Aspnes and Faith Ellen and Rati Gelashvili and Leqi Zhu}, editor = {Yuval Emek and Christian Cachin}, title = {Brief Announcement: Why Extension-Based Proofs Fail}, booktitle = {{PODC} '20: {ACM} Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020}, pages = {54--56}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3382734.3405743}, doi = {10.1145/3382734.3405743}, timestamp = {Tue, 04 Aug 2020 16:04:51 +0200}, biburl = {https://dblp.org/rec/conf/podc/AlistarhAEGZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/ca/Zhu19a, author = {Leqi Zhu}, title = {On the Space Complexity of Colourless Tasks}, school = {University of Toronto, Canada}, year = {2019}, url = {http://hdl.handle.net/1807/97746}, timestamp = {Fri, 29 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/ca/Zhu19a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/EllenGWZ19, author = {Faith Ellen and Rati Gelashvili and Philipp Woelfel and Leqi Zhu}, editor = {Rolf Niedermeier and Christophe Paul}, title = {Space Lower Bounds for the Signal Detection Problem}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2019, March 13-16, 2019, Berlin, Germany}, series = {LIPIcs}, volume = {126}, pages = {26:1--26:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.STACS.2019.26}, doi = {10.4230/LIPICS.STACS.2019.26}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/stacs/EllenGWZ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AlistarhAEGZ19, author = {Dan Alistarh and James Aspnes and Faith Ellen and Rati Gelashvili and Leqi Zhu}, editor = {Moses Charikar and Edith Cohen}, title = {Why extension-based proofs fail}, booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019}, pages = {986--996}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3313276.3316407}, doi = {10.1145/3313276.3316407}, timestamp = {Sat, 22 Jun 2019 17:42:26 +0200}, biburl = {https://dblp.org/rec/conf/stoc/AlistarhAEGZ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/EllenGZ18, author = {Faith Ellen and Rati Gelashvili and Leqi Zhu}, editor = {Calvin Newport and Idit Keidar}, title = {Revisionist Simulations: {A} New Approach to Proving Space Lower Bounds}, booktitle = {Proceedings of the 2018 {ACM} Symposium on Principles of Distributed Computing, {PODC} 2018, Egham, United Kingdom, July 23-27, 2018}, pages = {61--70}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3212734.3212749}, doi = {10.1145/3212734.3212749}, timestamp = {Wed, 21 Nov 2018 12:44:03 +0100}, biburl = {https://dblp.org/rec/conf/podc/EllenGZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1811-01421, author = {Dan Alistarh and James Aspnes and Faith Ellen and Rati Gelashvili and Leqi Zhu}, title = {Why Extension-Based Proofs Fail}, journal = {CoRR}, volume = {abs/1811.01421}, year = {2018}, url = {http://arxiv.org/abs/1811.01421}, eprinttype = {arXiv}, eprint = {1811.01421}, timestamp = {Thu, 22 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1811-01421.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijon/LuoZAL17, author = {Shan Luo and Leqi Zhu and Kaspar Althoefer and Hongbin Liu}, title = {Knock-Knock: Acoustic object recognition by using stacked denoising autoencoders}, journal = {Neurocomputing}, volume = {267}, pages = {18--24}, year = {2017}, url = {https://doi.org/10.1016/j.neucom.2017.03.014}, doi = {10.1016/J.NEUCOM.2017.03.014}, timestamp = {Fri, 23 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijon/LuoZAL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1708-04432, author = {Shan Luo and Leqi Zhu and Kaspar Althoefer and Hongbin Liu}, title = {Knock-Knock: Acoustic Object Recognition by using Stacked Denoising Autoencoders}, journal = {CoRR}, volume = {abs/1708.04432}, year = {2017}, url = {http://arxiv.org/abs/1708.04432}, eprinttype = {arXiv}, eprint = {1708.04432}, timestamp = {Mon, 20 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1708-04432.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1711-02455, author = {Faith Ellen and Rati Gelashvili and Leqi Zhu}, title = {Revisionist Simulations: {A} New Approach to Proving Space Lower Bounds}, journal = {CoRR}, volume = {abs/1711.02455}, year = {2017}, url = {http://arxiv.org/abs/1711.02455}, eprinttype = {arXiv}, eprint = {1711.02455}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1711-02455.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/Zhu16, author = {Leqi Zhu}, editor = {George Giakkoupis}, title = {Brief Announcement: {A} Tight Space Bound for Consensus}, booktitle = {Proceedings of the 2016 {ACM} Symposium on Principles of Distributed Computing, {PODC} 2016, Chicago, IL, USA, July 25-28, 2016}, pages = {147--149}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2933057.2933078}, doi = {10.1145/2933057.2933078}, timestamp = {Tue, 06 Nov 2018 11:07:19 +0100}, biburl = {https://dblp.org/rec/conf/podc/Zhu16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/EllenGSZ16, author = {Faith Ellen and Rati Gelashvili and Nir Shavit and Leqi Zhu}, editor = {George Giakkoupis}, title = {A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract]}, booktitle = {Proceedings of the 2016 {ACM} Symposium on Principles of Distributed Computing, {PODC} 2016, Chicago, IL, USA, July 25-28, 2016}, pages = {289--298}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2933057.2933113}, doi = {10.1145/2933057.2933113}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/EllenGSZ16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Zhu16, author = {Leqi Zhu}, editor = {Daniel Wichs and Yishay Mansour}, title = {A tight space bound for consensus}, booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016}, pages = {345--350}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2897518.2897565}, doi = {10.1145/2897518.2897565}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Zhu16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/EllenGSZ16, author = {Faith Ellen and Rati Gelashvili and Nir Shavit and Leqi Zhu}, title = {A Complexity-Based Hierarchy for Multiprocessor Synchronization}, journal = {CoRR}, volume = {abs/1607.06139}, year = {2016}, url = {http://arxiv.org/abs/1607.06139}, eprinttype = {arXiv}, eprint = {1607.06139}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/EllenGSZ16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/opodis/ZhuE15, author = {Leqi Zhu and Faith Ellen}, editor = {Emmanuelle Anceaume and Christian Cachin and Maria Gradinariu Potop{-}Butucaru}, title = {Atomic Snapshots from Small Registers}, booktitle = {19th International Conference on Principles of Distributed Systems, {OPODIS} 2015, December 14-17, 2015, Rennes, France}, series = {LIPIcs}, volume = {46}, pages = {17:1--17:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.OPODIS.2015.17}, doi = {10.4230/LIPICS.OPODIS.2015.17}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/opodis/ZhuE15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.