The following pages link to Haifeng Yu (Q251295):
Displaying 16 items.
- Secure and highly-available aggregation queries in large-scale sensor networks via set sampling (Q658674) (← links)
- Some lower bounds in dynamic networks with oblivious adversaries (Q2174250) (← links)
- Signed quorum systems (Q2375298) (← links)
- Optimal inter-object correlation when replicating for availability (Q2377265) (← links)
- On Differentially Private Online Collaborative Recommendation Systems (Q2806773) (← links)
- The cost of fault tolerance in multi-party communication complexity (Q2933776) (← links)
- The Cost of Fault Tolerance in Multi-Party Communication Complexity (Q3189654) (← links)
- The Cost of Unknown Diameter in Dynamic Networks (Q4625652) (← links)
- Sublinear-Time Non-Adaptive Group Testing With <i>O</i>(<i>k</i> log <i>n</i>) Tests via Bit-Mixing Coding (Q5003676) (← links)
- Minimal replication cost for availability (Q5170871) (← links)
- Optimal inter-object correlation when replicating for availability (Q5401418) (← links)
- Toward an optimal social network defense against Sybil attacks (Q5401472) (← links)
- DoS-resilient secure aggregation queries in sensor networks (Q5401485) (← links)
- Signed quorum systems (Q5501504) (← links)
- Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions (Q5964896) (← links)
- Some lower bounds in dynamic networks with oblivious adversaries (Q6487501) (← links)