default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDH. Gökalp Demirci
Person information
- affiliation: University of Chicago, IL, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[i7]Yuhang Zhou, Zhuokai Zhao, Ke Li, Spilios Evmorfos, Gökalp Demirci, Mingyi Wang, Qiao Liu, Qifei Wang, Serena Li, Weiwei Li, Tingting Wang, Mingze Gao, Gedi Zhou, Abhishek Kumar, Xiangjun Fan, Lizhu Zhang, Jiayi Liu:
LLM-Driven Reasoning for Constraint-Aware Feature Selection in Industrial Systems. CoRR abs/2603.24979 (2026)- 2022
- [c6]Gökalp Demirci, Vijayaraghavan Murali, Imad Ahmad, Rajeev Rao, Gareth Ari Aye:
Detecting Privacy-Sensitive Code Changes with Language Modeling. MSR 2022: 761-762
2010 – 2019
- 2019
- [j3]Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say
, Abuzer Yakaryilmaz:
Alternating, private alternating, and quantum alternating realtime automata. Log. Methods Comput. Sci. 15(3) (2019) - 2018
- [c5]Gökalp Demirci, Ivana Marincic, Henry Hoffmann:
A divide and conquer algorithm for DAG scheduling under power constraints. SC 2018: 36:1-36:12 - [c4]Gökalp Demirci, Henry Hoffmann, David H. K. Kim:
Approximation Algorithms for Scheduling with Resource and Precedence Constraints. STACS 2018: 25:1-25:14 - 2016
- [j2]Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci:
Debates with Small Transparent Quantum Verifiers. Int. J. Found. Comput. Sci. 27(2): 283- (2016) - [c3]H. Gökalp Demirci, Shi Li:
Constant Approximation for Capacitated k-Median with (1+epsilon)-Capacity Violation. ICALP 2016: 73:1-73:14 - [i6]H. Gökalp Demirci, Shi Li:
Constant Approximation for Capacitated k-Median with (1 + ε)-Capacity Violation. CoRR abs/1603.02324 (2016) - 2015
- [j1]H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz:
The Complexity of Debate Checking. Theory Comput. Syst. 57(1): 36-80 (2015) - 2014
- [c2]Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci:
Debates with Small Transparent Quantum Verifiers. Developments in Language Theory 2014: 327-338 - [c1]H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz:
Classical and quantum realtime alternating automata. NCMA 2014: 101-114 - [i5]Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci:
Debates with small transparent quantum verifiers. CoRR abs/1405.1655 (2014) - [i4]H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz:
Classical and quantum realtime alternating automata. CoRR abs/1407.0334 (2014) - [i3]H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz:
The Complexity of Debate Checking. Electron. Colloquium Comput. Complex. TR14: Article TR14-016 (2014) - 2012
- [i2]H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz:
Probabilistic verifiers for asymmetric debates. CoRR abs/1209.5192 (2012) - [i1]H. Gökalp Demirci, A. C. Cem Say:
Checking generalized debates with small space and randomness. CoRR abs/1211.7346 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-04-17 01:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
