works on

From the 1 of 17 papers with an AI index.

most citedCertificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs

4 citations

17 papers

cs.FL2026

Explorable Parity Automata

Emile Hazard, Olivier Idir, Denis Kuperberg

The paper introduces explorable automata, a generalization of history‑deterministic automata that resolves nondeterminism using multiple simultaneous runs, and studies their decisi…

math.CO2026

Balanced-chromatic number and Hadwiger-like conjectures

Andrea Jiménez, Jessica McDonald, Reza Naserasr +2

Motivated by different characterizations of planar graphs and the 4-Color Theorem, several structural results concerning graphs of high chromatic number have been obtained. Toward…

math.AT2026

Branching spaces of multipointed d-spaces

Philippe Gaucher

Using the notion of a short directed path, we introduce the branching space of a multipointed d-space. We prove that for any q-cofibrant multipointed d-space, it is homeomorphic to…

cs.PL20263 cited

Guard Analysis and Safe Erasure Gradual Typing: a Type System for Elixir

Giuseppe Castagna, Guillaume Duboc

We formalize a new type system for Elixir, a dynamically typed functional programming language of growing popularity that runs on the Erlang virtual machine. Our system combines gr…

math.CO2026

Lecture hall graphs and the Askey scheme

Sylvie Corteel, Bhargavi Jonnadula, Jonathan P. Keating +1

We establish, for every family of orthogonal polynomials in the -Askey scheme and the Askey scheme, a combinatorial model for mixed moments and coefficients in terms of paths…

cs.DM2026

Pointwise order of generalized Hofstadter functions G, H and beyond

Pierre Letouzey, Shuo Li, Wolfgang Steiner

Hofstadter's G function is recursively defined via and then . Following Hofstadter, we vary the number of nested recursive calls in this equation and…