Concept
Computable number
Related publications (51)
Computation of Al-Salam Carlitz and Askey-Wilson moments using Motzkin paths
In this paper we study the moments of polynomials from the Askey scheme, and we focus on Askey-Wilson polynomials. More precisely, we give a combinatorial proof for the case where d = 0. Their values have already been computed by Kim and Stanton in 2015, h ...
ELECTRONIC JOURNAL OF COMBINATORICS2021Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior
Boi Faltings, Aris Filos Ratsikas, Panayiotis Danassis
We present a novel anytime heuristic (ALMA), inspired by the human principle of altruism, for solving the assignment problem. ALMA is decentralized, completely uncoupled, and requires no communication between the participants. We prove an upper bound on th ...
2019Lonely Runner Polyhedra
We study the Lonely Runner Conjecture, conceived by Jörg M. Wills in the 1960's: Given positive integers n_1, n_2, ... , n_k, there exists a positive real number t such that for all 1 \le j \le k the distance of t n_j to the nearest integer is at least 1 / ...
2018Method and device for proving his identity
Serge Vaudenay, Ioana Cristina Carlson
The invention is related to a method allowing a prover holding a secret key (x) to prove its identity to a verifier and to prove to this verifier that he is within a predetermined distance of this verifier, said method comprising an initialization phase du ...
2018