Thibaut V is a software engineer and Scrum Master with nine years of experience specializing in software architecture for multi-service applications. He brings strong C++ systems expertise demonstrated by performance-focused contributions to high-profile open-source projects such as Tessil’s robin-map and hat-trie implementations and targeted work within the TensorFlow codebase, including TFLite/MLIR-related improvements. Comfortable both as a hands-on back-end developer and a delivery coach, he blends low-level data-structure optimization with pragmatic team facilitation to ship reliable, efficient systems. Educated in telecommunications and research-level computer systems, he often applies rigorous academic thinking to practical engineering problems, for example introducing performance and correctness fixes that reduce operational surprises.
10 years of coding experience
Diplôme d'ingénieur, Télécommunications, Services et Usages, Diplôme d'ingénieur, Télécommunications, Services et Usages at Institut national des Sciences appliquées de Lyon
Master 2 Recherche, Systèmes Informatiques et Réseaux, Master 2 Recherche, Systèmes Informatiques et Réseaux at Université Claude Bernard (Lyon I)
C++ implementation of a fast hash map and hash set using robin hood hashing
Role in this project:
Back-end Developer
Contributions:17 releases, 150 commits, 34 PRs in 5 years 5 months
Contributions summary:Thibaut's commits primarily involve the implementation of a fast hash map and hash set in C++. The contributions include the initial implementation of core data structures and algorithms for efficient key-value storage. The user also made changes to include features like storing the hash alongside the values for faster lookups and rehash operations. Further commits focus on performance improvements.
C++ implementation of a fast and memory efficient HAT-trie
Role in this project:
Back-end Developer
Contributions:7 releases, 128 commits, 18 PRs in 5 years 1 month
Contributions summary:Thibaut's primary contribution revolves around the initial implementation and subsequent bug fixes within the C++ HAT-trie data structure. They established the foundation by introducing core files and functions, and addressed several issues including setting the `m_child_of_char` variable during insertion, correcting problems that could leave trie nodes without children or values after an erase, and improving the functions associated with the iterators. Further development includes the addition of a customizable burst threshold to the data structure.
cpptriehat-triedata-structuresheader-only
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.