◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Thaler

40 papers hereh-index 293.2k citations98 works total

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

author position
  • sole author3
  • first author3
  • middle author11
  • last author23

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

fields
  • cs.DS18
  • cs.CC10
  • quant-ph5
  • cs.IT2
  • cs.LG2
  • cs.CR1
same name
  • J. Thaler — 144 papers, h 60
  • J. Thaler — 95 papers, h 49
  • J. Thaler — 80 papers, h 25
  • J. Thaler — 10 papers, h 13
  • J. Thaler — 2 papers
  • J. Thaler — 2 papers

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

activity
20102022
most citedReliably Learning the ReLU in Polynomial Time

53 citations · 247 across the 33 of their papers we have counts for

collaborators
Showing 2011 · cs.DSShow all

4 papers · 2 filters

cs.DS2011★ 9 cited

Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps

Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher +1

A dictionary (or map) is a key-value store that requires all keys be unique, and a multimap is a key-value store that allows for multiple values to be associated with the same key.…

cs.DS2011

Practical Verified Computation with Streaming Interactive Proofs

Graham Cormode, Michael Mitzenmacher, Justin Thaler

When delegating computation to a service provider, as in cloud computing, we seek some reassurance that the output is correct and complete. Yet recomputing the output as a check is…

cs.DS2011

External-Memory Multimaps

Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher +1

Many data structures support dictionaries, also known as maps or associative arrays, which store and manage a set of key-value pairs. A \emph{multimap} is generalization that allow…

cs.DS2011★ 10 cited

Hierarchical Heavy Hitters with the Space Saving Algorithm

Michael Mitzenmacher, Thomas Steinke, Justin Thaler

The Hierarchical Heavy Hitters problem extends the notion of frequent items to data arranged in a hierarchy. This problem has applications to network traffic monitoring, anomaly de…

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