DBLP: A. C. Cem Say

	2013
j22		Abuzer Yakaryilmaz, A. C. Cem Say: Proving the Power of Postselection. Fundam. Inform. 123(1): 107-134 (2013)
i18		Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say: Real-Time Vector Automata. CoRR abs/1303.6129 (2013)
i17		A. C. Cem Say, Abuzer Yakaryilmaz: Finite state verifiers with constant randomness. Electronic Colloquium on Computational Complexity (ECCC) 20: 4 (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. Natural Computing 11(1): 81-94 (2012)
j19		A. C. Cem Say, Abuzer Yakaryilmaz: Computation with multiple CTCs of fixed length and width. Natural Computing 11(4): 579-594 (2012)
c9		A. C. Cem Say, Abuzer Yakaryilmaz: Finite State Verifiers with Constant Randomness. CiE 2012: 646-654
i16		H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz: Probabilistic verifiers for asymmetric debates. CoRR abs/1209.5192 (2012)
	2011
j18		Abuzer Yakaryilmaz, A. C. Cem Say: Unbounded-error quantum computation with small space bounds. Inf. Comput. 209(6): 873-892 (2011)
c8		Nuri Tasdemir, A. C. Cem Say: Models of Pushdown Automata with Reset. Developments in Language Theory 2011: 417-428
c7		A. C. Cem Say, Abuzer Yakaryilmaz: Computation with Narrow CTCs. UC 2011: 201-211
i15		Abuzer Yakaryilmaz, A. C. Cem Say: NP has log-space verifiers with fixed-size public quantum registers. CoRR abs/1101.5227 (2011)
i14		Abuzer Yakaryilmaz, A. C. Cem Say: Probabilistic and quantum finite automata with postselection. CoRR abs/1102.0666 (2011)
i13		A. C. Cem Say, Abuzer Yakaryilmaz: Computation with narrow CTCs. CoRR abs/1102.1199 (2011)
i12		A. C. Cem Say, Abuzer Yakaryilmaz: Finite state verifiers with constant randomness. CoRR abs/1102.2719 (2011)
i11		A. C. Cem Say, Abuzer Yakaryilmaz: Quantum counter automata. CoRR abs/1105.0165 (2011)
i10		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)
i9		A. C. Cem Say, Özgür Yilmaz: Causes of Ineradicable Spurious Predictions in Qualitative Simulation. CoRR abs/1110.0020 (2011)
i8		Abuzer Yakaryilmaz, A. C. Cem Say: Proving the power of postselection. CoRR abs/1111.3125 (2011)
	2010
j17		Abuzer Yakaryilmaz, A. C. Cem Say: Succinctness of two-way probabilistic and quantum finite automata. Discrete Mathematics & Theoretical Computer Science 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 Information & Computation 10(9&10): 747-770 (2010)
c6		Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan: Quantum Computation with Devices Whose Contents Are Never Read. UC 2010: 164-174
i7		Abuzer Yakaryilmaz, A. C. Cem Say: Unbounded-error quantum computation with small space bounds. CoRR abs/1007.3624 (2010)
i6		A. C. Cem Say, Abuzer Yakaryilmaz: Quantum function computation using sublogarithmic space (abstract & poster). CoRR abs/1009.3124 (2010)
i5		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
j14		Abuzer Yakaryilmaz, A. C. Cem Say: Efficient probability amplification in two-way quantum finite automata. Theor. Comput. Sci. 410(20): 1932-1941 (2009)
c5		Abuzer Yakaryilmaz, A. C. Cem Say: Languages Recognized with Unbounded Error by Quantum Finite Automata. CSR 2009: 356-367
i4		Abuzer Yakaryilmaz, A. C. Cem Say: Language Recognition by Generalized Quantum Finite Automata with Unbounded Error. CoRR abs/0901.2703 (2009)
i3		Abuzer Yakaryilmaz, A. C. Cem Say: Quantum Finite Automata with One-Sided Unbounded Error. CoRR abs/0902.2081 (2009)
i2		Abuzer Yakaryilmaz, A. C. Cem Say: Succinctness of two-way probabilistic and quantum finite automata. CoRR abs/0903.0050 (2009)
	2008
i1		Abuzer Yakaryilmaz, A. C. Cem Say: Languages recognized with unbounded error by quantum finite automata. CoRR abs/0809.0073 (2008)
	2006
j13		Özgür Yilmaz, A. C. Cem Say: Causes of Ineradicable Spurious Predictions in Qualitative Simulation. J. Artif. Intell. Res. (JAIR) 27: 551-575 (2006)
c4		Evgeniya Khusnitdinova, A. C. Cem Say: Problems of Adiabatic Quantum Program Design. ISCIS 2006: 1040-1049
	2005
j12		A. C. Cem Say, A. Kutsi Nircan: Random generation of monotonic functions for Monte Carlo solution of qualitative differential equations. Automatica 41(5): 739-754 (2005)
	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
	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. Computers and Artificial Intelligence 20(5) (2001)
j6		A. C. Cem Say: Understanding Arithmetic Problems in Turkish. IJPRAI 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 Transactions on Systems, Man, and Cybernetics, 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)

2013

j22

Abuzer Yakaryilmaz, A. C. Cem Say: Proving the Power of Postselection. Fundam. Inform. 123(1): 107-134 (2013)

i18

Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say: Real-Time Vector Automata. CoRR abs/1303.6129 (2013)

i17

A. C. Cem Say, Abuzer Yakaryilmaz: Finite state verifiers with constant randomness. Electronic Colloquium on Computational Complexity (ECCC) 20: 4 (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. Natural Computing 11(1): 81-94 (2012)

j19

A. C. Cem Say, Abuzer Yakaryilmaz: Computation with multiple CTCs of fixed length and width. Natural Computing 11(4): 579-594 (2012)

A. C. Cem Say, Abuzer Yakaryilmaz: Finite State Verifiers with Constant Randomness. CiE 2012: 646-654

i16

H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz: Probabilistic verifiers for asymmetric debates. CoRR abs/1209.5192 (2012)

2011

j18

Abuzer Yakaryilmaz, A. C. Cem Say: Unbounded-error quantum computation with small space bounds. Inf. Comput. 209(6): 873-892 (2011)

Nuri Tasdemir, A. C. Cem Say: Models of Pushdown Automata with Reset. Developments in Language Theory 2011: 417-428

A. C. Cem Say, Abuzer Yakaryilmaz: Computation with Narrow CTCs. UC 2011: 201-211

i15

Abuzer Yakaryilmaz, A. C. Cem Say: NP has log-space verifiers with fixed-size public quantum registers. CoRR abs/1101.5227 (2011)

i14

Abuzer Yakaryilmaz, A. C. Cem Say: Probabilistic and quantum finite automata with postselection. CoRR abs/1102.0666 (2011)

i13

A. C. Cem Say, Abuzer Yakaryilmaz: Computation with narrow CTCs. CoRR abs/1102.1199 (2011)

i12

A. C. Cem Say, Abuzer Yakaryilmaz: Finite state verifiers with constant randomness. CoRR abs/1102.2719 (2011)

i11

A. C. Cem Say, Abuzer Yakaryilmaz: Quantum counter automata. CoRR abs/1105.0165 (2011)

i10

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)

A. C. Cem Say, Özgür Yilmaz: Causes of Ineradicable Spurious Predictions in Qualitative Simulation. CoRR abs/1110.0020 (2011)

Abuzer Yakaryilmaz, A. C. Cem Say: Proving the power of postselection. CoRR abs/1111.3125 (2011)

2010

j17

Abuzer Yakaryilmaz, A. C. Cem Say: Succinctness of two-way probabilistic and quantum finite automata. Discrete Mathematics & Theoretical Computer Science 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 Information & Computation 10(9&10): 747-770 (2010)

Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan: Quantum Computation with Devices Whose Contents Are Never Read. UC 2010: 164-174

Abuzer Yakaryilmaz, A. C. Cem Say: Unbounded-error quantum computation with small space bounds. CoRR abs/1007.3624 (2010)

A. C. Cem Say, Abuzer Yakaryilmaz: Quantum function computation using sublogarithmic space (abstract & poster). CoRR abs/1009.3124 (2010)

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

j14

Abuzer Yakaryilmaz, A. C. Cem Say: Efficient probability amplification in two-way quantum finite automata. Theor. Comput. Sci. 410(20): 1932-1941 (2009)

Abuzer Yakaryilmaz, A. C. Cem Say: Languages Recognized with Unbounded Error by Quantum Finite Automata. CSR 2009: 356-367

Abuzer Yakaryilmaz, A. C. Cem Say: Language Recognition by Generalized Quantum Finite Automata with Unbounded Error. CoRR abs/0901.2703 (2009)

Abuzer Yakaryilmaz, A. C. Cem Say: Quantum Finite Automata with One-Sided Unbounded Error. CoRR abs/0902.2081 (2009)

Abuzer Yakaryilmaz, A. C. Cem Say: Succinctness of two-way probabilistic and quantum finite automata. CoRR abs/0903.0050 (2009)

2008

Abuzer Yakaryilmaz, A. C. Cem Say: Languages recognized with unbounded error by quantum finite automata. CoRR abs/0809.0073 (2008)

2006

j13

Özgür Yilmaz, A. C. Cem Say: Causes of Ineradicable Spurious Predictions in Qualitative Simulation. J. Artif. Intell. Res. (JAIR) 27: 551-575 (2006)

Evgeniya Khusnitdinova, A. C. Cem Say: Problems of Adiabatic Quantum Program Design. ISCIS 2006: 1040-1049

2005

j12

A. C. Cem Say, A. Kutsi Nircan: Random generation of monotonic functions for Monte Carlo solution of qualitative differential equations. Automatica 41(5): 739-754 (2005)

2004

A. C. Cem Say, Özlem Çetinoglu, Seniz Demir, Faith Ögün: A Natural Language Processing Infrastructure for Turkish. COLING 2004

F. Canan Pembe, A. C. Cem Say: A Linguistically Motivated Information Retrieval System for Turkish. ISCIS 2004: 741-750

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

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)

Tolga Könik, A. C. Cem Say: Duration Consistency Filtering for Qualitative Simulation. Ann. Math. Artif. Intell. 38(4): 269-309 (2003)

2002

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

A. C. Cem Say: Improved Reasoning About Infinity Using Qualitative Simulation. Computers and Artificial Intelligence 20(5) (2001)

A. C. Cem Say: Understanding Arithmetic Problems in Turkish. IJPRAI 15(2): 359-374 (2001)

1999

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

A. C. Cem Say: L'Hôpital's Filter for QSIM. IEEE Trans. Pattern Anal. Mach. Intell. 20(1): 1-8 (1998)

1997

A. C. Cem Say, Selahattin Kuru: Postdiction using reverse qualitative simulation. IEEE Transactions on Systems, Man, and Cybernetics, Part A 27(1): 84-95 (1997)

1996

A. C. Cem Say, Selahattin Kuru: Qualitative System Identification: Deriving Structure from Behavior. Artif. Intell. 83(1): 75-141 (1996)

1993

A. C. Cem Say, Selahattin Kuru: Improved Filtering for the QSIM Algorithm. IEEE Trans. Pattern Anal. Mach. Intell. 15(9): 967-971 (1993)

1	Ruben Agadzanyan	[j20] [c6] [i5]
2	H. Levent Akin	[j11]
3	Elton Ballhysa	[c1]
4	Seniz Demir	[c3]
5	H. Gökalp Demirci	[i16]
6	Rusins Freivalds	[j20] [j16] [c6] [i5]
7	Evgeniya Khusnitdinova	[c4]
8	Selahattin Kuru	[j3] [j2] [j1]
9	Tolga Könik	[j9]
10	A. Kutsi Nircan	[j12]
11	F. Canan Pembe	[c2]
12	Özlem Salehi	[i18]
13	Nuri Tasdemir	[c8]
14	Abuzer Yakaryilmaz	[j22] [i18] [i17] [j21] [j20] [j19] [c9] [i16] [j18] [c7] [i15] [i14] [i13] [i12] [i11] [i10] [i8] [j17] [j16] [j15] [c6] [i7] [i6] [i5] [j14] [c5] [i4] [i3] [i2] [i1]
15	Özgür Yilmaz	[i9] [j13]
16	Özlem Çetinoglu	[c3]
17	Faith Ögün	[c3]

A. C. Cem Say

Coauthor Index