Travelled to:
1 × Australia
1 × USA
1 × United Kingdom
Collaborated with:
∅ R.Panigrahy A.Goel S.Khanna
Talks about:
tradeoff (1) neighbor (1) bipartit (1) regular (1) perfect (1) nearest (1) complex (1) between (1) smooth (1) search (1)
Person: Michael Kapralov
DBLP: Kapralov:Michael
Contributed to:
Wrote 3 papers:
- PODS-2015-Kapralov #complexity #nearest neighbour #query #trade-off
- Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search (MK), pp. 329–342.
- ICALP-v1-2012-KapralovP #bound #metric
- NNS Lower Bounds via Metric Expansion for l ∞ and EMD (MK, RP), pp. 545–556.
- STOC-2010-GoelKK #graph
- Perfect matchings in o(n log n) time in regular bipartite graphs (AG, MK, SK), pp. 39–46.