Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDA. C. Cem Say
Ahmet Celal Cem Say
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 1992
[b1]Ahmet Celal Cem Say:
Qualitative system identification (Nitel sistem tanılama). Boğaziçi University, Turkey, 1992
Journal Articles
- 2024
- [j38]Firat Kiyak, A. C. Cem Say:
Energy complexity of regular languages. Theor. Comput. Sci. 982: 114291 (2024) - 2023
- [j37]M. Utkan Gezer
, Özdeniz Dolu, Nevzat Ersoy, A. C. Cem Say:
Real-time, constant-space, constant-randomness verifiers. Theor. Comput. Sci. 976: 114155 (2023) - 2022
- [j36]M. Utkan Gezer, A. C. Cem Say:
Constant-space, constant-randomness verifiers with arbitrarily small error. Inf. Comput. 288: 104744 (2022) - [j35]Ahmet Bilal Uçan, A. C. Cem Say:
Advice hierarchies among finite automata. Inf. Comput. 288: 104878 (2022) - 2019
- [j34]Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say:
New Results on Vector and Homing Vector Automata. Int. J. Found. Comput. Sci. 30(8): 1335-1361 (2019) - [j33]Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz:
Alternating, private alternating, and quantum alternating realtime automata. Log. Methods Comput. Sci. 15(3) (2019) - 2018
- [j32]Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say:
Language classes associated with automata over matrix groups. RAIRO Theor. Informatics Appl. 52(2-3-4): 253-268 (2018) - [j31]Ryan O'Donnell, A. C. Cem Say:
The Weakness of CTC Qubits and the Power of Approximate Counting. ACM Trans. Comput. Theory 10(2): 5:1-5:22 (2018) - 2017
- [j30]Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz:
Inkdots as advice for finite automata. Discret. Math. Theor. Comput. Sci. 19(3) (2017) - [j29]A. C. Cem Say, Abuzer Yakaryilmaz:
Magic coins are useful for small-space quantum machines. Quantum Inf. Comput. 17(11&12): 1027-1043 (2017) - 2016
- [j28]Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci:
Debates with Small Transparent Quantum Verifiers. Int. J. Found. Comput. Sci. 27(2): 283- (2016) - [j27]Özlem Salehi, A. C. Cem Say, Flavio D'Alessandro:
Homing vector automata. RAIRO Theor. Informatics Appl. 50(4): 371-386 (2016) - 2015
- [j26]H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz:
The Complexity of Debate Checking. Theory Comput. Syst. 57(1): 36-80 (2015) - 2014
- [j25]A. C. Cem Say, Abuzer Yakaryilmaz:
Finite state verifiers with constant randomness. Log. Methods Comput. Sci. 10(3) (2014) - [j24]Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz:
Finite Automata with Advice Tapes. Int. J. Found. Comput. Sci. 25(8): 987-1000 (2014) - 2013
- [j23]Abuzer Yakaryilmaz, A. C. Cem Say:
Proving the Power of Postselection. Fundam. Informaticae 123(1): 107-134 (2013) - [j22]Abuzer Yakaryilmaz, A. C. Cem Say:
Tight Bounds for the Space Complexity of Nonregular Language Recognition by Real-Time Machines. Int. J. Found. Comput. Sci. 24(8): 1243-1254 (2013) - 2012
- [j21]A. C. Cem Say, Abuzer Yakaryilmaz:
Quantum Counter Automata. Int. J. Found. Comput. Sci. 23(5): 1099-1116 (2012) - [j20]Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan:
Quantum computation with write-only memory. Nat. Comput. 11(1): 81-94 (2012) - [j19]A. C. Cem Say, Abuzer Yakaryilmaz:
Computation with multiple CTCs of fixed length and width. Nat. Comput. 11(4): 579-594 (2012) - 2011
- [j18]Abuzer Yakaryilmaz, A. C. Cem Say:
Unbounded-error quantum computation with small space bounds. Inf. Comput. 209(6): 873-892 (2011) - 2010
- [j17]Abuzer Yakaryilmaz, A. C. Cem Say:
Succinctness of two-way probabilistic and quantum finite automata. Discret. Math. Theor. Comput. Sci. 12(4): 19-40 (2010) - [j16]Rusins Freivalds, Abuzer Yakaryilmaz, A. C. Cem Say:
A new family of nonstochastic languages. Inf. Process. Lett. 110(10): 410-413 (2010) - [j15]Abuzer Yakaryilmaz, A. C. Cem Say:
Languages recognized by nondeterministic quantum finite automata. Quantum Inf. Comput. 10(9&10): 747-770 (2010) - 2009
- [j14]Abuzer Yakaryilmaz, A. C. Cem Say:
Efficient probability amplification in two-way quantum finite automata. Theor. Comput. Sci. 410(20): 1932-1941 (2009) - 2006
- [j13]Özgür Yilmaz, A. C. Cem Say:
Causes of Ineradicable Spurious Predictions in Qualitative Simulation. J. Artif. Intell. Res. 27: 551-575 (2006) - 2005
- [j12]A. C. Cem Say, A. Kutsi Nircan:
Random generation of monotonic functions for Monte Carlo solution of qualitative differential equations. Autom. 41(5): 739-754 (2005) - 2003
- [j11]A. C. Cem Say, H. Levent Akin:
Sound and complete qualitative simulation is impossible. Artif. Intell. 149(2): 251-266 (2003) - [j10]A. C. Cem Say:
Sound and Complete Qualitative Simulation Needs "Quantitative" Filtering. Ann. Math. Artif. Intell. 38(4): 257-267 (2003) - [j9]Tolga Könik, A. C. Cem Say:
Duration Consistency Filtering for Qualitative Simulation. Ann. Math. Artif. Intell. 38(4): 269-309 (2003) - 2002
- [j8]A. C. Cem Say:
Problems in Representing Liquid Tanks with Monotonicity Constraints: A Case Study in Model-Imposed Limitations on the Coverage of Qualitative Simulators. Artif. Intell. Rev. 17(4): 291-317 (2002) - 2001
- [j7]A. C. Cem Say:
Improved Reasoning About Infinity Using Qualitative Simulation. Comput. Artif. Intell. 20(5): 487-507 (2001) - [j6]A. C. Cem Say:
Understanding Arithmetic Problems in Turkish. Int. J. Pattern Recognit. Artif. Intell. 15(2): 359-374 (2001) - 1999
- [j5]A. C. Cem Say:
Making Use of Contradictory Behavior Information in Qualitative Reasoning. IEEE Trans. Pattern Anal. Mach. Intell. 21(8): 781-786 (1999) - 1998
- [j4]A. C. Cem Say:
L'Hôpital's Filter for QSIM. IEEE Trans. Pattern Anal. Mach. Intell. 20(1): 1-8 (1998) - 1997
- [j3]A. C. Cem Say, Selahattin Kuru:
Postdiction using reverse qualitative simulation. IEEE Trans. Syst. Man Cybern. Part A 27(1): 84-95 (1997) - 1996
- [j2]A. C. Cem Say, Selahattin Kuru:
Qualitative System Identification: Deriving Structure from Behavior. Artif. Intell. 83(1): 75-141 (1996) - 1993
- [j1]A. C. Cem Say, Selahattin Kuru:
Improved Filtering for the QSIM Algorithm. IEEE Trans. Pattern Anal. Mach. Intell. 15(9): 967-971 (1993)
Conference and Workshop Papers
- 2023
- [c24]M. Utkan Gezer, A. C. Cem Say:
Finite State Verifiers with Both Private and Public Coins. ICTCS 2023: 241-253 - [c23]Ahmet Celal Cem Say:
Energy Complexity of Computation. RC 2023: 3-11 - 2022
- [c22]Öykü Yilmaz, Firat Kiyak, Meriç Üngör, A. C. Cem Say:
Energy Complexity of Regular Language Recognition. CIAA 2022: 200-211 - [c21]Özdeniz Dolu, Nevzat Ersoy, M. Utkan Gezer, A. C. Cem Say:
Real-Time, Constant-Space, Constant-Randomness Verifiers. CIAA 2022: 212-224 - 2017
- [c20]Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say:
Generalized Results on Monoids as Memory. AFL 2017: 234-247 - 2016
- [c19]Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say:
Language classes associated with automata over matrix groups. NCMA 2016: 287-300 - 2015
- [c18]Cafer Caferov, Baris Kaya, Ryan O'Donnell, A. C. Cem Say:
Optimal Bounds for Estimating Entropy with PMF Queries. MFCS (2) 2015: 187-198 - [c17]Özlem Salehi, A. C. Cem Say:
Homing vector automata. NCMA 2015: 193-205 - 2014
- [c16]A. C. Cem Say, Abuzer Yakaryilmaz:
Quantum Finite Automata: A Modern Introduction. Computing with New Resources 2014: 208-222 - [c15]Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci:
Debates with Small Transparent Quantum Verifiers. Developments in Language Theory 2014: 327-338 - [c14]Ryan O'Donnell, A. C. Cem Say:
One Time-traveling Bit is as Good as Logarithmically Many. FSTTCS 2014: 469-480 - [c13]H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz:
Classical and quantum realtime alternating automata. NCMA 2014: 101-114 - 2013
- [c12]Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz:
Finite Automata with Advice Tapes. Developments in Language Theory 2013: 301-312 - [c11]Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say:
Real-Time Vector Automata. FCT 2013: 293-304 - 2012
- [c10]A. C. Cem Say, Abuzer Yakaryilmaz:
Finite State Verifiers with Constant Randomness. CiE 2012: 646-654 - 2011
- [c9]Nuri Tasdemir, A. C. Cem Say:
Models of Pushdown Automata with Reset. Developments in Language Theory 2011: 417-428 - [c8]A. C. Cem Say, Abuzer Yakaryilmaz:
Computation with Narrow CTCs. UC 2011: 201-211 - 2010
- [c7]Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan:
Quantum Computation with Devices Whose Contents Are Never Read. UC 2010: 164-174 - 2009
- [c6]Abuzer Yakaryilmaz, A. C. Cem Say:
Languages Recognized with Unbounded Error by Quantum Finite Automata. CSR 2009: 356-367 - 2006
- [c5]Evgeniya Khusnitdinova, A. C. Cem Say:
Problems of Adiabatic Quantum Program Design. ISCIS 2006: 1040-1049 - 2005
- [c4]Ugur Küçük, A. C. Cem Say:
Improved Simulation of Quantum Random Walks. ISCIS 2005: 937-946 - 2004
- [c3]A. C. Cem Say, Özlem Çetinoglu, Seniz Demir, Faith Ögün:
A Natural Language Processing Infrastructure for Turkish. COLING 2004 - [c2]F. Canan Pembe, A. C. Cem Say:
A Linguistically Motivated Information Retrieval System for Turkish. ISCIS 2004: 741-750 - [c1]Elton Ballhysa, A. C. Cem Say:
Generating Equiprobable Superpositions of Arbitrary Sets for a New Generalization of the Deutsch-Jozsa Algorithm. ISCIS 2004: 966-975
Informal and Other Publications
- 2023
- [i38]Firat Kiyak, A. C. Cem Say:
Read-once machines and the thermodynamic complexity of Maxwell's demons. CoRR abs/2304.11452 (2023) - [i37]M. Utkan Gezer, A. C. Cem Say:
Finite state verifiers with both private and public coins. CoRR abs/2306.09542 (2023) - 2022
- [i36]Öykü Yilmaz, Firat Kiyak, Meriç Üngör, A. C. Cem Say:
Energy Complexity of Regular Language Recognition. CoRR abs/2204.06025 (2022) - [i35]Özdeniz Dolu, Nevzat Ersoy, M. Utkan Gezer, A. C. Cem Say:
Real-Time, Constant-Space, Constant-Randomness Verifiers. CoRR abs/2206.00968 (2022) - 2020
- [i34]M. Utkan Gezer, A. C. Cem Say:
Constant-Space, Constant-Randomness Verifiers with Arbitrarily Small Error. CoRR abs/2006.12330 (2020) - 2019
- [i33]Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say:
New Results on Vector and Homing Vector Automata. CoRR abs/1905.11857 (2019) - 2018
- [i32]Özlem Salehi, Ahmet Celal Cem Say:
Extended finite automata and decision problems for matrix semigroups. CoRR abs/1807.05516 (2018) - [i31]Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say:
Language Classes Associated With Automata Over Matrix Groups. CoRR abs/1810.12415 (2018) - 2016
- [i30]Özlem Salehi, A. C. Cem Say, Flavio D'Alessandro:
Homing vector automata. CoRR abs/1603.09185 (2016) - [i29]Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say:
Language Classes Associated with Automata Over Matrix Groups. CoRR abs/1609.00396 (2016) - [i28]Ryan O'Donnell, A. C. Cem Say:
The weakness of CTC qubits and the power of approximate counting. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i27]Özlem Salehi, A. C. Cem Say:
Homing Vector Automata. CoRR abs/1504.04859 (2015) - [i26]Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz:
Inkdots as advice to small-space machines. CoRR abs/1509.03712 (2015) - 2014
- [i25]Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci:
Debates with small transparent quantum verifiers. CoRR abs/1405.1655 (2014) - [i24]A. C. Cem Say, Abuzer Yakaryilmaz:
Quantum finite automata: A modern introduction. CoRR abs/1406.4048 (2014) - [i23]H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz:
Classical and quantum realtime alternating automata. CoRR abs/1407.0334 (2014) - [i22]A. C. Cem Say, Abuzer Yakaryilmaz:
Magic coins are useful for small-space quantum machines. CoRR abs/1411.7647 (2014) - [i21]H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz:
The Complexity of Debate Checking. Electron. Colloquium Comput. Complex. TR14 (2014) - [i20]Ryan O'Donnell, A. C. Cem Say:
One time-travelling bit is as good as logarithmically many. Electron. Colloquium Comput. Complex. TR14 (2014) - [i19]A. C. Cem Say, Abuzer Yakaryilmaz:
Magic coins are useful for small-space quantum machines. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [i18]Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say:
Real-Time Vector Automata. CoRR abs/1303.6129 (2013) - [i17]Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz:
Finite automata with advice tapes. CoRR abs/1312.2268 (2013) - [i16]A. C. Cem Say, Abuzer Yakaryilmaz:
Finite state verifiers with constant randomness. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [i15]H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz:
Probabilistic verifiers for asymmetric debates. CoRR abs/1209.5192 (2012) - [i14]H. Gökalp Demirci, A. C. Cem Say:
Checking generalized debates with small space and randomness. CoRR abs/1211.7346 (2012) - 2011
- [i13]Abuzer Yakaryilmaz, A. C. Cem Say:
NP has log-space verifiers with fixed-size public quantum registers. CoRR abs/1101.5227 (2011) - [i12]Abuzer Yakaryilmaz, A. C. Cem Say:
Probabilistic and quantum finite automata with postselection. CoRR abs/1102.0666 (2011) - [i11]A. C. Cem Say, Abuzer Yakaryilmaz:
Computation with narrow CTCs. CoRR abs/1102.1199 (2011) - [i10]A. C. Cem Say, Abuzer Yakaryilmaz:
Quantum counter automata. CoRR abs/1105.0165 (2011) - [i9]Abuzer Yakaryilmaz, A. C. Cem Say:
Tight bounds for the space complexity of nonregular language recognition by real-time machines. CoRR abs/1108.2613 (2011) - [i8]A. C. Cem Say, Özgür Yilmaz:
Causes of Ineradicable Spurious Predictions in Qualitative Simulation. CoRR abs/1110.0020 (2011) - [i7]Abuzer Yakaryilmaz, A. C. Cem Say:
Proving the power of postselection. CoRR abs/1111.3125 (2011) - 2010
- [i6]Abuzer Yakaryilmaz, A. C. Cem Say:
Unbounded-error quantum computation with small space bounds. CoRR abs/1007.3624 (2010) - [i5]A. C. Cem Say, Abuzer Yakaryilmaz:
Quantum function computation using sublogarithmic space (abstract & poster). CoRR abs/1009.3124 (2010) - [i4]Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan:
Quantum computation with devices whose contents are never read. CoRR abs/1011.1201 (2010) - 2009
- [i3]Abuzer Yakaryilmaz, A. C. Cem Say:
Language Recognition by Generalized Quantum Finite Automata with Unbounded Error. CoRR abs/0901.2703 (2009) - [i2]Abuzer Yakaryilmaz, A. C. Cem Say:
Quantum Finite Automata with One-Sided Unbounded Error. CoRR abs/0902.2081 (2009) - [i1]Abuzer Yakaryilmaz, A. C. Cem Say:
Succinctness of two-way probabilistic and quantum finite automata. CoRR abs/0903.0050 (2009)
Coauthor Index
a service of 
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-25 01:30 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:
