default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElena Calude
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j19]Cristian S. Calude, Elena Calude, Michael J. Dinneen:
Guest Column: Adiabatic Quantum Computing Challenges. SIGACT News 46(1): 40-61 (2015)- 2013
- [j18]Mark Burgin, Cristian S. Calude
, Elena Calude:
Inductive Complexity Measures for Mathematical Problems. Int. J. Found. Comput. Sci. 24(4): 487-500 (2013) - [j17]Cristian S. Calude, Elena Calude:
Algorithmic Complexity of Mathematical Problems: An Overview of Results and Open Problems. Int. J. Unconv. Comput. 9(3-4): 327-343 (2013) - [j16]Cristian S. Calude, Elena Calude, Melissa S. Queen:
Inductive Complexity of the P versus NP Problem. Parallel Process. Lett. 23(1) (2013) - 2012
- [j15]Elena Calude:
The Complexity of Riemann's Hypothesis. J. Multiple Valued Log. Soft Comput. 18(3-4): 257-265 (2012) - [j14]Elena Calude:
Fermat's last theorem and chaoticity. Nat. Comput. 11(2): 241-245 (2012) - [j13]Cristian S. Calude, Elena Calude, Melissa S. Queen:
The complexity of Euler's integer partition theorem. Theor. Comput. Sci. 454: 72-80 (2012) - [c8]Cristian S. Calude, Elena Calude, Melissa S. Queen:
Inductive Complexity of P versus NP Problem - Extended Abstract. UCNC 2012: 2-9 - 2010
- [j12]Cristian S. Calude, Elena Calude:
Evaluating the Complexity of Mathematical Problems: Part 2. Complex Syst. 18(4) (2010) - [j11]Cristian S. Calude, Elena Calude:
The complexity of the four colour theorem. LMS J. Comput. Math. 13: 414-425 (2010) - [i1]Cristian S. Calude, Elena Calude, Karl Svozil:
Pi_1-Statements, Chaotic Systems and the Church-Turing Thesis. CoRR abs/1006.2951 (2010)
2000 – 2009
- 2009
- [j10]Cristian S. Calude, Elena Calude:
Evaluating the Complexity of Mathematical Problems: Part 1. Complex Syst. 18(3) (2009) - 2006
- [j9]Cristian S. Calude, Elena Calude, Michael J. Dinneen:
A New Measure of the Difficulty of Problems. J. Multiple Valued Log. Soft Comput. 12(3-4): 285-307 (2006) - 2004
- [j8]Elena Calude, Bruce Mills, Lan Mills:
A Uniform Approach to Test Computational Complementarity. Acta Cybern. 16(3): 367-384 (2004) - [j7]Cristian Calude, Elena Calude, Solomon Marcus:
Passages of Proof. Bull. EATCS 84: 167-188 (2004) - [e1]Cristian Calude, Elena Calude, Michael J. Dinneen:
Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, Proceedings. Lecture Notes in Computer Science 3340, Springer 2004, ISBN 3-540-24014-4 [contents] - 2003
- [j6]Cristian Calude, Elena Calude, Michael J. Dinneen:
What is the Value of Taxicab(6)? J. Univers. Comput. Sci. 9(10): 1196-1203 (2003) - 2002
- [j5]Cristian Calude, Elena Calude:
The Bridge Crossing Problem. Bull. EATCS 77: 180-190 (2002) - 2001
- [c7]Cristian S. Calude, Elena Calude, Peter Kay:
Liars, Demons, and Chaos. Words, Semigroups, and Transductions 2001: 33-46 - [c6]Cristian S. Calude, Elena Calude, Karl Svozil:
Computational complementarity for probabilistic automata. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 99-113 - [c5]Cristian Calude, Elena Calude:
Automata: From Uncertainty to Quantum. Developments in Language Theory 2001: 1-14 - 2000
- [j4]Cristian Calude, Elena Calude, Bakhadyr Khoussainov:
Finite nondeterministic automata: Simulation and minimality. Theor. Comput. Sci. 242(1-2): 219-235 (2000) - [c4]Cristian S. Calude, Elena Calude, Karl Svozil:
Quantum Correlations Conundrum: An Automata-Theoretic Approach. Recent Topics in Mathematical and Computational Linguistics 2000: 55-67
1990 – 1999
- 1999
- [c3]Cristian Calude, Elena Calude:
Bisimulations and behaviour of nondeterministic automata. Developments in Language Theory 1999: 60-70 - 1998
- [j3]Cristian Calude, Elena Calude, Catalina Stefanescu:
Computational Complementarity for Mealy Automata. Bull. EATCS 66: 139-149 (1998) - 1997
- [j2]Cristian Calude, Elena Calude, Bakhadyr Khoussainov:
Deterministic Automata: Simulation, Universality and Minimality. Ann. Pure Appl. Log. 90(1-3): 263-276 (1997) - [j1]Elena Calude, Marjo Lipponen:
Minimal Deterministic Incomplete Automata. J. Univers. Comput. Sci. 3(11): 1180-1193 (1997) - [c2]Dainis Geidmanis, Janis Kaneps, Kalvis Apsitis, Daina Taimina, Elena Calude:
Tally Languages Accepted by Alternating Multitape Finite Automata. COCOON 1997: 422-430 - [c1]Cristian S. Calude, Elena Calude, Bakhadyr Khoussainov:
Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract. Developments in Language Theory 1997: 519-537
Coauthor Index
aka: Cristian Calude
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
