Checking generalized debates with small space and randomness. - H. Gökalp Demirci; A. C. Cem Say (CoRR, 2012)

Probabilistic verifiers for asymmetric debates - H. Gökalp Demirci; A. C. Cem Say; Abuzer Yakaryilmaz (CoRR, 2012)

Classical and quantum realtime alternating automata. - H. Gökalp Demirci; Mika Hirvensalo; Klaus Reinhardt; A. C. Cem Say; Abuzer Yakaryilmaz (NCMA, 2014)

The Complexity of Debate Checking. - H. Gökalp Demirci; A. C. Cem Say; Abuzer Yakaryilmaz (Electron. Colloquium Comput. Complex., 2014)

Constant Approximation for Capacitated k-Median with (1+epsilon)-Capacity Violation. - H. Gökalp Demirci; Shi Li 001 (ICALP, 2016)

Constant Approximation for Capacitated k-Median with (1 + ε)-Capacity Violation. - H. Gökalp Demirci; Shi Li 001 (CoRR, 2016)

Debates with Small Transparent Quantum Verifiers. - Abuzer Yakaryilmaz; A. C. Cem Say; H. Gökalp Demirci (Int. J. Found. Comput. Sci., 2016)

A divide and conquer algorithm for DAG scheduling under power constraints. - Gökalp Demirci; Ivana Marincic; Henry Hoffmann (SC, 2018)

Approximation Algorithms for Scheduling with Resource and Precedence Constraints. - Gökalp Demirci; Henry Hoffmann; David H. K. Kim (STACS, 2018)

Alternating, private alternating, and quantum alternating realtime automata. - Gökalp Demirci; Mika Hirvensalo; Klaus Reinhardt; A. C. Cem Say; Abuzer Yakaryilmaz (Log. Methods Comput. Sci., 2019)

Detecting Privacy-Sensitive Code Changes with Language Modeling. - Gökalp Demirci; Vijayaraghavan Murali; Imad Ahmad; Rajeev Rao; Gareth Ari Aye (MSR, 2022)