There are 2 repositories under binary-lifting topic.
Generate data-flow graph and def-use graph for a function based on miasm and IDA Pro.
This repository contains solutions of various classical problems on SPOJ.
Z- algorithm for pattern matching, Trie-Aho-Corasick Automaton(FGREP), Hungarian Algorithm for the Munkres Assignment Problem, Binary Lifting, Eulerian Tour for Least Common Ancestor(LCA) using Sparse Table coupled with Farach-Colton and Bender optimization, Wellsh Powell Algorithm for Graph Coloring, Kahn's Agorithm for TopSort and Cycle detection in Graphs. Sparse Table for range queries. Johnson's Algorithm. AHU Encoding. Kosaraju's Algorithm for strongly connected components. Tarjan's Algorithm. Union Find. Fenwick Tree. Segment Tree. Ford Fulkerson. Edmonds-Karp. Dinic's Algorithm. Capacity Scalling. Push Relabel. Dijkstra's Algorithm. Bellman Ford's Algorithm. Floyd Warshall's Algorithm and much more..
Lifting and Diversifying Binaries (blog post accompanying materials)
Personal Templates for Competitive Programming