◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Otmar Ertl

18 papers hereh-index 10306 citations25 works total

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

author position
  • sole author10
  • middle author6
  • last author2

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

fields
  • cs.DS10
  • cs.DC3
  • cs.SE3
  • cs.DB1
  • stat.CO1

identity via Semantic Scholar / OpenAlex

activity
20172026
most citedComputing Extremely Accurate Quantiles Using t-Digests

42 citations · 194 across the 18 of their papers we have counts for

collaborators
Showing 2019 · cs.DSShow all

1 paper · 2 filters

cs.DS2019★ 23 cited

ProbMinHash -- A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity

Otmar Ertl

The probability Jaccard similarity was recently proposed as a natural generalization of the Jaccard similarity to measure the proximity of sets whose elements are associated with r…

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