Julius Jonušas

Computer Science · Physical Sciences

3h-index52citations27works0.02yr avg
OpenAlex↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

semigroups and automata theory(13), Advanced Topology and Set Theory(12), Geometric and Algebraic Topology(4), Rings, Modules, and Algebras(4), Mathematical Dynamics and Fractals(3)

Publications27 total

digraphs/Digraphs: Digraphs 1.14.0
Zenodo (CERN European Organization for Nuclear Research)·2026Open Access
An algebraic model for inversion and deletion in bacterial genome rearrangement
Journal of Mathematical Biology·2023· 1 citedOpen Access
Automatic continuity, unique Polish topologies, and Zariski topologies on monoids and clones
Transactions of the American Mathematical Society·2023· 3 citedOpen Access
An algebraic model for inversion and deletion in bacterial genome rearrangement
arXiv (Cornell University)·2022Open Access
When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems
SIAM Journal on Computing·2022· 6 cited
Corrigendum: Pseudo‐loop conditions
Bulletin of the London Mathematical Society·2021
Generating the monoid of $2 \times 2$ matrices over max-plus and min-plus semirings
arXiv (Cornell University)·2020Open Access
When symmetries are not enough: a hierarchy of hard Constraint Satisfaction Problems
arXiv (Cornell University)·2020Open Access
Sets of universal sequences for the symmetric group and analogous semigroups
Proceedings of the American Mathematical Society·2020Open Access
Hrushovski’s Encoding and ω-Categorical CSP Monsters
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2020· 4 citedOpen Access
Automatic continuity, unique Polish topologies, and Zariski topologies (part I, monoids)
arXiv (Cornell University)·2019· 2 citedOpen Access
Automatic continuity and uniqueness of Polish semigroup topologies
arXiv (Cornell University)·2019· 1 citedOpen Access
Automatic continuity, unique Polish topologies, and Zariski topologies on monoids and clones
arXiv (Cornell University)·2019· 2 citedOpen Access
Random ubiquitous transformation semigroups
Semigroup Forum·2019Open Access
Sets of universal sequences for the symmetric group and analogous semigroups
arXiv (Cornell University)·2018· 1 citedOpen Access
Two variants of the Froidure–Pin Algorithm for finite semigroups
Portugaliae Mathematica·2018· 1 cited
Some isomorphism results for Thompson-like groups V n (G)
Israel Journal of Mathematics·2017· 1 citedOpen Access
Parallel algorithms for computing finite semigroups
arXiv (Cornell University)·2017· 1 citedOpen Access
Two variants of the Froiduire-Pin Algorithm for finite semigroups
arXiv (Cornell University)·2017· 1 citedOpen Access
Topological 2-generation of automorphism groups of countable ultrahomogeneous graphs
Forum Mathematicum·2016· 2 cited
page 1 of 2Next →

Frequent Co-authors

James D. Mitchell(18), Y. Péresse(7), Pierre Gillibert(4), Michael Pinsker(4), L. Elliott(4), Michał Morayne(4), Markus Pfeiffer(4), Michael Kompatscher(3), Antoine Mottet(3), Zachary Mesyan(3), James Hyde(3), James East(2), Chad Clark(2), Andrew Francis(2), Vytautas Gruslys(1), Vuksan Mijović(1), O. Ng(1), L. Olsen(1), Izabela Petrykiewicz(1), Ben Z. Steinberg(1)