◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Heiko Röglin

1 paper here

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

author position
  • last author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.DS1
ORCID 0009-0006-8438-3986
same name
  • Heiko Röglin — 1 paper, h 24

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

most citedk-Means has Polynomial Smoothed Complexity

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

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2009★ 15 cited

k-Means has Polynomial Smoothed Complexity

David Arthur, Bodo Manthey, Heiko Röglin

The k-means method is one of the most widely used clustering algorithms, drawing its popularity from its speed in practice. Recently, however, it was shown to have exponential wors…

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