Chiu-Yuen Koo

2009
17	EE	Jonathan Katz, Chiu-Yuen Koo: On expected constant-round protocols for Byzantine agreement. J. Comput. Syst. Sci. 75(2): 91-112 (2009)
16	EE	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
15	EE	Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan: Improving the Round Complexity of VSS in Point-to-Point Networks. ICALP (2) 2008: 499-510
2007
14	EE	Jonathan Katz, Chiu-Yuen Koo: Round-Efficient Secure Computation in Point-to-Point Networks. EUROCRYPT 2007: 311-328
13	EE	Juan A. Garay, Jonathan Katz, Chiu-Yuen Koo, Rafail Ostrovsky: Round Complexity of Authenticated Broadcast with a Dishonest Majority. FOCS 2007: 658-668
12	EE	Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda Lindell: Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions. TCC 2007: 323-341
2006
11	EE	Jonathan Katz, Chiu-Yuen Koo: On Expected Constant-Round Protocols for Byzantine Agreement. CRYPTO 2006: 445-462
10	EE	Chiu-Yuen Koo, Vartika Bhandari, Jonathan Katz, Nitin H. Vaidya: Reliable broadcast in radio networks: the bounded collision case. PODC 2006: 258-264
9	EE	Chiu-Yuen Koo: Secure Computation with Partial Message Loss. TCC 2006: 502-521
8	EE	Jonathan Katz, Chiu-Yuen Koo: On Expected Constant-Round Protocols for Byzantine Agreement. Electronic Colloquium on Computational Complexity (ECCC) 13(028): (2006)
2005
7	EE	Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel: Reducing Complexity Assumptions for Statistically-Hiding Commitment. EUROCRYPT 2005: 58-77
2004
6	EE	Chiu-Yuen Koo: Broadcast in radio networks tolerating byzantine adversarial behavior. PODC 2004: 275-282
5	EE	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)
2003
4		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)
3	EE	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
2	EE	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
1	EE	Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To: On-Line Scheduling with Tight Deadlines. MFCS 2001: 464-473

Coauthor Index

1	Vartika Bhandari	[10]
2	Juan A. Garay	[13]
3	Iftach Haitner	[7] [16]
4	Carmit Hazay	[12]
5	Omer Horvitz	[7] [16]
6	Jonathan Katz	[7] [8] [10] [11] [12] [13] [14] [15] [16] [17]
7	Ranjit Kumaresan	[15]
8	Tak Wah Lam	[1] [2] [3] [4] [5]
9	Yehuda Lindell (Andrew Y. Lindell)	[12]
10	Ruggero Morselli	[7] [16]
11	Tsuen-Wan Ngan	[1] [2] [3] [4] [5]
12	Rafail Ostrovsky	[13]
13	Kunihiko Sadakane	[3]
14	Ronen Shaltiel	[7] [16]
15	Isaac Kar-Keung To (Kar-Keung To)	[1] [2] [3] [4] [5]
16	Nitin H. Vaidya	[10]

Colors in the list of coauthors