×

zbMATH — the first resource for mathematics

Yakaryılmaz, Abuzer

Compute Distance To:
Author ID: yakaryilmaz.abuzer Recent zbMATH articles by "Yakaryılmaz, Abuzer"
Published as: Yakaryilmaz, Abuzer; Yakaryılmaz, A.; Yakaryılmaz, Abuzer; Yakaryılmaz, Abuzer.
External Links: MGP · Wikidata · ORCID
Documents Indexed: 57 Publications since 2009

Publications by Year

Citations contained in zbMATH

39 Publications have been cited 218 times in 67 Documents Cited by Year
Unbounded-error quantum computation with small space bounds. Zbl 1221.68092
Yakaryılmaz, Abuzer; Say, A. C. Cem
33
2011
Superiority of exact quantum automata for promise problems. Zbl 1237.68082
Ambainis, Andris; Yakaryılmaz, Abuzer
29
2012
Languages recognized by nondeterministic quantum finite automata. Zbl 1236.81071
Yakaryılmaz, Abuzer; Say, A. C. Cem
16
2010
Quantum finite automata: a modern introduction. Zbl 1323.68278
Say, A. C. Cem; Yakaryılmaz, Abuzer
15
2014
Succinctness of two-way probabilistic and quantum finite automata. Zbl 1286.68297
Yakaryılmaz, Abuzer; Say, Cem
12
2010
Languages recognized with unbounded error by quantum finite automata. Zbl 1248.68315
Yakaryilmaz, Abuzer; Say, A. C. Cem
10
2009
Very narrow quantum OBDDs and width hierarchies for classical OBDDs. Zbl 1407.68158
Ablayev, Farid; Gainutdinova, Aida; Khadiev, Kamil; Yakaryılmaz, Abuzer
8
2014
Implications of quantum automata for contextuality. Zbl 1302.68177
Rashid, Jibran; Yakaryılmaz, Abuzer
6
2014
Efficient probability amplification in two-way quantum finite automata. Zbl 1163.68026
Yakaryılmaz, Abuzer; Say, A. C. Cem
6
2009
Very narrow quantum OBDDs and width hierarchies for classical OBDDs. Zbl 1407.68159
Ablayev, F.; Gainutdinova, A.; Khadiev, K.; Yakaryılmaz, A.
5
2016
Looking for pairs that hard to separate: a quantum approach. Zbl 1379.68214
Belovs, Aleksandrs; Montoya, J. Andres; Yakaryılmaz, Abuzer
5
2016
Affine computation and affine automaton. Zbl 1434.68172
Díaz-Caro, Alejandro; Yakaryılmaz, Abuzer
5
2016
Superiority of one-way and realtime quantum machines. Zbl 1279.68090
Yakaryılmaz, Abuzer
5
2012
Quantum computation with write-only memory. Zbl 1251.68117
Yakaryılmaz, Abuzer; Freivalds, Rūsiņš; Say, A. C. Cem; Agadzanyan, Ruben
5
2012
Language recognition power and succinctness of affine automata. Zbl 06630589
Villagra, Marcos; Yakaryılmaz, Abuzer
4
2016
Classical automata on promise problems. Zbl 1333.68166
Geffert, Viliam; Yakaryılmaz, Abuzer
4
2015
Unary probabilistic and quantum automata on promise problems. Zbl 1434.68250
Gainutdinova, Aida; Yakaryılmaz, Abuzer
4
2015
Quantum, stochastic, and pseudo stochastic languages with few states. Zbl 1445.68126
Shur, Arseny M.; Yakaryılmaz, Abuzer
4
2014
Classical automata on promise problems. Zbl 1333.68165
Geffert, Viliam; Yakaryılmaz, Abuzer
4
2014
A new family of nonstochastic languages. Zbl 1229.68048
Freivalds, Rūsiņš; Yakaryılmaz, Abuzer; Say, A. C. Cem
4
2010
More on quantum, stochastic, and pseudo stochastic languages with few states. Zbl 1415.68139
Shur, Arseny M.; Yakaryılmaz, Abuzer
3
2016
One-counter verifiers for decidable languages. Zbl 1382.68138
Yakaryılmaz, Abuzer
3
2013
Quantum alternation. Zbl 1381.68091
Yakaryılmaz, Abuzer
3
2013
Proving the power of postselection. Zbl 1279.68091
Yakaryılmaz, Abuzer; Say, A. C. Cem
3
2013
Uncountable realtime probabilistic classes. Zbl 06767290
Dimitrijevs, Maksims; Yakaryılmaz, Abuzer
2
2017
Debates with small transparent quantum verifiers. Zbl 1344.68133
Yakaryilmaz, Abuzer; Say, A. C. Cem; Demirci, H. Gökalp
2
2016
New results on the minimum amount of useful space. Zbl 1338.68138
Bednárová, Zuzana; Geffert, Viliam; Reinhardt, Klaus; Yakaryilmaz, Abuzer
2
2016
Classical and quantum counter automata on promise problems. Zbl 06484744
Nakanishi, Masaki; Yakaryılmaz, Abuzer
2
2015
The minimum amount of useful space: new results and new directions. Zbl 1425.68227
Reinhardt, Klaus; Yakaryılmaz, Abuzer
2
2014
Real-time vector automata. Zbl 1390.68415
Salehi, Özlem; Yakaryılmaz, Abuzer; Say, A. C. Cem
2
2013
Quantum counter automata. Zbl 1279.68175
Say, A. C. Cem; Yakaryilmaz, Abuzer
2
2012
Uncountable classical and quantum complexity classes. Zbl 1425.68126
Dimitrijevs, Maksims; Yakaryılmaz, Abuzer
1
2018
New size hierarchies for two way automata. Zbl 1403.68114
Ibrahimov, R.; Khadiev, K.; Yakaryılmaz, A.
1
2018
The complexity of debate checking. Zbl 1329.68108
Demirci, H. Gökalp; Say, A. C. Cem; Yakaryılmaz, Abuzer
1
2015
Unary languages recognized by two-way one-counter automata. Zbl 1302.68156
De Biasi, Marzio; Yakaryılmaz, Abuzer
1
2014
Tight bounds for the space complexity of nonregular language recognition by real-time machines. Zbl 1291.68234
Yakaryilmaz, Abuzer; Say, A. C. Cem
1
2013
Finite automata with advice tapes. Zbl 1381.68124
Küçük, Uğur; Say, A. C. Cem; Yakaryılmaz, Abuzer
1
2013
Finite state verifiers with constant randomness. Zbl 1338.68160
Say, A. C. Cem; Yakaryılmaz, Abuzer
1
2012
Quantum computation with devices whose contents are never read. Zbl 1286.68148
Yakaryılmaz, Abuzer; Freivalds, Rūsiņš; Say, A. C. Cem; Agadzanyan, Ruben
1
2010
Uncountable classical and quantum complexity classes. Zbl 1425.68126
Dimitrijevs, Maksims; Yakaryılmaz, Abuzer
1
2018
New size hierarchies for two way automata. Zbl 1403.68114
Ibrahimov, R.; Khadiev, K.; Yakaryılmaz, A.
1
2018
Uncountable realtime probabilistic classes. Zbl 06767290
Dimitrijevs, Maksims; Yakaryılmaz, Abuzer
2
2017
Very narrow quantum OBDDs and width hierarchies for classical OBDDs. Zbl 1407.68159
Ablayev, F.; Gainutdinova, A.; Khadiev, K.; Yakaryılmaz, A.
5
2016
Looking for pairs that hard to separate: a quantum approach. Zbl 1379.68214
Belovs, Aleksandrs; Montoya, J. Andres; Yakaryılmaz, Abuzer
5
2016
Affine computation and affine automaton. Zbl 1434.68172
Díaz-Caro, Alejandro; Yakaryılmaz, Abuzer
5
2016
Language recognition power and succinctness of affine automata. Zbl 06630589
Villagra, Marcos; Yakaryılmaz, Abuzer
4
2016
More on quantum, stochastic, and pseudo stochastic languages with few states. Zbl 1415.68139
Shur, Arseny M.; Yakaryılmaz, Abuzer
3
2016
Debates with small transparent quantum verifiers. Zbl 1344.68133
Yakaryilmaz, Abuzer; Say, A. C. Cem; Demirci, H. Gökalp
2
2016
New results on the minimum amount of useful space. Zbl 1338.68138
Bednárová, Zuzana; Geffert, Viliam; Reinhardt, Klaus; Yakaryilmaz, Abuzer
2
2016
Classical automata on promise problems. Zbl 1333.68166
Geffert, Viliam; Yakaryılmaz, Abuzer
4
2015
Unary probabilistic and quantum automata on promise problems. Zbl 1434.68250
Gainutdinova, Aida; Yakaryılmaz, Abuzer
4
2015
Classical and quantum counter automata on promise problems. Zbl 06484744
Nakanishi, Masaki; Yakaryılmaz, Abuzer
2
2015
The complexity of debate checking. Zbl 1329.68108
Demirci, H. Gökalp; Say, A. C. Cem; Yakaryılmaz, Abuzer
1
2015
Quantum finite automata: a modern introduction. Zbl 1323.68278
Say, A. C. Cem; Yakaryılmaz, Abuzer
15
2014
Very narrow quantum OBDDs and width hierarchies for classical OBDDs. Zbl 1407.68158
Ablayev, Farid; Gainutdinova, Aida; Khadiev, Kamil; Yakaryılmaz, Abuzer
8
2014
Implications of quantum automata for contextuality. Zbl 1302.68177
Rashid, Jibran; Yakaryılmaz, Abuzer
6
2014
Quantum, stochastic, and pseudo stochastic languages with few states. Zbl 1445.68126
Shur, Arseny M.; Yakaryılmaz, Abuzer
4
2014
Classical automata on promise problems. Zbl 1333.68165
Geffert, Viliam; Yakaryılmaz, Abuzer
4
2014
The minimum amount of useful space: new results and new directions. Zbl 1425.68227
Reinhardt, Klaus; Yakaryılmaz, Abuzer
2
2014
Unary languages recognized by two-way one-counter automata. Zbl 1302.68156
De Biasi, Marzio; Yakaryılmaz, Abuzer
1
2014
One-counter verifiers for decidable languages. Zbl 1382.68138
Yakaryılmaz, Abuzer
3
2013
Quantum alternation. Zbl 1381.68091
Yakaryılmaz, Abuzer
3
2013
Proving the power of postselection. Zbl 1279.68091
Yakaryılmaz, Abuzer; Say, A. C. Cem
3
2013
Real-time vector automata. Zbl 1390.68415
Salehi, Özlem; Yakaryılmaz, Abuzer; Say, A. C. Cem
2
2013
Tight bounds for the space complexity of nonregular language recognition by real-time machines. Zbl 1291.68234
Yakaryilmaz, Abuzer; Say, A. C. Cem
1
2013
Finite automata with advice tapes. Zbl 1381.68124
Küçük, Uğur; Say, A. C. Cem; Yakaryılmaz, Abuzer
1
2013
Superiority of exact quantum automata for promise problems. Zbl 1237.68082
Ambainis, Andris; Yakaryılmaz, Abuzer
29
2012
Superiority of one-way and realtime quantum machines. Zbl 1279.68090
Yakaryılmaz, Abuzer
5
2012
Quantum computation with write-only memory. Zbl 1251.68117
Yakaryılmaz, Abuzer; Freivalds, Rūsiņš; Say, A. C. Cem; Agadzanyan, Ruben
5
2012
Quantum counter automata. Zbl 1279.68175
Say, A. C. Cem; Yakaryilmaz, Abuzer
2
2012
Finite state verifiers with constant randomness. Zbl 1338.68160
Say, A. C. Cem; Yakaryılmaz, Abuzer
1
2012
Unbounded-error quantum computation with small space bounds. Zbl 1221.68092
Yakaryılmaz, Abuzer; Say, A. C. Cem
33
2011
Languages recognized by nondeterministic quantum finite automata. Zbl 1236.81071
Yakaryılmaz, Abuzer; Say, A. C. Cem
16
2010
Succinctness of two-way probabilistic and quantum finite automata. Zbl 1286.68297
Yakaryılmaz, Abuzer; Say, Cem
12
2010
A new family of nonstochastic languages. Zbl 1229.68048
Freivalds, Rūsiņš; Yakaryılmaz, Abuzer; Say, A. C. Cem
4
2010
Quantum computation with devices whose contents are never read. Zbl 1286.68148
Yakaryılmaz, Abuzer; Freivalds, Rūsiņš; Say, A. C. Cem; Agadzanyan, Ruben
1
2010
Languages recognized with unbounded error by quantum finite automata. Zbl 1248.68315
Yakaryilmaz, Abuzer; Say, A. C. Cem
10
2009
Efficient probability amplification in two-way quantum finite automata. Zbl 1163.68026
Yakaryılmaz, Abuzer; Say, A. C. Cem
6
2009

Citations by Year

Wikidata Timeline