Skantz

expander-decomposition

Implementation of the expander decomposition algorithm in https://arxiv.org/abs/1812.08958. Decompose graph with cluster expansion guarantee.

formal-methods

KTH Royal Institute of Technology DD2452

tsp

algorithms - minimum spanning trees, traveling salesmen

UniMath

This coq library aims to formalize a substantial body of mathematics using the univalent point of view.

Puzzles

Solutions to competitive programming puzzles. Leetcode, Kattis, Project Euler and more.

thu-computational-biology

THU Computational Biology (30470093-0)

thu-web-information-retrieval

Web Information Retrieval (80240573-0)

coq

Coq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs.

Barbarossa

Chess engine entirely written in Haskell

CoqCP

We combat sloppy arguments in competitive programming and raise the standard of rigor

expander-decomp

haskell-challenges

Code challenges to solve with Haskell

lemon-1.3.1

Copy of lemon graph library 1.3.1

math-comp-school-2022

misc

misc. drafts not yet full repos

ocaml-webmachine

A REST toolkit for OCaml

Schools

thu-bigdata

Introduction to Big Data Systems（80240693-0)

thu-deep-learning

THU Deep Learning（80240743-0）

thu-nlp

80240763 THU Natural Language Processing

tutorial_material

proof script associated to tutorial material

TypeTheory

The mathematical study of type theories, in univalent foundations