Guang Yang

Orcid: 0000-0002-4916-3551

Affiliations:
  • Conflux - Tree-Graph Blockchain Research Institute, Shanghai, China
  • Chinese Academy of Sciences, Institute of Computing Technology, Beijing, China (2016 - 2018)
  • Aarhus University, Denmark (2016 - 2017)
  • Tsinghua University, Institute for Interdisciplinary Information Sciences, Beijing, China (PhD 2016)


According to our database1, Guang Yang authored at least 21 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
LVMT: An Efficient Authenticated Storage for Blockchain.
ACM Trans. Storage, August, 2024

2023
Exact quantum query complexity of weight decision problems via Chebyshev polynomials.
Sci. China Inf. Sci., February, 2023

Separating <i>k</i>-Player from <i>t</i>-Player One-Way Communication, with Applications to Data Streams.
Theory Comput., 2023

2021
Querying a Matrix through Matrix-Vector Products.
ACM Trans. Algorithms, 2021

Decentralized Asset Custody Scheme with Security Against Rational Adversary.
Proceedings of the Web and Internet Economics - 17th International Conference, 2021

2020
Decentralized Custody Scheme with Game-Theoretic Security.
IACR Cryptol. ePrint Arch., 2020

GHAST: Breaking Confirmation Delay Barrier in Nakamoto Consensus via Adaptive Weighted Blocks.
CoRR, 2020

A Decentralized Blockchain with High Throughput and Fast Confirmation.
Proceedings of the 2020 USENIX Annual Technical Conference, 2020

2019
Sharing Information with Competitors.
Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

Separating k-Player from t-Player One-Way Communication, with Applications to Data Streams.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Exact quantum query complexity of weight decision problems.
CoRR, 2018

2016
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions.
Comput. Complex., 2016

On the Power and Limits of Distance-Based Learning.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Posting Prices for a Perishable Item: (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Online Non-Preemptive Story Scheduling in Web Advertising.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015
Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits.
IACR Cryptol. ePrint Arch., 2015

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterminsitic Reductions.
Electron. Colloquium Comput. Complex., 2015

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions (Extended Abstract).
Proceedings of the 30th Conference on Computational Complexity, 2015

2014
Cryptography with Streaming Algorithms.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2012
A remark on one-wayness versus pseudorandomness.
Electron. Colloquium Comput. Complex., 2012

2011
Reversing Longest Previous Factor Tables is Hard.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011


  Loading...