The following pages link to Chiu-Yuen Koo (Q706311):
Displaying 15 items.
- Extra processors versus future information in optimal deadline scheduling (Q706313) (← links)
- On expected constant-round protocols for Byzantine agreement (Q1004599) (← links)
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- On-line scheduling with tight deadlines. (Q1401244) (← links)
- Improving the round complexity of VSS in point-to-point networks (Q2389350) (← links)
- Competitive deadline scheduling via additional or faster processors (Q2464388) (← links)
- Improving the Round Complexity of VSS in Point-to-Point Networks (Q3519526) (← links)
- Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions (Q3596389) (← links)
- (Q4779165) (← links)
- Reliable broadcast in radio networks (Q5177287) (← links)
- Reducing Complexity Assumptions for Statistically-Hiding Commitment (Q5385722) (← links)
- Round-Efficient Secure Computation in Point-to-Point Networks (Q5429398) (← links)
- Broadcast in radio networks tolerating byzantine adversarial behavior (Q5501507) (← links)
- On Expected Constant-Round Protocols for Byzantine Agreement (Q5756649) (← links)
- Theory of Cryptography (Q5898371) (← links)
