On Systems of Linear Equations with Two Variables per Equation. - Uriel Feige; Daniel Reichman 001 (APPROX-RANDOM, 2004)

On the hardness of approximating Max-Satisfy. - Uriel Feige; Daniel Reichman 001 (Inf. Process. Lett., 2006)

Approximating maximum satisfiable subsystems of linear equations of bounded width. - Zeev Nutov; Daniel Reichman 001 (Inf. Process. Lett., 2008)

Influence is a Matter of Degree: New Algorithms for Activation Problems - Daniel Reichman 001 (CoRR, 2010)

Tight Approximation of Image Matching - Simon Korman; Daniel Reichman 001; Gilad Tsur (CoRR, 2011)

New bounds for contagious sets. - Daniel Reichman 001 (Discret. Math., 2012)

Contagious Sets in Expanders. - Amin Coja-Oghlan; Uriel Feige; Michael Krivelevich; Daniel Reichman 001 (SODA, 2015)

On the Non-Existence of Nash Equilibrium in Games with Resource-Bounded Players. - Joseph Y. Halpern; Rafael Pass; Daniel Reichman 001 (CoRR, 2015)

On Percolation and NP-Hardness. - Daniel Reichman 001; Igor Shinkar (Electron. Colloquium Comput. Complex., 2015)

Recoverable values for independent sets. - Uriel Feige; Daniel Reichman 001 (Random Struct. Algorithms, 2015)

Smoothed Analysis on Connected Graphs. - Michael Krivelevich; Daniel Reichman 001; Wojciech Samotij (SIAM J. Discret. Math., 2015)

On Percolation and NP-Hardness. - Huck Bennett; Daniel Reichman 001; Igor Shinkar (ICALP, 2016)

Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. - Nikhil Bansal 001; Daniel Reichman 001; Seeun William Umboh (CoRR, 2016)

A Graph-Theoretic Approach to Multitasking. - Jonathan D. Cohen 003; Biswadip Dey; Tom Griffiths 001; Sebastian Musslick; Kayhan Özcimder; Daniel Reichman 001; Igor Shinkar; Tal Wagner (CoRR, 2016)

Testing Pattern-Freeness. - Simon Korman; Daniel Reichman 001 (CoRR, 2016)

On giant components and treewidth in the layers model. - Uriel Feige; Jonathan Hermon; Daniel Reichman 001 (Random Struct. Algorithms, 2016)

The Structure of Goal Systems Predicts Human Performance. - David Bourgin; Falk Lieder; Daniel Reichman 001; Nimrod Talmon; Tom Griffiths 001 (CogSci, 2017)

Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays. - Omri Ben-Eliezer; Simon Korman; Daniel Reichman 001 (ICALP, 2017)

A graph-theoretic approach to multitasking. - Noga Alon; Daniel Reichman 001; Igor Shinkar; Tal Wagner; Sebastian Musslick; Jonathan D. Cohen 003; Tom Griffiths 001; Biswadip Dey; Kayhan Özcimder (NIPS, 2017)

LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. - Nikhil Bansal 001; Daniel Reichman 001; Seeun William Umboh (SODA, 2017)

Detecting Patterns Can Be Hard: Circuit Lower Bounds for the String Matching Problem. - Alexander Golovnev; Daniel Reichman 001; Igor Shinkar (CoRR, 2017)

Fast-Match: Fast Affine Template Matching. - Simon Korman; Daniel Reichman 001; Gilad Tsur; Shai Avidan (Int. J. Comput. Vis., 2017)

On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank One Perturbations of Gaussian Tensors. - Andrea Montanari; Daniel Reichman 001; Ofer Zeitouni (IEEE Trans. Inf. Theory, 2017)

Inference in Sparse Graphs with Pairwise Measurements and Side Information. - Dylan J. Foster; Karthik Sridharan; Daniel Reichman 001 (AISTATS, 2018)

The Computational Complexity of Training ReLU(s). - Pasin Manurangsi; Daniel Reichman 001 (CoRR, 2018)

Contagious sets in dense graphs. - Daniel Freund 001; Matthias Poloczek; Daniel Reichman 001 (Eur. J. Comb., 2018)

String Matching: Communication, Circuits, and Learning. - Alexander Golovnev; Mika Göös; Daniel Reichman 001; Igor Shinkar (APPROX-RANDOM, 2019)

Cognitive model priors for predicting human decisions. - David D. Bourgin; Joshua C. Peterson; Daniel Reichman 001; Stuart J. Russell; Thomas L. Griffiths 001 (ICML, 2019)

On the Existence of Nash Equilibrium in Games with Resource-Bounded Players. - Joseph Y. Halpern; Rafael Pass; Daniel Reichman 001 (SAGT, 2019)

Predicting human decisions with behavioral theories and machine learning. - Ori Plonsky; Reut Apel; Eyal Ert; Moshe Tennenholtz; David Bourgin; Joshua C. Peterson; Daniel Reichman 001; Thomas L. Griffiths 001; Stuart J. Russell; Evan C. Carter; James F. Cavanagh; Ido Erev (CoRR, 2019)

On percolation and -hardness. - Huck Bennett; Daniel Reichman 001; Igor Shinkar (Random Struct. Algorithms, 2019)

Multitasking Capacity: Hardness Results and Improved Constructions. - Noga Alon; Jonathan D. Cohen 003; Thomas L. Griffiths 001; Pasin Manurangsi; Daniel Reichman 001; Igor Shinkar; Tal Wagner; Alexander Y. Ku (SIAM J. Discret. Math., 2020)

Size and Depth Separation in Approximating Benign Functions with Neural Networks. - Gal Vardi; Daniel Reichman 001; Toniann Pitassi; Ohad Shamir (COLT, 2021)

Tight Hardness Results for Training Depth-2 ReLU Networks. - Surbhi Goel; Adam R. Klivans; Pasin Manurangsi; Daniel Reichman 001 (ITCS, 2021)

Size and Depth Separation in Approximating Natural Functions with Neural Networks. - Gal Vardi; Daniel Reichman 001; Toniann Pitassi; Ohad Shamir (CoRR, 2021)

The Sketching and Communication Complexity of Subsequence Detection. - Mason DiCicco; Daniel Reichman 001 (CoRR, 2021)

Local Treewidth of Random and Noisy Graphs with Applications to Stopping Contagion in Networks. - Hermish Mehta; Daniel Reichman 001 (APPROX/RANDOM, 2022)

The Learning and Communication Complexity of Subsequence Containment. - Mason DiCicco; Daniel Reichman 001 (ISIT, 2023)

The Computational Challenges of Means Selection Problems: Network Structure of Goal Systems Predicts Human Performance. - Daniel Reichman 001; Falk Lieder; David D. Bourgin; Nimrod Talmon; Thomas L. Griffiths 001 (Cogn. Sci., 2023)

How Many Neurons Does it Take to Approximate the Maximum? - Itay Safran; Daniel Reichman 001; Paul Valiant (SODA, 2024)

Improved Lower Bounds on the Expected Length of Longest Common Subsequences. - George T. Heineman; Chase Miller; Daniel Reichman 001; Andrew Salls; Gábor Sárközy; Duncan Soiffer (CoRR, 2024)

Nearest Neighbor Complexity and Boolean Circuits. - Mason DiCicco; Vladimir Podolskii 001; Daniel Reichman 001 (Electron. Colloquium Comput. Complex., 2024)

Erratum: Multitasking Capacity: Hardness Results and Improved Constructions. - Noga Alon; Jonathan D. Cohen 003; Thomas L. Griffiths 001; Pasin Manurangsi; Daniel Reichman 001; Igor Shinkar; Tal Wagner (SIAM J. Discret. Math., 2024)

Time Lower Bounds for the Metropolis Process and Simulated Annealing. - Zongchen Chen; Dan Mikulincer; Daniel Reichman 001; Alexander S. Wein (APPROX/RANDOM, 2025)

Depth Separations in Neural Networks: Separating the Dimension from the Accuracy. - Itay Safran; Daniel Reichman 001; Paul Valiant (COLT, 2025)

Inoculation strategies for bounded degree graphs. - Mason DiCicco; Henry Poskanzer; Daniel Reichman 001 (Theor. Comput. Sci., 2025)

The Karp Dataset. - Mason DiCicco; Eamon Worden; Conner Olsen; Nikhil Gangaram; Daniel Reichman 001; Neil T. Heffernan (CoRR, 2025)

Size and Depth of Monotone Neural Networks: Interpolation and Approximation. - Dan Mikulincer; Daniel Reichman 001 (IEEE Trans. Neural Networks Learn. Syst., 2025)

On the Depth of Monotone ReLU Neural Networks and ICNNs. - Egor Bakaev; Florestan Brunck; Christoph Hertrich; Daniel Reichman 001; Amir Yehudayoff (CoRR, 2025)

The Computational Complexity of Counting Linear Regions in ReLU Neural Networks. - Moritz Stargalla; Christoph Hertrich; Daniel Reichman 001 (CoRR, 2025)

Protocols for Verifying Smooth Strategies in Bandits and Games. - Miranda Christ; Daniel Reichman 001; Jonathan Shafer (CoRR, 2025)