default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Xiao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c23]Michal Aibin
, Stephen Cheng, David Xiao, Aldrich Huang:
Optimization of Regenerator Placement in Optical Networks Using Deep Tensor Neural Network. UEMCON 2020: 218-225
2010 – 2019
- 2019
- [c22]Stephen Cheng, David Xiao, Aldrich Huang, Michal Aibin:
Machine Learning for Regenerator Placement Based on the Features of the Optical Network. ICTON 2019: 1-3 - 2016
- [j5]Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao:
Improved bounds for the randomized decision tree Complexity of recursive majority. Random Struct. Algorithms 48(3): 612-638 (2016) - [r1]Kobbi Nissim, David Xiao:
Mechanism Design and Differential Privacy. Encyclopedia of Algorithms 2016: 1247-1256 - 2015
- [j4]Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao:
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. SIAM J. Comput. 44(5): 1550-1572 (2015) - [j3]Vitaly Feldman, David Xiao:
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity. SIAM J. Comput. 44(6): 1740-1764 (2015) - [j2]Sharon Goldberg, David Xiao, Eran Tromer, Boaz Barak, Jennifer Rexford:
Path-Quality Monitoring in the Presence of Adversaries: The Secure Sketch Protocols. IEEE/ACM Trans. Netw. 23(6): 1729-1741 (2015) - 2014
- [c21]Vitaly Feldman, David Xiao:
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity. COLT 2014: 1000-1019 - [c20]Kobbi Nissim, Salil P. Vadhan, David Xiao:
Redrawing the boundaries on purchasing data from privacy-sensitive individuals. ITCS 2014: 411-422 - [c19]David Xiao, Robert C. Miller:
A multiplayer online game for teaching software engineering practices. L@S 2014: 159-160 - [i17]Kobbi Nissim, Salil P. Vadhan, David Xiao:
Redrawing the Boundaries on Purchasing Data from Privacy-Sensitive Individuals. CoRR abs/1401.4092 (2014) - [i16]Vitaly Feldman, David Xiao:
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity. CoRR abs/1402.6278 (2014) - 2013
- [c18]Iordanis Kerenidis, Mathieu Laurière, David Xiao:
New Lower Bounds for Privacy in Communication Protocols. ICITS 2013: 69-89 - [c17]David Xiao:
Is privacy compatible with truthfulness? ITCS 2013: 67-86 - [c16]Mohammad Mahmoody, David Xiao:
Languages with Efficient Zero-Knowledge PCPs are in SZK. TCC 2013: 297-314 - [c15]David Xiao:
Errata to (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks. TCC 2013: 721-722 - [i15]Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao:
Improved bounds for the randomized decision tree complexity of recursive majority. CoRR abs/1309.7565 (2013) - [i14]Iordanis Kerenidis, Mathieu Laurière, David Xiao:
New lower bounds for privacy in communication protocols. Electron. Colloquium Comput. Complex. TR13 (2013) - [i13]Damien Vergnaud, David Xiao:
Public-Key Encryption with Weak Randomness: Security against Strong Chosen Distribution Attacks. IACR Cryptol. ePrint Arch. 2013: 681 (2013) - 2012
- [c14]David Xiao:
Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments. AFRICACRYPT 2012: 395-411 - [c13]Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao:
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. FOCS 2012: 500-509 - [i12]Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao:
Lower bounds on information complexity via zero-communication protocols and applications. CoRR abs/1204.1505 (2012) - [i11]Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao:
Lower bounds on information complexity via zero-communication protocols and applications. Electron. Colloquium Comput. Complex. TR12 (2012) - [i10]Mohammad Mahmoody, David Xiao:
Languages with Efficient Zero-Knowledge PCPs are in SZK. Electron. Colloquium Comput. Complex. TR12 (2012) - [i9]Mohammad Mahmoody, David Xiao:
Languages with Efficient Zero-Knowledge PCP's are in SZK. IACR Cryptol. ePrint Arch. 2012: 229 (2012) - 2011
- [c12]Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao:
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority. ICALP (1) 2011: 317-329 - [c11]David Xiao:
(Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks. TCC 2011: 541-558 - [i8]David Xiao:
Is privacy compatible with truthfulness? IACR Cryptol. ePrint Arch. 2011: 5 (2011) - 2010
- [c10]Mohammad Mahmoody, David Xiao:
On the Power of Randomized Reductions and the Checkability of SAT. CCC 2010: 64-75 - [c9]Iftach Haitner, Mohammad Mahmoody, David Xiao:
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. CCC 2010: 76-87 - [c8]David Xiao:
Learning to Create is as Hard as Learning to Appreciate. COLT 2010: 516-528 - [c7]S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yerukhimovich:
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations. LATINCRYPT 2010: 189-204 - [i7]Iftach Haitner, Mohammad Mahmoody, David Xiao:
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. Electron. Colloquium Comput. Complex. TR10 (2010) - [i6]Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao:
Improved bounds for the randomized decision tree complexity of recursive majority. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c6]David Xiao:
On Basing ZK ≠ BPP on the Hardness of PAC Learning. CCC 2009: 304-315 - [i5]Mohammad Mahmoody, David Xiao:
On the Power of Randomized Reductions and the Checkability of SAT. Electron. Colloquium Comput. Complex. TR09 (2009) - [i4]David Xiao:
On basing ZK != BPP on the hardness of PAC learning. Electron. Colloquium Comput. Complex. TR09 (2009) - [i3]David Xiao:
(Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks. IACR Cryptol. ePrint Arch. 2009: 513 (2009) - 2008
- [j1]Avi Wigderson, David Xiao:
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications. Theory Comput. 4(1): 53-76 (2008) - [c5]Boaz Barak, Sharon Goldberg, David Xiao:
Protocols and Lower Bounds for Failure Localization in the Internet. EUROCRYPT 2008: 341-360 - [c4]Benny Applebaum, Boaz Barak, David Xiao:
On Basing Lower-Bounds for Learning on Worst-Case Assumptions. FOCS 2008: 211-220 - [c3]Sharon Goldberg, David Xiao, Eran Tromer, Boaz Barak, Jennifer Rexford:
Path-quality monitoring in the presence of adversaries. SIGMETRICS 2008: 193-204 - 2006
- [i2]Avi Wigderson, David Xiao:
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c2]Avi Wigderson, David Xiao:
A Randomness-Efficient Sampler for Matrix-valued Functions and Applications. FOCS 2005: 397-406 - [i1]Avi Wigderson, David Xiao:
A Randomness-Efficient Sampler for Matrix-valued Functions and Applications. Electron. Colloquium Comput. Complex. TR05 (2005) - 2003
- [c1]Frederic H. Behr, Victoria Fossum, Michael Mitzenmacher, David Xiao:
Estimating and Comparing Entropies Across Written Natural Languages Using PPM Compression. DCC 2003: 416
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-24 23:01 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:
