The following pages link to Daniel Reichman (Q418890):
Displaying 23 items.
- New bounds for contagious sets (Q418891) (← links)
- Approximating maximum satisfiable subsystems of linear equations of bounded width (Q963367) (← links)
- On the hardness of approximating max-satisfy (Q1045886) (← links)
- Contagious sets in dense graphs (Q1678088) (← links)
- Contagious sets in random graphs (Q1688015) (← links)
- Fast-Match: fast affine template matching (Q2187432) (← links)
- On the existence of Nash equilibrium in games with resource-bounded players (Q2292618) (← links)
- On giant components and treewidth in the layers model (Q2811162) (← links)
- Smoothed Analysis on Connected Graphs (Q2947435) (← links)
- Smoothed Analysis on Connected Graphs (Q2969664) (← links)
- Recoverable Values for Independent Sets (Q3012827) (← links)
- LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs (Q4575875) (← links)
- (Q4598220) (← links)
- On percolation and ‐hardness (Q4633317) (← links)
- Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays (Q5111338) (← links)
- Multitasking Capacity: Hardness Results and Improved Constructions (Q5220467) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313015) (← links)
- Contagious Sets in Expanders (Q5363074) (← links)
- String Matching: Communication, Circuits, and Learning. (Q5875515) (← links)
- New ordering methods to construct contagious sets and induced degenerate subgraphs (Q6102104) (← links)
- Erratum to: ``Multitasking capacity: hardness results and improved constructions'' (Q6572999) (← links)
- Local treewidth of random and noisy graphs with applications to stopping contagion in networks (Q6591856) (← links)
- How many neurons does it take to approximate the maximum? (Q6645476) (← links)
