Ilya Razenshteyn

activity

20102015

most citedOptimal Data-Dependent Hashing for Approximate Near Neighbors

33 citations · 33 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

1 paper · 1 filter

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…