Jérémie Gillet
Senior Developer at Steady
Okinawa Prefecture, Japan
Summary
🤩
Rockstar🎓
Top SchoolJérémie Gillet is a Senior Full-Stack Developer with a PhD in physics and a decade of professional experience building Elixir-backed web applications from Okinawa, Japan. He transitioned from academic research in quantum optics and cold atoms to full-time software engineering, bringing rigorous problem-solving and numerical intuition to backend systems. At Steady he progressed from junior to senior roles, shipping production services in Elixir while contributing algorithmic and functional code to open-source projects like the Algorithm Archive and Exercism’s Elixir track. His open-source work includes Haskell implementations of classic algorithms and numerous test-driven Elixir exercises, reflecting a blend of theoretical depth and practical engineering. Beyond production code he teaches coding to children with Scratch, demonstrating a commitment to mentorship and STEM outreach. Fluent across research and engineering cultures, he thrives on turning complex concepts into readable, well-tested implementations.
10 years of coding experience
5 years of employment as a software developer
Doctorat, Physique, Doctorat, Physique at University of Liège
French, English, Japanese
Stackoverflow
1reputation
0reached
0answers
0questions
Github Skills (20)
algorithm10
test-driven-design10
elixir10
functional-programming10
haskell10
fftw9
maths9
mathics9
math9
mathematics9
fft9
tracks9
tree-traversal8
cc8
data-structures8
Programming languages (20)
Github contributions (5)
algorithm-archivists/algorithm-archive
Dec 2017 - Nov 2021
A collaborative book on algorithms
Role in this project:
Back-end Developer
Back-end DeveloperContributions:6 reviews, 32 commits, 112 PRs in 4 years
Contributions summary:Jérémie primarily contributed code related to algorithm implementations in Haskell. They added implementations for various algorithms such as Fast Fourier Transform, convolutions, stable marriage, Huffman coding, bubble sort, Jarvis March, Bogo sort, tree traversals, Graham Scan, Monte Carlo, Gaussian Elimination, Thomas Algorithm, split-operator method, DFS with stack, Verlet integration, and DFT/FFT. Their work is focused on providing Haskell code examples for a variety of algorithms.
algorithm-archivejavascriptlanguagesdata-structurescollaborative
exercism/elixir
Jun 2021 - Nov 2022
Exercism exercises in Elixir.
Role in this project:Back-end Developer
Back-end DeveloperContributions:402 reviews, 58 commits, 287 PRs in 1 year 5 months
Contributions summary:Jérémie primarily contributed to the development of Elixir practice exercises within the Exercism project. Their work involved adding new exercises to the Elixir track, including "pov", "zebra-puzzle", "rational-numbers", "satellite", "complex-numbers", "affine-cipher", "pythagorean-triplet", "book-store", "darts", and "go-counting". These contributions encompassed test-driven development, as evidenced by the included test files, and likely involved writing the core Elixir logic for each exercise.
exercismelixirexercism-exercisesexercism-trackcommunity-contributions-accepted
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.