output
20002026
most citedQuantum attacks on Bitcoin, and how to protect against them

225 citations

researchers with a paper here
collaborating institutions
Showing cs.DMShow all

20 papers · 1 filter

cs.DM2025

Maximum Biclique for Star 1,2,3 -free and Bounded Bimodularwidth Twin-free Bipartite Graphs

Fabien de Montgolfier, Renaud Torfs

There are three usual definitions of a maximum bipartite clique (biclique) in a bipartite graph\,: either maximizing the number of vertices, or of edges, or finding a maximum balan…

cs.DM2025

Generalized Hofstadter functions and beyond: numeration systems and discrepancy

Pierre Letouzey

Hofstadter's function is recursively defined via and then . Following Hofstadter, a family of similar functions is obtained by varying the nu…

cs.DM2024

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…

cs.DM2021★ 1 cited

Stochastic Graph Transformation For Social Network Modeling

Nicolas Behr, Bello Shehu Bello, Sebastian Ehmes +1

Adaptive networks model social, physical, technical, or biological systems as attributed graphs evolving at the level of both their topology and data. They are naturally described…

cs.DM2021★ 1 cited

Classifying grounded intersection graphs via ordered forbidden patterns

Laurent Feuilloley, Michel Habib

It was noted already in the 90s that many classic graph classes, such as interval, chordal, and bipartite graphs, can be characterized by the existence of an ordering of the vertic…

cs.DM2021★ 4 cited

Morphisms and minimisation of weighted automata

Sylvain Lombardy, Jacques Sakarovitch

This paper studies the algorithms for the minimisation of weighted automata. It starts with the definition of morphisms-which generalises and unifies the notion of bisimulation to…