default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDK. Tuncay Tekle
Person information
- affiliation: Stony Brook University, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c10]Yanhong A. Liu, Scott D. Stoller, Yi Tong, K. Tuncay Tekle:
Benchmarking for Integrating Logic Rules with Everything Else. ICLP 2023: 12-26- 2022
- [e1]Yuliya Lierler, José F. Morales, Carmine Dodaro, Verónica Dahl, Martin Gebser, K. Tuncay Tekle:
Proceedings 38th International Conference on Logic Programming, ICLP 2022 Technical Communications / Doctoral Consortium, Haifa, Israel, 31st July 2022 - 6th August 2022. EPTCS 364, 2022 [contents] - [i2]Yanhong A. Liu, Scott D. Stoller, Yi Tong, Bo Lin, K. Tuncay Tekle:
Programming with rules and everything else, seamlessly. CoRR abs/2205.15204 (2022)
2010 – 2019
- 2019
- [c9]K. Tuncay Tekle, Yanhong A. Liu:
Extended Magic for Negation: Efficient Demand-Driven Evaluation of Stratified Datalog with Precise Complexity Guarantees. ICLP Technical Communications 2019: 241-254 - 2018
- [p1]David Maier, K. Tuncay Tekle, Michael Kifer, David Scott Warren:
Datalog: concepts, history, and outlook. Declarative Logic Programming 2018: 3-100 - 2016
- [j1]K. Tuncay Tekle, Yanhong A. Liu:
Precise complexity guarantees for pointer analysis via Datalog with extensions. Theory Pract. Log. Program. 16(5-6): 916-932 (2016) - [i1]K. Tuncay Tekle, Yanhong A. Liu:
Precise Complexity Guarantees for Pointer Analysis via Datalog with Extensions. CoRR abs/1608.01594 (2016) - 2011
- [c8]K. Tuncay Tekle, Yanhong A. Liu:
More efficient datalog queries: subsumptive tabling beats magic sets. SIGMOD Conference 2011: 661-672 - 2010
- [c7]Michael Gorbovitski, Yanhong A. Liu, Scott D. Stoller, Tom Rothamel, K. Tuncay Tekle:
Alias analysis for optimization of dynamic languages. DLS 2010: 27-42 - [c6]K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. Liu:
Graph queries through datalog optimizations. PPDP 2010: 25-34 - [c5]K. Tuncay Tekle, Yanhong A. Liu:
Precise complexity analysis for efficient datalog queries. PPDP 2010: 35-44
2000 – 2009
- 2008
- [c4]K. Tuncay Tekle, Katia Hristova, Yanhong A. Liu:
Generating Specialized Rules and Programs for Demand-Driven Analysis. AMAST 2008: 346-361 - [c3]Michael Gorbovitski, K. Tuncay Tekle, Tom Rothamel, Scott D. Stoller, Yanhong A. Liu:
Analysis and Transformations for Efficient Query-Based Debugging. SCAM 2008: 174-183 - 2007
- [c2]Katia Hristova, K. Tuncay Tekle, Yanhong A. Liu:
Efficient trust management policy analysis from rules. PPDP 2007: 211-220 - 2005
- [c1]K. Tuncay Tekle, Hasan Ural, M. Cihan Yalcin, Hüsnü Yenigün:
Generalizing Redundancy Elimination in Checking Sequences. ISCIS 2005: 915-926
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 2024-04-24 23:14 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
