Följ
Gökalp Demirci
Gökalp Demirci
Verifierad e-postadress på cs.uchicago.edu - Startsida
Titel
Citeras av
Citeras av
År
Constant Approximation for Capacitated -Median with -Capacity Violation
G Demirci, S Li
arXiv preprint arXiv:1603.02324, 2016
432016
A divide and conquer algorithm for dag scheduling under power constraints
G Demirci, I Marincic, H Hoffmann
SC18: International Conference for High Performance Computing, Networking …, 2018
112018
Classical and quantum realtime alternating automata.
HG Demirci, M Hirvensalo, K Reinhardt, ACC Say, A Yakaryilmaz
NCMA, 101-114, 2014
92014
The complexity of debate checking
HG Demirci, AC Say, A Yakaryılmaz
Theory of Computing Systems 57 (1), 36-80, 2015
82015
Approximation algorithms for scheduling with resource and precedence constraints
G Demirci, H Hoffmann, DHK Kim
35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), 2018
62018
Debates with small transparent quantum verifiers
A Yakaryilmaz, ACC Say, HG Demirci
International Journal of Foundations of Computer Science 27 (02), 283-300, 2016
62016
Probabilistic verifiers for asymmetric debates
HG Demirci, AC Say, A Yakaryılmaz
arXiv preprint arXiv:1209.5192, 2012
12012
Detecting Privacy-Sensitive Code Changes with Language Modeling
G Demirci, V Murali, I Ahmad, R Rao, GA Aye
2022 IEEE/ACM 19th International Conference on Mining Software Repositories …, 2022
2022
Alternating, private alternating, and quantum alternating realtime automata
A Yakaryılmaz, AC Say, K Reinhardt, M Hirvensalo, G Demirci
Logical Methods in Computer Science 15, 2019
2019
Alternating, private alternating, and quantum alternating realtime automata
G Demirci, M Hirvensalo, K Reinhardt, AC Say, A Yakaryılmaz
arXiv preprint arXiv:1407.0334, 2014
2014
Checking generalized debates with small space and randomness
HG Demirci, AC Say
arXiv preprint arXiv:1211.7346, 2012
2012
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–11