Encyclopedia of Combinatorial Structures
-
Updated
Jun 27, 2018 - Makefile
#
analytic-combinatorics
Here are 8 public repositories matching this topic...
A simple, time-tested, family of random hash functions in Python, based on CRC32 and xxHash, affine transformations, and the Mersenne Twister. 🎲
python
hash-functions
hyperloglog
streaming-algorithms
data-streaming
flajolet
randomized-algorithm
analytic-combinatorics
analysis-of-algorithms
flajolet-martin
-
Updated
Jun 6, 2022 - Python
Reluctant walks tend to exit the quarter-plane in which they are constrained (because of strong negative drift), but this work shows how to randomly sample large reluctant walks anyway. (Lumbroso, Mishna, Ponty, 2017)
-
Updated
Apr 3, 2018 - Python
Lightweight library to parse combstruct grammars, and standalone tool to convert them to JSON.
-
Updated
Jun 19, 2018 - C
Jupyter notebook that fully implements Analytic Samplers for degree-constrained trees using only standard Python functions (and no separate symbolic computation library).
-
Updated
Mar 20, 2018 - Jupyter Notebook
Analytic combinatorics and dynamical systems
-
Updated
Apr 27, 2024 - PostScript
Fast, Standalone Oracle for Analytic Sampling of Trees
-
Updated
Jun 14, 2018 - C
A SageMath package with algorithms for analytic combinatorics in several variables.
-
Updated
Oct 31, 2024 - Python
Improve this page
Add a description, image, and links to the analytic-combinatorics topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the analytic-combinatorics topic, visit your repo's landing page and select "manage topics."