Daniel Reichman

Orcid: 0000-0003-0566-7528

Affiliations:
  • Worcester Polytechnic Institute, Worcester, MA, USA
  • UC Berkeley, CA, USA (former)


According to our database1, Daniel Reichman authored at least 45 papers between 2004 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Nearest Neighbor Complexity and Boolean Circuits.
Electron. Colloquium Comput. Complex., 2024

Depth Separations in Neural Networks: Separating the Dimension from the Accuracy.
CoRR, 2024

2023
The Computational Challenges of Means Selection Problems: Network Structure of Goal Systems Predicts Human Performance.
Cogn. Sci., August, 2023

Time Lower Bounds for the Metropolis Process and Simulated Annealing.
CoRR, 2023

How Many Neurons Does it Take to Approximate the Maximum?
CoRR, 2023

Inoculation strategies for bounded degree graphs.
CoRR, 2023

The Learning and Communication Complexity of Subsequence Containment.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Size and depth of monotone neural networks: interpolation and approximation.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Local Treewidth of Random and Noisy Graphs with Applications to Stopping Contagion in Networks.
Proceedings of the Approximation, 2022

2021
The Sketching and Communication Complexity of Subsequence Detection.
CoRR, 2021

Size and Depth Separation in Approximating Natural Functions with Neural Networks.
CoRR, 2021

Tight Hardness Results for Training Depth-2 ReLU Networks.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Size and Depth Separation in Approximating Benign Functions with Neural Networks.
Proceedings of the Conference on Learning Theory, 2021

2020
Multitasking Capacity: Hardness Results and Improved Constructions.
SIAM J. Discret. Math., 2020

2019
On percolation and -hardness.
Random Struct. Algorithms, 2019

Predicting human decisions with behavioral theories and machine learning.
CoRR, 2019

On the Existence of Nash Equilibrium in Games with Resource-Bounded Players.
Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

Cognitive model priors for predicting human decisions.
Proceedings of the 36th International Conference on Machine Learning, 2019

String Matching: Communication, Circuits, and Learning.
Proceedings of the Approximation, 2019

2018
Contagious sets in dense graphs.
Eur. J. Comb., 2018

The Computational Complexity of Training ReLU(s).
CoRR, 2018

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

2017
On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank One Perturbations of Gaussian Tensors.
IEEE Trans. Inf. Theory, 2017

Fast-Match: Fast Affine Template Matching.
Int. J. Comput. Vis., 2017

Detecting Patterns Can Be Hard: Circuit Lower Bounds for the String Matching Problem.
CoRR, 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

Testing Pattern-Freeness.
CoRR, 2016

A Graph-Theoretic Approach to Multitasking.
CoRR, 2016

Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs.
CoRR, 2016

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

2015
Smoothed Analysis on Connected Graphs.
SIAM J. Discret. Math., 2015

Recoverable values for independent sets.
Random Struct. Algorithms, 2015

On Percolation and NP-Hardness.
Electron. Colloquium Comput. Complex., 2015

On the Non-Existence of Nash Equilibrium in Games with Resource-Bounded Players.
CoRR, 2015

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

2012
New bounds for contagious sets.
Discret. Math., 2012

2011
Tight Approximation of Image Matching
CoRR, 2011

2010
Influence is a Matter of Degree: New Algorithms for Activation Problems
CoRR, 2010

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 Systems of Linear Equations with Two Variables per Equation.
Proceedings of the Approximation, 2004


  Loading...