activity
20172020
most citedOn the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz

2 citations · 3 across the 4 of their papers we have counts for

collaborators

5 papers

cs.IT2020

Hierarchical Coding for Cloud Storage: Topology-Adaptivity, Scalability, and Flexibility

Siyi Yang, Ahmed Hareedy, Robert Calderbank +1

In order to accommodate the ever-growing data from various, possibly independent, sources and the dynamic nature of data usage rates in practical applications, modern cloud data st…

cs.IT20201 cited

Efficient Information Reconciliation for Energy-Time Entanglement Quantum Key Distribution

Siyi Yang, Murat Can Sarihan, Kai-Chi Chang +2

Graph based codes such as low density parity check (LDPC) codes have been shown promising for the information reconciliation phase in quantum key distribution (QKD). However, exist…

cs.IT2020

Topology-Aware Cooperative Data Protection in Blockchain-Based Decentralized Storage Networks

Siyi Yang, Ahmed Hareedy, Robert Calderbank +1

From currency to cloud storage systems, the continuous rise of the blockchain technology is moving various information systems towards decentralization. Blockchain-based decentrali…

cs.IT2019

Hierarchical Coding to Enable Scalability and Flexibility in Heterogeneous Cloud Storage

Siyi Yang, Ahmed Hareedy, Robert Calderbank +1

In order to accommodate the ever-growing data from various, possibly independent, sources and the dynamic nature of data usage rates in practical applications, modern cloud data st…

cs.CC20172 cited

On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz

Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao +2

The complexity class PPA consists of NP-search problems which are reducible to the parity principle in undirected graphs. It contains a wide variety of interesting problems from gr…