College of Sciences staff

Dr Elena Calude staff profile picture

Contact details+64 (09) 414 0800  ext. 43138

Dr Elena Calude Computer Science, Mathematics Education, Mathematics

Senior Lecturer

Institute of Natural and Mathematical Sciences

Calude has a PhD in Computer Science from the University of Auckland. She is an External Researcher of the Centre for Discrete Mathematics and Theoretical Computer Science of the University of Auckland and The Complex Systems and Simulations Group. She has visiting positions with Japan Institute for Advanced Study, Japan and Efate College, Jeddah, Saudi Arabia. Member in the Editorial Boards of the International Journal of Engineering Research and Applications, Journal of Global Research in Computer Science and International Journal of Advanced Research in Computer Science.

Elena Calude is a Senior Lecturer in Computer Science at Massey University, Albany.

More about me...View less...

Professional

Contact details

  • Ph: 43138
    Location: 3.18, IIMS
    Campus: ALBANY

Qualifications

  • PhD - The University of Auckland, New Zealand (1998)
  • Master - Bucharest University, Romania (1977)
  • BSC - Bucharest University, Romania (1974)

Research Expertise

Research Interests

Automat theory,

Complexity theory

 Quantuum computing

Data science

Thematics

21st Century Citizenship, Design – for Commerce, Community and Culture

Area of Expertise

Field of research codes
Mathematical Sciences (010000): Mathematical Sciences not elsewhere classified (019999): Numerical and Computational Mathematics (010300): Numerical and Computational Mathematics not elsewhere classified (010399): Other Mathematical Sciences (019900):
Other Technology (109900): Technology (100000): Technology not elsewhere classified (109999)

Keywords

Discrete Mathematics

Complexity analysis

Programming in C, C++, Java, Haskell, Prolog, Python

 

Research Outputs

Journal

Calude, E., Calude, CS., & Dinneen, M. (2015). Adiabatic quantum computing challenges,. ACM SIGACT News. 46(1), 40-61 Retrieved from http://dl.acm.org/citation.cfm?id=2744459&CFID=507842771&CFTOKEN=78865552
[Journal article]Authored by: Calude, E.
Burgin, M., Calude, CS., & Calude, E. (2013). Inductive complexity measures for mathematical problems. International Journal of Foundations of Computer Science. 24(4), 487-500
[Journal article]Authored by: Calude, E.
Calude, CS., & Calude, E. (2013). Algorithmic complexity of mathematical problems: An overview of results and open problems. International Journal of Unconventional Computing. 9(3-4), 327-343
[Journal article]Authored by: Calude, E.
Calude, CS., Calude, E., & Queen, MS. (2013). Inductive complexity of the P versus NP problem. Parallel Processing Letters. 23(1)
[Journal article]Authored by: Calude, E.
Calude, CS., Calude, E., & Queen, MS. (2012). Inductive complexity of P versus NP problem: Extended abstract. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7445 LNCS, 2-9
[Journal article]Authored by: Calude, E.
Calude, CS., Calude, E., & Queen, MS. (2012). The complexity of Euler's integer partition theorem. Theoretical Computer Science. 454, 72-80
[Journal article]Authored by: Calude, E.
Calude, CS., Calude, E., & Queen, MS. (2012). The complexity of Euler's integer partition theorem. Theoretical Computer Science.
[Journal article]Authored by: Calude, E.
Calude, E. (2012). The complexity of Riemann's Hypothesis. Journal of Multiple-Valued Logic and Soft Computing. 18(3-4), 257-265
[Journal article]Authored by: Calude, E.
Calude, E. (2012). Fermat’s last theorem and chaoticity. Natural Computing. 11(2), 241-245 Retrieved from http://link.springer.com/article/10.1007/s11047-011-9282-9
[Journal article]Authored by: Calude, E.
Calude, CS., Calude, E., & Svozil, K. (2010). The complexity of proving chaoticity and the Church-Turing thesis. Chaos. 20(3)
[Journal article]Authored by: Calude, E.
Calude, CS., & Calude, E. (2010). The complexity of the four colour theorem. LMS JOURNAL OF COMPUTATION AND MATHEMATICS. 13, 414-425
[Journal article]Authored by: Calude, E.
Calude, C., & Calude, E. (2010). Evaluating the complexity of mathematical problems: Part 1. Complex Systems. 18(4), 267-285
[Journal article]Authored by: Calude, E.
Calude, C., & Calude, E. (2010). Evaluating the complexity of mathematical problems: Part 2. Complex Systems. 18(4), 387-401
[Journal article]Authored by: Calude, E.
Calude, CS., Calude, E., & Dinneen, MJ. (2006). A new measure of the difficulty of problems. Journal of Multiple-Valued Logic and Soft Computing. 12(3-4 SPEC. ISS.), 285-307
[Journal article]Authored by: Calude, E.
Calude, CS., Calude, E., & Dinneen, MJ. (2006). A new measure of the difficulty of problems. JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING. 12(3-4), 285-307
[Journal article]Authored by: Calude, E.
Calude, E. (2005). Report on natural processes and models of computation. Bulletin of the European Association for Theorectical Computer Science. 87, 226-227
[Journal article]Authored by: Calude, E.
Calude, CS., Calude, E., & Dinneen, MJ. (2005). What is the value of Taxicab(6)? An update. Multiple Valued Logic and Soft Computing Journal.
[Journal article]Authored by: Calude, E.
Calude, E., Mills, B., & Mills, L. (2004). A uniform approach to test computational complementarity. Acta Cybernetica. 16(3), 367-384
[Journal article]Authored by: Calude, E.
Calude, CS., Calude, E., & Marcus, S. (2004). Passages of proof. Bulletin of the European Association for Theoretical Computer Science. (84), 167-188
[Journal article]Authored by: Calude, E.
Calude, CS., Calude, E., & Dinneen, MJ. (2003). What is the value of Taxicab (6)?. Analele Stiintifice. 11(1), 41-44
[Journal article]Authored by: Calude, E.
Calude, CS., Calude, E., & Dinneen, MJ. (2003). What is the value of taxicab(6)?. Journal of Universal Computer Science. 9(10), 1196-1203
[Journal article]Authored by: Calude, E.
Calude, CS., & Calude, E. (2002). The bridge crossing problem. Bulletin of the European Association for Theorectical Computer Science. 77, 180-190
[Journal article]Authored by: Calude, E.
Calude, C., Calude, E., Chiu, T., Dumitrescu, M., & Nicolescu, R. (2001). Testing computational complementarity for Mermin automata. Journal of Multiple-Valued Logic. 6, 47-65
[Journal article]Authored by: Calude, E.
Calude, E., Kay, P., & Luo, W. (2000). C/C++ Implementation of Functions of the Class LT0. Research Letters in the Information and Mathematical Sciences. 1, 37-64
[Journal article]Authored by: Calude, E., Kay, P.
Calude, CS., Calude, E., & Khoussainov, B. (2000). Finite nondeterministic automata: Simulation and minimality. Theoretical Computer Science. 242(1-2), 219-235
[Journal article]Authored by: Calude, E.
Calude, E., & Lipponen, M. (1997). Minimal Deterministic Incomplete Automata 1. Journal of Universal Computer Science. 3(11), 1180-1193
[Journal article]Authored by: Calude, E.
Calude, C., Calude, E., Svozil, K., & Yu, S. (1997). Physical versus computational complementarity. I. International Journal of Theoretical Physics. 36(7), 1495-1523
[Journal article]Authored by: Calude, E.
Calude, C., Calude, E., & Khoussainov, B. (1997). Deterministic automata simulation, universality and minimality. Annals of Pure and Applied Logic. 90(1-3), 263-276
[Journal article]Authored by: Calude, E.

Book

Calude, E., Calude, C., & Marcus, S. (2007). Passages of proof. In . Solomon Marcus (Ed.) Words and Languages Everywhere. (pp. 69 - 88). Milano, Italy: Polimetrica International Scientific Publisher
[Chapter]Authored by: Calude, E.
Calude, CS., Calude, E., & Marcus, S. (2007). Proving and programming. In Randomness and Complexity: From Leibniz to Chaitin. (pp. 301 - 320).
[Chapter]Authored by: Calude, E.
Calude, CS., Calude, E., & Kay, P. (2001). Liars, demons, and chaos. In M. Ito, G. Paun, & SY. Eds (Eds.) Words, Semigroups, and Transductions. (pp. 33 - 46). Singapore: World Scientific
[Chapter]Authored by: Calude, E., Kay, P.
Calude, CS., Calude, E., & Svozil, K. (2001). Computational complementarity for probabilistic automata. In C. Martin-Vide, & VM. Eds (Eds.) Where Mathematics, Computer Science, Linguistics and Biology Meet. (pp. 99 - 113). Amsterdam, The Netherlands: Kluwer Academic Publishers
[Chapter]Authored by: Calude, E.
Kay, P., & Calude, E. (2001). Liars, Demons and Chaos. In M. Ito, G. Paun, & SY. Eds (Eds.) Words, Semigroups and Transductions. (pp. 33 - 46). Singapore: World Scientific
[Chapter]Authored by: Calude, E., Kay, P.
Calude, CS., Calude, E., & Svozil, K. (2000). Quantum correlations conundrum: An automata-theoretic approach. In C. Martin-Vide, & GP. Eds (Eds.) Recent Topics in Mathematical and Computational Linguistics. (pp. 55 - 67). Bucuresti, Romania: Editura Academiei Romane
[Chapter]Authored by: Calude, E.

Report

Calude CS, Calude E, .(2011). The Complexity of Mathematical Problems: An Overview of Results and Open Problems. (Report No. 410). http://www.cs.auckland.ac.nz/CDMTCS//researchreports/410cris.pdf
[Technical Report]Authored by: Calude, E.
Calude CS, Calude E, Queen MS, .(2011). The Complexity of Euler's Integer Partition Theorem. (Report No. 409). http://www.cs.auckland.ac.nz/CDMTCS//researchreports/409cris.pdf
[Technical Report]Authored by: Calude, E.
Burger M, Calude CS, Calude E, .(2011). Inductive Complexity Measures for Mathematical Problems. (Report No. 416). http://www.cs.auckland.ac.nz/CDMTCS//researchreports/416bcc.pdf
[Technical Report]Authored by: Calude, E.
Calude, E.(2011). Fermat's last theorem and chaoticity.
[Technical Report]Authored by: Calude, E.
Calude, C., & Calude, E.(2010). The complexity of the four colour theorem.
[Technical Report]Authored by: Calude, E.
Calude, C., Calude, E., & Svozil, K.(2010). The complexity of proving chaoticity and the Church-Turing thesis.
[Technical Report]Authored by: Calude, E.
Calude, C., Calude, E., & Svozil, K.(2010). The complexity of proving chaoticity and the Church-Turing thesis.
[Technical Report]Authored by: Calude, E.
Calude, C., & Calude, E.(2009). Evaluating the complexity of mathematical problems. Part 2..
[Technical Report]Authored by: Calude, E.
Calude, E.(2009). The complexity of Goldbach's conjecture and Riemann's hypothesis.
[Technical Report]Authored by: Calude, E.
Calude, C., & Calude, E.(2009). The complexity of Goldbach's conjecture and Riemann's Hypothesis.
[Technical Report]Authored by: Calude, E.
Calude, C., & Calude, E.(2009). The complexity of the four colour theorem.
[Technical Report]Authored by: Calude, E.
Calude, C., & Calude, E.(2009). Evaluating the complexity of mathematical problems. Part 2..
[Technical Report]Authored by: Calude, E.
Calude, C., & Calude, E.(2008). Evaluating the complexity of mathematical problems. Part 1..
[Technical Report]Authored by: Calude, E.
Calude, C., & Calude, E.(2008). Evaluating the complexity of mathematical problems. Part 1..
[Technical Report]Authored by: Calude, E.
Calude, CS., Calude, E., & Dinneen, MJ.(2006). A new measure of the difficulty of problems.
[Technical Report]Authored by: Calude, E.
Calude, CS., Calude, E., & Dinneen, MJ.(2005). What is the value of Taxicab(6)? An Update. Auckland, NZ: University of Auckland
[Technical Report]Authored by: Calude, E.
Calude, E., Mills, BI., & Mills, L.(2003). A uniform method for testing computational complementarity. Auckland University, NZ: Centre for Discrete Mathematics and Theoretical Computer Science
[Technical Report]Authored by: Calude, E.
Calude, CS., Calude, E., & Marcus, S.(2002). Passages of proof. Auckland University, NZ: Centre for Discrete Mathematics and Theoretical Computer Science
[Technical Report]Authored by: Calude, E.
Calude, CS., & Calude, E.(2001). The bridge crossing problem. University of Auckland, NZ: Centre for Discrete Mathematics and Theoretical Computer Science
[Technical Report]Authored by: Calude, E.

Conference

Calude, E. (2010, August). Fermat's last theorem and chaoticity: Preliminary version. Presented at The 3rd International Workshop on Physics and Computation PC2010. Luxor, Egypt.
[Conference Oral Presentation]Authored by: Calude, E.
Calude, E.(2010, August). Fermat's last theorem and chaoticity. Centre for Applied Mathematics and Information Technology.. Pre-Proceedings: 3rd International Workshop. (Physics and Computation 2010)(pp. 146 - 154).
[Conference]Authored by: Calude, E.
Calude, E. (2012). Fermat's last theorem and chaoticity. Natural Computing. Vol. 11 (pp. 241 - 245).
[Conference Paper in Published Proceedings]Authored by: Calude, E.
Calude, CS., Calude, E., & Dinneen, MJ. (Eds.)(2005). . In Lecture Notes in Computer Science: Springer
[Conference Other]Edited by: Calude, E.
Calude, CS., Calude, E., & Dinneen, MJ. (Eds.)(2004). Supplemental papers for DLT'04.
[Conference Other]Edited by: Calude, E.
Calude, CS., & Calude, E. (2002). Automata: From uncertainty to quantum. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2295 LNCS (pp. 1 - 14).
[Conference Paper in Published Proceedings]Authored by: Calude, E.
Calude, CS., Calude, E., & Kay, P. (2000, May). Liars, demons and dragons. Presented at The 5th Anniversary Workshop on Discrete Mathmatics and Theoretical Computer Science. University of Auckland, Auckland, NZ.
[Conference Oral Presentation]Authored by: Calude, E., Kay, P.
Calude, C., & Calude, E. (2000). Bisimulations and behaviour of nondeterministic automata. In G. Rozenberg, & WT. Eds (Eds.) Developments in Language Theory. Foundations, Applications, and Perspectives. (pp. 60 - 70). Singapore
[Conference Paper in Published Proceedings]Authored by: Calude, E.
Calude, E., & Lipponen, M.(1998, January). Deterministic incomplete automats: Simulation, universality and complementarity. UNCONVENTIONAL MODELS OF COMPUTATION. (pp. 131 - 149).
[Conference]Authored by: Calude, E.
Geidmanis, D., Kaņeps, J., Apsītis, K., Taimirņa, D., & Calude, E.Tally languages accepted by alternating multitape finite automata. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). (pp. 422 - 430). 0302-9743.
[Conference]Authored by: Calude, E.

Other

Calude, E. (2010, August). Fermat's last theorem and chaoticity. In Physics and Computation Workshop 2010. Presented at Luxor, Egypt.
[Oral Presentation]Authored by: Calude, E.
Calude, E. (2010). Can we measure the complexity of mathematical statements?. In Computer Science - Information Technology, Massey University, Auckland, NZ.
[Oral Presentation]Authored by: Calude, E.
Calude, E. (2010). Fermat's last theorem and chaoticity. Presented at Massey University, Auckland, New Zealand.
[Oral Presentation]Authored by: Calude, E.
Calude, C., Calude, E., & Dinneen, MJ. (2009). The complexity of the Riemann hypothesis (invited lecture), Riemann Day at the University of Auckland. Presented at The Department of Mathematics, The University of Auckland, Auckland, NZ.
[Oral Presentation]Authored by: Calude, E.
Calude, E.The Complexity of Riemann's Hypothesis. : OLD CITY PUBLISHING INC.
[Oral Presentation]Authored by: Calude, E.
Calude, E. (2005). DLT'04: Short presentation 12-17 December. (pp. 45 - 45). New Zealand Mathematical Society
[Other]Authored by: Calude, E.
Calude E., Burgin M., Calude C.S., .Inductive Complexity Measures for Mathematical Problems. (pp. 1 - 11).
[Other]Authored by: Calude, E.

Consultancy and Languages

Languages

  • English
    Last used: today
    Spoken ability: Excellent
    Written ability: Excellent
  • Romanian
    Last used: today
    Spoken ability: Excellent
    Written ability: Excellent
  • French
    Last used: two month ago
    Spoken ability: Average
    Written ability: Average

Supervision and Teaching

Courses Coordinated

Media and Links

Other Links


Massey Contact CentreMon - Fri 8:30am to 5:00pm0800 MASSEY (+64 6 350 5701)TXT 5222contact@massey.ac.nzWeb chatMyMasseyStaffAlumniNewsMāori @ Massey