| A direct product theorem for two-party bounded-round public-coin communication complexity R Jain, A Pereszlényi, P Yao Algorithmica 76 (3), 720-748, 2016 | 66 | 2016 |
| A parallel repetition theorem for entangled two-player one-round games under product distributions R Jain, A Pereszlényi, P Yao 2014 IEEE 29th Conference on Computational Complexity (CCC), 209-216, 2014 | 39 | 2014 |
| Web spam: a survey with vision for the archivist AA Benczúr, D Siklósi, J Szabó, I Bíró, Z Fekete, M Kurucz, A Pereszlényi, ... | 18 | 2008 |
| Simulation of quantum key distribution with noisy channels A Pereszlenyi Proceedings of the 8th International Conference on Telecommunications, 2005 …, 2005 | 18 | 2005 |
| Multi-prover quantum Merlin-Arthur proof systems with small gap A Pereszlényi arXiv preprint arXiv:1205.2761, 2012 | 14 | 2012 |
| Large-scale principal component analysis on livejournal friends network M Kurucz, A Benczúr, A Pereszlényi Proceedings of SNAKDD 2008, 2008 | 13 | 2008 |
| Cross-modal image retrieval with parameter tuning B Daróczy, Z Fekete, M Brendel, S Rácz, A Benczúr, D Siklósi, ... CLEF, 2008 | 8 | 2008 |
| Pointer Quantum PCPs and Multi-Prover Games AB Grilo, I Kerenidis, A Pereszlényi arXiv preprint arXiv:1603.00903, 2016 | 4 | 2016 |
| One-Sided Error QMA with Shared EPR Pairs--A Simpler Proof A Pereszlényi arXiv preprint arXiv:1306.5406, 2013 | 4 | 2013 |
| Increasing cluster recall of cross-modal image retrieval S Rácz, BZ Daróczy, D Siklósi, A Pereszlényi, M Brendel, A Benczúr CLEF, 2008 | 4 | 2008 |
| On quantum interactive proofs with short messages A Pereszlényi arXiv preprint arXiv:1109.0964, 2011 | 2 | 2011 |
| Quantum Inspired Adaptive Boosting B Daróczy, K Friedl, L Kabódi, A Pereszlényi, D Szabó arXiv preprint arXiv:2102.00949, 2021 | 1 | 2021 |
| SZTAKI@ ImageCLEF 2008: visual feature analysis in segmented images B Daróczy, Z Fekete, M Brendel, S Rácz, A Benczúr, D Siklósi, ... Workshop of the Cross-Language Evaluation Forum for European Languages, 644-651, 2008 | 1 | 2008 |
| Web Spam Hunting@ Budapest∗ D Siklósi, AA Benczúr, I Bíró, Z Fekete, M Kurucz, A Pereszlényi, S Rácz, ... | 1 | 2008 |
| Some Complexity Results Involving Quantum Computing G Ivanyos, A Pereszlényi, L Rónyai ERCIM NEWS, 18-19, 2022 | | 2022 |
| Studies in Models of Quantum Proof Systems A Pereszlényi | | 2014 |
| One-sided error QMA with shared EPR pairs–a simpler proof. arXiv: 1306.5406 A Pereszlényi | | 2013 |
András BenczúrInstitute for Computer Science and ControlEmail verificata su sztaki.hu
