default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLajos Rónyai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j54]Tomas Bayer, Tamás Mészáros, Lajos Rónyai, Tibor Szabó:
The automorphism group of projective norm graphs. Appl. Algebra Eng. Commun. Comput. 35(6): 875-886 (2024)- [j53]Gábor Hegedüs, Lajos Rónyai:
Gröbner Bases for Increasing Sequences. Electron. J. Comb. 31(2) (2024) - 2021
- [j52]Gábor Hegedüs, Lajos Rónyai:
An Upper Bound for the Size of $s$-Distance Sets in Real Algebraic Sets. Electron. J. Comb. 28(3) (2021) - [j51]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:
Probabilistic Shared Risk Link Groups Modeling Correlated Resource Failures Caused by Disasters. IEEE J. Sel. Areas Commun. 39(9): 2672-2687 (2021) - [j50]Sándor Z. Kiss, Éva Hosszu, János Tapolcai, Lajos Rónyai, Ori Rottenstreich:
Bloom Filter With a False Positive Free Zone. IEEE Trans. Netw. Serv. Manag. 18(2): 2334-2349 (2021) - 2020
- [j49]Alija Pasic, Péter Babarczi, János Tapolcai, Erika R. Bérczi-Kovács, Zoltán Király, Lajos Rónyai:
Minimum Cost Survivable Routing Algorithms for Generalized Diversity Coding. IEEE/ACM Trans. Netw. 28(1): 289-300 (2020) - [j48]János Tapolcai, Lajos Rónyai, Balázs Vass, László Gyimóthi:
Fast Enumeration of Regional Link Failures Caused by Disasters With Limited Size. IEEE/ACM Trans. Netw. 28(6): 2421-2434 (2020) - 2019
- [j47]Gábor Ivanyos, Péter Kutas, Lajos Rónyai:
Explicit equivalence of quadratic forms over Fq(t). Finite Fields Their Appl. 55: 33-63 (2019) - 2018
- [j46]Gábor Ivanyos, Péter Kutas, Lajos Rónyai:
Computing Explicit Isomorphisms with Full Matrix Algebras over Fq(x). Found. Comput. Math. 18(2): 381-397 (2018) - 2017
- [j45]Tamás Mészáros, Lajos Rónyai:
Standard Monomials and Extremal Vector Systems. Electron. Notes Discret. Math. 61: 855-861 (2017) - [j44]Péter Babarczi, János Tapolcai, Alija Pasic, Lajos Rónyai, Erika R. Bérczi-Kovács, Muriel Médard:
Diversity Coding in Two-Connected Networks. IEEE/ACM Trans. Netw. 25(4): 2308-2319 (2017) - 2016
- [j43]László Csató, Lajos Rónyai:
Incomplete Pairwise Comparison Matrices and Weighting Methods. Fundam. Informaticae 144(3-4): 309-320 (2016) - [j42]János Tapolcai, Lajos Rónyai, Éva Hosszu, Laszlo Gyimothi, Pin-Han Ho, Suresh Subramaniam:
Signaling Free Localization of Node Failures in All-Optical Networks. IEEE Trans. Commun. 64(6): 2527-2538 (2016) - 2015
- [j41]Sándor Z. Kiss, Éva Hosszu, Lajos Rónyai, János Tapolcai:
On a Parity Based Group Testing Algorithm. Acta Cybern. 22(2): 423-433 (2015) - [j40]Sándor Bozóki, Tsung-Lin Lee, Lajos Rónyai:
Seven mutually touching infinite cylinders. Comput. Geom. 48(2): 87-93 (2015) - [j39]János Tapolcai, Pin-Han Ho, Péter Babarczi, Lajos Rónyai:
Neighborhood Failure Localization in All-Optical Networks via Monitoring Trails. IEEE/ACM Trans. Netw. 23(6): 1719-1728 (2015) - 2014
- [j38]Tamás Mészáros, Lajos Rónyai:
Shattering-Extremal Set Systems of VC Dimension at most 2. Electron. J. Comb. 21(4): 4 (2014) - [j37]János Tapolcai, Pin-Han Ho, Péter Babarczi, Lajos Rónyai:
On Signaling-Free Failure Dependent Restoration in All-Optical Mesh Networks. IEEE/ACM Trans. Netw. 22(4): 1067-1078 (2014) - 2013
- [j36]János Tapolcai, Lajos Rónyai, Pin-Han Ho:
Link Fault Localization Using Bi-Directional M-Trails in All-Optical Mesh Networks. IEEE Trans. Commun. 61(1): 291-300 (2013) - 2012
- [j35]Géza Kós, Lajos Rónyai:
Alon's Nullstellensatz for multisets. Comb. 32(5): 589-605 (2012) - [j34]Itnuit Janovitz-Freireich, Bernard Mourrain, Lajos Rónyai, Ágnes Szántó:
On the computation of matrices of traces and radicals of ideals. J. Symb. Comput. 47(1): 102-122 (2012) - [j33]Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena:
Trading GRH for algebra: Algorithms for factoring polynomials and related structures. Math. Comput. 81(277): 493-531 (2012) - [j32]János Tapolcai, Pin-Han Ho, Lajos Rónyai, Bin Wu:
Network-wide local unambiguous failure localization (NWL-UFL) via monitoring trails. IEEE/ACM Trans. Netw. 20(6): 1762-1773 (2012) - 2011
- [j31]János Tapolcai, Bin Wu, Pin-Han Ho, Lajos Rónyai:
A novel approach for failure localization in all-optical mesh networks. IEEE/ACM Trans. Netw. 19(1): 275-285 (2011) - 2010
- [j30]Sándor Bozóki, János Fülöp, Lajos Rónyai:
On optimal completion of incomplete pairwise comparison matrices. Math. Comput. Model. 52(1-2): 318-333 (2010) - 2009
- [j29]Bálint Felszeghy, Gábor Hegedüs, Lajos Rónyai:
Algebraic Properties of Modulo q Complete l-Wide Families. Comb. Probab. Comput. 18(3): 309-333 (2009) - 2008
- [j28]Edward G. Coffman Jr., János Csirik, Lajos Rónyai, Ambrus Zsbán:
Random-order bin packing. Discret. Appl. Math. 156(14): 2810-2816 (2008) - [j27]Gábor Ivanyos, Attila B. Nagy, Lajos Rónyai:
Constructions for quantum computing with symmetrized gates. Quantum Inf. Comput. 8(5): 411-429 (2008) - 2007
- [j26]Itnuit Janovitz-Freireich, Lajos Rónyai, Ágnes Szántó:
Approximate Radical for Clusters: A Global Approach Using Gaussian Elimination or SVD. Math. Comput. Sci. 1(2): 393-425 (2007) - 2006
- [j25]Bálint Felszeghy, Balázs Ráth, Lajos Rónyai:
The lex game and some applications. J. Symb. Comput. 41(6): 663-681 (2006) - 2003
- [j24]Katalin Friedl, Lajos Rónyai:
Order shattering and Wilson's theorem. Discret. Math. 270(1-3): 126-135 (2003) - 2002
- [j23]Richard P. Anstee, Lajos Rónyai, Attila Sali:
Shattering News. Graphs Comb. 18(1): 59-73 (2002) - 2000
- [j22]Lajos Rónyai:
On a Conjecture of Kemnitz. Comb. 20(4): 569-573 (2000) - [j21]György Elekes, Lajos Rónyai:
A Combinatorial Problem on Polynomials and Rational Functions. J. Comb. Theory A 89(1): 1-20 (2000) - 1999
- [j20]János Demetrovics, Attila Pethö, Lajos Rónyai:
On 1-Representations of Integers. Acta Cybern. 14(1): 27-36 (1999) - [j19]Noga Alon, Lajos Rónyai, Tibor Szabó:
Norm-Graphs: Variations and Applications. J. Comb. Theory B 76(2): 280-290 (1999) - 1997
- [j18]Willem A. de Graaf, Gábor Ivanyos, A. Küronya, Lajos Rónyai:
Computing Levi Decompositions in Lie algebras. Appl. Algebra Eng. Commun. Comput. 8(4): 291-303 (1997) - [j17]Arjeh M. Cohen, Willem A. de Graaf, Lajos Rónyai:
Computations in finite-dimensional Lie algebras. Discret. Math. Theor. Comput. Sci. 1(2): 129-138 (1997) - 1996
- [j16]Willem A. de Graaf, Gábor Ivanyos, Lajos Rónyai:
Computing Cartan subalgebras of Lie algebras. Appl. Algebra Eng. Commun. Comput. 7(5): 339-349 (1996) - [j15]Lajos Rónyai, Ágnes Szántó:
Primer-Field Complete Functions and Factoring Polynomials over Finite Fields. Comput. Artif. Intell. 15(6): 571-577 (1996) - [j14]János Kollár, Lajos Rónyai, Tibor Szabó:
Norm-Graphs and Bipartite Turán Numbers. Comb. 16(3): 399-406 (1996) - 1994
- [j13]Gábor Ivanyos, Lajos Rónyai, Ágnes Szántó:
Decomposition of Algebras over Fq(X1, ..., Xm). Appl. Algebra Eng. Commun. Comput. 5: 71-90 (1994) - [j12]Lajos Rónyai:
A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q. J. Algorithms 16(1): 24-32 (1994) - 1993
- [j11]János Demetrovics, Lajos Rónyai, Hua nam Son:
Functional Dependencies among Boolean Dependencies. Ann. Math. Artif. Intell. 7(1-4): 83-106 (1993) - [j10]Gábor Ivanyos, Lajos Rónyai:
Finding Maximal Orders in Semisimple Algebras Over Q. Comput. Complex. 3: 245-261 (1993) - 1992
- [j9]János Demetrovics, Lajos Rónyai:
A Note on Intersection of Isotone Clones. Acta Cybern. 10(3): 217-220 (1992) - [j8]Lajos Rónyai:
Algorithmic Properties of Maximal Orders in Simple Algebras over Q. Comput. Complex. 2: 225-243 (1992) - [j7]Lajos Rónyai:
Galois Groups and Factoring Polynomials Over Finite Fields. SIAM J. Discret. Math. 5(3): 345-365 (1992) - 1991
- [j6]Lajos Rónyai:
Computing the Order of Centralizers in Linear Groups. Inf. Comput. 91(2): 172-176 (1991) - 1990
- [j5]Lajos Rónyai:
Computing the Structure of Finite Algebras. J. Symb. Comput. 9(3): 355-373 (1990) - 1989
- [j4]Lajos Rónyai:
Factoring polynomials modulo special primes. Comb. 9(2): 199-206 (1989) - [j3]Lajos Rónyai, Tamás Szonyi:
Planar functions over finite fields. Comb. 9(3): 315-320 (1989) - 1988
- [j2]Lajos Rónyai:
Factoring Polynomials Over Finite Fields. J. Algorithms 9(3): 391-400 (1988) - [j1]Lajos Rónyai:
Zero Divisors in Quaternion Algebras. J. Algorithms 9(4): 494-506 (1988)
Conference and Workshop Papers
- 2023
- [c24]János Tapolcai, Péter Babarczi, Pin-Han Ho, Lajos Rónyai:
Resilient Routing Table Computation Based on Connectivity Preserving Graph Sequences. INFOCOM 2023: 1-10 - 2022
- [c23]Péter Babarczi, Gábor Rétvári, Lajos Rónyai, János Tapolcai:
Routing on the Shortest Pairs of Disjoint Paths. IFIP Networking 2022: 1-9 - 2021
- [c22]János Tapolcai, Zsombor L. Hajdú, Alija Pasic, Pin-Han Ho, Lajos Rónyai:
On Network Topology Augmentation for Global Connectivity under Regional Failures. INFOCOM 2021: 1-10 - 2018
- [c21]Sándor Z. Kiss, Éva Hosszu, János Tapolcai, Lajos Rónyai, Ori Rottenstreich:
Bloom Filter with a False Positive Free Zone. INFOCOM 2018: 1412-1420 - [c20]János Tapolcai, Bálazs Vass, Zalán Heszberger, József Bíró, David Hay, Fernando A. Kuipers, Lajos Rónyai:
A Tractable Stochastic Model of Correlated Link Failures Caused by Disasters. INFOCOM 2018: 2105-2113 - 2017
- [c19]János Tapolcai, Lajos Rónyai, Bálazs Vass, Laszlo Gyimothi:
List of shared risk link groups representing regional failures with limited size. INFOCOM 2017: 1-9 - 2015
- [c18]Alija Pasic, János Tapolcai, Péter Babarczi, Erika R. Bérczi-Kovács, Zoltán Király, Lajos Rónyai:
Survivable routing meets diversity coding. Networking 2015: 1-9 - 2014
- [c17]János Tapolcai, Lajos Rónyai, Éva Hosszu, Pin-Han Ho, Suresh Subramaniam:
Signaling free localization of node failures in all-optical networks. INFOCOM 2014: 1860-1868 - [c16]Péter Babarczi, János Tapolcai, Lajos Rónyai, Muriel Médard:
Resilient flow decomposition of unicast connections with network coding. ISIT 2014: 116-120 - 2013
- [c15]János Tapolcai, Pin-Han Ho, Péter Babarczi, Lajos Rónyai:
On achieving all-optical failure restoration via monitoring trails. INFOCOM 2013: 380-384 - 2012
- [c14]Éva Hosszu, János Tapolcai, Lajos Rónyai, Péter Soproni, Péter Babarczi, Pin-Han Ho:
Fast failure localization in all-optical networks with length-constrained monitoring trails. ICUMT 2012: 677-683 - 2011
- [c13]Lajos Rónyai, Tamás Mészáros:
Some Combinatorial Applications of Gröbner Bases. CAI 2011: 65-83 - 2010
- [c12]János Tapolcai, Lajos Rónyai, Pin-Han Ho:
Optimal Solutions for Single Fault Localization in Two Dimensional Lattice Networks. INFOCOM 2010: 161-165 - 2008
- [c11]Itnuit Janovitz-Freireich, Ágnes Szántó, Bernard Mourrain, Lajos Rónyai:
Moment matrices, trace matrices and the radical of ideals. ISSAC 2008: 125-132 - 2006
- [c10]Itnuit Janovitz-Freireich, Lajos Rónyai, Ágnes Szántó:
Approximate radical of ideals with clusters of roots. ISSAC 2006: 146-153 - 1996
- [c9]László Babai, Anna Gál, János Kollár, Lajos Rónyai, Tibor Szabó, Avi Wigderson:
Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs. STOC 1996: 603-611 - 1992
- [c8]János Demetrovics, Lajos Rónyai, Hua nam Son:
On the Composition and Decomposition of Attributes and Tuples. ICDT 1992: 71-85 - 1991
- [c7]Lajos Rónyai:
Computations in Associative Algebras. Groups And Computation 1991: 221-243 - [c6]János Demetrovics, Lajos Rónyai, Hua nam Son:
On the Representation of Dependencies by Propositional Logic. MFDBS 1991: 230-242 - 1989
- [c5]László Babai, Lajos Rónyai:
Computing Irreducible Representations of Finite Groups. FOCS 1989: 93-98 - [c4]Lajos Rónyai:
Galois Groups and Factoring Polynomials over Finite Fields. FOCS 1989: 99-104 - 1987
- [c3]Lajos Rónyai:
Factoring Polynomials over Finite Fields. FOCS 1987: 132-137 - [c2]Lajos Rónyai:
Simple Algebras Are Difficult. STOC 1987: 398-408 - 1985
- [c1]Katalin Friedl, Lajos Rónyai:
Polynomial Time Solutions of Some Problems in Computational Algebra. STOC 1985: 153-162
Parts in Books or Collections
- 2009
- [p1]Bálint Felszeghy, Lajos Rónyai:
Some Meeting Points of Gröbner Bases and Combinatorics. Algorithmic Algebraic Combinatorics and Gröbner Bases 2009: 207-227
Informal and Other Publications
- 2022
- [i11]Gábor Ivanyos, Attila Pereszlényi, Lajos Rónyai:
Some Complexity Results Involving Quantum Computing. ERCIM News 2022(128) (2022) - 2018
- [i10]Gábor Ivanyos, Lajos Rónyai:
Chevalley-Warning Theorem in Quantum Computing. ERCIM News 2018(112) (2018) - 2016
- [i9]Gábor Ivanyos, Péter Kutas, Lajos Rónyai:
Explicit equivalence of quadratic forms over $\mathbb{F}_q(t)$. CoRR abs/1610.08671 (2016) - 2015
- [i8]Gábor Ivanyos, Péter Kutas, Lajos Rónyai:
Computing explicit isomorphisms with full matrix algebras over $\mathbb{F}_q(x)$. CoRR abs/1508.07755 (2015) - 2014
- [i7]Péter Babarczi, János Tapolcai, Lajos Rónyai, Muriel Médard:
Resilient Flow Decomposition of Unicast Connections with Network Coding. CoRR abs/1401.6670 (2014) - 2013
- [i6]Sándor Bozóki, Tsung-Lin Lee, Lajos Rónyai:
Seven mutually touching infinite cylinders. CoRR abs/1308.5164 (2013) - 2011
- [i5]Gábor Ivanyos, Lajos Rónyai, Josef Schicho:
Splitting full matrix algebras over algebraic number fields. CoRR abs/1106.6191 (2011) - 2009
- [i4]Itnuit Janovitz-Freireich, Bernard Mourrain, Lajos Rónyai, Ágnes Szántó:
On the Computation of Matrices of Traces and Radicals of Ideals. CoRR abs/0901.2778 (2009) - 2008
- [i3]Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena:
Trading GRH for algebra: algorithms for factoring polynomials and related structures. CoRR abs/0811.3165 (2008) - [i2]Itnuit Janovitz-Freireich, Ágnes Szántó, Bernard Mourrain, Lajos Rónyai:
Moment matrices, trace matrices and the radical of ideals. CoRR abs/0812.0088 (2008) - [i1]Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena:
Trading GRH for algebra: algorithms for factoring polynomials and related structures. Electron. Colloquium Comput. Complex. TR08 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
