default search action
Daniel Reichman 0001
Person information
- affiliation: Worcester Polytechnic Institute, Worcester, MA, USA
- affiliation (former): UC Berkeley, CA, USA
Other persons with the same name
- Daniel Reichman 0002
(aka: Daniël Reichman 0002) — Duke University, Electrical Engineering Department, Durham, NC, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths, Pasin Manurangsi, Daniel Reichman, Igor Shinkar, Tal Wagner:
Erratum: Multitasking Capacity: Hardness Results and Improved Constructions. SIAM J. Discret. Math. 38(2): 2001-2003 (2024) - [c22]Itay Safran, Daniel Reichman, Paul Valiant:
How Many Neurons Does it Take to Approximate the Maximum? SODA 2024: 3156-3183 - [i32]Mason DiCicco, Vladimir Podolskii, Daniel Reichman:
Nearest Neighbor Complexity and Boolean Circuits. CoRR abs/2402.06740 (2024) - [i31]Itay Safran, Daniel Reichman, Paul Valiant:
Depth Separations in Neural Networks: Separating the Dimension from the Accuracy. CoRR abs/2402.07248 (2024) - [i30]George T. Heineman, Chase Miller, Daniel Reichman, Andrew Salls, Gábor Sárközy, Duncan Soiffer:
Improved Lower Bounds on the Expected Length of Longest Common Subsequences. CoRR abs/2407.10925 (2024) - [i29]Mason DiCicco, Vladimir Podolskii, Daniel Reichman:
Nearest Neighbor Complexity and Boolean Circuits. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j12]Daniel Reichman, Falk Lieder, David D. Bourgin, Nimrod Talmon, Thomas L. Griffiths:
The Computational Challenges of Means Selection Problems: Network Structure of Goal Systems Predicts Human Performance. Cogn. Sci. 47(8) (2023) - [c21]Mason DiCicco, Daniel Reichman:
The Learning and Communication Complexity of Subsequence Containment. ISIT 2023: 322-327 - [i28]Mason DiCicco, Henry Poskanzer, Daniel Reichman:
Inoculation strategies for bounded degree graphs. CoRR abs/2304.12303 (2023) - [i27]Itay Safran, Daniel Reichman, Paul Valiant:
How Many Neurons Does it Take to Approximate the Maximum? CoRR abs/2307.09212 (2023) - [i26]Zongchen Chen, Dan Mikulincer, Daniel Reichman, Alexander S. Wein:
Time Lower Bounds for the Metropolis Process and Simulated Annealing. CoRR abs/2312.13554 (2023) - 2022
- [c20]Hermish Mehta, Daniel Reichman:
Local Treewidth of Random and Noisy Graphs with Applications to Stopping Contagion in Networks. APPROX/RANDOM 2022: 7:1-7:17 - [c19]Dan Mikulincer, Daniel Reichman:
Size and depth of monotone neural networks: interpolation and approximation. NeurIPS 2022 - [i25]Hermish Mehta, Daniel Reichman:
Local treewidth of random and noisy graphs with applications to stopping contagion in networks. CoRR abs/2204.07827 (2022) - [i24]Dan Mikulincer, Daniel Reichman:
Size and depth of monotone neural networks: interpolation and approximation. CoRR abs/2207.05275 (2022) - 2021
- [c18]Gal Vardi, Daniel Reichman, Toniann Pitassi, Ohad Shamir:
Size and Depth Separation in Approximating Benign Functions with Neural Networks. COLT 2021: 4195-4223 - [c17]Surbhi Goel, Adam R. Klivans, Pasin Manurangsi, Daniel Reichman:
Tight Hardness Results for Training Depth-2 ReLU Networks. ITCS 2021: 22:1-22:14 - [i23]Gal Vardi, Daniel Reichman, Toniann Pitassi, Ohad Shamir:
Size and Depth Separation in Approximating Natural Functions with Neural Networks. CoRR abs/2102.00314 (2021) - [i22]Mason DiCicco, Daniel Reichman:
The Sketching and Communication Complexity of Subsequence Detection. CoRR abs/2112.13399 (2021) - 2020
- [j11]Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths
Multitasking Capacity: Hardness Results and Improved Constructions. SIAM J. Discret. Math. 34(1): 885-903 (2020) - [i21]Surbhi Goel, Adam R. Klivans, Pasin Manurangsi, Daniel Reichman:
Tight Hardness Results for Training Depth-2 ReLU Networks. CoRR abs/2011.13550 (2020)
2010 – 2019
- 2019
- [j10]Huck Bennett, Daniel Reichman, Igor Shinkar:
On percolation and -hardness. Random Struct. Algorithms 54(2): 228-257 (2019) - [c16]Alexander Golovnev, Mika Göös, Daniel Reichman, Igor Shinkar:
String Matching: Communication, Circuits, and Learning. APPROX-RANDOM 2019: 56:1-56:20 - [c15]David D. Bourgin, Joshua C. Peterson, Daniel Reichman, Stuart J. Russell, Thomas L. Griffiths:
Cognitive model priors for predicting human decisions. ICML 2019: 5133-5141 - [c14]Joseph Y. Halpern, Rafael Pass
On the Existence of Nash Equilibrium in Games with Resource-Bounded Players. SAGT 2019: 139-152 - [i20]Ori Plonsky, Reut Apel, Eyal Ert, Moshe Tennenholtz, David Bourgin, Joshua C. Peterson, Daniel Reichman, Thomas L. Griffiths, Stuart J. Russell, Evan C. Carter, James F. Cavanagh, Ido Erev:
Predicting human decisions with behavioral theories and machine learning. CoRR abs/1904.06866 (2019) - [i19]David D. Bourgin, Joshua C. Peterson, Daniel Reichman, Thomas L. Griffiths, Stuart J. Russell:
Cognitive Model Priors for Predicting Human Decisions. CoRR abs/1905.09397 (2019) - 2018
- [j9]Daniel Freund
Contagious sets in dense graphs. Eur. J. Comb. 68: 66-78 (2018) - [c13]Dylan J. Foster, Karthik Sridharan, Daniel Reichman:
Inference in Sparse Graphs with Pairwise Measurements and Side Information. AISTATS 2018: 1810-1818 - [i18]Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths, Pasin Manurangsi, Daniel Reichman, Igor Shinkar, Tal Wagner, Alexander Y. Ku:
Multitasking Capacity: Hardness Results and Improved Constructions. CoRR abs/1809.02835 (2018) - [i17]Pasin Manurangsi, Daniel Reichman:
The Computational Complexity of Training ReLU(s). CoRR abs/1810.04207 (2018) - 2017
- [j8]Simon Korman, Daniel Reichman, Gilad Tsur, Shai Avidan:
Fast-Match: Fast Affine Template Matching. Int. J. Comput. Vis. 121(1): 111-125 (2017) - [j7]Andrea Montanari, Daniel Reichman
On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank One Perturbations of Gaussian Tensors. IEEE Trans. Inf. Theory 63(3): 1572-1579 (2017) - [c12]David Bourgin, Falk Lieder, Daniel Reichman, Nimrod Talmon, Tom Griffiths:
The Structure of Goal Systems Predicts Human Performance. CogSci 2017 - [c11]Omri Ben-Eliezer, Simon Korman, Daniel Reichman:
Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays. ICALP 2017: 9:1-9:14 - [c10]Noga Alon, Daniel Reichman, Igor Shinkar, Tal Wagner, Sebastian Musslick, Jonathan D. Cohen, Tom Griffiths, Biswadip Dey, Kayhan Özcimder:
A graph-theoretic approach to multitasking. NIPS 2017: 2100-2109 - [c9]Nikhil Bansal, Daniel Reichman, Seeun William Umboh
LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. SODA 2017: 1964-1979 - [i16]Dylan J. Foster, Daniel Reichman, Karthik Sridharan:
Inference in Sparse Graphs with Pairwise Measurements and Side Information. CoRR abs/1703.02728 (2017) - [i15]Alexander Golovnev, Daniel Reichman, Igor Shinkar:
Detecting Patterns Can Be Hard: Circuit Lower Bounds for the String Matching Problem. CoRR abs/1709.02034 (2017) - 2016
- [j6]Uriel Feige, Jonathan Hermon, Daniel Reichman:
On giant components and treewidth in the layers model. Random Struct. Algorithms 48(3): 524-545 (2016) - [c8]Huck Bennett, Daniel Reichman, Igor Shinkar:
On Percolation and NP-Hardness. ICALP 2016: 80:1-80:14 - [i14]Nikhil Bansal, Daniel Reichman, Seeun William Umboh:
Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. CoRR abs/1606.05198 (2016) - [i13]Simon Korman, Daniel Reichman:
Testing Pattern-Freeness. CoRR abs/1607.03961 (2016) - [i12]Jonathan D. Cohen, Biswadip Dey, Tom Griffiths, Sebastian Musslick, Kayhan Özcimder, Daniel Reichman, Igor Shinkar, Tal Wagner:
A Graph-Theoretic Approach to Multitasking. CoRR abs/1611.02400 (2016) - 2015
- [j5]Uriel Feige, Daniel Reichman:
Recoverable values for independent sets. Random Struct. Algorithms 46(1): 142-159 (2015) - [j4]Michael Krivelevich, Daniel Reichman, Wojciech Samotij:
Smoothed Analysis on Connected Graphs. SIAM J. Discret. Math. 29(3): 1654-1669 (2015) - [c7]Daniel Freund
Contagious Sets in Dense Graphs. IWOCA 2015: 185-196 - [c6]Andrea Montanari, Daniel Reichman, Ofer Zeitouni:
On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank-One Perturbations of Gaussian Tensors. NIPS 2015: 217-225 - [c5]Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman:
Contagious Sets in Expanders. SODA 2015: 1953-1987 - [i11]Daniel Freund, Matthias Poloczek, Daniel Reichman:
Contagious Sets in Dense Graphs. CoRR abs/1503.00158 (2015) - [i10]Joseph Y. Halpern, Rafael Pass, Daniel Reichman:
On the Non-Existence of Nash Equilibrium in Games with Resource-Bounded Players. CoRR abs/1507.01501 (2015) - [i9]Daniel Reichman, Igor Shinkar:
On Percolation and NP-Hardness. CoRR abs/1508.02071 (2015) - [i8]Daniel Reichman, Igor Shinkar:
On Percolation and NP-Hardness. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c4]Michael Krivelevich, Daniel Reichman, Wojciech Samotij:
Smoothed Analysis on Connected Graphs. APPROX-RANDOM 2014: 810-825 - [i7]Uriel Feige, Jonathan Hermon, Daniel Reichman:
On giant components and treewidth in the layers model. CoRR abs/1401.6681 (2014) - [i6]Andrea Montanari, Daniel Reichman, Ofer Zeitouni:
On the limitation of spectral methods: From the Gaussian hidden clique problem to rank one perturbations of Gaussian tensors. CoRR abs/1411.6149 (2014) - 2013
- [c3]Simon Korman, Daniel Reichman, Gilad Tsur, Shai Avidan:
FasT-Match: Fast Affine Template Matching. CVPR 2013: 2331-2338 - [i5]Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman:
Contagious Sets in Expanders. CoRR abs/1306.2465 (2013) - 2012
- [j3]Daniel Reichman:
New bounds for contagious sets. Discret. Math. 312(10): 1812-1814 (2012) - 2011
- [c2]Uriel Feige, Daniel Reichman:
Recoverable Values for Independent Sets. ICALP (1) 2011: 486-497 - [i4]Uriel Feige, Daniel Reichman:
Recoverable Values for Independent Sets. CoRR abs/1103.5609 (2011) - [i3]Simon Korman, Daniel Reichman, Gilad Tsur:
Tight Approximation of Image Matching. CoRR abs/1111.1713 (2011) - 2010
- [i2]Daniel Reichman:
Influence is a Matter of Degree: New Algorithms for Activation Problems. CoRR abs/1009.3619 (2010)
2000 – 2009
- 2008
- [j2]Zeev Nutov, Daniel Reichman:
Approximating maximum satisfiable subsystems of linear equations of bounded width. Inf. Process. Lett. 106(5): 203-207 (2008) - 2006
- [j1]Uriel Feige, Daniel Reichman:
On the hardness of approximating Max-Satisfy. Inf. Process. Lett. 97(1): 31-35 (2006) - 2004
- [c1]Uriel Feige, Daniel Reichman:
On Systems of Linear Equations with Two Variables per Equation. APPROX-RANDOM 2004: 117-127 - [i1]Uriel Feige, Daniel Reichman:
On The Hardness of Approximating Max-Satisfy. Electron. Colloquium Comput. Complex. TR04 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-18 23:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: