◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Benerecetti

15 papers hereh-index 161.1k citations84 works total

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

author position
  • first author12
  • middle author3

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

fields
  • cs.LO13
  • cs.DS1
  • cs.GT1

identity via Semantic Scholar / OpenAlex

activity
20032026
most citedRobust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games

9 citations · 30 across the 13 of their papers we have counts for

collaborators
Showing 2026Show all

2 papers · 1 filter

cs.LO2026

Deciding the Common Fragment of CTL with Past and LTL

Massimo Benerecetti, Dario Della Monica, Angelo Matteo +2

A central goal of language theory is to compare formalisms by understanding their relative expressive power. One challenging question in this direction is the problem of determinin…

cs.LO2026

Automaton-based Characterisations of First Order Logic over Infinite Trees

Massimo Benerecetti, Dario Della Monica, Angelo Matteo +2

We study the expressive power of First-Order Logic (\FO) over (unordered) infinite trees, with the aim of identifying robust characterisations in terms of branching-time specificat…

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