Expertini Research Research

Browse Research Papers

6,081+ open-access research outputs.

✕ Clear
🔍 daniel omeiza 📂 Computer Science
Showing 6081 results for "daniel omeiza" in Computer Science
Computer Science Preprint PDF DOI

Distributed Santa Claus via Global Rounding

Tijn de Vos, Leo Wennmann, Malte Baumecker, Yannic Maus, Florian Schager · 2026

In this paper, we consider the Santa Claus problem in the CONGEST model. This NP-hard problem can be modeled as a bipartite graph of children and gifts where an edge indicates that a child desires a g…

Read Paper →
Computer Science Preprint PDF DOI

A Generalisation of Goursat's Algorithm for Integration in Finite Terms

Sam Blake · 2026

We give a self-contained, modern exposition of \'Edouard Goursat's 1887 theorem on pseudo-elliptic integrals -- those integrals of the form $\int F(t)\,\d t/\sqrt{R(t)}$ with $R$ a cubic or quartic po…

Read Paper →
Computer Science Preprint PDF DOI

Truthful-in-Expectation Mechanisms for MMS Approximation

Moshe Babaioff, Uriel Feige, Noam Manaker Morag · 2026

We study fair allocation of indivisible goods among strategic agents with additive valuations. Motivated by impossibility results for deterministic truthful mechanisms, we focus on randomized mechanis…

Read Paper →
Computer Science Preprint PDF DOI

Improved Approximation Algorithm for Maximum Balanced Biclique

Pasin Manurangsi · 2026

We study the Maximum Balanced Biclique (MBB) problem: Given a bipartite graph $G$ with $n$ vertices on each side, find a balanced biclique in $G$ with maximum size. We give a polynomial-time $\left(\f…

Read Paper →
Computer Science Preprint PDF DOI

Online Monotone Metric Embeddings

Christian Coester, Yichen Huang · 2026

Metric embeddings into structured spaces, particularly hierarchically well-separated trees (HSTs), are a fundamental tool in the design of online algorithms. In the classical online embedding setting,…

Read Paper →
Computer Science Preprint PDF DOI

On (In)approximability of MaxMin Independent Set Reconfiguration

Hung P. Hoang, Naoto Ohsaka, Rin Saito, Yuma Tamura · 2026

In the Independent Set Reconfiguration problem under the Token Addition/Removal rule, given a graph $G$ and two independent sets $I$ and $J$ of $G$, we want to transform $I$ into $J$ by adding and rem…

Read Paper →
Computer Science Preprint PDF DOI

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width

Benjamin Bergougnoux, Vera Chekan, Stefan Kratsch · 2026

In this work we contribute to the study of the fine-grained complexity of problems parameterized by multi-clique-width, which was initiated by F\"urer [ITCS 2017] and pursued further by Chekan and Kra…

Read Paper →
Computer Science Preprint PDF DOI

Embedded Rust or C Firmware? Lessons from an Industrial Microcontroller Use Case with Ariel OS

Bipin Thapa, Daniele Alfonso, Lorenzo Bini, Licio Mapelli, Kaspar Schleiser, Romain Fouquet, Emmanuel Baccelli · 2026

As Rust gains traction for developing safer systems software, a reality check for the microcontroller hardware segment becomes necessary. How ready is the Rust ecosystem for this segment? Can Rust com…

Read Paper →
Computer Science Preprint PDF DOI

Positional Properties in Temporal Logic

Jessica Newman, Benjamin Plummer · 2026

We study positional properties in the context of game-based reactive synthesis. Our motivation stems from having a usable specification logic, for which tractable synthesis is guaranteed. We demonstra…

Read Paper →
Computer Science Preprint PDF DOI

Densification Converses for Walker Constellations With Explicit Constants and Reuse Scaling Laws

Ali Khalesi, Francois Baccelli · 2026

We establish densification converses for Walker LEO constellations under nearest-visible association in the full-frequency-reuse setting. Performance is evaluated under the invariant (stationary) meas…

Read Paper →
Computer Science Preprint PDF DOI

The Polynomial Hierarchy and $\omega$-categorical CSPs

Santiago Guzman Pro, Jakub Rydval · 2026

In 2008, Bodirsky and Grohe showed that for every $\Pi_n^{\mathrm{P}}$-level of the Polynomial Hierarchy (PH) there are $\omega$-categorical Constraint Satisfaction Problems (CSPs) complete for this l…

Read Paper →
Computer Science Preprint PDF DOI

A Theory of Hanoi Omega-Automata and Games

Emmanuel Filiot, Allen Joseph, Guillermo A. Perez, Saina Sunny · 2026

The Hanoi Omega-Automata (HOA) format has established itself as the definitive standard for encoding $\omega$-regular automata in modern synthesis tools. While HOA is widely adopted due to its succinc…

Read Paper →
Computer Science Preprint PDF DOI

Dynamic Grammar-Compressed Self-Index in $\delta$-Optimal Space

Takaaki Nishimoto, Yasuo Tabei · 2026

A compressed self-index stores a string in compressed form while supporting locate queries without decompression. For highly repetitive strings (arising in web crawls, versioned documents, and genomic…

Read Paper →
Computer Science Preprint PDF DOI

The Vehicle May Be Sick: Denial of Diagnostic Services by Exploiting the CAN Transport Protocol

Seungjin Baek, Seonghoon Jeong, Huy Kang Kim · 2026

Vehicle diagnostics has become essential for detecting in-vehicle errors and ensuring safety. While the Unified Diagnostic Services (UDS) protocol is widely adopted for diagnostic operations, it relie…

Read Paper →
Computer Science Preprint PDF DOI

Bowties and Hourglasses: Intersections of Double-Wedges (or Stabbing and Avoiding Line Segments)

Daniel Bertschinger, Henry Forster, Fabian Klute, Irene Parada, Patrick Schnider, Birgit Vogtenhuber · 2026

We study the common intersection of arrangements of double-wedges. We consider arrangements where double-wedges may be either bowties (which do not contain a vertical line) or hourglasses (which conta…

Read Paper →
Computer Science Preprint PDF DOI

Semantic Denial of Service in LLM-controlled robots

Jonathan Steinberg, Oren Gal · 2026

Safety-oriented instruction-following is supposed to keep LLM-controlled robots safe. We show it also creates an availability attack surface. By injecting short safety-plausible phrases (1-5 tokens) i…

Read Paper →
Computer Science Preprint PDF DOI

Peer Identity Bias in Multi-Agent LLM Evaluation: An Empirical Study Using the TRUST Democratic Discourse Analysis Pipeline

Juergen Dietrich · 2026

The TRUST democratic discourse analysis pipeline exposes its large language model (LLM) components to peer model identity through multiple structural channels -- a design feature whose bias implicatio…

Read Paper →
Computer Science Preprint PDF DOI

Multiplex Hypergraph Modeling of Higher Order Structures in Psychometric Networks

Francesca Possenti, Laura Girelli, Paolo Tieri, Manuela Petti · 2026

Psychiatric disorders have been traditionally conceptualized as latent conditions producing observable symptoms, but recent studies suggest that psychopathology may emerge from symptoms interactions. …

Read Paper →
Computer Science Preprint PDF DOI

Cuts and Gauges for Submodular Width

Matthias Lanzinger · 2026

Submodular width is a central structural measure governing the complexity of conjunctive query evaluation. In this paper we recast submodular width in geometric terms. We how that submodular width can…

Read Paper →
Computer Science Preprint PDF DOI

An algebraic characterisation of Eve-positional languages

Thomas Colcombet, Olivier Idir · 2026

We present a new algebraic characterisation of Eve-positionality for $\omega$-regular languages. It involves only a limited number of elementary local properties to be checked. An $\omega$-regular l…

Read Paper →
Page 1 of 305 Next →