default search action
Marius Nagy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j27]Naya Nagy
, Matthew Stuart-Edwards
Quantum analysis of squiggle data. BioData Min. 16(1) (2023) - [j26]Naya Nagy
Quantum Honeypots. Entropy 25(10): 1461 (2023) - [j25]Marius Nagy
Quantum advantage in deciding NP-complete problems. Quantum Inf. Process. 22(3): 133 (2023) - 2022
- [j24]Robert Benkoczi, Daya Ram Gaur
Quantum Bitcoin Mining. Entropy 24(3): 323 (2022) - [j23]Marius Nagy
Intrusion Detection Quantum Sensor Networks. Sensors 22(21): 8092 (2022) - 2020
- [j22]Marius Nagy
Quantum Steganography by Harnessing Entanglement as a Degree of Freedom. IEEE Access 8: 213671-213681 (2020) - [j21]Marius Nagy, Naya Nagy:
Image processing: why quantum? Quantum Inf. Comput. 20(7&8): 616-626 (2020) - [j20]Dhoha A. Almubayedh, Ghadeer Alazman, Mashael Alkhalis, Manal Alabdali, Naya Nagy
Quantum bit commitment on IBM QX. Quantum Inf. Process. 19(2): 55 (2020) - [j19]Marius Nagy, Naya Nagy
Coding in the entanglement domain. Quantum Inf. Process. 19(4): 134 (2020)
2010 – 2019
- 2019
- [p1]Marius Nagy, Naya Nagy:
On the Importance of Parallelism for the Security of Quantum Protocols. From Parallel to Emergent Computing 2019: 3-30 - 2018
- [j18]Marius Nagy, Naya Nagy
An Information-Theoretic Perspective on the Quantum Bit Commitment Impossibility Theorem. Entropy 20(3): 193 (2018) - 2016
- [j17]Naya Nagy, Marius Nagy, Paul Hodor:
Cryptography and Information Protection in the Living World. Int. J. Unconv. Comput. 12(2-3): 133-143 (2016) - [j16]Naya Nagy, Marius Nagy:
Quantum Bit Commitment - Within an Equivalence Class. Int. J. Unconv. Comput. 12(5-6): 413-432 (2016) - [j15]Marius Nagy, Naya Nagy
Quantum Oblivious Transfer: a secure practical implementation. Quantum Inf. Process. 15(12): 5037-5050 (2016) - [j14]Marius Nagy, Naya Nagy
Quantum-based secure communications with no prior key distribution. Soft Comput. 20(1): 87-101 (2016) - [c10]Ahmet Emin Tatar, Marius Nagy, Naya Nagy:
The Cost of Breaking a Quantum Bit Commitment Protocol on Equivalence Classes. SECRYPT 2016: 419-423 - 2015
- [j13]Naya Nagy
Carving Secret Messages out of Public Information. J. Comput. Sci. 11(1): 64-70 (2015) - 2014
- [c9]Naya Nagy
Unconditionally Secure Quantum Bit Commitment Protocol Based on Incomplete Information. TPNC 2014: 134-143 - 2013
- [c8]Marius Nagy, Naya Nagy
General Quantum Encryption Scheme Based on Quantum Memory. TPNC 2013: 169-180 - [c7]Marius Nagy, Naya Nagy
Quantum Secret Communication without an Encryption Key. TPNC 2013: 181-192 - 2010
- [j12]Naya Nagy, Marius Nagy, Selim G. Akl:
Hypercomputation in a Cryptographic Setting: Solving the Identity Theft Problem Using Quantum Memories? Int. J. Unconv. Comput. 6(5): 375-398 (2010) - [j11]Naya Nagy
Quantum security in wireless sensor networks. Nat. Comput. 9(4): 819-830 (2010) - [j10]Marius Nagy, Selim G. Akl:
Coping with Decoherence: Parallelizing the Quantum Fourier Transform. Parallel Process. Lett. 20(3): 213-226 (2010) - [j9]Marius Nagy, Selim G. Akl:
Entanglement Verification with an Application to Quantum Key Distribution Protocols. Parallel Process. Lett. 20(3): 227-237 (2010) - [j8]Naya Nagy
Key Distribution versus Key Enhancement in Quantum Cryptography. Parallel Process. Lett. 20(3): 239-250 (2010)
2000 – 2009
- 2009
- [j7]Marius Nagy:
Locating the Median of a Tree in Real Time. Parallel Process. Lett. 19(1): 39-55 (2009) - 2008
- [c6]Marius Nagy, Selim G. Akl:
Entanglement verification with application to key distribution protocols. ITSL 2008: 99-105 - [c5]Marius Nagy, Selim G. Akl, Sean Kershaw:
Key Distribution based on Quantum Fourier Transform. SECRYPT 2008: 263-269 - [c4]Naya Nagy
Quantum Wireless Sensor Networks. UC 2008: 177-188 - 2007
- [j6]Marius Nagy, Selim G. Akl:
Quantum computing: beyond the limits of conventional computation. Int. J. Parallel Emergent Distributed Syst. 22(2): 123-135 (2007) - [j5]Marius Nagy, Selim G. Akl:
Parallelism in Quantum Information Processing Defeats the Universal Computer. Parallel Process. Lett. 17(3): 233-262 (2007) - 2006
- [j4]Marius Nagy, Selim G. Akl:
Real-time minimum vertex cover for two-terminal series-parallel graphs. Int. J. High Perform. Comput. Netw. 4(5/6): 347-356 (2006) - [j3]Marius Nagy, Selim G. Akl:
Quantum Measurements and Universal Computation. Int. J. Unconv. Comput. 2(1): 73-88 (2006) - [j2]Marius Nagy, Selim G. Akl:
Computing nearest neighbors in real time. J. Parallel Distributed Comput. 66(3): 359-366 (2006) - [j1]Marius Nagy, Selim G. Akl:
Quantum computation and quantum information. Int. J. Parallel Emergent Distributed Syst. 21(1): 1-59 (2006) - [c3]Marius Nagy, Selim G. Akl:
Coping with Decoherence: Parallelizing the Quantum Fourier Transform. PDCS 2006: 108-113 - 2005
- [c2]Marius Nagy, Selim G. Akl:
On the Importance of Parallelism for Quantum Computation and the Concept of a Universal Computer. UC 2005: 176-190 - 2002
- [c1]Marius Nagy, Selim G. Akl:
Locating the Median of a Tree in Real Time. IASTED PDCS 2002: 108-113
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-10-07 22:17 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: