Lajos Hajdu

According to our database1, Lajos Hajdu authored at least 37 papers between 1997 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 




Finding well approximating lattices for a finite set of points.
Math. Comput., 2019

30 years of collaboration.
Period. Math. Hung., 2017

On Arithmetic Progressions in Lucas Sequences.
J. Integer Seq., 2017

Consistency Conditions for Discrete Tomography.
Fundam. Informaticae, 2017

A Hasse-type principle for exponential Diophantine equations and its applications.
Math. Comput., 2016

Composing ensembles by a stochastic approach under execution time constraint.
Proceedings of the 23rd International Conference on Pattern Recognition, 2016

Measuring regularity of network patterns by grid approximations using the LLL algorithm.
Proceedings of the 23rd International Conference on Pattern Recognition, 2016

Ghosts in Discrete Tomography.
J. Math. Imaging Vis., 2015

Representing algebraic integers as linear combinations of units.
Period. Math. Hung., 2014

Distinct unit generated totally complex quartic fields.
Math. Comput., 2014

A key exchange protocol based on Diophantine equations and S-integers.
JSIAM Lett., 2014

Representation of finite graphs as difference graphs of S-units, I.
J. Comb. Theory, Ser. A, 2014

On a correlational clustering of integers.
CoRR, 2014

Generalizing the Majority Voting Scheme to Spatially Constrained Voting.
IEEE Trans. Image Process., 2013

Bounds for Approximate Discrete Tomography Solutions.
SIAM J. Discret. Math., 2013

An Optimization Problem for Lattices.
Exp. Math., 2013

Bounds on the quality of reconstructed images in binary tomography.
Discret. Appl. Math., 2013

Diversity Measures for Majority Voting in the Spatial Domain.
Proceedings of the Hybrid Artificial Intelligent Systems - 8th International Conference, 2013

Disproof of a conjecture of Jacobsthal.
Math. Comput., 2012

Approximations of the Euclidean distance by chamfer distances
CoRR, 2012

Approximation of the Euclidean Distance by Chamfer Distances.
Acta Cybern., 2012

Generalized Weighted Majority Voting with an Application to Algorithms Having Spatial Output.
Proceedings of the Hybrid Artificial Intelligent Systems - 7th International Conference, 2012

A Generalization of Majority Voting Scheme for Medical Image Detectors.
Proceedings of the Hybrid Artificial Intelligent Systems - 6th International Conference, 2011

Bounds on the Difference between Reconstructions in Binary Tomography.
Proceedings of the Discrete Geometry for Computer Imagery, 2011

Optimal systems of fundamental <i>S</i>-units for LLL-reduction.
Period. Math. Hung., 2009

Parallel LLL-reduction for bounding the integral solutions of elliptic Diophantine equations.
Math. Comput., 2009

General neighborhood sequences in Z<sup>n</sup>.
Discret. Appl. Math., 2007

On the Lattice Structure of Subsets of Octagonal Neighborhood Sequences in \mathbb <i>Z</i><sup><i>n</i></sup>.
Proceedings of the Discrete Geometry for Computer Imagery, 13th International Conference, 2006

Metrical neighborhood sequences in Z<sup>n</sup>.
Pattern Recognit. Lett., 2005

Unique reconstruction of bounded sets in discrete tomography.
Electron. Notes Discret. Math., 2005

Approximating the Euclidean distance using non-periodic neighbourhood sequences.
Discret. Math., 2004

Algebraic aspects of emission tomography with absorption.
Theor. Comput. Sci., 2003

Velocity and Distance of Neighbourhood Sequences.
Acta Cybern., 2003

On the Diophantine Equations (2<sup> <i>n</i> </sup> - 1)(6<sup> <i>n</i> </sup> - 1) = <i>x</i> <sup>2</sup> and (<i>a</i> <sup> <i>n</i> </sup> - 1)(<i>a</i> <sup> <i>kn</i> </sup> - 1) = <i>x</i> <sup>2</sup>.
Period. Math. Hung., 2000

Square product of three integers in short intervals.
Math. Comput., 1999

Explicit Bounds for the Solutions of Elliptic Equations with Rational Coefficients.
J. Symb. Comput., 1998

Computational experiences on the distances of polynomials to irreducible polynomials.
Math. Comput., 1997