default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChiu-Yuen Koo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
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. Cryptol. 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 Cryptol. ePrint Arch. 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]Chiu-Yuen Koo:
Secure Computation with Partial Message Loss. TCC 2006: 502-521 - [i4]Jonathan Katz, Chiu-Yuen Koo:
On Expected Constant-Round Protocols for Byzantine Agreement. Electron. Colloquium Comput. Complex. TR06 (2006) - [i3]Jonathan Katz, Chiu-Yuen Koo:
On Expected Constant-Round Protocols for Byzantine Agreement. IACR Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 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. Sched. 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
