default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYaqiao Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Yaqiao Li, Pierre McKenzie:
Perspective on complexity measures targeting read-once branching programs. Inf. Comput. 301: 105230 (2024)- [j8]Shenggen Zheng
, Yaqiao Li, Minghua Pan, Jozef Gruska, Lvzhou Li:
Lifting query complexity to time-space complexity for two-way finite automata. J. Comput. Syst. Sci. 141: 103494 (2024) - [c6]Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li, Denis Pankratov:
On the Online Weighted Non-Crossing Matching Problem. SWAT 2024: 16:1-16:19 - [i13]Yaqiao Li, Mahtab Masoori, Lata Narayanan, Denis Pankratov:
Renting Servers for Multi-Parameter Jobs in the Cloud. CoRR abs/2404.15444 (2024) - [i12]Ali Mohammad Lavasani, Yaqiao Li, Mehran Shakerinava:
Newman's theorem via Carathéodory. CoRR abs/2406.08500 (2024) - 2023
- [c5]Yaqiao Li, Denis Pankratov:
Online vector bin packing and hypergraph coloring illuminated: simpler proofs and new connections. LAGOS 2023: 70-77 - [i11]Yaqiao Li, Pierre McKenzie:
Perspective on complexity measures targetting read-once branching programs. CoRR abs/2305.11276 (2023) - [i10]Yaqiao Li, Denis Pankratov:
Online Vector Bin Packing and Hypergraph Coloring Illuminated: Simpler Proofs and New Connections. CoRR abs/2306.11241 (2023) - [i9]Shenggen Zheng, Yaqiao Li, Minghua Pan, Jozef Gruska, Lvzhou Li:
Lifting query complexity to time-space complexity for two-way finite automata. CoRR abs/2311.18220 (2023) - 2022
- [j7]Yaqiao Li, Vishnu V. Narayan, Denis Pankratov:
Online Coloring and a New Type of Adversary for Online Graph Problems. Algorithmica 84(5): 1232-1251 (2022) - [j6]Yaqiao Li:
Trading information complexity for error II: The case of a large error and the external information complexity. Inf. Comput. 289(Part): 104952 (2022) - 2021
- [j5]Yaqiao Li:
Conflict complexity is lower bounded by block sensitivity. Theor. Comput. Sci. 856: 169-172 (2021) - 2020
- [j4]Lianna Hambardzumyan, Yaqiao Li:
Chang's lemma via Pinsker's inequality. Discret. Math. 343(1): 111496 (2020) - [c4]Yaqiao Li, Vishnu V. Narayan, Denis Pankratov:
Online Coloring and a New Type of Adversary for Online Graph Problems. WAOA 2020: 47-62 - [i8]Lianna Hambardzumyan, Yaqiao Li:
Chang's lemma via Pinsker's inequality. CoRR abs/2005.10830 (2020) - [i7]Yaqiao Li, Vishnu V. Narayan, Denis Pankratov:
Online Coloring and a New Type of Adversary for Online Graph Problems. CoRR abs/2005.10852 (2020)
2010 – 2019
- 2019
- [j3]Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You:
Information Complexity of the AND Function in the Two-Party and Multi-party Settings. Algorithmica 81(11-12): 4200-4237 (2019) - [c3]Yi Tian Xu, Yaqiao Li, David Meger:
Human Motion Prediction Via Pattern Completion in Latent Representation Space. CRV 2019: 57-64 - [i6]Yi Tian Xu, Yaqiao Li, David Meger:
Human Motion Prediction via Pattern Completion in Latent Representation Space. CoRR abs/1904.09039 (2019) - 2018
- [j2]Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li:
Trading Information Complexity for Error. Theory Comput. 14(1): 1-73 (2018) - [i5]Yaqiao Li:
Trading information complexity for error II. CoRR abs/1809.10219 (2018) - [i4]Yaqiao Li:
Conflict complexity is lower bounded by block sensitivity. CoRR abs/1810.08873 (2018) - 2017
- [c2]Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li:
Trading Information Complexity for Error. CCC 2017: 16:1-16:59 - [c1]Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You:
Information Complexity of the AND Function in the Two-Party and Multi-party Settings. COCOON 2017: 200-211 - [i3]Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You:
Information complexity of the AND function in the two-Party, and multiparty settings. CoRR abs/1703.07833 (2017) - 2016
- [j1]Hamed Hatami, Pooya Hatami, Yaqiao Li:
A characterization of functions with vanishing averages over products of disjoint sets. Eur. J. Comb. 56: 81-93 (2016) - [i2]Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li:
Trading information complexity for error. CoRR abs/1611.06650 (2016) - [i1]Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li:
Trading information complexity for error. Electron. Colloquium Comput. Complex. TR16 (2016)
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-11-07 20:35 CET 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:
