Back to authors
Ahmet Kara
- Author ID
- o0000-0001-8155-8070
- ORCID
-
0000-0001-8155-8070
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Ostbayerische Technische Hochschule Regensburg
- Pagerank
- 0.083345649
- Overall Rank
- 857 | 96.04%
- Paper Count
- 11
Affiliation Timeline
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing 11 of 11 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 3,187 |
Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries |
2020 |
PODS |
7.5546613e-05 |
| 4,002 |
From Shapley Value to Model Counting and Back |
2024 |
PODS |
6.8607198e-05 |
| 4,699 |
F-IVM: Learning over Fast-Evolving Relational Data |
2020 |
SIGMOD |
6.4633894e-05 |
| 5,793 |
Banzhaf Values for Facts in Query Answering |
2024 |
SIGMOD |
5.9930101e-05 |
| 6,876 |
Insert-Only versus Insert-Delete in Dynamic Query Evaluation |
2024 |
PODS |
5.6586279e-05 |
| 7,367 |
ADOPT: Adaptively Optimizing Attribute Orders for Worst-Case Optimal Join Algorithms via Reinforcement Learning |
2023 |
VLDB |
5.5411636e-05 |
| 8,855 |
Advancing Fact Attribution for Query Answering: Aggregate Queries and Novel Algorithms |
2025 |
VLDB |
5.2638827e-05 |
| 9,410 |
Output-Sensitive Evaluation of Regular Path Queries |
2025 |
PODS |
5.1826718e-05 |
| 10,363 |
Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries |
2026 |
PODS |
4.9793485e-05 |
| 10,377 |
Maintaining Queries under Updates Using Heavy-Light Partitioning of the Input Relations |
2026 |
PODS |
4.9793485e-05 |
| 11,806 |
Demonstrating ADOPT: Adaptively Optimizing Attribute Orders for Worst-Case Optimal Joins via Reinforcement Learning |
2023 |
VLDB |
4.9793485e-05 |
Frequent Co-authors
Co-authored at least 5 papers.
| Co-author |
Shared Papers |
Rank |
Pagerank |
|
Dan Olteanu
|
11 |
126 |
0.34978247 |