Cem Say | Academic Influence

Cem Say's AcademicInfluence.com Rankings

Cem Say

Computer Science

#2163

World Rank

#2249

Historical Rank

Artificial Intelligence

#1307

World Rank

#1331

Historical Rank

Computational Linguistics

#3213

World Rank

#3254

Historical Rank

Machine Learning

#5929

World Rank

#6021

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Cem Say's Degrees

PhD Computer Science University of California, Berkeley
Masters Computer Science University of California, Berkeley
Bachelors Computer Engineering Middle East Technical University

Similar Degrees You Can Earn

Why Is Cem Say Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Ahmet Celal Cem Say is a Turkish theoretical computer scientist and professor of computer science. He is a full time professor at the Boğaziçi University Department of Computer Engineering in Istanbul, Turkey. Cem Say is the author of the QSI algorithm for qualitative system identification, an AI task relevant in the study of qualitative reasoning. His work in complexity theory includes studies on small-space quantum automata and new characterizations of the complexity classes NL and P in terms of verifiers modeled by finite-state machines allowed to use only a fixed number of random bits. He is also known for his advocacy of people wrongly accused with forged digital evidence, and his popular science books.

(See a Problem?)

Cem Say's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Unbounded-error quantum computation with small space bounds (2010) (97)
Succinctness of two-way probabilistic and quantum finite automata (2009) (67)
Quantum Finite Automata: A Modern Introduction (2014) (61)
Languages recognized by nondeterministic quantum finite automata (2009) (58)
Qualitative System Identification: Deriving Structure from Behavior (1996) (55)
L'Hôpital's Filter for QSIM (1998) (46)
Languages Recognized with Unbounded Error by Quantum Finite Automata (2008) (35)
Sound and complete qualitative simulation is impossible (2003) (25)
Quantum computation with write-only memory (2012) (23)
Efficient probability amplification in two-way quantum finite automata (2009) (20)
Improved Filtering for the QSIM Algorithm (1993) (19)
Magic coins are useful for small-space quantum machines (2014) (18)
A new family of nonstochastic languages (2010) (17)
Proving the Power of Postselection (2011) (13)
Quantum Computation with Devices Whose Contents Are Never Read (2010) (13)
Probabilistic and quantum finite automata with postselection (2011) (12)
A Linguistically Motivated Information Retrieval System for Turkish (2004) (12)
Quantum Counter Automata (2011) (11)
Finite State Verifiers with Constant Randomness (2011) (11)
Finite Automata with Advice Tapes (2013) (10)
Language Recognition by Generalized Quantum Finite Automata with Unbounded Error (2009) (10)
Computation with multiple CTCs of fixed length and width (2012) (8)
Debates with Small Transparent Quantum Verifiers (2014) (7)
Improved Reasoning About Infinity Using Qualitative Simulation (2001) (7)
Classical and quantum realtime alternating automata (2014) (7)
Computation with Narrow CTCs (2011) (7)
The Complexity of Debate Checking (2015) (7)
Real-Time Vector Automata (2013) (6)
Optimal Bounds for Estimating Entropy with PMF Queries (2015) (6)
Causes of Ineradicable Spurious Predictions in Qualitative Simulation (2006) (5)
Qualitative system identification (1992) (5)
Tight Bounds for the Space Complexity of Nonregular Language Recognition by Real-Time Machines (2011) (5)
Quantum function computation using sublogarithmic space (abstract & poster) (2010) (5)
Using Inter-Behavior Contradictions for Modeling and Diagnosis (2003) (4)
The Weakness of CTC Qubits and the Power of Approximate Counting (2018) (4)
Postdiction using reverse qualitative simulation (1997) (3)
A Natural Language Processing Infrastructure for Turkish (2004) (3)
Energy Complexity of Regular Language Recognition (2022) (3)
NP has log-space verifiers with fixed-size public quantum registers (2011) (3)
Constant-Space, Constant-Randomness Verifiers with Arbitrarily Small Error (2020) (2)
Extracting and Using Relative Duration Information in Pure Qualitative Simulation (1998) (2)
One time-travelling bit is as good as logarithmically many (2014) (2)
Random generation of monotonic functions for Monte Carlo solution of qualitative differential equations (2005) (2)
Problems in Representing Liquid Tankswith Monotonicity Constraints: A Case Study inModel-Imposed Limitations on the Coverage ofQualitative Simulators (2002) (2)
Language classes associated with automata over matrix groups (2016) (2)
Extended finite automata and decision problems for matrix semigroups (2018) (2)
Quantum Finite Automata with One-Sided Unbounded Error (2009) (2)
Homing vector automata (2015) (2)
Duration Consistency Filtering for Qualitative Simulation (2003) (2)
Models of Pushdown Automata with Reset (2011) (1)
Generalized Results on Monoids as Memory (2017) (1)
Improved Infinity Filtering in Qualitative Simulation (1998) (1)
Probabilistic verifiers for asymmetric debates (2012) (1)
Sound and Complete Qualitative Simulation Needs “Quantitative” Filtering (2003) (1)
A program which solves arithmetic problems in Turkish (1994) (1)
Generating Equiprobable Superpositions of Arbitrary Sets for a New Generalization of the Deutsch-Jozsa Algorithm (2004) (1)
Advice hierarchies among finite automata (2022) (1)
Making Use of Contradictory Behavior Information in Qualitative Reasoning (1999) (1)
Energy Complexity of Regular Languages (2022) (0)
Extracting Duration Facts in Qualitative Simulation using Comparison Calculus (2002) (0)
Checking generalized debates with small space and randomness (2012) (0)
Problems of Adiabatic Quantum Program Design (2006) (0)
The Complexity of Debate Checking (2014) (0)
Inkdots as advice to small-space machines (2015) (0)
Generalization of some hidden subgroup algorithms for input sets of arbitrary size (2006) (0)
Automatic Construction of Qualitative Models (1993) (0)
Inkdots as advice for finite automata (2015) (0)
Real-Time, Constant-Space, Constant-Randomness Verifiers (2022) (0)
Read-once machines and the thermodynamic complexity of Maxwell's demons (2023) (0)
Improved Simulation of Quantum Random Walks (2005) (0)
New Results on Vector and Homing Vector Automata (2019) (0)
Quantum computation with write-only memory (2011) (0)
Understanding Arithmetic Problems in Turkish (2001) (0)
ASSOCIATED WITH AUTOMATA OVER MATRIX GROUPS (2018) (0)
Computation with multiple CTCs of fixed length and width (2012) (0)
Alternating, private alternating, and quantum alternating realtime automata (2014) (0)
Correction to "Proving the power of postselection" (2013) (0)

This paper list is powered by the following services:

Other Resources About Cem Say

en.wikipedia.org

What Schools Are Affiliated With Cem Say?

Cem Say is affiliated with the following schools: