◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Esparza

61 papers hereh-index 4910.2k citations276 works total

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

author position
  • sole author2
  • first author31
  • middle author19
  • last author6

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

fields
  • cs.LO32
  • cs.DC15
  • cs.FL9
  • cs.DS2
  • cs.PF1
  • eess.SY1
same name
  • J. Esparza — 6 papers, h 2
  • J. Esparza — 3 papers, h 3
  • J. Esparza — 2 papers, h 2
  • J. Esparza — 1 paper
  • J. Esparza — 1 paper, h 1
  • J. Esparza — 1 paper

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
20052024
most citedParikh's Theorem: A simple and direct automaton construction

52 citations · 267 across the 47 of their papers we have counts for

collaborators
Showing 2014 · cs.LOShow all

4 papers · 2 filters

cs.LO2014★ 2 cited

Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Corrected version)

Javier Esparza

We survey some results on the automatic verification of parameterized programs without identities. These are systems composed of arbitrarily many components, all of them running ex…

cs.LO2014

Negotiation Games (with abstract)

Javier Esparza, Philipp Hoffmann

Negotiations, a model of concurrency with multi party negotiation as primitive, have been recently introduced in arXiv:1307.2145, arXiv:1403.4958. We initiate the study of games fo…

cs.LO2014★ 3 cited

On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations

Javier Esparza, Jörg Desel

We continue our study of negotations, a concurrency model with multiparty negotiation as primitive. In a previous paper (arXiv:13072145) we have provided a correct and complete set…

cs.LO2014★ 12 cited

From LTL to Deterministic Automata: A Safraless Compositional Approach

Javier Esparza, Jan Křetínský

We present a new algorithm to construct a deterministic Rabin automaton for an LTL formula φ. The automaton is the product of a master automaton and an array of slave automata, o…

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