Lajos Rónyai

Orcid: 0000-0002-8364-9627

According to our database1, Lajos Rónyai authored at least 79 papers between 1985 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.



In proceedings 
PhD thesis 




Resilient Routing Table Computation Based on Connectivity Preserving Graph Sequences.
Proceedings of the IEEE INFOCOM 2023, 2023

Some Complexity Results Involving Quantum Computing.
ERCIM News, 2022

Routing on the Shortest Pairs of Disjoint Paths.
Proceedings of the IFIP Networking Conference, 2022

Bloom Filter With a False Positive Free Zone.
IEEE Trans. Netw. Serv. Manag., 2021

Probabilistic Shared Risk Link Groups Modeling Correlated Resource Failures Caused by Disasters.
IEEE J. Sel. Areas Commun., 2021

An Upper Bound for the Size of $s$-Distance Sets in Real Algebraic Sets.
Electron. J. Comb., 2021

On Network Topology Augmentation for Global Connectivity under Regional Failures.
Proceedings of the 40th IEEE Conference on Computer Communications, 2021

Fast Enumeration of Regional Link Failures Caused by Disasters With Limited Size.
IEEE/ACM Trans. Netw., 2020

Minimum Cost Survivable Routing Algorithms for Generalized Diversity Coding.
IEEE/ACM Trans. Netw., 2020

Explicit equivalence of quadratic forms over Fq(t).
Finite Fields Their Appl., 2019

Computing Explicit Isomorphisms with Full Matrix Algebras over F<sub>q</sub>(x).
Found. Comput. Math., 2018

Chevalley-Warning Theorem in Quantum Computing.
ERCIM News, 2018

A Tractable Stochastic Model of Correlated Link Failures Caused by Disasters.
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

Diversity Coding in Two-Connected Networks.
IEEE/ACM Trans. Netw., 2017

Standard Monomials and Extremal Vector Systems.
Electron. Notes Discret. Math., 2017

List of shared risk link groups representing regional failures with limited size.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Signaling Free Localization of Node Failures in All-Optical Networks.
IEEE Trans. Commun., 2016

Incomplete Pairwise Comparison Matrices and Weighting Methods.
Fundam. Informaticae, 2016

Explicit equivalence of quadratic forms over $\mathbb{F}_q(t)$.
CoRR, 2016

Neighborhood Failure Localization in All-Optical Networks via Monitoring Trails.
IEEE/ACM Trans. Netw., 2015

Computing explicit isomorphisms with full matrix algebras over $\mathbb{F}_q(x)$.
CoRR, 2015

Seven mutually touching infinite cylinders.
Comput. Geom., 2015

On a Parity Based Group Testing Algorithm.
Acta Cybern., 2015

Survivable routing meets diversity coding.
Proceedings of the 14th IFIP Networking Conference, 2015

On Signaling-Free Failure Dependent Restoration in All-Optical Mesh Networks.
IEEE/ACM Trans. Netw., 2014

Shattering-Extremal Set Systems of VC Dimension at most 2.
Electron. J. Comb., 2014

Resilient flow decomposition of unicast connections with network coding.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Signaling free localization of node failures in all-optical networks.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

Link Fault Localization Using Bi-Directional M-Trails in All-Optical Mesh Networks.
IEEE Trans. Commun., 2013

On achieving all-optical failure restoration via monitoring trails.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Network-wide local unambiguous failure localization (NWL-UFL) via monitoring trails.
IEEE/ACM Trans. Netw., 2012

On the computation of matrices of traces and radicals of ideals.
J. Symb. Comput., 2012

Alon's Nullstellensatz for multisets.
Comb., 2012

Fast failure localization in all-optical networks with length-constrained monitoring trails.
Proceedings of the 4th International Congress on Ultra Modern Telecommunications and Control Systems, 2012

A novel approach for failure localization in all-optical mesh networks.
IEEE/ACM Trans. Netw., 2011

Splitting full matrix algebras over algebraic number fields
CoRR, 2011

Some Combinatorial Applications of Gröbner Bases.
Proceedings of the Algebraic Informatics - 4th International Conference, 2011

On optimal completion of incomplete pairwise comparison matrices.
Math. Comput. Model., 2010

Optimal Solutions for Single Fault Localization in Two Dimensional Lattice Networks.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Algebraic Properties of Modulo <i>q</i> Complete <i>l</i>-Wide Families.
Comb. Probab. Comput., 2009

Some Meeting Points of Gröbner Bases and Combinatorics.
Proceedings of the Algorithmic Algebraic Combinatorics and Gröbner Bases, 2009

Constructions for quantum computing with symmetrized gates.
Quantum Inf. Comput., 2008

Trading GRH for algebra: algorithms for factoring polynomials and related structures.
Electron. Colloquium Comput. Complex., 2008

Random-order bin packing.
Discret. Appl. Math., 2008

Moment matrices, trace matrices and the radical of ideals.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

Approximate Radical for Clusters: A Global Approach Using Gaussian Elimination or SVD.
Math. Comput. Sci., 2007

The lex game and some applications.
J. Symb. Comput., 2006

Approximate radical of ideals with clusters of roots.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

Order shattering and Wilson's theorem.
Discret. Math., 2003

Shattering News.
Graphs Comb., 2002

A Combinatorial Problem on Polynomials and Rational Functions.
J. Comb. Theory A, 2000

On a Conjecture of Kemnitz.
Comb., 2000

Norm-Graphs: Variations and Applications.
J. Comb. Theory B, 1999

On 1-Representations of Integers.
Acta Cybern., 1999

Computations in finite-dimensional Lie algebras.
Discret. Math. Theor. Comput. Sci., 1997

Computing Levi Decompositions in Lie algebras.
Appl. Algebra Eng. Commun. Comput., 1997

Norm-Graphs and Bipartite Turán Numbers.
Comb., 1996

Primer-Field Complete Functions and Factoring Polynomials over Finite Fields.
Comput. Artif. Intell., 1996

Computing Cartan subalgebras of Lie algebras.
Appl. Algebra Eng. Commun. Comput., 1996

Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q.
J. Algorithms, 1994

Decomposition of Algebras over F<sub>q</sub>(X<sub>1</sub>, ..., X<sub>m</sub>).
Appl. Algebra Eng. Commun. Comput., 1994

Finding Maximal Orders in Semisimple Algebras Over Q.
Comput. Complex., 1993

Functional Dependencies among Boolean Dependencies.
Ann. Math. Artif. Intell., 1993

Galois Groups and Factoring Polynomials Over Finite Fields.
SIAM J. Discret. Math., 1992

Algorithmic Properties of Maximal Orders in Simple Algebras over Q.
Comput. Complex., 1992

A Note on Intersection of Isotone Clones.
Acta Cybern., 1992

On the Composition and Decomposition of Attributes and Tuples.
Proceedings of the Database Theory, 1992

Computing the Order of Centralizers in Linear Groups
Inf. Comput., April, 1991

On the Representation of Dependencies by Propositional Logic.
Proceedings of the MFDBS 91, 1991

Computations in Associative Algebras.
Proceedings of the Groups And Computation, 1991

Computing the Structure of Finite Algebras.
J. Symb. Comput., 1990

Planar functions over finite fields.
Comb., 1989

Factoring polynomials modulo special primes.
Comb., 1989

Computing Irreducible Representations of Finite Groups
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Zero Divisors in Quaternion Algebras.
J. Algorithms, 1988

Factoring Polynomials Over Finite Fields.
J. Algorithms, 1988

Simple Algebras Are Difficult
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

Polynomial Time Solutions of Some Problems in Computational Algebra
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985