David Xiao

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

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

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.

[BibT_eX]

[DOI]

Proceedings of the 11th IEEE Annual Ubiquitous Computing, 2020

2019

Machine Learning for Regenerator Placement Based on the Features of the Optical Network.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Transparent Optical Networks, 2019

2016

Mechanism Design and Differential Privacy.

[BibT_eX]

[DOI]

Kobbi Nissim

David Xiao

Encyclopedia of Algorithms, 2016

Improved bounds for the randomized decision tree Complexity of recursive majority.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

2015

Path-Quality Monitoring in the Presence of Adversaries: The Secure Sketch Protocols.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2015

2014

A multiplayer online game for teaching software engineering practices.

[BibT_eX]

[DOI]

David Xiao

Robert C. Miller

Proceedings of the First (2014) ACM Conference on Learning @ Scale, 2014

Redrawing the boundaries on purchasing data from privacy-sensitive individuals.

[BibT_eX]

[DOI]

Kobbi Nissim

Salil P. Vadhan

David Xiao

Proceedings of the Innovations in Theoretical Computer Science, 2014

Sample Complexity Bounds on Differentially Private Learning via Communication Complexity.

[BibT_eX]

[DOI]

Vitaly Feldman

David Xiao

Proceedings of The 27th Conference on Learning Theory, 2014

2013

Public-Key Encryption with Weak Randomness: Security against Strong Chosen Distribution Attacks.

[BibT_eX]

[DOI]

Damien Vergnaud

David Xiao

IACR Cryptol. ePrint Arch., 2013

Errata to (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks.

[BibT_eX]

[DOI]

David Xiao

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Languages with Efficient Zero-Knowledge PCPs are in SZK.

[BibT_eX]

[DOI]

Mohammad Mahmoody

David Xiao

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Is privacy compatible with truthfulness?

[BibT_eX]

[DOI]

David Xiao

Proceedings of the Innovations in Theoretical Computer Science, 2013

New Lower Bounds for Privacy in Communication Protocols.

[BibT_eX]

[DOI]

Iordanis Kerenidis

Mathieu Laurière

David Xiao

Proceedings of the Information Theoretic Security - 7th International Conference, 2013

2012

Languages with Efficient Zero-Knowledge PCP's are in SZK.

[BibT_eX]

[DOI]

Mohammad Mahmoody

David Xiao

IACR Cryptol. ePrint Arch., 2012

Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments.

[BibT_eX]

[DOI]

David Xiao

Proceedings of the Progress in Cryptology - AFRICACRYPT 2012, 2012

2011

(Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks.

[BibT_eX]

[DOI]

David Xiao

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2010

Learning to Create is as Hard as Learning to Appreciate.

[BibT_eX]

[DOI]

David Xiao

Proceedings of the COLT 2010, 2010

On the Power of Randomized Reductions and the Checkability of SAT.

[BibT_eX]

[DOI]

Mohammad Mahmoody

David Xiao

Proceedings of the 25th Annual IEEE Conference on Computational Complexity, 2010

A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP.

[BibT_eX]

[DOI]

Iftach Haitner

Mohammad Mahmoody

David Xiao

Proceedings of the 25th Annual IEEE Conference on Computational Complexity, 2010

2009

On Basing ZK ≠ BPP on the Hardness of PAC Learning.

[BibT_eX]

[DOI]

David Xiao

Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009

2008

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

[BibT_eX]

[DOI]

Avi Wigderson

David Xiao

Theory Comput., 2008

Path-quality monitoring in the presence of adversaries.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Benny Applebaum

Boaz Barak

David Xiao

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

Protocols and Lower Bounds for Failure Localization in the Internet.

[BibT_eX]

[DOI]

Boaz Barak

Sharon Goldberg

David Xiao

Proceedings of the Advances in Cryptology, 2008

2006

Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications.

[BibT_eX]

[DOI]

Avi Wigderson

David Xiao

Electron. Colloquium Comput. Complex., 2006

2005

A Randomness-Efficient Sampler for Matrix-valued Functions and Applications.

[BibT_eX]

[DOI]

Avi Wigderson

David Xiao

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005

2003

Estimating and Comparing Entropies Across Written Natural Languages Using PPM Compression.

[BibT_eX]

[DOI]

Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

David Xiao

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...