BibTeX records: Yaqiao Li

download as .bib file

@article{DBLP:journals/jcss/ZhengLPGL24,
  author       = {Shenggen Zheng and
                  Yaqiao Li and
                  Minghua Pan and
                  Jozef Gruska and
                  Lvzhou Li},
  title        = {Lifting query complexity to time-space complexity for two-way finite
                  automata},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {141},
  pages        = {103494},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.jcss.2023.103494},
  doi          = {10.1016/J.JCSS.2023.103494},
  timestamp    = {Thu, 29 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/ZhengLPGL24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lagos/LiP23,
  author       = {Yaqiao Li and
                  Denis Pankratov},
  editor       = {Cristina G. Fernandes and
                  Sergio Rajsbaum},
  title        = {Online vector bin packing and hypergraph coloring illuminated: simpler
                  proofs and new connections},
  booktitle    = {Proceedings of the {XII} Latin-American Algorithms, Graphs and Optimization
                  Symposium, {LAGOS} 2023, Huatulco, Mexico, September 18-22, 2023},
  series       = {Procedia Computer Science},
  volume       = {223},
  pages        = {70--77},
  publisher    = {Elsevier},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.procs.2023.08.215},
  doi          = {10.1016/J.PROCS.2023.08.215},
  timestamp    = {Tue, 16 Jan 2024 15:18:39 +0100},
  biburl       = {https://dblp.org/rec/conf/lagos/LiP23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-11276,
  author       = {Yaqiao Li and
                  Pierre McKenzie},
  title        = {Perspective on complexity measures targetting read-once branching
                  programs},
  journal      = {CoRR},
  volume       = {abs/2305.11276},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2305.11276},
  doi          = {10.48550/ARXIV.2305.11276},
  eprinttype    = {arXiv},
  eprint       = {2305.11276},
  timestamp    = {Thu, 25 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2305-11276.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-11241,
  author       = {Yaqiao Li and
                  Denis Pankratov},
  title        = {Online Vector Bin Packing and Hypergraph Coloring Illuminated: Simpler
                  Proofs and New Connections},
  journal      = {CoRR},
  volume       = {abs/2306.11241},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2306.11241},
  doi          = {10.48550/ARXIV.2306.11241},
  eprinttype    = {arXiv},
  eprint       = {2306.11241},
  timestamp    = {Fri, 23 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2306-11241.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-18220,
  author       = {Shenggen Zheng and
                  Yaqiao Li and
                  Minghua Pan and
                  Jozef Gruska and
                  Lvzhou Li},
  title        = {Lifting query complexity to time-space complexity for two-way finite
                  automata},
  journal      = {CoRR},
  volume       = {abs/2311.18220},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2311.18220},
  doi          = {10.48550/ARXIV.2311.18220},
  eprinttype    = {arXiv},
  eprint       = {2311.18220},
  timestamp    = {Tue, 05 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2311-18220.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LiNP22,
  author       = {Yaqiao Li and
                  Vishnu V. Narayan and
                  Denis Pankratov},
  title        = {Online Coloring and a New Type of Adversary for Online Graph Problems},
  journal      = {Algorithmica},
  volume       = {84},
  number       = {5},
  pages        = {1232--1251},
  year         = {2022},
  url          = {https://doi.org/10.1007/s00453-021-00920-w},
  doi          = {10.1007/S00453-021-00920-W},
  timestamp    = {Wed, 18 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/LiNP22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Li22,
  author       = {Yaqiao Li},
  title        = {Trading information complexity for error {II:} The case of a large
                  error and the external information complexity},
  journal      = {Inf. Comput.},
  volume       = {289},
  number       = {Part},
  pages        = {104952},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.ic.2022.104952},
  doi          = {10.1016/J.IC.2022.104952},
  timestamp    = {Tue, 29 Nov 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Li22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Li21,
  author       = {Yaqiao Li},
  title        = {Conflict complexity is lower bounded by block sensitivity},
  journal      = {Theor. Comput. Sci.},
  volume       = {856},
  pages        = {169--172},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.tcs.2020.12.038},
  doi          = {10.1016/J.TCS.2020.12.038},
  timestamp    = {Fri, 22 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Li21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HambardzumyanL20,
  author       = {Lianna Hambardzumyan and
                  Yaqiao Li},
  title        = {Chang's lemma via Pinsker's inequality},
  journal      = {Discret. Math.},
  volume       = {343},
  number       = {1},
  pages        = {111496},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.disc.2019.04.015},
  doi          = {10.1016/J.DISC.2019.04.015},
  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/HambardzumyanL20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/LiNP20,
  author       = {Yaqiao Li and
                  Vishnu V. Narayan and
                  Denis Pankratov},
  editor       = {Christos Kaklamanis and
                  Asaf Levin},
  title        = {Online Coloring and a New Type of Adversary for Online Graph Problems},
  booktitle    = {Approximation and Online Algorithms - 18th International Workshop,
                  {WAOA} 2020, Virtual Event, September 9-10, 2020, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {12806},
  pages        = {47--62},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-80879-2\_4},
  doi          = {10.1007/978-3-030-80879-2\_4},
  timestamp    = {Tue, 20 Jul 2021 15:29:23 +0200},
  biburl       = {https://dblp.org/rec/conf/waoa/LiNP20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-10830,
  author       = {Lianna Hambardzumyan and
                  Yaqiao Li},
  title        = {Chang's lemma via Pinsker's inequality},
  journal      = {CoRR},
  volume       = {abs/2005.10830},
  year         = {2020},
  url          = {https://arxiv.org/abs/2005.10830},
  eprinttype    = {arXiv},
  eprint       = {2005.10830},
  timestamp    = {Thu, 28 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2005-10830.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-10852,
  author       = {Yaqiao Li and
                  Vishnu V. Narayan and
                  Denis Pankratov},
  title        = {Online Coloring and a New Type of Adversary for Online Graph Problems},
  journal      = {CoRR},
  volume       = {abs/2005.10852},
  year         = {2020},
  url          = {https://arxiv.org/abs/2005.10852},
  eprinttype    = {arXiv},
  eprint       = {2005.10852},
  timestamp    = {Thu, 28 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2005-10852.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FilmusHLY19,
  author       = {Yuval Filmus and
                  Hamed Hatami and
                  Yaqiao Li and
                  Suzin You},
  title        = {Information Complexity of the {AND} Function in the Two-Party and
                  Multi-party Settings},
  journal      = {Algorithmica},
  volume       = {81},
  number       = {11-12},
  pages        = {4200--4237},
  year         = {2019},
  url          = {https://doi.org/10.1007/s00453-018-0484-8},
  doi          = {10.1007/S00453-018-0484-8},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/FilmusHLY19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crv/XuLM19,
  author       = {Yi Tian Xu and
                  Yaqiao Li and
                  David Meger},
  title        = {Human Motion Prediction Via Pattern Completion in Latent Representation
                  Space},
  booktitle    = {16th Conference on Computer and Robot Vision, {CRV} 2019, Kingston,
                  ON, Canada, May 29-31, 2019},
  pages        = {57--64},
  publisher    = {{IEEE}},
  year         = {2019},
  url          = {https://doi.org/10.1109/CRV.2019.00016},
  doi          = {10.1109/CRV.2019.00016},
  timestamp    = {Wed, 16 Oct 2019 14:14:50 +0200},
  biburl       = {https://dblp.org/rec/conf/crv/XuLM19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-09039,
  author       = {Yi Tian Xu and
                  Yaqiao Li and
                  David Meger},
  title        = {Human Motion Prediction via Pattern Completion in Latent Representation
                  Space},
  journal      = {CoRR},
  volume       = {abs/1904.09039},
  year         = {2019},
  url          = {http://arxiv.org/abs/1904.09039},
  eprinttype    = {arXiv},
  eprint       = {1904.09039},
  timestamp    = {Fri, 26 Apr 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1904-09039.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/DaganFHL18,
  author       = {Yuval Dagan and
                  Yuval Filmus and
                  Hamed Hatami and
                  Yaqiao Li},
  title        = {Trading Information Complexity for Error},
  journal      = {Theory Comput.},
  volume       = {14},
  number       = {1},
  pages        = {1--73},
  year         = {2018},
  url          = {https://doi.org/10.4086/toc.2018.v014a006},
  doi          = {10.4086/TOC.2018.V014A006},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/DaganFHL18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-10219,
  author       = {Yaqiao Li},
  title        = {Trading information complexity for error {II}},
  journal      = {CoRR},
  volume       = {abs/1809.10219},
  year         = {2018},
  url          = {http://arxiv.org/abs/1809.10219},
  eprinttype    = {arXiv},
  eprint       = {1809.10219},
  timestamp    = {Fri, 05 Oct 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1809-10219.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-08873,
  author       = {Yaqiao Li},
  title        = {Conflict complexity is lower bounded by block sensitivity},
  journal      = {CoRR},
  volume       = {abs/1810.08873},
  year         = {2018},
  url          = {http://arxiv.org/abs/1810.08873},
  eprinttype    = {arXiv},
  eprint       = {1810.08873},
  timestamp    = {Wed, 31 Oct 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1810-08873.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DaganFHL17,
  author       = {Yuval Dagan and
                  Yuval Filmus and
                  Hamed Hatami and
                  Yaqiao Li},
  editor       = {Ryan O'Donnell},
  title        = {Trading Information Complexity for Error},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {16:1--16:59},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.16},
  doi          = {10.4230/LIPICS.CCC.2017.16},
  timestamp    = {Thu, 02 Feb 2023 13:27:05 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/DaganFHL17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/FilmusHLY17,
  author       = {Yuval Filmus and
                  Hamed Hatami and
                  Yaqiao Li and
                  Suzin You},
  editor       = {Yixin Cao and
                  Jianer Chen},
  title        = {Information Complexity of the {AND} Function in the Two-Party and
                  Multi-party Settings},
  booktitle    = {Computing and Combinatorics - 23rd International Conference, {COCOON}
                  2017, Hong Kong, China, August 3-5, 2017, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10392},
  pages        = {200--211},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-62389-4\_17},
  doi          = {10.1007/978-3-319-62389-4\_17},
  timestamp    = {Tue, 14 May 2019 10:00:35 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoon/FilmusHLY17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FilmusHLY17,
  author       = {Yuval Filmus and
                  Hamed Hatami and
                  Yaqiao Li and
                  Suzin You},
  title        = {Information complexity of the {AND} function in the two-Party, and
                  multiparty settings},
  journal      = {CoRR},
  volume       = {abs/1703.07833},
  year         = {2017},
  url          = {http://arxiv.org/abs/1703.07833},
  eprinttype    = {arXiv},
  eprint       = {1703.07833},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/FilmusHLY17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/HatamiHL16,
  author       = {Hamed Hatami and
                  Pooya Hatami and
                  Yaqiao Li},
  title        = {A characterization of functions with vanishing averages over products
                  of disjoint sets},
  journal      = {Eur. J. Comb.},
  volume       = {56},
  pages        = {81--93},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.ejc.2016.03.002},
  doi          = {10.1016/J.EJC.2016.03.002},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejc/HatamiHL16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DaganFHL16,
  author       = {Yuval Dagan and
                  Yuval Filmus and
                  Hamed Hatami and
                  Yaqiao Li},
  title        = {Trading information complexity for error},
  journal      = {CoRR},
  volume       = {abs/1611.06650},
  year         = {2016},
  url          = {http://arxiv.org/abs/1611.06650},
  eprinttype    = {arXiv},
  eprint       = {1611.06650},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DaganFHL16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DaganFHL16,
  author       = {Yuval Dagan and
                  Yuval Filmus and
                  Hamed Hatami and
                  Yaqiao Li},
  title        = {Trading information complexity for error},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR16-190}},
  year         = {2016},
  url          = {https://eccc.weizmann.ac.il/report/2016/190},
  eprinttype    = {ECCC},
  eprint       = {TR16-190},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/DaganFHL16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics