Ning Xie

Theor. Comput. Sci., February, 2023

2022

Approximate Quantum Circuit Reconstruction.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2022

Hardness of Maximum Likelihood Learning of DPPs.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021

A Generalization of a Theorem of Rothschild and van Lint.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2021

List Learning with Attribute Noise.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2019

A new coding-based algorithm for finding closest pair of vectors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Tagging Address Queries in Maps Search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

AC0∘MOD2 lower bounds for the Boolean Inner Product.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

City Disaster Susceptibility Comparisons using Weighted Bipartite Graphs.

[BibT_eX]

[DOI]

Int. J. Next Gener. Comput., 2018

A New Algorithm for Finding Closest Pair of Vectors.

[BibT_eX]

[DOI]

CoRR, 2018

Context-Sensitive Neural Sentiment Classification.

[BibT_eX]

[DOI]

Shekoofeh Mokhtari

Tao Li

Proceedings of the 2018 IEEE International Conference on Information Reuse and Integration, 2018

RevMap: A Visualized Framework for Holistic View of Reviews.

[BibT_eX]

[DOI]

Shekoofeh Mokhtari

Tao Li

Proceedings of the 2018 IEEE International Conference on Information Reuse and Integration, 2018

A New Algorithm for Finding Closest Pair of Vectors (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2018

2017

Data-Driven Techniques in Disaster Information Management.

[BibT_eX]

[DOI]

Jainendra K. Navlakha

S. Sitharama Iyengar

ACM Comput. Surv., 2017

2016

AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Fourier Sparsity of GF(2) Polynomials.

[BibT_eX]

[DOI]

Hing Yin Tsang

Shengyu Zhang

Proceedings of the Computer Science - Theory and Applications, 2016

2015

AC0 \circ MOD2 lower bounds for the Boolean Inner Product.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2015

Sunflowers and Testing Triangle-Freeness of Functions.

[BibT_eX]

[DOI]

Ishay Haviv

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

2014

A bipartite-graph based approach for disaster susceptibility comparisons among cities.

[BibT_eX]

[DOI]

Proceedings of the 15th IEEE International Conference on Information Reuse and Integration, 2014

Generating textual storyline to improve situation awareness in disaster management.

[BibT_eX]

[DOI]

Proceedings of the 15th IEEE International Conference on Information Reuse and Integration, 2014

2013

Robust characterizations of k-wise independence over product spaces and related testing results.

[BibT_eX]

[DOI]

Ronitt Rubinfeld

Random Struct. Algorithms, 2013

Fourier Sparsity, Spectral Norm, and the Log-Rank Conjecture.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Tight Lower Bounds for Testing Linear Isomorphism.

[BibT_eX]

[DOI]

Elena Grigorescu

Karl Wimmer

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

Testing k-wise independent distributions.

[BibT_eX]

[DOI]

PhD thesis, 2012

Space-efficient local computation algorithms.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Converting Online Algorithms to Local Computation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Fast Local Computation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Computer Science, 2011

Property Testing via Set-Theoretic Operations.

[BibT_eX]

[DOI]

Victor Chen

Madhu Sudan

Proceedings of the Innovations in Computer Science, 2011

The Complexity of Linear Dependence Problems in Vector Spaces.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Computer Science, 2011

2010

Separations of Matroid Freeness Properties.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2010

Testing linear-invariant non-linear properties: A short report.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2010

Lower Bounds for Testing Triangle-freeness in Boolean Functions.

[BibT_eX]

[DOI]

Arnab Bhattacharyya

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Testing Linear-Invariant Non-linear Properties: A Short Report.

[BibT_eX]

[DOI]

Proceedings of the Property Testing - Current Research and Surveys, 2010

Testing Non-uniform k-Wise Independent Distributions over Product Spaces.

[BibT_eX]

[DOI]

Ronitt Rubinfeld

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Testing Linear-Invariant Non-Linear Properties.

[BibT_eX]

[DOI]

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008

Breaking the ε-Soundness Bound of the Linearity Test over GF(2).

[BibT_eX]

[DOI]

Tali Kaufman

Simon Litsyn

Proceedings of the Sublinear Algorithms, 17.08. - 22.08.2008, 2008

Breaking the epsilon-Soundness Bound of the Linearity Test over GF(2).

[BibT_eX]

[DOI]

Tali Kaufman

Simon Litsyn