Xin Li

According to our database1, Xin Li authored at least 39 papers between 2004 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Block Edit Errors with Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Edit Errors with Block Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes.
CoRR, 2018

Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors.
CoRR, 2018

Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets.
CoRR, 2018

A New Approach for Constructing Low-Error, Two-Source Extractors.
Proceedings of the 33rd Computational Complexity Conference, 2018

2017
Near-Optimal Secret Sharing and Error Correcting Codes in AC0.
IACR Cryptology ePrint Archive, 2017

A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate.
Electronic Colloquium on Computational Complexity (ECCC), 2017

Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets.
CoRR, 2017

Near-Optimal Secret Sharing and Error Correcting Codes in \mathsf AC^0 AC 0.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

2016
Improved Non-Malleable Extractors, Non-Malleable Codes and Independent Source Extractors.
Electronic Colloquium on Computational Complexity (ECCC), 2016

Randomness Extraction in AC0 and with Small Locality.
Electronic Colloquium on Computational Complexity (ECCC), 2016

Non-Malleable Codes and Extractors for Small-Depth Circuits, and Affine Functions.
Electronic Colloquium on Computational Complexity (ECCC), 2016

Explicit Non-Malleable Extractors, Multi-Source Extractors and Almost Optimal Privacy Amplification Protocols.
Electronic Colloquium on Computational Complexity (ECCC), 2016

Randomness Extraction in AC0 and with Small Locality.
CoRR, 2016

Computing approximate PSD factorizations.
CoRR, 2016

Improved Two-Source Extractors, and Affine Extractors for Polylogarithmic Entropy.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Improved Constructions of Two-Source Extractors.
Electronic Colloquium on Computational Complexity (ECCC), 2015

Extractors for Affine Sources with Polylogarithmic Entropy.
Electronic Colloquium on Computational Complexity (ECCC), 2015

Three-Source Extractors for Polylogarithmic Min-Entropy.
Electronic Colloquium on Computational Complexity (ECCC), 2015

Extractors for Sumset Sources.
Electronic Colloquium on Computational Complexity (ECCC), 2015

Non-Malleable Extractors and Codes, with their Many Tampered Extensions.
Electronic Colloquium on Computational Complexity (ECCC), 2015

Non-malleable Condensers for Arbitrary Min-entropy, and Almost Optimal Protocols for Privacy Amplification.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

2014
Privacy Amplification and Nonmalleable Extractors Via Character Sums.
SIAM J. Comput., 2014

Multi-Source Randomness Extractors Against Quantum Side Information, and their Applications.
Electronic Colloquium on Computational Complexity (ECCC), 2014

2013
Extractors for a Constant Number of Independent Sources with Polylogarithmic Min-Entropy.
Electronic Colloquium on Computational Complexity (ECCC), 2013

Robust Pseudorandom Generators.
Electronic Colloquium on Computational Complexity (ECCC), 2013

2012
Non-Malleable Extractors, Two-Source Extractors and Privacy Amplification.
IACR Cryptology ePrint Archive, 2012

New Independent Source Extractors with Exponential Improvement.
Electronic Colloquium on Computational Complexity (ECCC), 2012

2011
Non-Malleable Extractors for Entropy Rate <1/2.
Electronic Colloquium on Computational Complexity (ECCC), 2011

Design Extractors, Non-Malleable Condensers and Privacy Amplification.
Electronic Colloquium on Computational Complexity (ECCC), 2011

Non-Malleable Extractors for Entropy Rate <1/2
CoRR, 2011

Privacy Amplification and Non-malleable Extractors via Character Sums.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
Improved Constructions of Three Source Extractors.
Electronic Colloquium on Computational Complexity (ECCC), 2010

A New Approach to Affine Extractors and Dispersers.
Electronic Colloquium on Computational Complexity (ECCC), 2010

On the Problem of Local Randomness in Privacy Amplification with an Active Adversary
CoRR, 2010

2009
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008
Network Extractor Protocols.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2004
A Speaker Tracking Algorithm Based on Audio and Visual Information Fusion Using Particle Filter.
Proceedings of the Image Analysis and Recognition: International Conference, 2004


  Loading...