| Physical versus computational complementarity. I C Calude, E Calude, K Svozil, S Yu International Journal of Theoretical Physics 36 (7), 1495-1523, 1997 | 51 | 1997 |
| A new measure of the difficulty of problems CS Calude, E Calude, M Dinneen Department of Computer Science, The University of Auckland, New Zealand, 2006 | 45 | 2006 |
| Passages of proof CS Calude, E Calude, S Marcus arXiv preprint math/0305213, 2003 | 38 | 2003 |
| Guest column: Adiabatic quantum computing challenges CS Calude, E Calude, MJ Dinneen ACM SIGACT News 46 (1), 40-61, 2015 | 32 | 2015 |
| Deterministic automata simulation, universality and minimality C Calude, E Calude, B Khoussainov Annals of Pure and Applied Logic 90 (1-3), 263-276, 1997 | 30 | 1997 |
| Finite nondeterministic automata: Simulation and minimality CS Calude, E Calude, B Khoussainov Theoretical Computer Science 242 (1-2), 219-235, 2000 | 29 | 2000 |
| The road to quantum computational supremacy CS Calude, E Calude Jonathan M. Borwein Commemorative Conference, 349-367, 2017 | 23 | 2017 |
| Evaluating the complexity of mathematical problems. Part 2 CS Calude, E Calude Department of Computer Science, The University of Auckland, New Zealand, 2009 | 23 | 2009 |
| Bivariate operators of Schurer-Stancu type D Barbosu An. St. Univ. Ovidius Constanta 11 (1), 1-8, 2003 | 20 | 2003 |
| Deterministic incomplete automata: simulation, universality and complementarity E Calude, M Lipponen Department of Computer Science, The University of Auckland, New Zealand, 1997 | 19 | 1997 |
| The complexity of proving chaoticity and the Church–Turing thesis CS Calude, E Calude, K Svozil Chaos: An Interdisciplinary Journal of Nonlinear Science 20 (3), 037103, 2010 | 16 | 2010 |
| The complexity of the four colour theorem CS Calude, E Calude LMS Journal of Computation and Mathematics 13, 414-425, 2010 | 16 | 2010 |
| Minimal deterministic incomplete automata E Calude, M Lipponen Department of Computer Science, The University of Auckland, New Zealand, 1997 | 16 | 1997 |
| Inductive complexity measures for mathematical problems M Burgin, CS Calude, E Calude International Journal of Foundations of Computer Science 24 (04), 487-500, 2013 | 13 | 2013 |
| The Complexity of Riemann's Hypothesis. E Calude Journal of Multiple-Valued Logic & Soft Computing 18, 2012 | 12 | 2012 |
| Evaluating the complexity of mathematical problems C Calude, E Calude Centre for Discrete Mathematics and Theoretical Computer Science, 2008 | 10 | 2008 |
| The complexity of Euler’s integer partition theorem CS Calude, E Calude, MS Queen Theoretical Computer Science 454, 72-80, 2012 | 9 | 2012 |
| Inductive complexity of P versus NP Problem CS Calude, E Calude, MS Queen International Conference on Unconventional Computing and Natural Computation …, 2012 | 9 | 2012 |
| The complexity of mathematical problems: An overview of results and open problems CS Calude, E Calude Department of Computer Science, The University of Auckland, New Zealand, 2011 | 9 | 2011 |
| What is the Value of Taxicab (6)? CS Calude, E Calude, M Dinneen Department of Computer Science, The University of Auckland, New Zealand, 2003 | 9 | 2003 |
Cristian S. CaludeProfessor of Computer Science, The University of AucklandVerified email at cs.auckland.ac.nz
