Daniel Reichman

According to our database1, Daniel Reichman authored at least 19 papers between 2004 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Inference in Sparse Graphs with Pairwise Measurements and Side Information.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017
LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

A graph-theoretic approach to multitasking.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

The Structure of Goal Systems Predicts Human Performance.
Proceedings of the 39th Annual Meeting of the Cognitive Science Society, 2017

2016
On giant components and treewidth in the layers model.
Random Struct. Algorithms, 2016

On Percolation and NP-Hardness.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
On Percolation and NP-Hardness.
Electronic Colloquium on Computational Complexity (ECCC), 2015

Contagious Sets in Expanders.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank-One Perturbations of Gaussian Tensors.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Contagious Sets in Dense Graphs.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014
Smoothed Analysis on Connected Graphs.
Proceedings of the Approximation, 2014

2013
FasT-Match: Fast Affine Template Matching.
Proceedings of the 2013 IEEE Conference on Computer Vision and Pattern Recognition, 2013

2012
New bounds for contagious sets.
Discrete Mathematics, 2012

2011
Recoverable Values for Independent Sets.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2008
Approximating maximum satisfiable subsystems of linear equations of bounded width.
Inf. Process. Lett., 2008

2006
On the hardness of approximating Max-Satisfy.
Inf. Process. Lett., 2006

2004
On The Hardness of Approximating Max-Satisfy
Electronic Colloquium on Computational Complexity (ECCC), 2004

On Systems of Linear Equations with Two Variables per Equation.
Proceedings of the Approximation, 2004


  Loading...