ELENA CALUDE

Curriculum Vitæ

Auckland, New Zealand, March 11, 2017

1 Personal Data

Birth Date: January 4, 1953Place of Birth: Constantza, RomaniaNationality: New Zealand, RomanianSex: FemaleFamily Status: Married Cristian S. Calude, Professor, University of Auckland

One child: Andreea-Simona Calude James, Senior Lecturer, Waikato University, NZOffice: Institute of Natural and Mathematical Sciences

Massey University at AlbanyPrivate Bag 102-904, North Shore MSCAuckland, New Zealand+64 (9) 414-0800 ext 43138 (Office)

Fax: +64 (9) 441-8181Email: E.Calude@massey.ac.nz

2 University Education

1995-1997: Graduate studies in Computer ScienceAuckland University, New ZealandDegree: Ph.D. in Computer Science (February 1998)Thesis: Automata-Theoretic Models for Computational Complementarity,Supervisor: Professor Hans Guesgen

1995: Post Graduate studies in EducationAuckland University, New ZealandDegree: Tutor Training Certificate (1995)

1987-1989: Graduate studies in Mathematics and Computer Science EducationBucharest University, RomaniaDegree: Masters of Education (Mathematics and Computer Science) (1989)Thesis: Methods of Multicriteria Decision and Applications

Supervisor: Professor Monica Dumitrescu1971-1975: Undergraduate studies in Mathematics and Computer Science

Bucharest University, RomaniaDegree: B.Sc. in Mathematics (1975)Thesis: Mathematical Analysis of the Drama “Long Days JourneyInto Night” by E. O’NeillSupervisor: Academician Solomon Marcus

3 Positions Held

3.1 Teaching Positions

1. Senior Lecturer, Institute of Information and Mathematical Sciences, Massey Uni-versity at Albany, Auckland, New Zealand, from February 2014 on.

2. Lecturer, Institute of Information and Mathematical Sciences, Massey University atAlbany, Auckland, New Zealand, from February 1999 to February 2014.

3. Tutor, Department of Computer Science, The University of Auckland, Auckland,New Zealand, from February 1994 to January 1999.

4. Instructor, Department of Mathematics and Statistics, The University of Auckland,Auckland, New Zealand, from March 1993 to October 1995.

5. Associate Mathematics Teacher, Princess Elizabeth Public School, London, Canada,from October 1992 to December 1992.

6. Mathematics Teacher Elementary and High School, Bucharest, Romania, fromSeptember 1975 to September 1992.

3.2 Research Positions

1. Visiting Professor, Chuo University, Tokyo, Japan, January 2013.

2. Visiting Associate Professor, Effat Colleage, Jedah, Saudi Arabia, August 2003-January 2004.

3. Visiting Fellow, Japan Institute for Advanced Study, Japan, 1999, November-December, 1999.

4. External Researcher, Centre for Discrete Mathematics and Theoretical ComputerScience, The University of Auckland, Auckland, New Zealand, from January 1999on.

2

5. Computer Scientist, Education Computing Center, Bucharest, Romania, fromSeptember 1986 to September 1992.

6. Associate Researcher, National Institute of Education, Bucharest, Romania, fromSeptember 1979 to September 1985.

4 Areas of Expertise

1. Applied computer science

• Programming: Python, Java, C, C++, Haskell, Prolog, Pascal, Basic, Logo.

• Computer applications: Internet programming, databases, spreadsheets, wordprocessing (Clarisworks Office, Microsoft Office, LATEX).

2. Theoretical computer science

• Automata theory and applications to quantum mechanics and quantum compu-tation.

• Algorithms and data structures.

• Computer-oriented teaching strategies.

• Discrete mathematics.

5 Languages

English, French, Romanian (primary).

6 Teaching

6.1 Courses1

2004–2017:(Massey) 159.339 Internet Programming159.171 Algorithmic Thinking Using Python158.753 Rapid Application Development159.202 Declarative Programming159.201 Algorithms and Data Structures159.234 Object Oriented Programming (using C++ and Java)159.732 Advanced Object Oriented Programming

2003-2004 (Effat): CS121 Introduction to Programming 1CS341 Database Systems

1Courses I have created or re-designed are emphasised.

3

CS351 Software Engineering1999-2002: 159.732 Advanced Object Oriented Programming

159.234 Programming with C++159.302 Artificial Intelligence159.737 Automata Theory

1994-1998: 415.111 Introduction to Computing and Applications415.100 Principles of Computing415.105 Data Structures

1993-1995: Stage I-II Mathematics (tutoring)1976-1992: High School Mathematics

Programming in BasicProgramming in LogoLinear Algebra and GeometryHigh School Physics

6.2 Teaching Training Sessions

1. Workshop “Reviewing the processes and responsibilities of paper coordinators andgrade reviewers”, CADEL, June 2016.

2. Workshop “Extending the Possibilities: Discovering the Opportunities with the Ex-pended Electronic Tool Set”, CADEL, November 2010.

3. Curriculum and Course Design, CADEL, July 2010.

4. Training Forum, Massey University, May 2008.

5. RIMS Workshop, Massey University, June 2008.

6. The Scholarly Internet, Massey University, June 2008.

6.3 Masters Students

1. Karina Donaldson, Pata Mei, A case study of an Object Oriented System for a Maoriorganization, Massy University at Albany, 2003.

2. Terry Chiu. Testing Computational Complementarity For Finite Automata UsingDistributed Object Technology, University of Auckland, New Zealand, 2000. (co-supervised with C.S. Calude and R. Nicolescu)

4

6.4 Project Students

1. Martin Wenzlick, Pilot’s Logbook System, 2016.

2. Michael Coleman, Fern – A Mood Tracking Mobile/iWatch Application, 2015.

3. Thomas Block, Complexity of Mathematical Problems, 2014.

4. Mohamed Abdul, Web Programming for Trademe and Real Estate, 2013.

5. Melissa S. Queen (Dartmouth College, NH USA), The Complexity of MathematicalStatements, 2012.

6. Lei Sun, Increasing Faculty Participation of an Institutional Repository by Interac-tivities, co-supervised with Dr. B. Whiteworth, 2009.

7. Karina Donaldson, A Database Editor for the IIMS Website, 2000.

8. Karina Donaldson, Learning to Program in C On-line, 2001.

9. Jing Hong Huang, Cryptosystems, 2001.

7 Research

7.1 Refereed Journal Papers

1. C. S. Calude, E. Calude, M. J. Dinneen. Adiabatic quantum computing challenges,ACM SIGACT News 46, 1 (2015), 40–61.

2. C. S. Calude, E. Calude. Algorithmic complexity of mathematical problems: anoverview of results and open problems, International Journal of Unconventional Com-puting 9(3-4) (2013), 327-343.

3. M. Burgin, C. S. Calude, E. Calude. Inductive complexity measures for mathematicalproblems, International Journal of Foundations of Computer Science 24, 4 (2013)487–500.

4. C. S. Calude, E. Calude, M. S. Queen. Inductive complexity of the P versus NPproblem, Parallel Processing Letters 23, 1 (2013), 1350007-1–1350007-16.

5. C. S. Calude, E. Calude, M. S. Queen. The complexity of Euler’s integer partitiontheorem Theoretical Computer Science 454 (2012), 72–80.

6. E. Calude. Fermat’s Last Theorem and chaoticity, Natural Computing 11, 2 (2012),241–245.

5

7. E. Calude. The complexity of Riemann’s Hypothesis, Journal for Multiple-ValuedLogic and Soft Computing, 17, 4 (2011) 1–9.

8. C. S. Calude, E. Calude and K. Svozil. The complexity of proving chaoticity and theChurch-Turing Thesis, Chaos 20 037103 (2010), 1–5.

9. C. S. Calude, E. Calude. The complexity of the Four Colour Theorem, LondonMathematical Society Journal of Computation and Mathematics 13 (2010), 414–425.

10. C.S. Calude, E. Calude. Evaluating the complexity of mathematical problems. Part2, Complex Systems 18 (2010), 387–401.

11. C. S. Calude, E. Calude. Evaluating the complexity of mathematical problems. Part1, Complex Systems 18(2009), 267–285.

12. C.S. Calude, E. Calude and M.J. Dinneen, A new measure of the difficulty of prob-lems, Journal of Multiple-Valued Logic and Soft Computing 12 (2006) (3-4), 285-307.

13. C. S. Calude, E. Calude, S. Marcus. Passages of proof, Bull. Eur. Assoc. Theor.Comput. Sci. 84 (2004), 167–188. Reprinted in S. Marcus. Words and LanguagesEverywhere, Polimetrica, Milano, 2007, 89–102.

14. C. S. Calude, E. Calude, M. J. Dinneen. What is the value of Taxicab(6)?, J. UCS9, 10 (2003), 1196–1203.

15. C. S. Calude, Elena Calude. The bridge crossing problem, EATCS Bull. 77 (2002),180–190.

16. C. S. Calude, E. Calude, T. Chiu, M. Dumitrescu, R. Nicolescu. Testing com-putational complementarity for Mermin automata, J. Multi Valued Logic, 6 (2001),47-65.

17. C. S. Calude, E. Calude, B. Khoussainov. Finite nondeterministic automata: simu-lation and minimality, Theoret. Comput. Sci. 242 (2000), 219-235.

18. C. S. Calude, E. Calude, C. Stefanescu. Computational complementarity for Mealyautomata, EATCS Bull. 66 (1998), 139-149; extended abstract, An. Univ. Bu-curesti, Mat.-Inf., 47 (1998), 35-39.

19. E. Calude, M. Lipponen. Minimal deterministic incomplete automata, J.UCS 11(1997), 1180-1193.

20. C. Calude, E. Calude, B. Khoussainov. Deterministic automata: simulation, univer-sality and minimality, Annals of Applied and Pure Logic 90 (1997), 263-276.

6

21. C. Calude, E. Calude, K. Svozil, S. Yu. Physical versus computational complemen-tarity I, International Journal of Theoretical Physics 36 (1997), 1495-1523.

22. Elena Calude. A problem solved in BASIC, Gazeta de Informatica 2 (1991), 22-23.(in Romanian)

23. C. Calude, Elena Calude. Traps of the infinity in elementary mathematics, GazetaMatematica 2 (1988), 63-64. (in Romanian)

24. C. Calude, Elena Calude. On some discrete metrics, Bull. Math. Soc. Sci. Math.R.S. Roumanie (N. S.) 27(75) (1983), 21-24.

25. C. Calude, Elena Calude. A metrical method for multicriteria decision making, St.Cerc. Mat. 34 (1982), 223-234. (in Romanian)

26. C. Calude, Elena Calude. On the “rationality” of Onicescu’s method for multicriteriamaking, Rev. de Statistica 30 (1981), 58-60. (in Romanian)

27. Elena Calude, Gh. Popa. The mathematical club-an interdisciplinary view, Revistade Pedagogie 4 (1984), 10. (in Romanian)

7.2 Book

1. Elena Calude. 07.100 Principles of Computing—Past Assignments and Exams, De-partment of Computer Science, The University of Auckland, Auckland, 1995, viii +154 pp.

7.3 Chapters in Books

1. C.S. Calude, E. Calude, S. Marcus Proving and programming, in C.S. Calude(eds.)Randomness and Complexity: From Leibniz to Chaitin Singapore: World Sci-entific Publishing, 2007, 301–321.

2. A. S. Calude, C. S. Calude, E. Calude. Professor Solomon Marcus and Calude’sfamily, in L. Spandonide, G. Paun (eds.). Meetings with Solomon Marcus, Ed. Span-dugino, Bucharest, 2010, 384–390.

3. C.S. Calude, E. Calude, S. Marcus Passages of Proofs, in S. Marcus (eds.)Words andLanguages Everywhere Polimetrica, Italy, 2007, 167-188. Reprinted in S. Marcus.Words and Languages Everywhere, Polimetrica, Milano, 2007, 89–102.

4. C.S. Calude, E. Calude. Automata: from uncertainty to quantum, in W. Kuich, G.Rozenberg, A. Salomaa (eds.) Developments in Language Theory (DLT’01), LecturesNotes in Comput. Sci. 2295, Springer Verlag, Berlin, 2002, 1–14. Preproceedings

7

published by the Institute fur Algebra un Computermathematik, Technische Uni-verstat Wien, Austria, 2001, 1–16.

5. C.S. Calude, E. Calude, P. Kay. Liars, demons and chaos, in M. Ito, G. Paun, S.Yu (eds.). Words, Semigroups, and Transductions, World Scientific, Singapore, 2001,33-46.

6. C.S. Calude, E. Calude, K. Svozil. Computational complementarity for probabilisticautomata, in C. Martin-Vide, V. Mitrana (eds.). Where Mathematics, ComputerScience, Linguistics and Biology Meet, Kluwer, Amsterdam 2001, 99-113.

7. C.S. Calude, E. Calude, K. Svozil. Quantum correlations conundrum: An automaton-theoretic approach, in G. Paun (ed.) Recent Topics in Mathematical and Computa-tional Linguistics, Romanian Academy Publishing Company, Bucharest, 2000, 55–67.Prepublication in O. Boldt, H. Jurgensen, L. Robbins (eds.) Workshop on Imple-menting Automata’99 (WIA’99), Preproc., 17-19 July, 1999, Potsdam, UniverstitatPotsdam, Institut fur Informatik, Germany, VII-1–12.

7.4 Refereed Conference Papers

1. C. S. Calude, E. Calude, M. S. Queen. Inductive complexity of P versus NP problem.Extended abstract, in J. Durand-Lose, N. Jonoska (eds.). Proceedings UCNC 2012,LNCS 7445, Springer, 2012, 2–9.

2. E. Calude. Fermat’s Last Theorem and chaoticity, in H. Guerra (ed.). Physics andComputation 2010, Pre-Proceedings, CAMIT, University of Azores, 2010, 146–154.

3. C.S. Calude, Elena Calude. Automata: From uncertainty to quantum, in W. Kuich,G. Rozenberg, A. Salomaa (eds.) Developments in Language Theory (DLT’01), Lec-tures Notes in Computer Science 2295, Springer-Verlag, Berlin, 2002, 1-14. Prepro-ceedings published by the Institute fur Algebra un Computermathematik, TechnischeUniverstat Wien, Austria, 2001, 1-16. (invited)

4. C.S. Calude and Elena Calude. Bisimulations and behaviour of nondeterministicautomata, in G. Rozenberg, W. Thomas (eds.) Developments in Language Theory.Foundations, Applications, and Perspectives, World Scientific, Singapore, 2000, 60-70. Prepublication in W. Thomas (ed.) DLT’99, Developments in Language Theory,Fourth International Conference, Preproc., 6-9 July, 1999 Aachen, Germany, Aach-ener Informatik-Berichte 99-5, 129–139.

5. E. Calude, M. Lipponen. Deterministic incomplete automata: simulation, universal-ity and complementarity, in C. S. Calude, J. Casti, M. Dinnen (eds.). Proceedingsof the First International Conference on “Unconventional Models of Computation”,Springer Verlag, Singapore, 1998, 131-149.

8

6. C. Calude, Elena Calude, B. Khoussainov, M. Lipponen. From complete to incom-plete automata: Simulation, universality and minimality, Philfest’97, AustralasianAssociation for Logic 1997 Annual Conference, Auckland, July 1997, Bull. SymbolicLogic, 4, 4 (1998), 460.

7. C. Calude, E. Calude, B. Khoussainov. Deterministic automata: simulation, univer-sality and minimality, S. Bozapalidis (ed.). Proceedings of the 3rd International Con-ference “Developments in Language Theory”, Aristotle University of Thessaloniki,Greece, 1997, 519-520.

7.5 Research Reports

1. C.S. Calude, E. Calude, M.S. Queen. Inductive Complexity of the P Versus NPProblem, CDMTCS Research Report 429, 2012, 27 pp.

2. M. Burgin, C.S. Calude and E. Calude. Inductive Complexity Measures for Mathe-matical Problems, CDMTCS Research Report 416, 2011, 11 pp.

3. C. S. Calude, E. Calude. The Complexity of Mathematical Problems: An Overviewof Results and Open Problems, CDMTCS Research Report, 410, 2011, 12 pp.

4. C. S. Calude, E. Calude, M. S. Queen. The Complexity of Euler’s Integer PartitionTheorem, CDMTCS Research Report, 409, 2011, 11 pp.

5. C. S. Calude, E. Calude and K. Svozil. The Complexity of Proving Chaoticity andthe Church-Turing Thesis, CDMTCS Research Report 384, 2010, 18 pp.

6. E. Calude, Fermat’s Last Theorem and Chaoticity, CDMTCS Research Report 383,2010, 14 pp.

7. E. Calude, The Complexity of Goldbach’s Conjecture and Riemann’s Hypothesis,CDMTCS Research Report 370, 2009, 13 pp.

8. C. S. Calude, E. Calude, Evaluating the Complexity of Mathematical Problems. Part2, CDMTCS Research Report 369, 2009, 13 pp.

9. C. S. Calude, E. Calude, The Complexity of the Four Colour Theorem, CDMTCSResearch Report 368, 2009, 13 pp.

10. C. S. Calude, E. Calude, Evaluating the Complexity of Mathematical Problems. Part1, CDMTCS Research Report 343, 2008, 18 pp.

11. C. S. Calude, E. Calude, Evaluating the Complexity of Mathematical Problems. Part1, CDMTCS Research Report 343, 2008, 12 pp.

9

12. C. S. Calude, E. Calude, S. Marcus. Proving and Programming, CDMTCS ResearchReport 309, 2007, 21 pp.

13. C. S. Calude, E. Calude, S. Marcus. Passages of Proof, CDMTCS Research Report180, 2002, 13 pp.

14. C. S. Calude, Elena Calude. The Bridge Crossing Problem. Draft Form, CDMTCSResearch Report 161, 2001, 10 pp.

15. C. S. Calude, Elena Calude, Terry Chiu, Monica Dumitrescu, R. Nicolescu. TestingComputational Complementarity for Mermin Automata, CDMTCS Research Report109, 1999, 13 pp.

16. C.S. Calude, Elena Calude, K. Svozil. Quantum Correlations Conundrum: AnAutomaton-Theoretic Approach, CDMTCS Research Report 106, 1999, 11 pp.

17. C.S. Calude and E. Calude. Bisimulations and Behaviour of Nondeterministic Au-tomata, CDMTCS Research Report 092, 1999, 9 pp.

18. C.S. Calude, E. Calude, C. Stefanescu. Computational complementarity for Mealyautomata, CDMTCS Research Report 083, 1998, 8 pp.

19. C.S. Calude, E. Calude, B. Khoussainov. Finite Nondeterministic Automata: Simu-lation and Minimality, CDMTCS Research Report 054, 1997, 18 pp.

20. E. Calude, M. Lipponen. Deterministic Incomplete Automata: Simulation, Univer-sality and Complementarity, CDMTCS Research Report 040, 1997, 16 pp.

21. C. Calude, E. Calude, B. Khoussainov. Deterministic Automata: Simulation, Uni-versality and Minimality, CDMTCS Research Report 025, 1996, 8 pp.

22. C. Calude, E. Calude, K. Svozil, S. Yu. Physical versus Computational Complemen-tarity I, CDMTCS Research Report 015, 1996, 24 pp.

7.6 Research Grants

1. Massey University Cross-College Research Fund, 2001, for the project TailoringCrypto-Algorithms to Business Applications. (participating staff)

2. University Auckland Research Grant A18/XXXXX/62090/F3414070 1997, for theproject Theoretical Aspects of Artificial Intelligence: Automata-Theoretical Modelsof Complementarity.

10

7.7 Lectures at Conferences or Universities

1. Quantum Computing: Agony or Ecstasy? Massey University INMS Seminar Series,2014.

2. The Complexity of the P vs NP Problem, Massey University INMS Seminar Series,2013.

3. The Complexity of Mathematical Problems, Chuo University, Tokyo, January 2013.

4. C. S. Calude, E. Calude, M. S. Queen. Inductive complexity of P versus NP problem,Proceedings UCNC 2012, Orleans, France, 2012 (invited).

5. Passages of Proof, Workshop on Truths and Proofs, Auckland University, December2001. (invited)

6. Automata, from Uncertainty to Quantum, Developments in Language Theory,DLT’01, Vienna, Austria, July 2001. (invited lecture)

7. QED vs QD, Third International Conference Discrete Mathematics and TheoreticalComputer Science (DMTCS’01), Constanta, Romania, July 2001.

8. Bisimulations and Nondeterministic Automata, Japan Institute for Advanced Study,Japan, 1999. (invited)

9. Teaching Java: Agony or Ecstasy, Massey University at Albany, New Zealand, 1998.

10. Deterministic Incomplete Automata: Simulation, Universality and Complementarity,First International Conference on “Unconventional Models of Computation”, Univer-sity of Auckland, New Zealand, 1998.

11. Deterministic Minimal Automata, First Japan–New Zealand Workshop on “Logic inComputer Science”, University of Auckland, 1997.

12. Some Applications of Automata to Physics, Workshop on “Computability and Re-lated Matters in Mathematics and Physics”, Waikato University, Hamilton, NewZealand, 1997.

13. Some Applications of Automata to Physics, Institute for Theoretical Physics, Tech-nical University of Vienna, Austria, 1997.

14. Romanian Education System-An Overview, A. B. Lucas Secondary School, London,Canada, 1992.

15. A Metric Method for Multicriteria Decision Making. Applications in Education, Sym-posium on Mathematics Education, Bucharest University and Board of Education,Bucharest, Romania, 1989.

11

16. New Information Technologies for Elementary School, Workshop on New Methods inEducation, Board of Education, 50 Elementary School, Bucharest, Romania, 1986.

17. Computers in Elementary Mathematics Teaching, Board of Education, Bucharest,Romania, 1984.

18. Mathematical Methods in the Study of Drama, Symposium on Mathematical Linguis-tics, Bucharest University, 1975.

7.8 Journal Editor

1. International Journal of Engineering Research and Applications, http://www.

ijera.com, 2011 on.

2. Journal of Global Research in Computer Science, www.jgrcs.info, 2010 on.

3. International Journal of Advanced Research in Computer Science, www.ijarcs.info,2010 on.

4. Research Letters in the Information and Mathematical Sciences, Massey University,2000–2008.

7.9 Programme Committee Member

1. Member of the Program Committee for the peer-reviewed international conferenceIADIS WWW/Internet, http://www.internet-conf.org, 2007–2015.

2. Member of the Program Committee for the peer-reviewed international conferenceWEBIST, http://www.webist.org, 2007–2015.

7.10 Member of the Conference Organising Committee

1. Unconventional Computation & Natural Computation, Auckland, 2015, http://

ucnc15.wordpress.fos.auckland.ac.nz/ucnc-2015-call-for-papers/.

2. Eighth International Conference on Developments in Language Theory, MasseyAlbany, 2004 (chair), https://www.cs.auckland.ac.nz/research/conferences/

dlt04/.

7.11 Referee

1. Workshop on Descriptional Complexity of Automata, Grammars and Related Struc-tures, Vienna, Austria, 2001).

2. DMTCS’01, Constanta, Romania, 2001.

12

3. FCT’2001, Riga, Latvia, August 2001.

4. UMC’2K, Brussels, Belgium, 2000.

5. DMTCS’99-CATS’99, Auckland, New Zealand, 1999.

6. UMC’98, Auckland, New Zealand, 1998.

7.12 Citations

7.12.1 Overviews

1. More than 414 citations (150 since 2012) in Google Scholar, accessed on 11 March2017; h-index = 12, i10-index = 14.

2. Scopus citations Citations: 89, h-index = 5.

Figure 1: E. Calude, Scopus profile.

7.12.2 Selected Citations

1. A. Yedidia, S. Aaronson. A relatively small Turing machine whose behavior is inde-pendent of set theory, https://arxiv.org/abs/1605.04343, 2016.

2. R. V. Yampolskiy. Verifier Theory from Axioms to Unverifiability of MathematicalProofs, Software and AI,

13

3. R. V. Yampolskiy. Verifier theory and unverifiability, https://arxiv.org/abs/

1609.00331, 2016.

4. M.Burgin. Inductively computable hierarchies and inductive algorithmic complex-ity, Global Journal of Computer Science and Technology 6,1 (2016), http://www.

computerresearch.org/index.php/computer/article/view/1357/1344.

5. Y. Liu, Y. Li, Y. Wang, Y. Zhang and J. Yuan. On the resource trade-off of flowupdate in software-defined networks, IEEE Communications Magazine, vol. 54, no.6, pp. 88-93, June 2016.

6. R. Dridi, H. Alghassi. Prime factorization using quantum annealing and computa-tional algebraic geometry R Dridi, H Alghassi, arXivpreprintarXiv:1604.05796,2016.

7. Ru-Chao TanTong LeiQing-Min ZhaoLi-Hua Gong. Quantum color image encryp-tion algorithm based on a hyper-chaotic system and quantum fourier transform, In-ternational Journal of Theoretical Physics December 2016, Volume 55, Issue 12, pp.5368–5384.

8. R. Dridi, H. Alghassi. Homology computation of large point clouds using quantumannealing, arXiv:1512.09328, 2015.

9. L. Bienvenu, A. Romashchenko, A. Shen, A. Taveneaux, S. Vermeeren. The axiomaticpower of Kolmogorov complexity, Annals of Pure and Applied Logic, Volume 165,Issue 9, September 2014, 1380–1402.

10. M.-M. Deza, Elena Deza. Dictionary of Distances, Elsevier, Amsterdam, 2006.

11. Z. Zhou. H. Zhigang. Task scheduling algorithm based on greedy strategy in cloudcomputing, The Open Cybernetics & Systemics Journal 2014, 8, 111–114.

12. M.-M. Deza, Elena Deza. Dictionary of Distances, Springer, Berlin, 2009; secondedition 2012; third edition 2014.

13. A. Leitsch, G. Schachner and K. Svozil. How to acknowledge hypercomputation?,Complex Systems 18(1) (2008), 131–143.

14. K. Svozil. Contexts in quantum, classical and partition logic, in K. Engesser, D.M. Gabbay and D. Lehmann (eds.). Handbook of Quantum Logic and QuantumStructures, Elsevier, Amsterdam, 2008, pp. 551–586.

15. K. Svozil. Quantum scholasticism: On quantum contexts, counterfactuals, and theabsurdities of quantum omniscience, Information Sciences 179(5) (2009), 535–541.

14

16. P. H. Potgieter, E. Rosinger. Output concepts for accelerated Turing machines,Natural Computing 10 (2011), to appear.

17. G. Chaitin. How much information can there be in a real number? InternationalJournal of Bifurcation and Chaos, 17, 6 (2007), 1933–1935.

18. Bibliography for the course “Sequential Machines”, Faculty of Mathematics andInformatics, University of Bucharest, 2010–2011, http://docs.google.com/

viewer?a=v&q=cache:wADqCGnDAg8J:fmi.unibuc.ro/ro/pdf/2010/secretariat/

optionale/CURSURI%2520OPTIONALE%2520INFORMATICA-2010-2011.doc+

Masini+secventiale,+Informatica-Matematica&hl=en&gl=nz&pid=

bl&srcid=ADGEESgF-NbB976nNIKg0hk3XEuuePaD5iFOVmnUvNgLGPT3c3_

ONEJJLCWBBWXnPzb9ZBDwMbaHIN8K8l5NSlm6Gz99V3Qht-sTGTC4FfnrVhV3Fwq_

vdzgKDXA36mfH8-_HIHrDYoU&sig=AHIEtbRaioTkVy1FK5Ft9Q4pLD4PVx6OCw

19. Cited regarding the sequence A011541, in N. Sloane’s “On-Line Encyclopedia of Inte-ger Sequences“ at http://www.research.att.com/cgi-bin/access.cgi/as/njas/sequences/eisA.cgi?Anum=A011541.

20. Adriana Popovici, n-Dimensional Cellular Automata: Applications and Generaliza-tions, Ph.D. Thesis, University of Timisoara, Romania, 2003.

21. K. Svozil. Computational universes, Chaos, Solitons & Fractals, to appear.

22. K. Svozil. n-ary Quantum Information Defined by State Partitions, CDMTCS Re-search Report 184, 2002, 10 pp.

23. K. Svozil. Logical Equivalence Between Generalized Urn Models and Finite Atuo-mata, CDMTCS Research Report 179, 2002, 10 pp.

24. Tree in Computer Science, http://hpsearch.uni-trier.de/hp/a-tree/100.html.

25. K. Svozil. n-ary Quantum Information Defined by State Partitions, CDMTCS Re-search Report 179, 2002, 10 pp.

26. B. Khoussainov, A. Nerode. Automata Theory and Its Applications, Birkhauser,Bosoton, 2001.

27. M. Lipponen. Computational complementarity and shift spaces, J. UCS 6, 1 (2000),169-177.

28. K. Svozil. Quantum information: the new frontier, CDMTCS Research Report 145,2000, 30 pp.

15

29. C. S. Calude, M. Lipponen. Computational complementarity and sofic shifts, inX. Lin (ed.). Theory of Computing 98, Proceedings of the 4th Australasian TheorySymposium, CATS’98, Springer-Verlag, Singapore, 1998, 277–290.

30. E. Jurvanen, M. Lipponen. Distinguishability, simulation and universality of Mooretree automata, Fundamenta Informaticae 34 (1999), 1-13.

31. K. Svozil. Quantum Logic, Springer–Verlag, Singapore, 1998.

32. K. Svozil. First International Conference on “Unconventional Models of ComputationUMC’98” An Unconventional Review, EATCS Bull. 64 (1998).

8 Service

8.1 IIMS

1. Organised the research visit of Dr. R. Mugridge, Rimu Research Ltd, 2007.

2. Organised the research visit and the IET NZ Prestige Lecture “The Internet: Wheredid it come from?” of Prof. B. Carpenter, 2008.

3. Organised the research visit and the lecture “Open Source Software” of R. Stallman,2009, http://nzoss.org.nz/news/2008/richard-stallmans-tour-new-zealand.

4. Open Day organiser for computer science, 2006–2011.

5. IIMS publicity coordinator, 2006–2011.

6. Member, “Learning and Teaching” Committee, IIMS, 2011.

7. HoI nominee for John Xie PhD confirmation, IIMS, 2008.

8.2 Conference/Workshop Organization

1. Unconventional Computing and Natural Computing 2015, Auckland, New Zealand,August-September 2015.

2. Third International Conference Discrete Mathematics and Theoretical Computer Sci-ence (DMTCS’01), Constanta, Romania, July 2001.

3. Australian Computer Science Week, ACSW’99, University of Auckland, Auckland,New Zealand, January, 1999.

4. The First International Conference UMC’98, Unconventional Models of Computation,University of Auckland, Auckland, New Zealand, January, 1998.

16

5. First Japan–New Zealand Workshop on Logic in Computer Science, University ofAuckland, 1997.

6. Workshop on New Methods in Education, Board of Education, 50 Elementary School,Bucharest, Romania, 1986.

8.3 External Reviewer

1. External reviewer for the peer-reviewed international conference FoiKS, http://

2008.foiks.org, 2008.

2. External reviewer for the peer-reviewed International Journal of Principles and Ap-plications in Information Science, 2007.

8.4 Examiner

1. External examiner for the MSc thesis “Adiabatic Quantum Computing with QUBOFormulations” by Rong Wang, University of Auckland, September 2016.

2. External examiner for the PhD thesis “Methodologies for the Development of Qual-itative Spatial and Temporal Reasoning” by Carl Schultz, University of Auckland,May 2010.

3. External examiner for the research project “Tree Automata” by Philip Stevens, Uni-versity of Auckland, January 2010.

4. External examiner for Master Thesis “State Complexity of Finite State Automata”by Ke Nan, University of Auckland, January 2011.

5. External examiner for the PhD Thesis “Games and Automata Theory” by ImranKhaliq, University of Auckland, May 2011.

8.5 Professional Organisations

1. Member of the Auckland CS Theory Colloquium, Auckland University of Technology,2011.

2. Member of NZMS and ANZIAM, 2010.

3. Member of Complex Systems and Simulations Group, Massey University, http://

tur-www1.massey.ac.nz/~kahawick/cssg, 2010.

4. External researcher of the Centre for Discrete Mathematics and Theoretical ComputerScience, University of Auckland, www.cs.auckland.ac.nz/CDMTCS, 1999–2011.

17

8.6 Other

1. Session chair, 7th International Conference on Applications and Principles of Infor-mation Science, Auckland, 2008.

2. Invited reviewer for “QS World University Rankings”, 2010–2014.

9 Honours

1. Nominated for Lecturer of the Year, Massey University at Albany, 2016.

2. Nominated for Lecturer of the Year, Massey University at Albany, 2012.

3. The article “The complexity of proving chaoticity and the Church-Turing thesis” wasone of Chaos monthly top 20 most-downloaded articles in 2010.

4. The paper Computational Complementarity for Mealy Automata was included inWolfram Research Library at http://library.wolfram.com/database/Articles/

2963/, 2008.

5. Awarded Kenon Circle Grant “Artistic Forms and Complexity” for the project Eval-uating the Complexity of Mathematical problems, Keno Circle, Vienna, Austria, 2008.

18