◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

U. Vishkin

3 papers hereh-index 5210.7k citations231 works total

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

author position
  • middle author2
  • last author1

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

fields
  • cs.DC1
  • cs.LG1
  • q-bio.GN1

identity via Semantic Scholar / OpenAlex

activity
20212025
most citedCan You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networks

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

collaborators
Showing cs.DCShow all

1 paper · 1 filter

cs.DC2023

Empirical Challenge for NC Theory

Ananth Hari, Uzi Vishkin

Horn-satisfiability or Horn-SAT is the problem of deciding whether a satisfying assignment exists for a Horn formula, a conjunction of clauses each with at most one positive litera…

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