David Xiao

According to our database1, David Xiao authored at least 30 papers between 2003 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Optimization of Regenerator Placement in Optical Networks Using Deep Tensor Neural Network.
Proceedings of the 11th IEEE Annual Ubiquitous Computing, 2020

2019
Machine Learning for Regenerator Placement Based on the Features of the Optical Network.
Proceedings of the 21st International Conference on Transparent Optical Networks, 2019

2016
Mechanism Design and Differential Privacy.
Encyclopedia of Algorithms, 2016

Improved bounds for the randomized decision tree Complexity of recursive majority.
Random Struct. Algorithms, 2016

2015
Path-Quality Monitoring in the Presence of Adversaries: The Secure Sketch Protocols.
IEEE/ACM Trans. Netw., 2015

Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications.
SIAM J. Comput., 2015

Sample Complexity Bounds on Differentially Private Learning via Communication Complexity.
SIAM J. Comput., 2015

2014
A multiplayer online game for teaching software engineering practices.
Proceedings of the First (2014) ACM Conference on Learning @ Scale, 2014

Redrawing the boundaries on purchasing data from privacy-sensitive individuals.
Proceedings of the Innovations in Theoretical Computer Science, 2014

2013
Public-Key Encryption with Weak Randomness: Security against Strong Chosen Distribution Attacks.
IACR Cryptol. ePrint Arch., 2013

New lower bounds for privacy in communication protocols.
Electron. Colloquium Comput. Complex., 2013

Errata to (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

2012
Languages with Efficient Zero-Knowledge PCP's are in SZK.
IACR Cryptol. ePrint Arch., 2012

Languages with Efficient Zero-Knowledge PCPs are in SZK.
Electron. Colloquium Comput. Complex., 2012

Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2012, 2012

2011
Is privacy compatible with truthfulness?
IACR Cryptol. ePrint Arch., 2011

2010
Improved bounds for the randomized decision tree complexity of recursive majority.
Electron. Colloquium Comput. Complex., 2010

A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP.
Electron. Colloquium Comput. Complex., 2010

On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations.
Proceedings of the Progress in Cryptology, 2010

Learning to Create is as Hard as Learning to Appreciate.
Proceedings of the COLT 2010, 2010

2009
(Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks.
IACR Cryptol. ePrint Arch., 2009

On basing ZK != BPP on the hardness of PAC learning.
Electron. Colloquium Comput. Complex., 2009

On the Power of Randomized Reductions and the Checkability of SAT.
Electron. Colloquium Comput. Complex., 2009

2008
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications.
Theory Comput., 2008

Path-quality monitoring in the presence of adversaries.
Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2008

On Basing Lower-Bounds for Learning on Worst-Case Assumptions.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

Protocols and Lower Bounds for Failure Localization in the Internet.
Proceedings of the Advances in Cryptology, 2008

2006
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications.
Electron. Colloquium Comput. Complex., 2006

2005
A Randomness-Efficient Sampler for Matrix-valued Functions and Applications
Electron. Colloquium Comput. Complex., 2005

2003
Estimating and Comparing Entropies Across Written Natural Languages Using PPM Compression.
Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003


  Loading...