Daniel Reichman

Available identifiers

zbMath Open reichman.danielMaRDI QIDQ418890

List of research outcomes

Publication	Date of Publication	Type
How many neurons does it take to approximate the maximum?	2024-11-28	Paper
Local treewidth of random and noisy graphs with applications to stopping contagion in networks	2024-08-22	Paper
Erratum to: ``Multitasking capacity: hardness results and improved constructions	2024-07-16	Paper
New ordering methods to construct contagious sets and induced degenerate subgraphs	2023-05-08	Paper
String Matching: Communication, Circuits, and Learning.	2023-02-03	Paper
A note on the largest induced matching in graphs avoiding a fixed bipartite graph	2020-06-05	Paper
Fast-Match: fast affine template matching	2020-06-03	Paper
Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays	2020-05-27	Paper
Multitasking Capacity: Hardness Results and Improved Constructions	2020-03-26	Paper
On the existence of Nash equilibrium in games with resource-bounded players	2020-02-04	Paper
On percolation and ‐hardness	2019-05-02	Paper
LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs	2018-07-16	Paper
Contagious sets in random graphs	2018-01-04	Paper
https://portal.mardi4nfdi.de/entity/Q4598220	2017-12-19	Paper
Contagious sets in dense graphs	2017-11-14	Paper
Contagious Sets in Expanders	2017-10-05	Paper
Smoothed Analysis on Connected Graphs	2017-03-22	Paper
On giant components and treewidth in the layers model	2016-06-10	Paper
Contagious sets in dense graphs	2016-04-04	Paper
Smoothed Analysis on Connected Graphs	2015-09-23	Paper
Recoverable values for independent sets	2015-02-20	Paper
New bounds for contagious sets	2012-05-30	Paper
Recoverable values for independent sets	2011-07-06	Paper
Approximating maximum satisfiable subsystems of linear equations of bounded width	2010-04-19	Paper
On the hardness of approximating max-satisfy	2009-12-18	Paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques	2005-08-25	Paper

Research outcomes over time

This page was built for person: Daniel Reichman