Yannis Tzitzikas

On the Computational Complexity of Problems: Formalizing Sensitivity to Uncertainty and Parametric Complexity Classes

Is the classical question $P \stackrel{?}{=} NP$ the right one for understanding the complexity of real-world computation? Traditional worst-case analysis characterizes complexity solely as a function of input size $n$. Yet tasks whose cost is exponential in general often run in polynomial or even linear time once spec...

Exploiting Mapping Corpora and Expert Knowledge for LLM-based Schema Mapping Generation

Sophocles’ Antigone as a Knowledge Graph through a Hybrid Collaborative Workflow with Ontology-Guided LLM Extraction

This work targets a KG for Sophocles’ Antigone that supports two coupled uses: structured retrieval, through integrity and competency questions expressed in SPARQL over dramatic structure and interpretive annotations; and interactive exploration, through a lightweight read client that navigates lines across languages,...