Elod Pal Csirmaz
I work as a lead software architect and have a keen interest in artificial intelligence, algebra, filesystems and computer science in general, as well as in creative writing and literary criticism. I live in the UK with my husband and two children.
Computing
-
Information Inequalities for Five Random VariablesBy Elod Csirmaz and Laszlo Csirmaz, in Computation 2026, 14(2), 42.
The entropic region is formed by the collection of the Shannon entropies of all subvectors of finitely many jointly distributed discrete random variables. For four or more variables, the structure of the entropic region is mostly unknown. We utilize a variant of the Maximum Entropy Method to obtain five-variable non-Shannon entropy inequalities, which delimit the five-variable entropy region. A significant reduction in computational complexity, achieved through theoretical considerations and by harnessing the inherent symmetries, allowed us to calculate all five-variable non-Shannon inequalities provided by the first nine generations. We define two infinite collections of such inequalities and prove them to be entropy inequalities. We investigate downward-closed subsets of non-negative lattice points that parameterize these collections, and based on this, we develop an algorithm to enumerate all extremal inequalities.
Read the paper here or on MDPI »
Get the related code »
The preprint is available on arXiv » -
Estimating from No Data: Deriving a Continuous Score from CategoriesIn towards data science, 2025.
A walkthrough of and the maths behind using low-capacity networks to acquire fine-grained scoring when only categorical labelling is available for training.
Read the article here or on TDS »
Get the related code » -
Synchronizing Many Filesystems in Near Linear TimeBy Elod Csirmaz and Laszlo Csirmaz, in Future Internet 2023; 15(6):198.
Finding a provably correct subquadratic synchronization algorithm for many filesystem replicas is one of the main theoretical problems in Operational Transformation (OT) and Conflict-free Replicated Data Types (CRDT) frameworks. Based on the Algebraic Theory of Filesystems, which incorporates non-commutative filesystem commands natively, we developed and built a proof-of-concept implementation of an algorithm which synchronizes an arbitrary number of replicas. It is provably correct, and has linear complexity after an initial sorting phase. It works by identifying conflicting command pairs and requesting one of them to be removed; can be guided to reach any of the theoretically possible synchronized states.
Read the paper here or on MDPI »
Also available on arXiv »
Sample implementation of the filesystem synchronization algorithms » -
openscad-py: OpenSCAD preprocessor A Python OOP precompiler for OpenSCAD's language. It also contains convenience functions to define a wider range of primitives, vector operations, and a method to export polyhedra directly to STL. Can create a tube-like or toroid polyhedron object from an arbitrary path, and a polyhedron from a 2D matrix of heights.
Code » | Code mirror » | Reference »
LinkedIn »