Yaqiao Li

Orcid: 0000-0002-9043-0375

According to our database1, Yaqiao Li authored at least 13 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Lifting query complexity to time-space complexity for two-way finite automata.
J. Comput. Syst. Sci., May, 2024

2023
Perspective on complexity measures targetting read-once branching programs.
CoRR, 2023

Online vector bin packing and hypergraph coloring illuminated: simpler proofs and new connections.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022
Trading information complexity for error II: The case of a large error and the external information complexity.
Inf. Comput., 2022

Online Coloring and a New Type of Adversary for Online Graph Problems.
Algorithmica, 2022

2021
Conflict complexity is lower bounded by block sensitivity.
Theor. Comput. Sci., 2021

2020
Chang's lemma via Pinsker's inequality.
Discret. Math., 2020

2019
Information Complexity of the AND Function in the Two-Party and Multi-party Settings.
Algorithmica, 2019

Human Motion Prediction Via Pattern Completion in Latent Representation Space.
Proceedings of the 16th Conference on Computer and Robot Vision, 2019

2018
Trading Information Complexity for Error.
Theory Comput., 2018

Trading information complexity for error II.
CoRR, 2018

2017
Information complexity of the AND function in the two-Party, and multiparty settings.
CoRR, 2017

2016
A characterization of functions with vanishing averages over products of disjoint sets.
Eur. J. Comb., 2016


  Loading...