35 citations · 114 across the 25 of their papers we have counts for
6 papers · 1 filter
The Learning and Communication Complexity of Subsequence Containment
Mason DiCicco, Daniel Reichman
We consider the learning and communication complexity of subsequence containment. In the learning problem, we seek to learn a classifier that positively labels a binary string …
A Graph-Theoretic Approach to Multitasking
Noga Alon, Jonathan D. Cohen, Biswadip Dey +6
A key feature of neural network architectures is their ability to support the simultaneous interaction among large numbers of units in the learning and processing of representation…
Contagious Sets in Dense Graphs
Daniel Freund, Matthias Poloczek, Daniel Reichman
We study the activation process in undirected graphs known as bootstrap percolation: a vertex is active either if it belongs to a set of initially activated vertices or if at some…
On giant components and treewidth in the layers model
Uriel Feige, Jonathan Hermon, Daniel Reichman
Given an undirected -vertex graph and an integer , let denote the random vertex induced subgraph of generated by ordering according to a random perm…
Contagious Sets in Expanders
Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich +1
We consider the following activation process in undirected graphs: a vertex is active either if it belongs to a set of initially activated vertices or if at some point it has at le…
Influence is a Matter of Degree: New Algorithms for Activation Problems
Daniel Reichman
We consider the target set selection problem. In this problem, a vertex is active either if it belongs to a set of initially activated vertices or if at some point it has at least…