I. Newman

activity

20022023

most citedThe Stackelberg Minimum Spanning Tree Game

31 citations · 95 across the 16 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

cs.DS2021

Parameterized Convexity Testing

Abhiruk Lahiri, Ilan Newman, Nithin Varma

In this work, we develop new insights into the fundamental problem of convexity testing of real-valued functions over the domain $[n]$ . Specifically, we present a nonadaptive algor…

cs.LG2021★ 1 cited

Coresets for Decision Trees of Signals

Ibrahim Jubran, Ernesto Evgeniy Sanches Shayda, Ilan Newman +1

A $k$ -decision tree $t$ (or $k$ -tree) is a recursive partition of a matrix (2D-signal) into $k \geq 1$ block matrices (axis-parallel rectangles, leaves) where each rectangle is assi…

cs.DS2021

Strongly Sublinear Algorithms for Testing Pattern Freeness

Ilan Newman, Nithin Varma

For a permutation $π : [k] \to [k]$ , a function $f : [n] \to R$ contains a $π$ -appearance if there exists $1 \leq i_{1} < i_{2} < \dots < i_{k} \leq n$ such that for all $s,t \in [k…