Polynomial Time Solutions of Some Problems in Computational Algebra - Katalin Friedl; Lajos Rónyai (STOC, 1985)

Simple Algebras Are Difficult - Lajos Rónyai (STOC, 1987)

Factoring Polynomials Over Finite Fields. - Lajos Rónyai (J. Algorithms, 1988)

Zero Divisors in Quaternion Algebras. - Lajos Rónyai (J. Algorithms, 1988)

Computing Irreducible Representations of Finite Groups - László Babai; Lajos Rónyai (FOCS, 1989)

Factoring polynomials modulo special primes. - Lajos Rónyai (Comb., 1989)

Planar functions over finite fields. - Lajos Rónyai; Tamás Szonyi (Comb., 1989)

Computing the Structure of Finite Algebras. - Lajos Rónyai (J. Symb. Comput., 1990)

Computations in Associative Algebras. - Lajos Rónyai (Groups And Computation, 1991)

On the Representation of Dependencies by Propositional Logic. - János Demetrovics; Lajos Rónyai; Hua nam Son (MFDBS, 1991)

Computing the Order of Centralizers in Linear Groups - Lajos Rónyai (Inf. Comput., 1991)

On the Composition and Decomposition of Attributes and Tuples. - János Demetrovics; Lajos Rónyai; Hua nam Son (ICDT, 1992)

A Note on Intersection of Isotone Clones. - János Demetrovics; Lajos Rónyai (Acta Cybern., 1992)

Algorithmic Properties of Maximal Orders in Simple Algebras over Q. - Lajos Rónyai (Comput. Complex., 1992)

Galois Groups and Factoring Polynomials Over Finite Fields. - Lajos Rónyai (SIAM J. Discret. Math., 1992)

Functional Dependencies among Boolean Dependencies. - János Demetrovics; Lajos Rónyai; Hua nam Son (Ann. Math. Artif. Intell., 1993)

Finding Maximal Orders in Semisimple Algebras Over Q. - Gábor Ivanyos; Lajos Rónyai (Comput. Complex., 1993)

Decomposition of Algebras over Fq(X1, ..., Xm). - Gábor Ivanyos; Lajos Rónyai; Ágnes Szántó (Appl. Algebra Eng. Commun. Comput., 1994)

A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q. - Lajos Rónyai (J. Algorithms, 1994)

Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs. - László Babai; Anna Gál; János Kollár; Lajos Rónyai; Tibor Szabó; Avi Wigderson (STOC, 1996)

Computing Cartan subalgebras of Lie algebras. - Willem A. de Graaf; Gábor Ivanyos; Lajos Rónyai (Appl. Algebra Eng. Commun. Comput., 1996)

Primer-Field Complete Functions and Factoring Polynomials over Finite Fields. - Lajos Rónyai; Ágnes Szántó (Comput. Artif. Intell., 1996)

Norm-Graphs and Bipartite Turán Numbers. - János Kollár; Lajos Rónyai; Tibor Szabó (Comb., 1996)

Computing Levi Decompositions in Lie algebras. - Willem A. de Graaf; Gábor Ivanyos; A. Küronya; Lajos Rónyai (Appl. Algebra Eng. Commun. Comput., 1997)

Computations in finite-dimensional Lie algebras. - Arjeh M. Cohen; Willem A. de Graaf; Lajos Rónyai (Discret. Math. Theor. Comput. Sci., 1997)

On 1-Representations of Integers. - János Demetrovics; Attila Pethö; Lajos Rónyai (Acta Cybern., 1999)

Norm-Graphs: Variations and Applications. - Noga Alon; Lajos Rónyai; Tibor Szabó (J. Comb. Theory B, 1999)

On a Conjecture of Kemnitz. - Lajos Rónyai (Comb., 2000)

A Combinatorial Problem on Polynomials and Rational Functions. - György Elekes; Lajos Rónyai (J. Comb. Theory A, 2000)

Shattering News. - Richard P. Anstee; Lajos Rónyai; Attila Sali (Graphs Comb., 2002)

Order shattering and Wilson's theorem. - Katalin Friedl; Lajos Rónyai (Discret. Math., 2003)

Approximate radical of ideals with clusters of roots. - Itnuit Janovitz-Freireich; Lajos Rónyai; Ágnes Szántó (ISSAC, 2006)

The lex game and some applications. - Bálint Felszeghy; Balázs Ráth; Lajos Rónyai (J. Symb. Comput., 2006)

Approximate Radical for Clusters: A Global Approach Using Gaussian Elimination or SVD. - Itnuit Janovitz-Freireich; Lajos Rónyai; Ágnes Szántó (Math. Comput. Sci., 2007)

Moment matrices, trace matrices and the radical of ideals. - Itnuit Janovitz-Freireich; Ágnes Szántó; Bernard Mourrain; Lajos Rónyai (ISSAC, 2008)

Random-order bin packing. - Edward G. Coffman Jr.; János Csirik; Lajos Rónyai; Ambrus Zsbán (Discret. Appl. Math., 2008)

Constructions for quantum computing with symmetrized gates. - Gábor Ivanyos; Attila B. Nagy; Lajos Rónyai (Quantum Inf. Comput., 2008)

Some Meeting Points of Gröbner Bases and Combinatorics. - Bálint Felszeghy; Lajos Rónyai (Algorithmic Algebraic Combinatorics and Gröbner Bases, 2009)

Algebraic Properties of Modulo q Complete l-Wide Families. - Bálint Felszeghy; Gábor Hegedüs; Lajos Rónyai (Comb. Probab. Comput., 2009)

Optimal Solutions for Single Fault Localization in Two Dimensional Lattice Networks. - János Tapolcai; Lajos Rónyai; Pin-Han Ho (INFOCOM, 2010)

On optimal completion of incomplete pairwise comparison matrices. - Sándor Bozóki; János Fülöp; Lajos Rónyai (Math. Comput. Model., 2010)

Some Combinatorial Applications of Gröbner Bases. - Lajos Rónyai; Tamás Mészáros 001 (CAI, 2011)

Splitting full matrix algebras over algebraic number fields - Gábor Ivanyos; Lajos Rónyai; Josef Schicho (CoRR, 2011)

A novel approach for failure localization in all-optical mesh networks. - János Tapolcai; Bin Wu 002; Pin-Han Ho; Lajos Rónyai (IEEE/ACM Trans. Netw., 2011)

Fast failure localization in all-optical networks with length-constrained monitoring trails. - Éva Hosszu; János Tapolcai; Lajos Rónyai; Péter Soproni; Péter Babarczi; Pin-Han Ho (ICUMT, 2012)

Alon's Nullstellensatz for multisets. - Géza Kós; Lajos Rónyai (Comb., 2012)

On the computation of matrices of traces and radicals of ideals. - Itnuit Janovitz-Freireich; Bernard Mourrain; Lajos Rónyai; Ágnes Szántó (J. Symb. Comput., 2012)

Trading GRH for algebra: Algorithms for factoring polynomials and related structures. - Gábor Ivanyos; Marek Karpinski; Lajos Rónyai; Nitin Saxena 001 (Math. Comput., 2012)

Network-wide local unambiguous failure localization (NWL-UFL) via monitoring trails. - János Tapolcai; Pin-Han Ho; Lajos Rónyai; Bin Wu 002 (IEEE/ACM Trans. Netw., 2012)

On achieving all-optical failure restoration via monitoring trails. - János Tapolcai; Pin-Han Ho; Péter Babarczi; Lajos Rónyai (INFOCOM, 2013)

Link Fault Localization Using Bi-Directional M-Trails in All-Optical Mesh Networks. - János Tapolcai; Lajos Rónyai; Pin-Han Ho (IEEE Trans. Commun., 2013)

Signaling free localization of node failures in all-optical networks. - János Tapolcai; Lajos Rónyai; Éva Hosszu; Pin-Han Ho; Suresh Subramaniam 001 (INFOCOM, 2014)

Resilient flow decomposition of unicast connections with network coding. - Péter Babarczi; János Tapolcai; Lajos Rónyai; Muriel Médard (ISIT, 2014)

Shattering-Extremal Set Systems of VC Dimension at most 2. - Tamás Mészáros 001; Lajos Rónyai (Electron. J. Comb., 2014)

On Signaling-Free Failure Dependent Restoration in All-Optical Mesh Networks. - János Tapolcai; Pin-Han Ho; Péter Babarczi; Lajos Rónyai (IEEE/ACM Trans. Netw., 2014)

Survivable routing meets diversity coding. - Alija Pasic; János Tapolcai; Péter Babarczi; Erika R. Bérczi-Kovács; Zoltán Király; Lajos Rónyai (Networking, 2015)

On a Parity Based Group Testing Algorithm. - Sándor Z. Kiss; Éva Hosszu; Lajos Rónyai; János Tapolcai (Acta Cybern., 2015)

Seven mutually touching infinite cylinders. - Sándor Bozóki; Tsung-Lin Lee; Lajos Rónyai (Comput. Geom., 2015)

Computing explicit isomorphisms with full matrix algebras over $ mathbb{F}_q(x)$. - Gábor Ivanyos; Péter Kutas; Lajos Rónyai (CoRR, 2015)

Neighborhood Failure Localization in All-Optical Networks via Monitoring Trails. - János Tapolcai; Pin-Han Ho; Péter Babarczi; Lajos Rónyai (IEEE/ACM Trans. Netw., 2015)

Explicit equivalence of quadratic forms over $ mathbb{F}_q(t)$. - Gábor Ivanyos; Péter Kutas; Lajos Rónyai (CoRR, 2016)

Incomplete Pairwise Comparison Matrices and Weighting Methods. - László Csató; Lajos Rónyai (Fundam. Informaticae, 2016)

Signaling Free Localization of Node Failures in All-Optical Networks. - János Tapolcai; Lajos Rónyai; Éva Hosszu; Laszlo Gyimothi; Pin-Han Ho; Suresh Subramaniam 001 (IEEE Trans. Commun., 2016)

List of shared risk link groups representing regional failures with limited size. - János Tapolcai; Lajos Rónyai; Bálazs Vass; Laszlo Gyimothi (INFOCOM, 2017)

Standard Monomials and Extremal Vector Systems. - Tamás Mészáros 001; Lajos Rónyai (Electron. Notes Discret. Math., 2017)

Diversity Coding in Two-Connected Networks. - Péter Babarczi; János Tapolcai; Alija Pasic; Lajos Rónyai; Erika R. Bérczi-Kovács; Muriel Médard (IEEE/ACM Trans. Netw., 2017)

A Tractable Stochastic Model of Correlated Link Failures Caused by Disasters. - János Tapolcai; Bálazs Vass; Zalán Heszberger; József Bíró; David Hay; Fernando A. Kuipers; Lajos Rónyai (INFOCOM, 2018)

Chevalley-Warning Theorem in Quantum Computing. - Gábor Ivanyos; Lajos Rónyai (ERCIM News, 2018)

Computing Explicit Isomorphisms with Full Matrix Algebras over Fq(x). - Gábor Ivanyos; Péter Kutas; Lajos Rónyai (Found. Comput. Math., 2018)

Explicit equivalence of quadratic forms over Fq(t). - Gábor Ivanyos; Péter Kutas; Lajos Rónyai (Finite Fields Their Appl., 2019)

Minimum Cost Survivable Routing Algorithms for Generalized Diversity Coding. - Alija Pasic; Péter Babarczi; János Tapolcai; Erika R. Bérczi-Kovács; Zoltán Király; Lajos Rónyai (IEEE/ACM Trans. Netw., 2020)

Fast Enumeration of Regional Link Failures Caused by Disasters With Limited Size. - János Tapolcai; Lajos Rónyai; Balázs Vass; László Gyimóthi (IEEE/ACM Trans. Netw., 2020)

On Network Topology Augmentation for Global Connectivity under Regional Failures. - János Tapolcai; Zsombor L. Hajdú; Alija Pasic; Pin-Han Ho; Lajos Rónyai (INFOCOM, 2021)

An Upper Bound for the Size of $s$-Distance Sets in Real Algebraic Sets. - Gábor Hegedüs; Lajos Rónyai (Electron. J. Comb., 2021)

Probabilistic Shared Risk Link Groups Modeling Correlated Resource Failures Caused by Disasters. - Balázs Vass; János Tapolcai; Zalán Heszberger; József Bíró; David Hay; Fernando A. Kuipers; Jorik Oostenbrink; Alessandro Valentini; Lajos Rónyai (IEEE J. Sel. Areas Commun., 2021)

Bloom Filter With a False Positive Free Zone. - Sándor Z. Kiss; Éva Hosszu; János Tapolcai; Lajos Rónyai; Ori Rottenstreich (IEEE Trans. Netw. Serv. Manag., 2021)

Routing on the Shortest Pairs of Disjoint Paths. - Péter Babarczi; Gábor Rétvári; Lajos Rónyai; János Tapolcai (IFIP Networking, 2022)

Some Complexity Results Involving Quantum Computing. - Gábor Ivanyos; Attila Pereszlényi; Lajos Rónyai (ERCIM News, 2022)

Resilient Routing Table Computation Based on Connectivity Preserving Graph Sequences. - János Tapolcai; Péter Babarczi; Pin-Han Ho; Lajos Rónyai (INFOCOM, 2023)

Gröbner Bases for Increasing Sequences. - Gábor Hegedüs; Lajos Rónyai (Electron. J. Comb., 2024)

The automorphism group of projective norm graphs. - Tomas Bayer; Tamás Mészáros 001; Lajos Rónyai; Tibor Szabó (Appl. Algebra Eng. Commun. Comput., 2024)

Connectivity Preserving Graph Sequences for Routing Arborescence Construction. - János Tapolcai; Péter Babarczi; Balázs Brányi; Pin-Han Ho; Lajos Rónyai (IEEE J. Sel. Areas Commun., 2025)