◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Dani Dorfmann

1 paper hereh-index 00 citations0 works total

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

fields
  • cs.DS1

identity via Semantic Scholar / OpenAlex

collaborators

1 paper

cs.DS2026

Can We Break Fine-Grained and NP-Hardness Barriers if We've Seen the Graph Before? The Isomorphic-Priors Model

Dani Dorfmann, Dani Dorfman, Simon Döring +5

If we run a heavy-duty computation on prior data, can we avoid repeated computation for similar future inputs? Inspired by this question, we introduce a new computational model for…

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