Ilya P. Razenshteyn

activity

20102021

most citedProvably Robust Deep Learning via Adversarially Trained Smoothed Classifiers

261 citations · 836 across the 30 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2010★ 1 cited

Triangle-Free 2-Matchings Revisited

Maxim Babenko, Alexey Gusakov, Ilya Razenshteyn

A \emph{2-matching} in an undirected graph $G = (V G, E G)$ is a function $f : E G \to {0, 1, 2}$ such that for each node $v \in V G$ the sum of values $f (e)$ on all edges $e$ i…

math.CO2010

A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks

Maxim Babenko, Ignat Kolesnichenko, Ilya Razenshteyn

Consider an undirected graph $G = (V G, E G)$ and a set of six \emph{terminals} $T = {s_{1}, s_{2}, s_{3}, t_{1}, t_{2}, t_{3}} \subseteq V G$ . The goal is to find a collection $\calP$ of thr…