The following pages link to Yuda Zhao (Q251294):
Displayed 7 items.
- Some lower bounds in dynamic networks with oblivious adversaries (Q2174250) (← 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)
- Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions (Q5964896) (← links)
- Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions (Q6483583) (← links)