Kamil Rusin
Curriculum Vitae
Phone number:
+48 517 455 134Email:
kamil.jakub.rusin@gmail.comLocation:
Cracow, PolandPortfolio:
madebyme.todayProfessional experience
OpenX
Software Engineer IV
Jul 2024–presentSoftware Engineer III
Jul 2023–Jul 2024Software Engineer II
Sep 2022–Jul 2023- Developing a distributed, low-latency, cloud-based platform for selling digital ad inventory in real time.
- As a part of a data science team I was responsible for: preparing implementations of experiments, developing and maintaining experimental frameworks, enabling development of ML models, and developing solutions for serving ML models.
- I led the development of a new experimental framework, which is used as the main tool for evaluating value of business decisions.
PythonJavaSpringGoErlangGCPgRPC
Motorola Solutions
Software Engineer
May 2022–Sep 2022Software Developer
June 2021–May 2022Junior Software Developer
Oct 2020–June 2021Software Developer Intern
Mar 2020–Oct 2020- Developing centralized, large-scale, on-premise systems for managing mobile radios.
- I developed and tested systems used by government agencies.
C++C#JavaSpringPythonAzure
Education
The Cracow University of Technology
2021–2022Master of Science (MSc), Applied Computer Science
5 / 5Graduated with distinction
The Cracow University of Technology
2017–2021Bachelor of Science (BSc), Applied Computer Science
4.5 / 5Salezjańskie Publiczne Liceum Ogólnokształcące
2014–2017High School
83%Publications pro bono publico
PagedOut! (Issue #4)
Jun 2024- Ma, why is dict() slower than {} in Python? — an analysis of computational complexity of Python’s dictionary
literal (
{}
) and dictionary built-in type (dict()
). Summary of Performance Analysis of Python’sdict()
and{}
. - Generating Identicons from SHA-256 hashes — POC of using Identicons (visual representations of a hash value) as avatars for users. Summary of Generating SVG Avatars From Identifiers.
Projects
Franklin
Feb 2022An open-source utility written in Rust for generating algorithmic art via genetic algorithms. Organisms are mutated by randomly generated shapes, scored by loss functions calculating their goodness, and crossed with each other to produce new offspring.
I wrote a series of articles about the subject.