Daniel Reichman

From MaRDI portal
(Redirected from Person:418890)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Tight hardness results for training depth-2 ReLU networks2026-04-15Paper
Inoculation strategies for bounded degree graphs
Theoretical Computer Science
2025-03-11Paper
How many neurons does it take to approximate the maximum?2024-11-28Paper
Local treewidth of random and noisy graphs with applications to stopping contagion in networks2024-08-22Paper
Erratum to: ``Multitasking capacity: hardness results and improved constructions''
SIAM Journal on Discrete Mathematics
2024-07-16Paper
New ordering methods to construct contagious sets and induced degenerate subgraphs
Involve
2023-05-08Paper
String Matching: Communication, Circuits, and Learning.
(available as arXiv preprint)
2023-02-03Paper
A note on the largest induced matching in graphs avoiding a fixed bipartite graph2020-06-05Paper
Fast-Match: fast affine template matching
International Journal of Computer Vision
2020-06-03Paper
Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays
(available as arXiv preprint)
2020-05-27Paper
Multitasking capacity: hardness results and improved constructions
SIAM Journal on Discrete Mathematics
2020-03-26Paper
On the existence of Nash equilibrium in games with resource-bounded players
(available as arXiv preprint)
2020-02-04Paper
On the existence of Nash equilibrium in games with resource-bounded players2020-02-04Paper
On percolation and \(\mathcal{NP}\)-hardness
Random Structures & Algorithms
2019-05-02Paper
LP-based robust algorithms for noisy minor-free and bounded treewidth graphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
2018-07-16Paper
Contagious sets in random graphs
The Annals of Applied Probability
2018-01-04Paper
Contagious sets in random graphs
The Annals of Applied Probability
2018-01-04Paper
On percolation and NP-hardness2017-12-19Paper
Contagious sets in dense graphs
European Journal of Combinatorics
2017-11-14Paper
Contagious sets in expanders
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
2017-10-05Paper
Smoothed Analysis on Connected Graphs2017-03-22Paper
On giant components and treewidth in the layers model
Random Structures & Algorithms
2016-06-10Paper
Contagious sets in dense graphs
Lecture Notes in Computer Science
2016-04-04Paper
Smoothed Analysis on Connected Graphs
SIAM Journal on Discrete Mathematics
2015-09-23Paper
Smoothed Analysis on Connected Graphs
SIAM Journal on Discrete Mathematics
2015-09-23Paper
Recoverable values for independent sets
Random Structures & Algorithms
2015-02-20Paper
New bounds for contagious sets
Discrete Mathematics
2012-05-30Paper
Recoverable values for independent sets
Lecture Notes in Computer Science
2011-07-06Paper
Approximating maximum satisfiable subsystems of linear equations of bounded width
Information Processing Letters
2010-04-19Paper
On the hardness of approximating max-satisfy
Information Processing Letters
2009-12-18Paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science
2005-08-25Paper


Research outcomes over time


This page was built for person: Daniel Reichman