Together with my colleagues we are coding specific tools for random generation, visualization of large trees and analytic combinatorics. My main contributions are dealing with algorithmics.
  1. Combination Unranking

    Github repository.
    Lexicographic unranking of combinations algorithms (one of the algorithm is implemented in Sagemath)
    Time_Complexity

    Note: this plot represents the time (in milliseconds) spent to unrank a combination of k elements among 10,000 when k ranges 0 to 10,000.

  2. Set Partition Unranking

  3. Arbogen

    Github repository.
    Boltzmann random sampler of tree structures. Tree example

    Note: this example is a plane rooted tree of more than 100.000 nodes obtained in a few seconds on a standard PC.

  4. BDDgen

    Github repository.
    Unranking and Uniform random sampler for Reduced Ordered Binary Decision Diagrams. ROBDD example

    Note: this example is an ROBDD with 8 variables of size 60 obtained in a few milliseconds on a standard PC.

  5. RandDAG

    Github repository.
    Uniform random sampler for DAGs. Random_DAG

    Note: this example is an ordered DAG with 1000 edges obtained in a few milliseconds on a standard PC. Each color in the nodes corresponds to a specific outdegree for that node.

  6. TreeDisplay

    Github repository.
    Visualization of tree structures. Tree
  7. Specific tools for Sagemath

    Analytic combinatorics tool for Sagemath: enumerate combinatorial structures with several parameters, according to their specifications.