◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Piotr Indyk

4 papers hereh-index 26 citations5 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • middle author2
  • last author1

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • cs.LG2
  • cs.CG1
  • cs.DS1
same name
  • Piotr Indyk — 6 papers, h 4

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

collaborators
Showing cs.CGShow all

1 paper · 1 filter

cs.CG2025

Even Faster Algorithm for the Chamfer Distance

Ying Feng, Piotr Indyk

For two d-dimensional point sets A, B of size up to n, the Chamfer distance from A to B is defined as CH(A,B) = \sum_{a \in A} \min_{b \in B} \|a-b\|. The Chamfer distance is a wid…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.