Items where Author is "Pongrácz, András"
Group by: Item Type | No Grouping Number of items: 11. ArticleBodirsky, Manuel and Pinsker, Michael and Pongrácz, András (2021) Projective clone homomorphisms. JOURNAL OF SYMBOLIC LOGIC, 86 (1). pp. 148-161. ISSN 0022-4812 Pongrácz, András (2020) Binary linear codes with near-extremal maximum distance. SIAM JOURNAL ON DISCRETE MATHEMATICS. ISSN 0895-4801 (print); 1095-7146 (online) (In Press) Pongrácz, András (2020) Discordant voting protocols for cyclically linked agents. ELECTRONIC JOURNAL OF COMBINATORICS, 27 (1). ISSN 1077-8926 Bodirsky, Manuel and Pinsker, Michael and Pongrácz, András (2019) Projective clone homomorphisms. JOURNAL OF SYMBOLIC LOGIC. ISSN 0022-4812 (In Press) Bodirsky, Manuel and Martin, Barnaby and Pinsker, Michael and Pongrácz, András (2019) Constraint satisfaction problems for reducts of homogeneous graphs. SIAM JOURNAL ON COMPUTING, 48 (4). pp. 1224-1264. ISSN 0097-5397 Bodirsky, M. and Martin, B. and Pinsker, M. and Pongrácz, András (2019) Constraint satisfaction problems for reducts of homogeneous graphs. SIAM JOURNAL ON COMPUTING, 48 (4). pp. 1224-1264. ISSN 0097-5397 Kátai-Urbán, Kamilla and Pongrácz, András and Szabó, Csaba (2019) The fine- and generative spectra of varieties of monounary algebras. Algebra Universalis, 80 (22). 18-pp. ISSN 0002-5240 Bodirsky, Manuel and Bradley-Williams, David and Pinsker, Michael and Pongrácz, András (2018) The universal homogeneous binary tree. Journal of Logic and Computation, 28 (1). pp. 133-163. ISSN 0955-792X, ESSN: 1465-363X Manuel, Bodirsky and David, Bradley-Williams and Michael, Pinsker and Pongrácz, András (2018) The universal homogeneous binary tree. JOURNAL OF LOGIC AND COMPUTATION, 28 (1). pp. 133-163. ISSN 0955-792X MonographSzabó, Csaba and Horváth, Gábor and Kátai-Urbán, Kamilla and Kun, Gábor and Pongrácz, András and Vértesi, Vera (2012) Bonyolultságelmélet és algebra = Complexity and algebra. Project Report. OTKA. Conference or Workshop ItemPongrácz, András (2018) Discordant voting protocols for cyclically linked agents. In: International Conference of Computer Science and Engineering, 2018. 07. 04-06., London. |