A. C. Cem Say - RankMe

105 papers B 2C 8Misc 1Journal 82Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Fine-grained quantum advantage beyond double-logarithmic space. CoRR A. C. Cem Say
2026	J	`jnl`	Time hierarchies for sublogarithmic-space quantum computation. Theor. Comput. Sci. A. C. Cem Say
2025	J	`jnl`	$\rm P$ has polynomial-time finite-state verifiers. Discret. Math. Theor. Comput. Sci. M. Utkan Gezer, A. C. Cem Say
2025	J	`jnl`	Short and useful quantum proofs for sublogarithmic-space verifiers. CoRR A. C. Cem Say
2025	J	`jnl`	Time hierarchies for sublogarithmic-space quantum computation. CoRR A. C. Cem Say
2025	J	`jnl`	Unconditional Proofs of Quantumness Between Small-Space Machines. Quantum Inf. Comput. A. C. Cem Say, M. Utkan Gezer
2024	J	`jnl`	Energy complexity of regular languages. Theor. Comput. Sci. Firat Kiyak, A. C. Cem Say
2024	J	`jnl`	Unconditional proofs of quantumness between small-space machines. CoRR A. C. Cem Say, M. Utkan Gezer
2023	—	`conf`	Finite State Verifiers with Both Private and Public Coins. ICTCS M. Utkan Gezer, A. C. Cem Say
2023	J	`jnl`	Finite state verifiers with both private and public coins. CoRR M. Utkan Gezer, A. C. Cem Say
2023	J	`jnl`	Read-once machines and the thermodynamic complexity of Maxwell's demons. CoRR Firat Kiyak, A. C. Cem Say
2023	J	`jnl`	Real-time, constant-space, constant-randomness verifiers. Theor. Comput. Sci. M. Utkan Gezer, Özdeniz Dolu, Nevzat Ersoy, A. C. Cem Say
2022	J	`jnl`	Advice hierarchies among finite automata. Inf. Comput. Ahmet Bilal Uçan, A. C. Cem Say
2022	J	`jnl`	Constant-space, constant-randomness verifiers with arbitrarily small error. Inf. Comput. M. Utkan Gezer, A. C. Cem Say
2022	C	`conf`	Energy Complexity of Regular Language Recognition. CIAA Öykü Yilmaz, Firat Kiyak, Meriç Üngör, A. C. Cem Say
2022	J	`jnl`	Energy Complexity of Regular Language Recognition. CoRR Öykü Yilmaz, Firat Kiyak, Meriç Üngör, A. C. Cem Say
2022	C	`conf`	Real-Time, Constant-Space, Constant-Randomness Verifiers. CIAA Özdeniz Dolu, Nevzat Ersoy, M. Utkan Gezer, A. C. Cem Say
2022	J	`jnl`	Real-Time, Constant-Space, Constant-Randomness Verifiers. CoRR Özdeniz Dolu, Nevzat Ersoy, M. Utkan Gezer, A. C. Cem Say
2020	J	`jnl`	Constant-Space, Constant-Randomness Verifiers with Arbitrarily Small Error. CoRR M. Utkan Gezer, A. C. Cem Say
2019	J	`jnl`	Alternating, private alternating, and quantum alternating realtime automata. Log. Methods Comput. Sci. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz
2019	J	`jnl`	New Results on Vector and Homing Vector Automata. CoRR Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say
2019	J	`jnl`	New Results on Vector and Homing Vector Automata. Int. J. Found. Comput. Sci. Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say
2018	J	`jnl`	Language Classes Associated With Automata Over Matrix Groups. CoRR Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say
2018	J	`jnl`	Language classes associated with automata over matrix groups. RAIRO Theor. Informatics Appl. Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say
2018	J	`jnl`	The Weakness of CTC Qubits and the Power of Approximate Counting. ACM Trans. Comput. Theory Ryan O'Donnell, A. C. Cem Say
2017	—	`conf`	Generalized Results on Monoids as Memory. AFL Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say
2017	J	`jnl`	Inkdots as advice for finite automata. Discret. Math. Theor. Comput. Sci. Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz
2017	J	`jnl`	Magic coins are useful for small-space quantum machines. Quantum Inf. Comput. A. C. Cem Say, Abuzer Yakaryilmaz
2016	J	`jnl`	Debates with Small Transparent Quantum Verifiers. Int. J. Found. Comput. Sci. Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci
2016	J	`jnl`	Homing vector automata. CoRR Özlem Salehi, A. C. Cem Say, Flavio D'Alessandro
2016	J	`jnl`	Homing vector automata. RAIRO Theor. Informatics Appl. Özlem Salehi, A. C. Cem Say, Flavio D'Alessandro
2016	J	`jnl`	Language Classes Associated with Automata Over Matrix Groups. CoRR Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say
2016	—	`conf`	Language classes associated with automata over matrix groups. NCMA Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say
2016	J	`jnl`	The weakness of CTC qubits and the power of approximate counting. Electron. Colloquium Comput. Complex. Ryan O'Donnell, A. C. Cem Say
2015	J	`jnl`	Homing Vector Automata. CoRR Özlem Salehi, A. C. Cem Say
2015	—	`conf`	Homing vector automata. NCMA Özlem Salehi, A. C. Cem Say
2015	J	`jnl`	Inkdots as advice to small-space machines. CoRR Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz
2015	—	`conf`	Optimal Bounds for Estimating Entropy with PMF Queries. MFCS (2) Cafer Caferov, Baris Kaya, Ryan O'Donnell, A. C. Cem Say
2015	J	`jnl`	The Complexity of Debate Checking. Theory Comput. Syst. H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz
2014	—	`conf`	Classical and quantum realtime alternating automata. NCMA H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz
2014	J	`jnl`	Classical and quantum realtime alternating automata. CoRR H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz
2014	C	`conf`	Debates with Small Transparent Quantum Verifiers. Developments in Language Theory Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci
2014	J	`jnl`	Debates with small transparent quantum verifiers. CoRR Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci
2014	J	`jnl`	Finite Automata with Advice Tapes. Int. J. Found. Comput. Sci. Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz
2014	J	`jnl`	Finite state verifiers with constant randomness Log. Methods Comput. Sci. A. C. Cem Say, Abuzer Yakaryilmaz
2014	J	`jnl`	Magic coins are useful for small-space quantum machines. CoRR A. C. Cem Say, Abuzer Yakaryilmaz
2014	J	`jnl`	Magic coins are useful for small-space quantum machines. Electron. Colloquium Comput. Complex. A. C. Cem Say, Abuzer Yakaryilmaz
2014	—	`conf`	One Time-traveling Bit is as Good as Logarithmically Many. FSTTCS Ryan O'Donnell, A. C. Cem Say
2014	J	`jnl`	One time-travelling bit is as good as logarithmically many. Electron. Colloquium Comput. Complex. Ryan O'Donnell, A. C. Cem Say
2014	—	`conf`	Quantum Finite Automata: A Modern Introduction. Computing with New Resources A. C. Cem Say, Abuzer Yakaryilmaz
2014	J	`jnl`	Quantum finite automata: A modern introduction. CoRR A. C. Cem Say, Abuzer Yakaryilmaz
2014	J	`jnl`	The Complexity of Debate Checking. Electron. Colloquium Comput. Complex. H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz
2013	C	`conf`	Finite Automata with Advice Tapes. Developments in Language Theory Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz
2013	J	`jnl`	Finite automata with advice tapes. CoRR Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz
2013	J	`jnl`	Finite state verifiers with constant randomness. Electron. Colloquium Comput. Complex. A. C. Cem Say, Abuzer Yakaryilmaz
2013	J	`jnl`	Proving the Power of Postselection. Fundam. Informaticae Abuzer Yakaryilmaz, A. C. Cem Say
2013	J	`jnl`	Real-Time Vector Automata CoRR Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say
2013	B	`conf`	Real-Time Vector Automata. FCT Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say
2013	J	`jnl`	Tight Bounds for the Space Complexity of Nonregular Language Recognition by Real-Time Machines. Int. J. Found. Comput. Sci. Abuzer Yakaryilmaz, A. C. Cem Say
2012	J	`jnl`	Checking generalized debates with small space and randomness. CoRR H. Gökalp Demirci, A. C. Cem Say
2012	J	`jnl`	Computation with multiple CTCs of fixed length and width. Nat. Comput. A. C. Cem Say, Abuzer Yakaryilmaz
2012	C	`conf`	Finite State Verifiers with Constant Randomness. CiE A. C. Cem Say, Abuzer Yakaryilmaz
2012	J	`jnl`	Probabilistic verifiers for asymmetric debates CoRR H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz
2012	J	`jnl`	Quantum Counter Automata. Int. J. Found. Comput. Sci. A. C. Cem Say, Abuzer Yakaryilmaz
2012	J	`jnl`	Quantum computation with write-only memory. Nat. Comput. Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan
2011	J	`jnl`	Causes of Ineradicable Spurious Predictions in Qualitative Simulation CoRR A. C. Cem Say, Özgür Yilmaz
2011	C	`conf`	Computation with Narrow CTCs. UC A. C. Cem Say, Abuzer Yakaryilmaz
2011	J	`jnl`	Computation with narrow CTCs CoRR A. C. Cem Say, Abuzer Yakaryilmaz
2011	C	`conf`	Models of Pushdown Automata with Reset. Developments in Language Theory Nuri Tasdemir, A. C. Cem Say
2011	J	`jnl`	NP has log-space verifiers with fixed-size public quantum registers CoRR Abuzer Yakaryilmaz, A. C. Cem Say
2011	J	`jnl`	Probabilistic and quantum finite automata with postselection CoRR Abuzer Yakaryilmaz, A. C. Cem Say
2011	J	`jnl`	Proving the power of postselection CoRR Abuzer Yakaryilmaz, A. C. Cem Say
2011	J	`jnl`	Quantum counter automata CoRR A. C. Cem Say, Abuzer Yakaryilmaz
2011	J	`jnl`	Tight bounds for the space complexity of nonregular language recognition by real-time machines CoRR Abuzer Yakaryilmaz, A. C. Cem Say
2011	J	`jnl`	Unbounded-error quantum computation with small space bounds. Inf. Comput. Abuzer Yakaryilmaz, A. C. Cem Say
2010	J	`jnl`	A new family of nonstochastic languages. Inf. Process. Lett. Rusins Freivalds, Abuzer Yakaryilmaz, A. C. Cem Say
2010	J	`jnl`	Languages recognized by nondeterministic quantum finite automata. Quantum Inf. Comput. Abuzer Yakaryilmaz, A. C. Cem Say
2010	C	`conf`	Quantum Computation with Devices Whose Contents Are Never Read. UC Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan
2010	J	`jnl`	Quantum computation with devices whose contents are never read CoRR Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan
2010	J	`jnl`	Quantum function computation using sublogarithmic space (abstract & poster) CoRR A. C. Cem Say, Abuzer Yakaryilmaz
2010	J	`jnl`	Succinctness of two-way probabilistic and quantum finite automata. Discret. Math. Theor. Comput. Sci. Abuzer Yakaryilmaz, A. C. Cem Say
2010	J	`jnl`	Unbounded-error quantum computation with small space bounds CoRR Abuzer Yakaryilmaz, A. C. Cem Say
2009	J	`jnl`	Efficient probability amplification in two-way quantum finite automata. Theor. Comput. Sci. Abuzer Yakaryilmaz, A. C. Cem Say
2009	J	`jnl`	Language Recognition by Generalized Quantum Finite Automata with Unbounded Error CoRR Abuzer Yakaryilmaz, A. C. Cem Say
2009	Misc	`conf`	Languages Recognized with Unbounded Error by Quantum Finite Automata. CSR Abuzer Yakaryilmaz, A. C. Cem Say
2009	J	`jnl`	Quantum Finite Automata with One-Sided Unbounded Error CoRR Abuzer Yakaryilmaz, A. C. Cem Say
2009	J	`jnl`	Succinctness of two-way probabilistic and quantum finite automata CoRR Abuzer Yakaryilmaz, A. C. Cem Say
2006	J	`jnl`	Causes of Ineradicable Spurious Predictions in Qualitative Simulation. J. Artif. Intell. Res. Özgür Yilmaz, A. C. Cem Say
2006	—	`conf`	Problems of Adiabatic Quantum Program Design. ISCIS Evgeniya Khusnitdinova, A. C. Cem Say
2005	—	`conf`	Improved Simulation of Quantum Random Walks. ISCIS Ugur Küçük, A. C. Cem Say
2005	J	`jnl`	Random generation of monotonic functions for Monte Carlo solution of qualitative differential equations. Autom. A. C. Cem Say, A. Kutsi Nircan
2004	—	`conf`	A Linguistically Motivated Information Retrieval System for Turkish. ISCIS F. Canan Pembe, A. C. Cem Say
2004	B	`conf`	A Natural Language Processing Infrastructure for Turkish. COLING A. C. Cem Say, Özlem Çetinoglu, Seniz Demir, Faith Ögün
2004	—	`conf`	Generating Equiprobable Superpositions of Arbitrary Sets for a New Generalization of the Deutsch-Jozsa Algorithm. ISCIS Elton Ballhysa, A. C. Cem Say
2003	J	`jnl`	Duration Consistency Filtering for Qualitative Simulation. Ann. Math. Artif. Intell. Tolga Könik, A. C. Cem Say
2003	J	`jnl`	Sound and Complete Qualitative Simulation Needs "Quantitative" Filtering. Ann. Math. Artif. Intell. A. C. Cem Say
2003	J	`jnl`	Sound and complete qualitative simulation is impossible. Artif. Intell. A. C. Cem Say, H. Levent Akin
2002	J	`jnl`	Problems in Representing Liquid Tanks with Monotonicity Constraints: A Case Study in Model-Imposed Limitations on the Coverage of Qualitative Simulators. Artif. Intell. Rev. A. C. Cem Say
2001	J	`jnl`	Improved Reasoning About Infinity Using Qualitative Simulation. Comput. Artif. Intell. A. C. Cem Say
2001	J	`jnl`	Understanding Arithmetic Problems in Turkish. Int. J. Pattern Recognit. Artif. Intell. A. C. Cem Say
1999	J	`jnl`	Making Use of Contradictory Behavior Information in Qualitative Reasoning. IEEE Trans. Pattern Anal. Mach. Intell. A. C. Cem Say
1998	J	`jnl`	L'Hôpital's Filter for QSIM. IEEE Trans. Pattern Anal. Mach. Intell. A. C. Cem Say
1997	J	`jnl`	Postdiction using reverse qualitative simulation. IEEE Trans. Syst. Man Cybern. Part A A. C. Cem Say, Selahattin Kuru
1996	J	`jnl`	Qualitative System Identification: Deriving Structure from Behavior. Artif. Intell. A. C. Cem Say, Selahattin Kuru
1993	J	`jnl`	Improved Filtering for the QSIM Algorithm. IEEE Trans. Pattern Anal. Mach. Intell. A. C. Cem Say, Selahattin Kuru