default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLajos Hajdu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j29]Matthew Ceko, Lajos Hajdu, Rob Tijdeman:
Error Correction for Discrete Tomography. Fundam. Informaticae 189(2): 91-112 (2022)
2010 – 2019
- 2019
- [j28]András Hajdu
, Lajos Hajdu, Robert Tijdeman:
Finding well approximating lattices for a finite set of points. Math. Comput. 88(315): 369-387 (2019) - 2017
- [j27]Lajos Hajdu, Robert Tijdeman:
Consistency Conditions for Discrete Tomography. Fundam. Informaticae 155(4): 425-447 (2017) - [j26]Lajos Hajdu, Márton Szikszai, Volker Ziegler:
On Arithmetic Progressions in Lucas Sequences. J. Integer Seq. 20(8): 17.8.6 (2017) - [j25]Clemens Fuchs, Lajos Hajdu:
30 years of collaboration. Period. Math. Hung. 74(2): 255-274 (2017) - 2016
- [j24]Csanád Bertók, Lajos Hajdu:
A Hasse-type principle for exponential Diophantine equations and its applications. Math. Comput. 85(298): 849-860 (2016) - [c7]András Hajdu, Henrietta Tomán, Laszlo Kovacs, Lajos Hajdu:
Composing ensembles by a stochastic approach under execution time constraint. ICPR 2016: 222-227 - [c6]András Hajdu, Balázs Harangi, Renátó Besenczi, István Lázár, G. Emri, Lajos Hajdu, Robert Tijdeman:
Measuring regularity of network patterns by grid approximations using the LLL algorithm. ICPR 2016: 1524-1529 - 2015
- [j23]Sara Brunetti, Paolo Dulio, Lajos Hajdu, Carla Peri:
Ghosts in Discrete Tomography. J. Math. Imaging Vis. 53(2): 210-224 (2015) - 2014
- [j22]K. Gyory, Lajos Hajdu, Robert Tijdeman:
Representation of finite graphs as difference graphs of S-units, I. J. Comb. Theory A 127: 314-335 (2014) - [j21]Attila Bérczes, Lajos Hajdu, Noriko Hirata-Kohno, Tünde Kovács, Attila Pethö:
A key exchange protocol based on Diophantine equations and S-integers. JSIAM Lett. 6: 85-88 (2014) - [j20]Lajos Hajdu, Volker Ziegler:
Distinct unit generated totally complex quartic fields. Math. Comput. 83(287): 1495-1512 (2014) - [j19]Daniel Dombek, Lajos Hajdu, Attila Pethö:
Representing algebraic integers as linear combinations of units. Period. Math. Hung. 68(2): 135-142 (2014) - [i2]László Aszalós, Lajos Hajdu, Attila Pethö:
On a correlational clustering of integers. CoRR abs/1404.0904 (2014) - 2013
- [j18]Kees Joost Batenburg, Wagner Fortes, Lajos Hajdu, Robert Tijdeman:
Bounds on the quality of reconstructed images in binary tomography. Discret. Appl. Math. 161(15): 2236-2251 (2013) - [j17]Lajos Hajdu, Tünde Kovács, Attila Pethö, Michael E. Pohst:
An Optimization Problem for Lattices. Exp. Math. 22(4): 443-455 (2013) - [j16]Lajos Hajdu, Robert Tijdeman:
Bounds for Approximate Discrete Tomography Solutions. SIAM J. Discret. Math. 27(2): 1055-1066 (2013) - [j15]András Hajdu, Lajos Hajdu, Agnes Jonas, Laszlo Kovacs, Henrietta Tomán:
Generalizing the Majority Voting Scheme to Spatially Constrained Voting. IEEE Trans. Image Process. 22(11): 4182-4194 (2013) - [c5]András Hajdu, Lajos Hajdu, Laszlo Kovacs, Henrietta Tomán:
Diversity Measures for Majority Voting in the Spatial Domain. HAIS 2013: 314-323 - 2012
- [j14]András Hajdu, Lajos Hajdu, Robert Tijdeman:
Approximation of the Euclidean Distance by Chamfer Distances. Acta Cybern. 20(3): 399-417 (2012) - [j13]Lajos Hajdu, N. Saradha:
Disproof of a conjecture of Jacobsthal. Math. Comput. 81(280): 2461-2471 (2012) - [c4]Henrietta Tomán, Laszlo Kovacs, Agnes Jonas, Lajos Hajdu, András Hajdu:
Generalized Weighted Majority Voting with an Application to Algorithms Having Spatial Output. HAIS (2) 2012: 56-67 - [i1]András Hajdu, Lajos Hajdu, Robert Tijdeman:
Approximations of the Euclidean distance by chamfer distances. CoRR abs/1201.0876 (2012) - 2011
- [c3]Kees Joost Batenburg, Wagner Fortes, Lajos Hajdu, Robert Tijdeman:
Bounds on the Difference between Reconstructions in Binary Tomography. DGCI 2011: 369-380 - [c2]Henrietta Tomán, Laszlo Kovacs, Agnes Jonas, Lajos Hajdu, András Hajdu:
A Generalization of Majority Voting Scheme for Medical Image Detectors. HAIS (2) 2011: 189-196
2000 – 2009
- 2009
- [j12]Lajos Hajdu, Tünde Kovács:
Parallel LLL-reduction for bounding the integral solutions of elliptic Diophantine equations. Math. Comput. 78(266): 1201-1210 (2009) - [j11]Lajos Hajdu:
Optimal systems of fundamental S-units for LLL-reduction. Period. Math. Hung. 59(1): 53-79 (2009) - 2007
- [j10]András Hajdu, Lajos Hajdu, Robert Tijdeman:
General neighborhood sequences in Zn. Discret. Appl. Math. 155(18): 2507-2522 (2007) - 2006
- [c1]András Hajdu, Lajos Hajdu:
On the Lattice Structure of Subsets of Octagonal Neighborhood Sequences in \mathbb Zn. DGCI 2006: 211-222 - 2005
- [j9]Lajos Hajdu:
Unique reconstruction of bounded sets in discrete tomography. Electron. Notes Discret. Math. 20: 15-25 (2005) - [j8]Attila Fazekas, András Hajdu, Lajos Hajdu:
Metrical neighborhood sequences in Zn. Pattern Recognit. Lett. 26(13): 2022-2032 (2005) - 2004
- [j7]András Hajdu, Lajos Hajdu:
Approximating the Euclidean distance using non-periodic neighbourhood sequences. Discret. Math. 283(1-3): 101-111 (2004) - 2003
- [j6]András Hajdu, Lajos Hajdu:
Velocity and Distance of Neighbourhood Sequences. Acta Cybern. 16(1): 133-145 (2003) - [j5]Lajos Hajdu, Robert Tijdeman:
Algebraic aspects of emission tomography with absorption. Theor. Comput. Sci. 290(3): 2169-2181 (2003) - 2000
- [j4]Lajos Hajdu, László Szalay:
On the Diophantine Equations (2 n - 1)(6 n - 1) = x 2 and (a n - 1)(a kn - 1) = x 2. Period. Math. Hung. 40(2): 141-145 (2000)
1990 – 1999
- 1999
- [j3]Lajos Hajdu, Ákos Pintér:
Square product of three integers in short intervals. Math. Comput. 68(227): 1299-1301 (1999) - 1998
- [j2]Lajos Hajdu, T. Herendi:
Explicit Bounds for the Solutions of Elliptic Equations with Rational Coefficients. J. Symb. Comput. 25(3): 361-366 (1998) - 1997
- [j1]Attila Bérczes, Lajos Hajdu:
Computational experiences on the distances of polynomials to irreducible polynomials. Math. Comput. 66(217): 391-398 (1997)
Coauthor Index
aka: Rob Tijdeman
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 2025-01-09 13:16 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:
