◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

T. Kaufman

3 papers hereh-index 302.7k citations104 works total

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

author position
  • first author1
  • last author2

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

fields
  • cs.CC1
  • cs.IT1
  • math.CO1

identity via Semantic Scholar / OpenAlex

most citedWorst Case to Average Case Reductions for Polynomials

19 citations · 24 across the 3 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2010

Dense locally testable codes cannot have constant rate and distance

Irit Dinur, Tali Kaufman

A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi…

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