Tuncay Tekle
Visiting Assistant Professor in Computer Science
Stony Brook University

High-level programming languages and efficient implementations. Algorithm design and generation of efficient algorithms from specifications. Query optimization and complexity analysis. Utilizing research and hands-on expertise to make software better in the retail industry via high-quality code that is reliable, fast, and maintainable.

PhD in Computer Science (2010)
Stony Brook University
Advisor: Annie Liu
Thesis: Efficient Datalog Queries with Time and Space Complexity Guarantees.
[PDF]

BSc in Computer Science and Engineering (Minor in Mathematics) (2005)
Sabanci University, Istanbul

Visiting Assistant Professor (2016-...)
Stony Brook University

Software Consultant (2014-...)
Columbus Consulting

Consultant (2010-2013)
LogicBlox

David Maier, K. Tuncay Tekle, Michael Kifer, David S. Warren. The History of Datalog. To appear in Declarative Logic Programming: Theory, Systems, and Applications.

K. Tuncay Tekle, Yanhong A. Liu. Precise complexity guarantees for pointer analysis via Datalog with extensions. Theory and Practice of Logic Programming, 16(5-6):916-932, September 2016. Cambridge University Press.
[PDF] [BibTeX] [arxiv]

K. Tuncay Tekle, Yanhong A. Liu. Precise complexity guarantees for pointer analysis via Datalog with extensions. In Proceedings of the 32nd International Conference on Logic Programming (ICLP) 2016, pages 916–932, New York City, USA, October 2016.
[PDF] [BibTeX] [arxiv]

K. Tuncay Tekle, Yanhong A. Liu. More efficient datalog queries: subsumptive tabling beats magic sets. In Proceedings of the ACM SIGMOD International Conference on Management of Data 2011 (SIGMOD), pages 661–672, Athens, Greece, June 2011.
[PDF] [BibTeX]

K. Tuncay Tekle, Yanhong A. Liu. Precise complexity guarantees for efficient Datalog queries. In Proceedings of the 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP), pages 35–44, Hagenberg, Austria, July 2010.
[PDF] [BibTeX]

K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. Liu. Graph queries through Datalog optimizations. In Proceedings of the 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP), pages 25–34, Hagenberg, Austria, July 2010.
[PDF] [BibTeX]

Michael Gorbovitski, Yanhong A. Liu, Scott D. Stoller, Tom Rothamel, K. Tuncay Tekle. Alias analysis for optimization of dynamic languages. In Proceedings of the 6th Symposium on Dynamic Languages (DLS), pages 27–42, Reno, NV, USA, October 2010.
[PDF] [BibTeX]

Michael Gorbovitski, K. Tuncay Tekle, Tom Rothamel, Scott D. Stoller, Yanhong A. Liu. Analysis and transformations for efficient query-based debugging. In Proceedings of the 8th IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM), pages 174–183, Beijing, China, September 2008.
[PDF] [BibTeX]

K. Tuncay Tekle, Katia Hristova, Yanhong A. Liu. Generating specialized rules and programs for demand-driven analysis. In Proceedings of the 12th International Conference on Algebraic Methodology and Software Technology (AMAST), pages 346–361, Urbana, IL, USA, July 2008.
[PDF] [BibTeX]

Katia Hristova, K. Tuncay Tekle, Yanhong A. Liu. Efficient trust management policy analysis from rules. In Proceedings of the 9th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP), pages 211–220, Wrocław, Poland, July 2007.
[PDF] [BibTeX]

K. Tuncay Tekle, Hasan Ural, M. Cihan Yalcin, Husnu Yenigun. Generalizing redundancy elimination in checking sequences. In Proceedings of the 20th International Symposium on Computer and Information Sciences (ISCIS), pages 915–926, Istanbul, Turkey, October 2005.
[PDF] [BibTeX]