Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Chiu-Yuen Koo
2000 – 2009
- 2009
[j6]Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan: Improving the round complexity of VSS in point-to-point networks. Inf. Comput. 207(8): 889-899 (2009)- [j5]Jonathan Katz, Chiu-Yuen Koo: On expected constant-round protocols for Byzantine agreement. J. Comput. Syst. Sci. 75(2): 91-112 (2009)
- [j4]Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel: Reducing Complexity Assumptions for Statistically-Hiding Commitment. J. Cryptology 22(3): 283-310 (2009)
- 2008
- [c11]Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan: Improving the Round Complexity of VSS in Point-to-Point Networks. ICALP (2) 2008: 499-510
- 2007
- [c10]Jonathan Katz, Chiu-Yuen Koo: Round-Efficient Secure Computation in Point-to-Point Networks. EUROCRYPT 2007: 311-328
- [c9]Juan A. Garay, Jonathan Katz, Chiu-Yuen Koo, Rafail Ostrovsky: Round Complexity of Authenticated Broadcast with a Dishonest Majority. FOCS 2007: 658-668
- [c8]Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda Lindell: Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions. TCC 2007: 323-341
- [i5]Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan: Improving the Round Complexity of VSS in Point-to-Point Networks. IACR Cryptology ePrint Archive 2007: 358 (2007)
- 2006
- [c7]Jonathan Katz, Chiu-Yuen Koo: On Expected Constant-Round Protocols for Byzantine Agreement. CRYPTO 2006: 445-462
- [c6]Chiu-Yuen Koo, Vartika Bhandari, Jonathan Katz, Nitin H. Vaidya: Reliable broadcast in radio networks: the bounded collision case. PODC 2006: 258-264
- [c5]
- [i4]Jonathan Katz, Chiu-Yuen Koo: On Expected Constant-Round Protocols for Byzantine Agreement. Electronic Colloquium on Computational Complexity (ECCC) 13(028) (2006)
- [i3]Jonathan Katz, Chiu-Yuen Koo: On Expected Constant-Round Protocols for Byzantine Agreement. IACR Cryptology ePrint Archive 2006: 65 (2006)
- 2005
- [c4]Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel: Reducing Complexity Assumptions for Statistically-Hiding Commitment. EUROCRYPT 2005: 58-77
- [i2]Jonathan Katz, Chiu-Yuen Koo: On Constructing Universal One-Way Hash Functions from Arbitrary One-Way Functions. IACR Cryptology ePrint Archive 2005: 328 (2005)
- 2004
- [j3]Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To: Extra Processors versus Future Information in Optimal Deadline Scheduling. Theory Comput. Syst. 37(3): 323-341 (2004)
- [c3]Chiu-Yuen Koo: Broadcast in radio networks tolerating byzantine adversarial behavior. PODC 2004: 275-282
- [i1]Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli: Reducing Complexity Assumptions for Statistically-Hiding Commitment. IACR Cryptology ePrint Archive 2004: 341 (2004)
- 2003
- [j2]Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To: Competitive Deadline Scheduling via Additional or Faster Processors. J. Scheduling 6(2): 213-223 (2003)
- [j1]Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kunihiko Sadakane, Kar-Keung To: On-line scheduling with tight deadlines. Theor. Comput. Sci. 295: 251-261 (2003)
- 2002
- [c2]Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To: Extra processors versus future information in optimal deadline scheduling. SPAA 2002: 133-142
- 2001
- [c1]Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To: On-Line Scheduling with Tight Deadlines. MFCS 2001: 464-473
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 22:12 CET by the dblp team