default search action
Ahmet Kara 0002
Person information
- affiliation: University of Zurich, Switzerland
- affiliation (former): University of Oxford, UK
- affiliation (former): TU Dortmund, Germany
Other persons with the same name
- Ahmet Kara 0001
— Middle East Technical University, Ankara, Turkey (and 1 more)
- Ahmet Kara 0003
- Ahmet Kara 0004
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [c17]Ahmet Kara, Zheng Luo, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Tractable Conjunctive Queries over Static and Dynamic Relations. ICDT 2025: 12:1-12:21 - [e1]Sudeepa Roy
28th International Conference on Database Theory, ICDT 2025, March 25-28, 2025, Barcelona, Spain. LIPIcs 328, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2025, ISBN 978-3-95977-364-5 [contents] - [i20]Omer Abramovich, Daniel Deutch, Nave Frost, Ahmet Kara, Dan Olteanu:
Advancing Fact Attribution for Query Answering: Aggregate Queries and Novel Algorithms. CoRR abs/2506.16923 (2025) - 2024
- [j8]Ahmet Kara
From Shapley Value to Model Counting and Back. Proc. ACM Manag. Data 2(2): 79 (2024) - [j7]Omer Abramovich
Banzhaf Values for Facts in Query Answering. Proc. ACM Manag. Data 2(3): 123 (2024) - [j6]Mahmoud Abo Khamis
Insert-Only versus Insert-Delete in Dynamic Query Evaluation. Proc. ACM Manag. Data 2(5): 219:1-219:26 (2024) - [j5]Ahmet Kara
F-IVM: analytics over relational databases under updates. VLDB J. 33(4): 903-929 (2024) - [i19]Ahmet Kara
Tractable Conjunctive Queries over Static and Dynamic Relations. CoRR abs/2404.16224 (2024) - [i18]Mahmoud Abo Khamis, Ahmet Kara, Dan Olteanu, Dan Suciu:
Output-Sensitive Evaluation of Regular Path Queries. CoRR abs/2412.07729 (2024) - 2023
- [j4]Ahmet Kara
Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries. Log. Methods Comput. Sci. 19(3) (2023) - [j3]Junxiong Wang, Immanuel Trummer
ADOPT: Adaptively Optimizing Attribute Orders for Worst-Case Optimal Join Algorithms via Reinforcement Learning. Proc. VLDB Endow. 16(11): 2805-2817 (2023) - [j2]Junxiong Wang, Mitchell Gray, Immanuel Trummer, Ahmet Kara
Demonstrating ADOPT: Adaptively Optimizing Attribute Orders for Worst-Case Optimal Joins via Reinforcement Learning. Proc. VLDB Endow. 16(12): 4094-4097 (2023) - [c16]Ahmet Kara
Evaluation Trade-Offs for Acyclic Conjunctive Queries. CSL 2023: 29:1-29:20 - [c15]Ahmet Kara
Conjunctive Queries with Free Access Patterns Under Updates. ICDT 2023: 17:1-17:20 - [i17]Ahmet Kara
F-IVM: Analytics over Relational Databases under Updates. CoRR abs/2303.08583 (2023) - [i16]Ahmet Kara, Dan Olteanu, Dan Suciu:
From Shapley Value to Model Counting and Back. CoRR abs/2306.14211 (2023) - [i15]Junxiong Wang, Immanuel Trummer, Ahmet Kara
ADOPT: Adaptively Optimizing Attribute Orders for Worst-Case Optimal Join Algorithms via Reinforcement Learning. CoRR abs/2307.16540 (2023) - [i14]Omer Abramovich, Daniel Deutch, Nave Frost, Ahmet Kara
Banzhaf Values for Facts in Query Answering. CoRR abs/2308.05588 (2023) - [i13]Mahmoud Abo Khamis, Ahmet Kara
Insert-Only versus Insert-Delete in Dynamic Query Evaluation. CoRR abs/2312.09331 (2023) - 2022
- [i12]Ahmet Kara
Conjunctive Queries with Output Access Patterns under Updates. CoRR abs/2206.09032 (2022) - 2021
- [c14]Ahmet Kara
Machine learning over static and dynamic relational data. DEBS 2021: 160-163 - [i11]Ahmet Kara, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Machine Learning over Static and Dynamic Relational Data. CoRR abs/2107.13923 (2021) - 2020
- [j1]Ahmet Kara
Maintaining Triangle Queries under Updates. ACM Trans. Database Syst. 45(3): 11:1-11:46 (2020) - [c13]Ahmet Kara
Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries. PODS 2020: 375-392 - [c12]Milos Nikolic
F-IVM: Learning over Fast-Evolving Relational Data. SIGMOD Conference 2020: 2773-2776 - [i10]Ahmet Kara, Milos Nikolic, Hung Q. Ngo, Dan Olteanu, Haozhe Zhang:
Maintaining Triangle Queries under Updates. CoRR abs/2004.03716 (2020) - [i9]Milos Nikolic, Haozhe Zhang, Ahmet Kara, Dan Olteanu:
F-IVM: Learning over Fast-Evolving Relational Data. CoRR abs/2006.00694 (2020)
2010 – 2019
- 2019
- [c11]Ahmet Kara
Counting Triangles under Updates in Worst-Case Optimal Time. ICDT 2019: 4:1-4:18 - [i8]Iman Elghandour, Ahmet Kara, Dan Olteanu, Stijn Vansummeren:
Incremental Techniques for Large-Scale Dynamic Query Processing. CoRR abs/1902.00585 (2019) - [i7]Ahmet Kara, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries. CoRR abs/1907.01988 (2019) - 2018
- [c10]Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, Haozhe Zhang
Counting Triangles under Updates. AMW 2018 - [c9]Iman Elghandour, Ahmet Kara
Incremental Techniques for Large-Scale Dynamic Query Processing. CIKM 2018: 2297-2298 - [c8]Ahmet Kara
Covers of Query Results. ICDT 2018: 16:1-16:22 - [i6]Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Counting Triangles under Updates in Worst-Case Optimal Time. CoRR abs/1804.02780 (2018) - 2017
- [i5]Ahmet Kara, Dan Olteanu:
Covers of Query Results. CoRR abs/1709.01600 (2017) - 2016
- [b1]Ahmet Kara:
Logics on data words: Expressivity, satisfiability, model checking. Technical University of Dortmund, Germany, 2016 - 2015
- [c7]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmet Kara, Othmane Rezine:
Verification of Buffered Dynamic Register Automata. NETYS 2015: 15-31 - 2014
- [c6]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmet Kara, Othmane Rezine:
Verification of Dynamic Register Automata. FSTTCS 2014: 653-665 - 2013
- [c5]Benedikt Bollig, Aiswarya Cyriac
Dynamic Communicating Automata and Branching High-Level MSCs. LATA 2013: 177-189 - 2012
- [c4]Ahmet Kara, Thomas Schwentick, Tony Tan:
Feasible Automata for Two-Variable Logic with Successor on Data Words. LATA 2012: 351-362 - 2011
- [c3]Ahmet Kara, Thomas Schwentick:
Expressiveness of Hybrid Temporal Logic on Data Words. M4M/LAMAS 2011: 115-128 - [i4]Ahmet Kara, Thomas Schwentick, Tony Tan:
Feasible Automata for Two-Variable Logic with Successor on Data Words. CoRR abs/1110.1221 (2011) - 2010
- [c2]Ahmet Kara, Thomas Schwentick, Thomas Zeume:
Temporal Logics on Words with Multiple Data Values. FSTTCS 2010: 481-492 - [i3]Ahmet Kara, Thomas Schwentick, Thomas Zeume:
Temporal Logics on Words with Multiple Data Values. CoRR abs/1010.1139 (2010) - [i2]Ahmet Kara, Tony Tan:
Extending Büchi Automata with Constraints on Data Values. CoRR abs/1012.5439 (2010)
2000 – 2009
- 2009
- [c1]Ahmet Kara, Volker Weber, Martin Lange, Thomas Schwentick:
On the Hybrid Extension of CTL and CTL+. MFCS 2009: 427-438 - [i1]Ahmet Kara, Martin Lange, Thomas Schwentick, Volker Weber:
On the Hybrid Extension of CTL and CTL+. CoRR abs/0906.2541 (2009)
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 2025-07-13 19:35 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: