A. C. Cem Say

640 total citations
27 papers, 203 citations indexed

About

A. C. Cem Say is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, A. C. Cem Say has authored 27 papers receiving a total of 203 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Artificial Intelligence, 12 papers in Computational Theory and Mathematics and 9 papers in Computer Networks and Communications. Recurrent topics in A. C. Cem Say's work include AI-based Problem Solving and Planning (9 papers), semigroups and automata theory (8 papers) and Machine Learning and Algorithms (8 papers). A. C. Cem Say is often cited by papers focused on AI-based Problem Solving and Planning (9 papers), semigroups and automata theory (8 papers) and Machine Learning and Algorithms (8 papers). A. C. Cem Say collaborates with scholars based in Türkiye, Latvia and United States. A. C. Cem Say's co-authors include Abuzer Yakaryılmaz, H. Levent Akın, Rūsiņš Freivalds, Hüseyin Demirci, Ömer Yılmaz, Uğur Küçük and Ryan O’Donnell and has published in prestigious journals such as IEEE Transactions on Pattern Analysis and Machine Intelligence, Artificial Intelligence and Artificial Intelligence Review.

In The Last Decade

A. C. Cem Say

23 papers receiving 190 citations

Peers

Countries citing papers authored by A. C. Cem Say

Since Specialization

Citations

This map shows the geographic impact of A. C. Cem Say's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by A. C. Cem Say with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites A. C. Cem Say more than expected).

Fields of papers citing papers by A. C. Cem Say

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by A. C. Cem Say. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by A. C. Cem Say. The network helps show where A. C. Cem Say may publish in the future.

Co-authorship network of co-authors of A. C. Cem Say

This figure shows the co-authorship network connecting the top 25 collaborators of A. C. Cem Say. A scholar is included among the top collaborators of A. C. Cem Say based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with A. C. Cem Say. A. C. Cem Say is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Real-time, constant-space, constant-randomness verifiers 2023 ·Theoretical Computer Science ·(unknown), (unknown), (unknown), A. C. Cem Say	0
2	Constant-space, constant-randomness verifiers with arbitrarily small error 2021 ·Information and Computation ·(unknown), A. C. Cem Say	1
3	The Weakness of CTC Qubits and the Power of Approximate Counting 2018 ·Electronic colloquium on computational complexity ·Ryan O’Donnell, A. C. Cem Say	1
4	Debates with Small Transparent Quantum Verifiers 2016 ·International Journal of Foundations of Computer Science ·Abuzer Yakaryılmaz, A. C. Cem Say, Hüseyin Demirci	3
5	Finite state verifiers with constant randomness 2014 ·Logical Methods in Computer Science ·A. C. Cem Say, Abuzer Yakaryılmaz	2
6	FINITE AUTOMATA WITH ADVICE TAPES 2014 ·International Journal of Foundations of Computer Science ·Uğur Küçük, A. C. Cem Say, Abuzer Yakaryılmaz	2
7	QUANTUM COUNTER AUTOMATA 2012 ·International Journal of Foundations of Computer Science ·A. C. Cem Say, Abuzer Yakaryılmaz	5
8	Unbounded-error quantum computation with small space bounds 2011 ·Information and Computation ·Abuzer Yakaryılmaz, A. C. Cem Say	35
9	Quantum computation with write-only memory 2011 ·Natural Computing ·Abuzer Yakaryılmaz, Rūsiņš Freivalds, A. C. Cem Say, (unknown)	10
10	Succinctness of two-way probabilistic and quantum finite automata 2010 ·Discrete Mathematics & Theoretical Computer Science ·Abuzer Yakaryılmaz, A. C. Cem Say	19
11	Efficient probability amplification in two-way quantum finite automata 2009 ·Theoretical Computer Science ·Abuzer Yakaryılmaz, A. C. Cem Say	8
12	Causes of Ineradicable Spurious Predictions in Qualitative Simulation 2006 ·Journal of Artificial Intelligence Research ·Ömer Yılmaz, A. C. Cem Say	1
13	Duration Consistency Filtering for Qualitative Simulation 2003 ·Annals of Mathematics and Artificial Intelligence ·(unknown), A. C. Cem Say	1
14	Sound and complete qualitative simulation is impossible 2003 ·Artificial Intelligence ·A. C. Cem Say, H. Levent Akın	17
15	Problems in Representing Liquid Tankswith Monotonicity Constraints: A Case Study inModel-Imposed Limitations on the Coverage ofQualitative Simulators 2002 ·Artificial Intelligence Review ·A. C. Cem Say	1
16	Improved reasoning about infinity using qualitative simulation 2001 ·Computing and Informatics / Computers and Artificial Intelligence ·A. C. Cem Say	3
17	L'Hopital's filter for QSIM 1998 ·IEEE Transactions on Pattern Analysis and Machine Intelligence ·A. C. Cem Say	37
18	Postdiction using reverse qualitative simulation 1997 ·IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans ·A. C. Cem Say, (unknown)	0
19	Qualitative system identification: deriving structure from behavior 1996 ·Artificial Intelligence ·A. C. Cem Say, (unknown)	34
20	Improved filtering for the QSIM algorithm 1993 ·IEEE Transactions on Pattern Analysis and Machine Intelligence ·A. C. Cem Say, (unknown)	9

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact