default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAttila Pereszlényi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i8]Gábor Ivanyos, Attila Pereszlényi, Lajos Rónyai:
Some Complexity Results Involving Quantum Computing. ERCIM News 2022(128) (2022)- 2021
- [i7]Bálint Daróczy, Katalin Friedl, László Kabódi, Attila Pereszlényi, Dániel Szabó:
Quantum Inspired Adaptive Boosting. CoRR abs/2102.00949 (2021)
2010 – 2019
- 2016
- [j2]Rahul Jain
, Attila Pereszlényi, Penghui Yao:
A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity. Algorithmica 76(3): 720-748 (2016) - [c5]Alex Bredariol Grilo, Iordanis Kerenidis, Attila Pereszlényi:
Pointer Quantum PCPs and Multi-Prover Games. MFCS 2016: 21:1-21:14 - [i6]Alex Bredariol Grilo, Iordanis Kerenidis, Attila Pereszlényi:
Pointer Quantum PCPs and Multi-Prover Games. CoRR abs/1603.00903 (2016) - 2014
- [c4]Rahul Jain, Attila Pereszlényi, Penghui Yao:
A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions. CCC 2014: 209-216 - 2013
- [i5]Attila Pereszlényi:
One-Sided Error QMA with Shared EPR Pairs - A Simpler Proof. CoRR abs/1306.5406 (2013) - [i4]Rahul Jain, Attila Pereszlényi, Penghui Yao:
A parallel repetition theorem for entangled two-player one-round games under product distributions. CoRR abs/1311.6309 (2013) - 2012
- [j1]Attila Pereszlényi:
On Quantum Interactive Proofs with Short Messages. Chic. J. Theor. Comput. Sci. 2012 (2012) - [c3]Rahul Jain, Attila Pereszlényi, Penghui Yao:
A Direct Product Theorem for the Two-Party Bounded-Round Public-Coin Communication Complexity. FOCS 2012: 167-176 - [i3]Rahul Jain, Attila Pereszlényi, Penghui Yao:
A direct product theorem for bounded-round public-coin randomized communication complexity. CoRR abs/1201.1666 (2012) - [i2]Attila Pereszlényi:
Multi-Prover Quantum Merlin-Arthur Proof Systems with Small Gap. CoRR abs/1205.2761 (2012) - 2011
- [i1]Attila Pereszlényi:
On quantum interactive proofs with short messages. CoRR abs/1109.0964 (2011)
2000 – 2009
- 2008
- [c2]Bálint Daróczy, Zsolt Fekete, Mátyás Brendel, Simon Rácz, András A. Benczúr, Dávid Siklósi, Attila Pereszlényi:
SZTAKI @ ImageCLEF 2008: Visual Feature Analysis in Segmented Images. CLEF 2008: 644-651 - [c1]Simon Rácz, Bálint Daróczy, Dávid Siklósi, Attila Pereszlényi, Mátyás Brendel, András A. Benczúr:
Increasing Cluster Recall of Cross-modal Image Retrieval. CLEF (Working Notes) 2008
Coauthor Index
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 2024-04-25 05:50 CEST 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:
