Statistics and implementation of APRNGs
Louis-Sebastien Guimond, Jan Patera, Jiri Patera
cs.DMarXiv:cs/0003063
Related papers
Boxicity of Power Graphs of Finite Nilpotent Groups
L. Sunil Chandran, Jinia Ghosh, Suraj Kumar Sahoo
Monadically Dependent Graph Classes Have Almost Bounded Merge-Width
Jan Dreier, Nikolas Mählmann, Michał Pilipczuk et al.
A Polynomial Erdős-Pósa bound for Eulerian digraphs
Esther Galby, Roohani Sharma, Bart van der Steenhoven
How Unbalanced Must a Latin Rectangle Be?
Zhengyu Li, Vijay Ganesh
Classifying K-Geodetic Graphs Via Combinatorial Designs and Distance-regularity
Carlos E. Frasser
Graph Similarity Meets Optimal Transport
Jens Breitung, Timo Gervens, Martin Grohe