@article{MTMT:32171117,
	title = {Extremal solutions of an inequality concerning supports of permutation groups and punctured Hadamard codes},
	url = {https://m2.mtmt.hu/api/publication/32171117},
	author = {Pongrácz, András},
	doi = {10.5565/PUBLMAT6612202},
	journal-iso = {PUBL MAT},
	journal = {PUBLICACIONS MATEMATIQUES},
	volume = {66},
	unique-id = {32171117},
	issn = {0214-1493},
	year = {2022},
	eissn = {0214-1493},
	pages = {57-75}
}

@article{MTMT:31669419,
	title = {On the reconstruction of the center of a projection by distances and incidence relations},
	url = {https://m2.mtmt.hu/api/publication/31669419},
	author = {Pongrácz, András and Vincze, Csaba},
	doi = {10.1007/s10851-020-00999-w},
	journal-iso = {J MATH IMAGING VIS},
	journal = {JOURNAL OF MATHEMATICAL IMAGING AND VISION},
	volume = {63},
	unique-id = {31669419},
	issn = {0924-9907},
	abstract = {Up to an orientation-preserving symmetry, photographic images are produced by a central projection of a restricted area in the space into the image plane. To obtain reliable information about physical objects and the environment through the process of recording is the basic problem of photogrammetry. We present a reconstruction process based on distances from the center of projection and incidence relations among the points to be projected. For any triplet of collinear points in the space, we construct a surface of revolution containing the center of the projection. It is a generalized conic that can be represented as an algebraic surface. The rotational symmetry allows us to restrict the investigations to the defining polynomial of the profile curve in the image plane. An equivalent condition for the boundedness is given in terms of the input parameters, and it is shown that the defining polynomial of the profile curve is irreducible.},
	keywords = {CENTRAL PROJECTIONS; Euclidean geometry; Generalized conics},
	year = {2021},
	eissn = {1573-7683},
	pages = {443-456}
}

@article{MTMT:3188105,
	title = {Projective clone homomorphisms},
	url = {https://m2.mtmt.hu/api/publication/3188105},
	author = {Manuel, Bodirsky and Michael, Pinsker and Pongrácz, András},
	doi = {10.1017/jsl.2019.23},
	journal-iso = {J SYMBOLIC LOGIC},
	journal = {JOURNAL OF SYMBOLIC LOGIC},
	volume = {86},
	unique-id = {3188105},
	issn = {0022-4812},
	abstract = {It is known that a countable -categorical structure interprets all finite structures primitively positively if and only if its polymorphism clone maps to the clone of projections on a two-element set via a continuous clone homomorphism. We investigate the relationship between the existence of a clone homomorphism to the projection clone, and the existence of such a homomorphism which is continuous and thus meets the above criterion.},
	year = {2021},
	eissn = {1943-5886},
	pages = {148-161}
}

@article{MTMT:31618390,
	title = {Binary linear codes with near-extremal maximum distance},
	url = {https://m2.mtmt.hu/api/publication/31618390},
	author = {Pongrácz, András},
	doi = {10.1137/19M1288498},
	journal-iso = {SIAM J DISCRETE MATH},
	journal = {SIAM JOURNAL ON DISCRETE MATHEMATICS},
	volume = {34},
	unique-id = {31618390},
	issn = {0895-4801},
	year = {2020},
	eissn = {1095-7146},
	pages = {2300-2317}
}

@article{MTMT:31618382,
	title = {Discordant voting protocols for cyclically linked agents},
	url = {https://m2.mtmt.hu/api/publication/31618382},
	author = {Pongrácz, András},
	doi = {10.37236/8578},
	journal-iso = {ELECTRON J COMB},
	journal = {ELECTRONIC JOURNAL OF COMBINATORICS},
	volume = {27},
	unique-id = {31618382},
	issn = {1097-1440},
	abstract = {Voting protocols, such as the push and the pull protocol, model the behavior of people during an election. These processes have been studied in distributed computing in peer-to-peer networks, and to describe how viruses or rumors spread in a community. We determine the asymptotic behavior of the runtime of discordant linear protocols on the cycle graph and the probability for each consensus to win.},
	year = {2020},
	eissn = {1077-8926},
	orcid-numbers = {Pongrácz, András/0000-0002-2771-8974}
}

@article{MTMT:3421943,
	title = {The fine- and generative spectra of varieties of monounary algebras},
	url = {https://m2.mtmt.hu/api/publication/3421943},
	author = {Kátai-Urbán, Kamilla and Pongrácz, András and Szabó, Csaba},
	doi = {10.1007/s00012-019-0596-2},
	journal-iso = {ALGEBR UNIV},
	journal = {ALGEBRA UNIVERSALIS},
	volume = {80},
	unique-id = {3421943},
	issn = {0002-5240},
	year = {2019},
	eissn = {1420-8911},
	orcid-numbers = {Szabó, Csaba/0000-0003-4783-5411}
}

@article{MTMT:3421941,
	title = {Constraint satisfaction problems for reducts of homogeneous graphs},
	url = {https://m2.mtmt.hu/api/publication/3421941},
	author = {Bodirsky, M and Martin, B and Pinsker, M and Pongrácz, András},
	doi = {10.1137/16M1082974},
	journal-iso = {SIAM J COMPUT},
	journal = {SIAM JOURNAL ON COMPUTING},
	volume = {48},
	unique-id = {3421941},
	issn = {0097-5397},
	abstract = {For n >= 3, let (H-n, E) denote the nth Henson graph, i.e., the unique countable homogeneous graph with exactly those finite graphs as induced subgraphs that do not embed the complete graph on n vertices. We show that for all structures Gamma with domain H-n whose relations are first-order definable in (H-n, E) the constraint satisfaction problem for F either is in P or is NP-complete. We moreover show a similar complexity dichotomy for all structures whose relations are first-order definable in a homogeneous graph whose reflexive closure is an equivalence relation. Together with earlier results, in particular for the random graph, this completes the complexity classification of constraint satisfaction problems of structures first-order definable in countably infinite homogeneous graphs: all such problems are either in P or NP-complete.},
	year = {2019},
	eissn = {1095-7111},
	pages = {1224-1264}
}

@inproceedings{MTMT:3421953,
	title = {Discordant voting Protocols for cyclically linked agents},
	url = {https://m2.mtmt.hu/api/publication/3421953},
	author = {Pongrácz, András},
	booktitle = {Proceedings of the World Congress on Engineering 2018 Vol I},
	unique-id = {3421953},
	year = {2018},
	pages = {165-168}
}

@article{MTMT:3339274,
	title = {The universal homogeneous binary tree},
	url = {https://m2.mtmt.hu/api/publication/3339274},
	author = {Manuel, Bodirsky and David, Bradley-Williams and Michael, Pinsker and Pongrácz, András},
	doi = {10.1093/logcom/exx043},
	journal-iso = {J LOGIC COMPUT},
	journal = {JOURNAL OF LOGIC AND COMPUTATION},
	volume = {28},
	unique-id = {3339274},
	issn = {0955-792X},
	year = {2018},
	eissn = {1465-363X},
	pages = {133-163}
}

@article{MTMT:3183038,
	title = {The complexity of counting quantifiers on equality languages},
	url = {https://m2.mtmt.hu/api/publication/3183038},
	author = {Barnaby, Martin and Pongrácz, András and Michal, Wrona},
	doi = {10.1016/j.tcs.2017.01.022},
	journal-iso = {THEOR COMPUT SCI},
	journal = {THEORETICAL COMPUTER SCIENCE},
	volume = {670},
	unique-id = {3183038},
	issn = {0304-3975},
	year = {2017},
	eissn = {1879-2294},
	pages = {56-67}
}