Algorithms library
My C++ library of parallel, graph and flow algorithms, each written by hand with tests and visualisations. The first entry is the Hillis-Steele prefix sum drawn above.
Alexandru Rotileanu
Software developer and algorithms researcher in Vienna, working on electrical flows in graphs.
One unit of current from s to t through a random resistor network, solved exactly in your browser. Click any vertex to move the source.
Reff(s, t) = 2.676
Current research
Can one fixed set of edge resistances route every source and sink demand with low congestion, all at the same time?
That is the open problem behind Understanding Single Electrical Routing for Solving Flow-Based Optimization Problems. It is an open question in oblivious routing. My thesis attacks it from both sides: large experiments to see what is true, and proofs for the cases the experiments make visible.
About the thesisSelected work
100+
HPC grading pipeline
Compiles, validates and benchmarks every student heat-equation solver on the university cluster, checks claimed speedups within 7.5%, and writes the report.
Patterns in Lorenz systems
My BSc thesis: a C++ simulation that searches the Lorenz system for inputs producing a chosen kind of chaotic behaviour.
RotiPI home server
nginx, PostgreSQL and a Cloudflare Tunnel behind Zero Trust, with Prometheus and Grafana watching it all. This site deploys to it on every push.
Experience
- Software Developer Pluxee Austria
- Teaching Assistant University of Vienna
- Student Research Assistant University of Vienna
- Application Developer, Educational Software Lab@Home, Constructor University
Away from the keyboard
I studied classical piano for eight years at music school; these days I collect vinyl and listen mostly to metal, rock and hip-hop/rap. I hike and ski. My love for algorithms started in competitive programming, on infoarena in 2014 and later on Codeforces.