Elena Calude

According to our database1, Elena Calude authored at least 27 papers between 1997 and 2015.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Guest Column: Adiabatic Quantum Computing Challenges.
SIGACT News, 2015

2013
Inductive Complexity of the P versus NP Problem.
Parallel Process. Lett., 2013

Algorithmic Complexity of Mathematical Problems: An Overview of Results and Open Problems.
Int. J. Unconv. Comput., 2013

Inductive Complexity Measures for Mathematical Problems.
Int. J. Found. Comput. Sci., 2013

2012
The complexity of Euler's integer partition theorem.
Theor. Comput. Sci., 2012

Fermat's last theorem and chaoticity.
Nat. Comput., 2012

The Complexity of Riemann's Hypothesis.
J. Multiple Valued Log. Soft Comput., 2012

Inductive Complexity of P versus NP Problem - Extended Abstract.
Proceedings of the Unconventional Computation and Natural Computation, 2012

2010
Pi_1-Statements, Chaotic Systems and the Church-Turing Thesis
CoRR, 2010

Evaluating the Complexity of Mathematical Problems: Part 2.
Complex Syst., 2010

2009
Evaluating the Complexity of Mathematical Problems: Part 1.
Complex Syst., 2009

2006
A New Measure of the Difficulty of Problems.
J. Multiple Valued Log. Soft Comput., 2006

2004
Passages of Proof.
Bull. EATCS, 2004

A Uniform Approach to Test Computational Complementarity.
Acta Cybern., 2004

2003
What is the Value of Taxicab(6)?
J. Univers. Comput. Sci., 2003

2002
The Bridge Crossing Problem.
Bull. EATCS, 2002

2001
Automata: From Uncertainty to Quantum.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

Computational complementarity for probabilistic automata.
Proceedings of the Where Mathematics, 2001

Liars, Demons, and Chaos.
Proceedings of the Words, Semigroups, and Transductions, 2001

2000
Finite nondeterministic automata: Simulation and minimality.
Theor. Comput. Sci., 2000

Quantum Correlations Conundrum: An Automata-Theoretic Approach.
Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

1999
Bisimulations and behaviour of nondeterministic automata.
Proceedings of the Developments in Language Theory, 1999

1998
Computational Complementarity for Mealy Automata.
Bull. EATCS, 1998

1997
Minimal Deterministic Incomplete Automata.
J. Univers. Comput. Sci., 1997

Deterministic Automata: Simulation, Universality and Minimality.
Ann. Pure Appl. Log., 1997

Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Tally Languages Accepted by Alternating Multitape Finite Automata.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997


  Loading...