Expertini Research Research

Browse Research Papers

20,957+ open-access research outputs.

✕ Clear
🔍 maxime lamothe 📂 Computer Science
Showing 20957 results for "maxime lamothe" in Computer Science
Computer Science Preprint PDF DOI

Computing Equilibrium beyond Unilateral Deviation

Mingyang Liu, Gabriele Farina, Asuman Ozdaglar · 2026

Most familiar equilibrium concepts, such as Nash and correlated equilibrium, guarantee only that no single player can improve their utility by deviating unilaterally. They offer no guarantees against …

Read Paper →
Computer Science Preprint PDF DOI

Succinct Graph Representations and Algorithmic Applications

Ahammed Ullah, Alex Pothen · 2026

We propose new graph representations that exploit dense local structure to improve time and space simultaneously. Given an undirected graph $G$, we define a dual clique cover (DCC) representation of $…

Read Paper →
Computer Science Preprint PDF DOI

The Origins of MEV: Systematic Attribution of Arbitrage Opportunity Creation at Scale

Andrei Seoev, Dmitry Belousov, Anastasiia Smirnova, Ksenia Kurinova, Aleksei Smirnov, Denis Fedyanin, Yury Yanovich · 2026

Maximal Extractable Value (MEV) represents billions of dollars in extracted value that fundamentally shapes blockchain network dynamics and participant incentives. While research has focused on MEV ex…

Read Paper →
Computer Science Preprint PDF DOI

MyoKin3X: A Myoelectric Framework for Full-Hand 3D Force Recording

Charlotte Rohleder, Raul Simpetru, Annika Wunsch, Alessandro Del Vecchio · 2026

Simultaneous multi-directional force measurement across all five digits is essential for studying hand coordination, compensatory forces, and myoelectric control, yet existing systems trade off digit …

Read Paper →
Computer Science Preprint PDF DOI

Semidefinite and linear programming bounds for sum-rank-metric codes and non-existence results

Aida Abiad, Antonina P. Khramova, Sven C. Polak, Ferdinando Zullo · 2026

The sum-rank metric provides a unifying framework that generalizes both the celebrated Hamming and rank metrics, and has found applications in areas such as network coding, distributed storage, and sp…

Read Paper →
Computer Science Preprint PDF DOI

AnTi-MiCS: Analytical Framework for Bounding Time in Embedded Mixed-Criticality Systems

Behnaz Ranjbar, Akash Kumar · 2026

In Mixed-Criticality (MC) systems, although the high Worst-Case Execution Time (WCET) serves as a conservative upper bound representing the task's maximum execution time under all conditions, obtainin…

Read Paper →
Computer Science Preprint PDF DOI

Maximally Diverse Stable Matchings: Optimizing Arbitrary Institutional Objectives

Gergely Csaji, Zhaohong Sun · 2026

Stable matching theory is the foundation of centralized clearinghouses worldwide, from school choice programs to medical residency allocations. However, incorporating complex distributional goals-such…

Read Paper →
Computer Science Preprint PDF DOI

Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility

Leo van Iersel, Mark Jones, Jannik Schestag, Celine Scornavacca, Mathias Weller · 2026

We investigate parameterized algorithms for computing the average-tree phylogenetic diversity (APD) in rooted phylogenetic networks, studying the problem under different structural parameters that cap…

Read Paper →
Computer Science Preprint PDF DOI

Why Self-Supervised Encoders Want to Be Normal

Yuval Domb · 2026

We develop a geometric and information-theoretic framework for encoder-decoder learning built on the Information Bottleneck (IB) principle. Recasting IB as a rate-distortion problem with Kullback-Leib…

Read Paper →
Computer Science Preprint PDF DOI

How Code Representation Shapes False-Positive Dynamics in Cross-Language LLM Vulnerability Detection

Maofei Chen, Laifu Wang, Yue Qin, Yuan Wang, Bo Wu, Dongxin Liu · 2026

How code representation format shapes false positive behaviour in cross-language LLM vulnerability detection remains poorly understood. We systematically vary training intensity and code representatio…

Read Paper →
Computer Science Preprint PDF DOI

From Elastic to Viscoelastic: An EEMD-Enhanced Pulse Transit Time Model for Robust Blood Pressure Estimation

Boyuan Gu, Yijin Yang, Shuaiqi Cheng, Xiaorong Ding · 2026

Cuffless blood pressure (BP) estimation based on Pulse Transit Time (PTT) has emerged as a promising solution for continuous health monitoring. However, conventional models relying on the Moens-Kortew…

Read Paper →
Computer Science Preprint PDF DOI

The Likelihood Ratio Wall: Structural Limits on Accurate Risk Assessment for Rare Violence

Marco Pollanen · 2026

Pretrial risk assessment tools are used on over one million U.S. defendants each year, yet their use for predicting rare violent re-offense faces a basic statistical barrier. We derive a universal pre…

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

Sparse-on-Dense: Area and Energy-Efficient Computing of Sparse Neural Networks on Dense Matrix Multiplication Accelerators

Hyunsung Yoon, Sungju Ryu, Jae-Joon Kim · 2026

As the size of Deep Neural Networks (DNNs) increases dramatically to achieve high accuracy, the DNNs require a large amount of computations and memory footprint. Pruning, which produces a sparse neura…

Read Paper →
Computer Science Preprint PDF DOI

MPI Malleability Validation under Replayed Real-World HPC Conditions

S. Iserte, M. Madon, G. Da, J. Pierson, A. J. Pena · 2026

Dynamic Resource Management (DRM) techniques can be leveraged to maximize throughput and resource utilization in computational clusters. Although DRM has been extensively studied through analytical wo…

Read Paper →
Computer Science Preprint PDF DOI

Rank Distribution and Dynamics of Gram Matrices from Binary m-Sequences with Applications to LCD Codes

Hengfeng Liu, Chunming Tang, Cuiling Fan, Zhengchun Zhou · 2026

The Gram matrix is a classical object formed from the pairwise inner products of a collection of vectors, with fundamental roles in functional analysis, statistics, combinatorics, and coding theory. I…

Read Paper →
Computer Science Preprint PDF DOI

Flashback: A Reversible Bilateral Run-Peeling Decomposition of Strings

Thomas Konstantinovsky, Gur Yaari · 2026

We introduce Flashback, a reversible string decomposition that repeatedly peels the maximal leading and trailing character runs from a sentinel-wrapped input, recording each pair as one bilateral toke…

Read Paper →
Page 1 of 1048 Next →