activity
20242026
collaborators

13 papers

cs.CC2026

On the Structure of Convolution

Huanyi Zhou

The convolution is a central problem in fine-grained complexity, and whether it admits a truly subquadratic algorithm remains open. We study it through tropical polynomi…

cs.IT2026

Strategic Persuasion Through Information Timeliness

Ahmet Bugra Gundogan, Melih Bastopcu

We study a dynamic strategic communication problem in which a sender controls the timing of truthful updates from binary continuous-time Markov sources. The receiver chooses betwee…

cs.IT2026

Timely Information for Strategic Persuasion

Ahmet Bugra Gundogan, Melih Bastopcu

This work investigates a dynamic variant of Bayesian persuasion, in which a strategic sender seeks to influence a receiver's belief over time through controlling the timing of the…

cs.IT2026

Characterizing Information Accuracy in Timeliness-Based Gossip Networks

Emirhan Tekez, Melih Bastopcu, Sinan Gezici

We investigate information accuracy in timeliness-based gossip networks where the source evolves according to a continuous-time Markov chain (CTMC) with states and disseminates…

cs.LG2026

Don't Always Pick the Highest-Performing Model: An Information Theoretic View of LLM Ensemble Selection

Yigit Turkmen, Baturalp Buyukates, Melih Bastopcu

Large language models (LLMs) are often ensembled together to improve overall reliability and robustness, but in practice models are strongly correlated. This raises a fundamental q…

cs.LG2026

Queueing-Aware Optimization of Reasoning Tokens for Accuracy-Latency Trade-offs in LLM Servers

Emre Ozbas, Melih Bastopcu

We consider a single large language model (LLM) server that serves a heterogeneous stream of queries belonging to distinct task types. Queries arrive according to a Poisson pro…