Lajos Rónyai

Electron. J. Comb., 2024

2023

Resilient Routing Table Computation Based on Connectivity Preserving Graph Sequences.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2023, 2023

2022

Some Complexity Results Involving Quantum Computing.

[BibT_eX]

[DOI]

Attila Pereszlényi

ERCIM News, 2022

Routing on the Shortest Pairs of Disjoint Paths.

[BibT_eX]

[DOI]

Proceedings of the IFIP Networking Conference, 2022

2021

Bloom Filter With a False Positive Free Zone.

[BibT_eX]

[DOI]

IEEE Trans. Netw. Serv. Manag., 2021

Probabilistic Shared Risk Link Groups Modeling Correlated Resource Failures Caused by Disasters.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2021

An Upper Bound for the Size of $s$-Distance Sets in Real Algebraic Sets.

[BibT_eX]

[DOI]

Gábor Hegedüs

Electron. J. Comb., 2021

On Network Topology Augmentation for Global Connectivity under Regional Failures.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE Conference on Computer Communications, 2021

2020

Fast Enumeration of Regional Link Failures Caused by Disasters With Limited Size.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2020

Minimum Cost Survivable Routing Algorithms for Generalized Diversity Coding.

[BibT_eX]

[DOI]

Alija Pasic

Péter Babarczi

Erika R. Bérczi-Kovács

Zoltán Király

IEEE/ACM Trans. Netw., 2020

2019

Explicit equivalence of quadratic forms over Fq(t).

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2019

2018

Computing Explicit Isomorphisms with Full Matrix Algebras over Fq(x).

[BibT_eX]

[DOI]

Found. Comput. Math., 2018

Chevalley-Warning Theorem in Quantum Computing.

[BibT_eX]

[DOI]

ERCIM News, 2018

A Tractable Stochastic Model of Correlated Link Failures Caused by Disasters.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

2017

Diversity Coding in Two-Connected Networks.

[BibT_eX]

[DOI]

Erika R. Bérczi-Kovács

Muriel Médard

IEEE/ACM Trans. Netw., 2017

Standard Monomials and Extremal Vector Systems.

[BibT_eX]

[DOI]

Tamás Mészáros

Electron. Notes Discret. Math., 2017

List of shared risk link groups representing regional failures with limited size.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

2016

Signaling Free Localization of Node Failures in All-Optical Networks.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2016

Incomplete Pairwise Comparison Matrices and Weighting Methods.

[BibT_eX]

[DOI]

László Csató

Fundam. Informaticae, 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

2015

Neighborhood Failure Localization in All-Optical Networks via Monitoring Trails.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

Seven mutually touching infinite cylinders.

[BibT_eX]

[DOI]

Sándor Bozóki

Tsung-Lin Lee

Comput. Geom., 2015

On a Parity Based Group Testing Algorithm.

[BibT_eX]

[DOI]

Acta Cybern., 2015

Survivable routing meets diversity coding.

[BibT_eX]

[DOI]

Alija Pasic

Péter Babarczi

Erika R. Bérczi-Kovács

Zoltán Király

Proceedings of the 14th IFIP Networking Conference, 2015

2014

On Signaling-Free Failure Dependent Restoration in All-Optical Mesh Networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2014

Shattering-Extremal Set Systems of VC Dimension at most 2.

[BibT_eX]

[DOI]

Tamás Mészáros

Electron. J. Comb., 2014

Resilient flow decomposition of unicast connections with network coding.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

2013

Link Fault Localization Using Bi-Directional M-Trails in All-Optical Mesh Networks.

[BibT_eX]

[DOI]

Pin-Han Ho

IEEE Trans. Commun., 2013

On achieving all-optical failure restoration via monitoring trails.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

2012

Network-wide local unambiguous failure localization (NWL-UFL) via monitoring trails.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2012

Trading GRH for algebra: Algorithms for factoring polynomials and related structures.

[BibT_eX]

[DOI]

Math. Comput., 2012

On the computation of matrices of traces and radicals of ideals.

[BibT_eX]

[DOI]

Bernard Mourrain

J. Symb. Comput., 2012

Alon's Nullstellensatz for multisets.

[BibT_eX]

[DOI]

Géza Kós

Comb., 2012

Fast failure localization in all-optical networks with length-constrained monitoring trails.

[BibT_eX]

[DOI]

Proceedings of the 4th International Congress on Ultra Modern Telecommunications and Control Systems, 2012

2011

A novel approach for failure localization in all-optical mesh networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2011

Splitting full matrix algebras over algebraic number fields

[BibT_eX]

[DOI]

Josef Schicho

CoRR, 2011

Some Combinatorial Applications of Gröbner Bases.

[BibT_eX]

[DOI]

Tamás Mészáros

Proceedings of the Algebraic Informatics - 4th International Conference, 2011

2010

On optimal completion of incomplete pairwise comparison matrices.

[BibT_eX]

[DOI]

Sándor Bozóki

János Fülöp

Math. Comput. Model., 2010

Optimal Solutions for Single Fault Localization in Two Dimensional Lattice Networks.

[BibT_eX]

[DOI]

Pin-Han Ho

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009

Algebraic Properties of Modulo q Complete l-Wide Families.

[BibT_eX]

[DOI]

Bálint Felszeghy

Gábor Hegedüs

Comb. Probab. Comput., 2009

Some Meeting Points of Gröbner Bases and Combinatorics.

[BibT_eX]

[DOI]

Bálint Felszeghy

Proceedings of the Algorithmic Algebraic Combinatorics and Gröbner Bases, 2009

2008

Constructions for quantum computing with symmetrized gates.

[BibT_eX]

[DOI]

Attila B. Nagy

Quantum Inf. Comput., 2008

Random-order bin packing.

[BibT_eX]

[DOI]

Edward G. Coffman Jr.

János Csirik

Ambrus Zsbán

Discret. Appl. Math., 2008

Moment matrices, trace matrices and the radical of ideals.

[BibT_eX]

[DOI]

Bernard Mourrain

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007

Approximate Radical for Clusters: A Global Approach Using Gaussian Elimination or SVD.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2007

2006

The lex game and some applications.

[BibT_eX]

[DOI]

Bálint Felszeghy

Balázs Ráth

J. Symb. Comput., 2006

Approximate radical of ideals with clusters of roots.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

2003

Order shattering and Wilson's theorem.

[BibT_eX]

[DOI]

Katalin Friedl

Discret. Math., 2003

2002

Shattering News.

[BibT_eX]

[DOI]

Richard P. Anstee

Attila Sali

Graphs Comb., 2002

2000

A Combinatorial Problem on Polynomials and Rational Functions.

[BibT_eX]

[DOI]

György Elekes

J. Comb. Theory A, 2000

On a Conjecture of Kemnitz.

[BibT_eX]

[DOI]

Comb., 2000

1999

Norm-Graphs: Variations and Applications.

[BibT_eX]

[DOI]

Noga Alon

Tibor Szabó

J. Comb. Theory B, 1999

On 1-Representations of Integers.

[BibT_eX]

[DOI]

Attila Pethö

Acta Cybern., 1999

1997

Computations in finite-dimensional Lie algebras.

[BibT_eX]

[DOI]

Arjeh M. Cohen

Willem A. de Graaf

Discret. Math. Theor. Comput. Sci., 1997

Computing Levi Decompositions in Lie algebras.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1997

1996

Norm-Graphs and Bipartite Turán Numbers.

[BibT_eX]

[DOI]

János Kollár

Tibor Szabó

Comb., 1996

Primer-Field Complete Functions and Factoring Polynomials over Finite Fields.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 1996

Computing Cartan subalgebras of Lie algebras.

[BibT_eX]

[DOI]

Willem A. de Graaf

Appl. Algebra Eng. Commun. Comput., 1996

Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1994

A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q.

[BibT_eX]

[DOI]

J. Algorithms, 1994

Decomposition of Algebras over Fq(X1, ..., Xm).

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1994

1993

Finding Maximal Orders in Semisimple Algebras Over Q.

[BibT_eX]

[DOI]

Comput. Complex., 1993

Functional Dependencies among Boolean Dependencies.

[BibT_eX]

[DOI]

Hua nam Son

Ann. Math. Artif. Intell., 1993

1992

Galois Groups and Factoring Polynomials Over Finite Fields.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1992

Algorithmic Properties of Maximal Orders in Simple Algebras over Q.

[BibT_eX]

[DOI]

Comput. Complex., 1992

A Note on Intersection of Isotone Clones.

[BibT_eX]

[DOI]

Acta Cybern., 1992

On the Composition and Decomposition of Attributes and Tuples.

[BibT_eX]

[DOI]

Hua nam Son

Proceedings of the Database Theory, 1992

1991

Computing the Order of Centralizers in Linear Groups

[BibT_eX]

[DOI]

Inf. Comput., April, 1991

On the Representation of Dependencies by Propositional Logic.

[BibT_eX]

[DOI]

Hua nam Son

Proceedings of the MFDBS 91, 1991

Computations in Associative Algebras.

[BibT_eX]

[DOI]

Proceedings of the Groups And Computation, 1991

1990

Computing the Structure of Finite Algebras.

[BibT_eX]

[DOI]

J. Symb. Comput., 1990

1989

Planar functions over finite fields.

[BibT_eX]

[DOI]

Tamás Szonyi

Comb., 1989

Factoring polynomials modulo special primes.

[BibT_eX]

[DOI]

Comb., 1989

Computing Irreducible Representations of Finite Groups

[BibT_eX]

[DOI]

László Babai

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

1988

Zero Divisors in Quaternion Algebras.

[BibT_eX]

[DOI]

J. Algorithms, 1988

Factoring Polynomials Over Finite Fields.

[BibT_eX]

[DOI]

J. Algorithms, 1988

1987

Simple Algebras Are Difficult

[BibT_eX]

[DOI]

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1985

Polynomial Time Solutions of Some Problems in Computational Algebra

[BibT_eX]

[DOI]

Katalin Friedl