Weiqiang Yuan

Affiliations:

EPFL, Switzerland
Institute for Interdisciplinary Information Sciences, Tsinghua University, China (former)

According to our database¹, Weiqiang Yuan authored at least 7 papers between 2020 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Breaking Verifiable Delay Functions in the Random Oracle Model.

[BibT_eX]

[DOI]

Ziyi Guan

Artur Riazanov

Weiqiang Yuan

IACR Cryptol. ePrint Arch., 2024

Direct Sums for Parity Decision Trees.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2024

2023

One-Way Functions vs. TFNP: Simpler and Improved.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

The Exact Bipartite Matching Polytope Has Exponential Extension Complexity.

[BibT_eX]

[DOI]

Xinrui Jia

Ola Svensson

Weiqiang Yuan

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Lower Bounds for Unambiguous Automata via Communication Complexity.

[BibT_eX]

[DOI]

Mika Göös

Stefan Kiefer

Weiqiang Yuan

Electron. Colloquium Comput. Complex., 2022

2021

Guest Column: Models of computation between decision trees and communication.

[BibT_eX]

[DOI]

SIGACT News, 2021

2020

Log-rank and lifting for AND-functions.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2020

Weiqiang Yuan

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...