Home \ Faculty Details \ Marius Nagy, Ph.D.
Faculty Img

  • Phone:

    +966-13-849-9272

  • Email:

    mnagy@pmu.edu.sa

  • Office No:

    F-019

  • Marius Nagy, Ph.D.

  • Job Title :

    Assistant Professor

  • College :

    College of Computer Engineering and Science


  • Department :

    Computer Science


Dr. Nagy obtained his B.Sc. in Computer Science from the Technical University of Cluj-Napoca, Romania in 1993. He then worked as a software developer in Romania until 1999, when he moved to Canada to pursue an academic career. Dr. Nagy obtained his M.Sc. and Ph.D. degrees in Computer Science from Queen’s University at Kingston, Ontario in 2001 and 2007, respectively. His Ph.D. thesis focuses on novel applications of quantum mechanics into information processing and data security.

Dr. Nagy continued as a post-doctoral fellow in the School of Computing at Queen’s University until the end of 2008. In 2009, he took a position as sessional instructor in the Royal Military College of Canada, Department of Math and Computer Science. Since February 2010, Dr. Nagy was appointed as Assistant Professor in the College of Computer Engineering and Science at Prince Mohammad Bin Fahd University, Al Khobar, Kingdom of Saudi Arabia.

His research interests include quantum information processing, particularly with applications to cryptography, parallel and unconventional models of computation and algorithms. Dr. Nagy’s publication record includes several book chapters and over 40 journal and conference papers.

Ph.D. School of Computing, Queen’s University 09/2002 – 06/2007
Computer Science Thesis: “Using quantum mechanics to enhance
information processing”.
M.Sc. School of Computing, Queen’s University 01/2000 – 10/2001
Computer Science Thesis: “Parallelism in real-time computation”.
B.Sc. Faculty of Automation and Computer Science 09/1988 – 06/1993
Computer Science Technical University of Cluj-Napoca, Romania
Diploma project: “Process management for a
PARLOG interpreter”.

Recent publications are listed here. The complete list of publications is included in the CV.

  1. Naya Nagy and Marius Nagy and Ghadeer Alazman and Zahra Hawaidi and Saja Mustafa
    Alsulaibikh and Layla Alabbad and Sadeem Alfaleh and Areej Aljuaid (2023) ”Quantum
    Honeypots”, Entropy, 25(10), 1461. DOI: 10.3390/e25101461.
  2. Naya Nagy and Matthew Stuart-Edwards and Marius Nagy and Liam Mitchell and Athanasios
    Zovoilis (2023) ”Quantum analysis of squiggle data”, BioData Mining, 16:27. DOI:
    10.1186/s13040-023-00343-z.
  3. Marius Nagy and Naya Nagy (2023) ”Quantum advantage in deciding NP-complete problems”,
    Quantum Information Processing, 22(3), 133. DOI: 10.1007/s11128-023-03889-3.
  4. Marius Nagy and Naya Nagy (2022) ”Intrusion Detection Quantum Sensor Networks”,
    Sensors, 22, 8092. DOI: 10.3390/s22218092.
  5. Robert Benkoczi, Daya Gaur, Naya Nagy, Marius Nagy and Shahadat Hossain (2022)
    ”Quantum Bitcoin Mining”, Entropy, 24(3), 323. DOI: 10.3390/e24030323.
  6. Marius Nagy and Naya Nagy (2020) ”Quantum Steganography by Harnessing Entanglement
    as a Degree of Freedom”, IEEE Access, vol. 8, 213671–213681. DOI: 10.1109/ACCESS.
    2020.3040442.
  7. Marius Nagy and Naya Nagy (2020) ”Image Processing: Why Quantum?”, Quantum
    Information and Computation, 20(7&8), 616–626. DOI: 10.26421/QIC20.7-8.
  8. Marius Nagy and Naya Nagy (2020) ”Coding in the entanglement domain”, Quantum
    Information Processing, 19(4), 134. DOI: 10.1007/s11128-020-02632-6.
  9. Dhoha Almubayedh and Ghadeer Alazman and Mashael Alkhalis and Manal Alabdali and
    Naya Nagy and Marius Nagy and Ahmet Emin Tatar and Malak Alfosail and Attaur-
    Rahman and Norah AlMubairik (2020) ”Quantum bit commitment on IBM QX”.
    Quantum Information Processing, 19(2), 55. DOI: 10.1007/s11128-019-2543-8.
  10. Marius Nagy and Naya Nagy (2018) ”An Information-Theoretic Perspective on the Quantum
    Bit Commitment Impossibility Theorem”. Entropy. 20(3), 193. DOI: 10.3390/e20030193.
  11. Marius Nagy and Naya Nagy (2016) “Quantum Oblivious Transfer: a secure practical
    implementation”. Quantum Information Processing. 15(12):5037–5050. DOI:
    10.1007/s11128-016-1438-1.
  12. Naya Nagy and Marius Nagy. (2016) “Quantum Bit Commitment – Within an Equivalence
    Class”. International Journal of Unconventional Computing. 12(5–6):413–432.
  13. Naya Nagy, Marius Nagy and Paul Hodor. (2016) “Cryptography and Information Protection
    in the LivingWorld”. International Journal of Unconventional Computing. 12(2–
    3):133–143.
  14. Marius Nagy and Naya Nagy (2016) “Quantum-based secure communications with no
    prior key distribution”. Soft Computing. 20(1):87–101. DOI: 10.1007/s00500-014-1555-
    7.
  15. Naya Nagy, Marius Nagy and Selim G. Akl (2015) ”Carving secret messages out of public
    information”. Journal of Computer Science. 11(1):64–70.
  16. Hafsa Yazdani, Fatemah Al Zayer, Naya Nagy and Marius Nagy (2014) ”Turing Machine
    Simulations: Classic and Quantum”. International Journal of Computer and Electrical
    Engineering. 6(1):49–53.
  17. Marius Nagy and Naya Nagy (2012) ”Quantum Tic-Tac-Toe: A Genuine Probabilistic
    Approach”. Applied Mathematics (Special Issue – Computing). 3(11A):1779–1786.
  18. Naya Nagy, Marius Nagy and Selim G. Akl. (2010) ”Hypercomputation in a cryptographic
    setting: Solving the identity theft problem using quantum memories”. International
    Journal of Unconventional Computing. 6(5):375–398.
  19. Naya Nagy, Marius Nagy and Selim G. Akl. (2010) ”Quantum security in wireless sensor
    networks”. Natural Computing. 9(4):819–830.
  20. Marius Nagy and Selim G. Akl. (2010) ”Coping with Decoherence: Parallelizing the
    Quantum Fourier Transform”. Parallel Processing Letters. 20(3):213–226.
  21. Marius Nagy and Selim G. Akl. (2010) ”Entanglement Verification with an Application
    to Quantum Key Distribution Protocols”. Parallel Processing Letters. 20(3):227–237.
  22. Naya Nagy, Marius Nagy and Selim G. Akl. (2010) ”Key Distribution versus Key Enhancement
    in Quantum Cryptography”, Parallel Processing Letters. 20(3):239–250.
  23. Marius Nagy, Selim G. Akl and Sean Kershaw. (2009) ”Key distribution based on
    Quantum Fourier Transform”. International Journal of Security and Its Applications.
    3(4):45–67.
  24. Marius Nagy. (2009) “Locating the Median of a Tree in Real Time”. Parallel Processing
    Letters. 19(1):39–55.
  25. Marius Nagy and Selim G. Akl. (2007) “Parallelism in quantum information processing
    defeats the Universal Computer”. Parallel Processing Letters. 17(3):233–262.
  26. Marius Nagy. (2007) “Emergent Computational Paradigms: How Quantum Mechanics
    Shapes the Future of Information Processing”. International Journal of Computer Research.
    14(1/2):1–56. an updated version appeared in: Clara M. De Smet and Julie A.
    Peeters, Eds., “Computer-Aided Design and other Computing Research Developments”,
    pages 427–486, NOVA Publishers, 2009.
  27. Marius Nagy and Selim G. Akl. (2007) “Quantum computing: Beyond the limits of
    conventional computation”. International Journal of Parallel, Emergent and Distributed
    Systems, Special Issue: Emergent Computation. 22(2):123–135.
  28. Marius Nagy and Selim G. Akl. (2006) “Quantum computation and quantum information”.
    International Journal of Parallel, Emergent and Distributed Systems. 21(1):1–59.
  29. Marius Nagy and Selim G. Akl. (2006) “Quantum Measurements and Universal Computation”.
    International Journal of Unconventional Computing. 2:73–88.
  30. Marius Nagy and Selim G. Akl. (2006) “Computing nearest neighbors in real time”.
    Journal of Parallel and Distributed Computing. 66:359–366.
  31. Marius Nagy and Selim G. Akl. (2006) “Real-Time Minimum Vertex Cover for Two-
    Terminal Series-Parallel Graphs”. International Journal of High Performance Computing
    and Networking. 4:347–356.

 

Google Scholar

 

https://scholar.google.com/citations?user=gNuw75cAAAAJ&hl=en

Scopus ID

https://www.scopus.com/authid/detail.uri?authorId=8987669100

ORCID ID

https://orcid.org/0000-0003-2202-1681

Research Gate

 

https://www.researchgate.net/profile/Marius_Nagy

- Prince Mohammad Bin Fahd University, Kingdom of Saudi Arabia (February 2010 - present).
Assistant Professor, College of Computer Engineering and Science.
- Royal Military College of Canada, Math & Computer Science Department, Kingston, Ontario.
sessional instructor (2009).
- Queen’s University, School of Computing, Kingston, Ontario (2002-2008).
post-doc, sessional instructor, teaching and research assistant during Ph.D. program.
- Queen’s University, Dept. of Computing and Inf. Science, Kingston, Ontario, (2000-2001).
teaching and research assistant during M.Sc. program.
- Compania de Informatica si Automatizari, Cluj-Napoca, Romania, (1994-1999).
software developer.
- Tricotaje Somesul, Cluj-Napoca, Romania, (1992-1994).
programmer.
- Technical University of Cluj-Napoca, Faculty of Automation and Computer Science (1993).
teaching assistant.

College of Computer Engineering and Science
Prince Mohammad Bin Fahd University
Kingdom of Saudi Arabia (2010–present)
– GEIT2331 Mathematical Reasoning and Algorithmic Thinking
Mathematical Reasoning and Algorithmic Thinking is concerned with the application
of objects with discrete characteristics to computer science as a discipline such that
commonly used structures may be described, characterized and analyzed. The course
examines the fundamentals of propositional and predicate logic, set operations, functions,
sequences and summations, matrices, design and analysis of algorithms, mathematical
reasoning including proofs and induction, recursion, and program correctness.
– COSC3332 Discrete Structures and Combinatorial Analysis
This course is a continuation of GEIT2331 Mathematical Reasoning and Algorithmic
Thinking and focuses on the study of objects that have discrete as opposed to continuous
values, including counting techniques, relations and combinatorics. Graphs,
including Euler and Hamilton paths and shortest path problems are examined, as are
tree applications.
– COSC3351 Algorithms
This course is concerned with the study of the design and performance analysis of algorithms,
including divide-and-conquer, graph algorithms, dynamic programming, and
greedy algorithms.
– COSC4311 Parallel Computing
The main purpose of this course is to provide a basic, in-depth look at techniques for the
design and analysis of parallel algorithms and for programming them on commercially
available parallel platforms. Principles of parallel algorithm design for various parallel
programming models are discussed.
– COSC4461 Programming Languages
Programming languages is the study of basic concepts and constructs underlying the design
of the modern programming languages. Various programming paradigms, including
object-oriented, functional, logic, and concurrent programming are discussed.
– COEN3323 Digital Systems
This course addresses the understanding and design of digital systems. Topics progress
through Boolean algebra and logic gates; combinational logic; sequential logic and synchronous
sequential logic systems; and design of logic circuits.
– ITAP4371 E-Commerce
The primary objective of this course is to expose students to the advanced use of information
technology in the design and implementation of Web-based business applications to
support e-commerce. The course presents concepts, methodology, and tools for designing,
implementing, and management of e-commerce applications in a business-to-business
paradigm.
– ITAP1312 Web Programming
This course is designed to provide the students with an introduction to World Wide
Web programming. It introduces the student to the techniques used in programming
web pages for interactive content. It specifically addresses the basic elements of AJAX
-Asynchronous JavaScript and XML for enhanced web interaction and applications.
– ITAP/COSC 3411 Systems Programming
Systems programming is the study of the basic programming principles and skills for
building systems software, including the introduction to UNIX, shell programming, C,
and Python programming.
– ITAP3471 Web Server Management
The primary objective of this course is to give students a comprehensive overview of
the tools and techniques needed to successfully administer Web servers. The course is
designed so as to cover topics that are relevant to the role of a Web server administrator.
Topics include installation, configuration, and administration of Web servers on common
hardware/software platforms.
– ITAP2381 Operations Research
This course introduces some of the basic concepts in operations research and quantitative
analysis. Students gain a working knowledge of operations research techniques that are
used extensively in organizations to solve large, structured problems. Coverage includes
the use of optimization (linear, integer, and non-linear programming) models, network
models, simulation and risk analysis in developing optimal solutions to operational and
strategic problems in modern organizations.
– ITAP4311 Database Management
This course focuses on the role of databases in organizations and the role of database
development within the systems development life cycle. Included in the class is the
introduction of a conceptual data modeling technique focusing on the entity relationship
model and the enhanced entity relationship model. Also included in the course is the
knowledge for converting a conceptual data model to the relational data model in the
logical database design phase, and to learn the steps necessary to achieve an efficient
database design in the physical database design phase. Structured Query Language
(SQL) and Query-by-Example software are used to illustrate the classroom concepts
and homework. The course also introduces the concept of Web-database connectivity.
– GEEN2312 Introduction to Computing
The course teaches the fundamentals of C programming to solve complicated mathematical
problems. This includes general problem-solving techniques, designing, coding,
debugging, and documenting programs, and the use of good programming style; especially
as applied to engineering applications.
– GEIT1411 Computer Science I
The course presents primary programming concepts: flow of control, branching statements,
boolean logic, loops, nested loops, functions, pass by value, pass by reference,
arrays, reading from and writing into a file.


ˆMath & Computer Science Department
Royal Military College of Canada (2009)
– CSE 260 Introduction to Computer Concepts
An elective course for students in Arts. This course is part of the core curriculum.
This course gives an introduction to information technology and its applications. Topics
include an overview of computer hardware and system software, algorithm design, programming
in a high level language, use of spreadsheets and data base systems. Computer
networks and the Internet. Security considerations.
– CSE 321 Algorithm Analysis
Analysis of algorithms and computational complexity, complexity measures and standard
complexity classes, use of recurrence relations to analyze recursive algorithms.
Fundamental algorithmic strategies: brute-force, greedy, divide and conquer, recursive
backtracking. Strings and pattern-matching algorithms. Graph and tree traversals, algorithms
for shortest-path, transitive closure, minimum spanning tree. Implementations
of graphs and trees. Introduction to computability, Turing machines, algorithmically
unsolvable problems, halting problem.


ˆSchool of Computing, Queen’s University
Canada (2007–2008)
– CISC 466 Algorithms II
This course is a continuation of CISC-365 (Algorithms I). Examples of topics studied
are: theoretical foundations of dynamic programming and the greedy method, amortized
analysis, sorting networks, matrix operations and approximation algorithms.
– CISC 491/879 Unconventional Computing
This course is an introduction to the two aspects of unconventional computing, namely,
unconventional models of computation and unconventional computational paradigms.
Unconventional models of computation to be studied include parallel computers, quantum
computers, biological computers (in vivo and in vitro), analog neural networks,
accelerating machines, and so on. Unconventional computational paradigms to be studied
include computing in real time with deadlines, computing under the control of the
laws of nature, computing subject to mathematical constraints, computing with time
varying variables, interactive computing, and so on.

Applications of quantum mechanics in computing and information processing, data communication and security, unconventional models of computation, design and analysis of algorithms, parallel models and algorithms.

member of the ACM