◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Christian Sohler

10 papers hereh-index 29 citations12 works total

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

author position
  • middle author6
  • last author4

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

fields
  • cs.DS8
  • cs.LG2

identity via Semantic Scholar / OpenAlex

activity
20222026
most citedOn the adversarial robustness of Locality-Sensitive Hashing in Hamming space

1 citations · 1 across the 8 of their papers we have counts for

collaborators
Showing 2024Show all

2 papers · 1 filter

cs.DS2024

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center

Matthijs Ebbens, Nicole Funk, Jan Höckendorff +2

We study the k-center problem in the context of individual fairness. Let P be a set of n points in a metric space and rx​ be the distance between x∈P and its $\lceil…

cs.DS2024★ 1 cited

On the adversarial robustness of Locality-Sensitive Hashing in Hamming space

Michael Kapralov, Mikhail Makarov, Christian Sohler

Locality-sensitive hashing~[Indyk,Motwani'98] is a classical data structure for approximate nearest neighbor search. It allows, after a close to linear time preprocessing of the in…

◍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.