default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAida Gainutdinova
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j3]Masaki Nakanishi, Abuzer Yakaryilmaz, Aida Gainutdinova:
New results on classical and quantum counter automata. Discret. Math. Theor. Comput. Sci. 21(4) (2019)- 2018
- [j2]Aida Gainutdinova, Abuzer Yakaryilmaz
:
Unary probabilistic and quantum automata on promise problems. Quantum Inf. Process. 17(2): 28 (2018) - 2017
- [c8]Aida Gainutdinova, Abuzer Yakaryilmaz:
Nondeterministic Unitary OBDDs. CSR 2017: 126-140 - 2016
- [i3]Aida Gainutdinova, Abuzer Yakaryilmaz:
Nondeterministic unitary OBDDs. CoRR abs/1612.07015 (2016) - 2015
- [c7]Aida Gainutdinova, Abuzer Yakaryilmaz:
Unary Probabilistic and Quantum Automata on Promise Problems. DLT 2015: 252-263 - [i2]Aida Gainutdinova, Abuzer Yakaryilmaz:
Unary probabilistic and quantum automata on promise problems. CoRR abs/1502.01462 (2015) - 2014
- [c6]Farid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz:
Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs. DCFS 2014: 53-64 - [i1]Farid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz:
Very narrow quantum OBDDs and width hierarchies for classical OBDDs. CoRR abs/1405.7849 (2014)
2000 – 2009
- 2007
- [c5]Farid M. Ablayev, Aida Gainutdinova:
Classical Simulation Complexity of Quantum Branching Programs. LATA 2007: 49-56 - 2005
- [j1]Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski, Cristopher Moore, Chris Pollett:
On the computational power of probabilistic and quantum branching program. Inf. Comput. 203(2): 145-162 (2005) - [c4]Farid M. Ablayev, Aida Gainutdinova:
Complexity of Quantum Uniform and Nonuniform Automata. Developments in Language Theory 2005: 78-87 - 2003
- [c3]Farid M. Ablayev, Aida Gainutdinova:
Classical Simulation Complexity of Quantum Machines. FCT 2003: 296-302 - 2001
- [c2]Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski:
On Computational Power of Quantum Branching Programs. FCT 2001: 59-70 - 2000
- [c1]Farid M. Ablayev, Aida Gainutdinova:
On the Lower Bounds for One-Way Quantum Automata. MFCS 2000: 132-140
Coauthor Index
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 2024-04-24 23:14 CEST 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:
