Expertini Research Research

Browse Research Papers

5,449+ open-access research outputs.

✕ Clear
🔍 f. hoffmann 📂 Computer Science 📄 Preprint
Showing 5449 results for "f. hoffmann" in Computer Science · Preprint
Computer Science Preprint PDF DOI

Simpler and Improved Replacement Path Coverings

Davide Bilo, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Martin Schirneck · 2026

An important tool in the design of fault-tolerant graph data structures are $(L,f)$-replacement path coverings (RPCs). An RPC is a family $\mathcal{G}$ of subgraphs of a given graph $G$ such that, for…

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

Hard-to-Sample Distributions from Robust Extractors

Farzan Byramji, Daniel M. Kane, Jackson Morris, Anthony Ostuni · 2026

We provide a unified method for constructing explicit distributions which are difficult for restricted models of computation to generate. Our constructions are based on a new notion of robust extracto…

Read Paper →
Computer Science Preprint PDF DOI

Twisted and Twisted Linearized Reed--Solomon Codes, LCD and ACD MDS constructions

Sanjit Bhowmick, Kuntal Deka, Edgar Martinez-Moro · 2026

We investigate a natural subfamily of twisted linearized Reed--Solomon (TLRS) codes in the sum-rank metric, where the twist is applied only to the constant term. We establish a simple necessary and su…

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

Performance Analysis of Pinching Antenna Systems Enabled NOMA Communications

Xinwei Yue, Xinglun Tao, Jingjing Zhao, Xianfu Lei, Yuanwei Liu, Zhiguo Ding · 2026

Pinching antenna systems (PASS) have the advantages in the perspective of flexible antenna reconfiguration, line-of-sight (LoS) creation, and scalability features. To highlight the ascendancy of PASS,…

Read Paper →
Computer Science Preprint PDF DOI

Spark Policy Toolkit: Semantic Contracts and Scalable Execution for Policy Learning in Spark

Zeyu Bai · 2026

Custom policy-learning pipelines in Spark fail for two coupled systems reasons: rowwise Python execution makes inference impractical, and driver-side candidate materialization makes split search fragi…

Read Paper →
Computer Science Preprint PDF DOI

Computational Complexity of the Interval Ordering Problem

Simeon Pawlowski, Vincent Froese · 2026

We study an interval ordering problem introduced by D\"urr et al. [Discrete Appl. Math. 2012] which is motivated by applications in bioinformatics. The task is to order a given set of n intervals with…

Read Paper →
Computer Science Preprint PDF DOI

Constructive Separations from Gate Elimination

Marco Carmosino, Ngu Dang, Tim Jackman · 2026

Gate elimination is the primary technique for proving explicit lower bounds against general Boolean circuits, including Li and Yang's state-of-the-art $3.1n - o(n)$ bound for affine dispersers (STOC 2…

Read Paper →
Computer Science Preprint PDF DOI

#MakeBeefGreatAgain: A Cross-Platform Analysis of Early #MAHA Discourse

Haoning Xue, Yue Li, Benjamin A. Lyons, Andy J. King · 2026

Make America Healthy Again (MAHA) is a health-related campaign slogan proposed by Robert F. Kennedy Jr. and later incorporated into the political coalition of President Trump. While #MAHA quickly circ…

Read Paper →
Computer Science Preprint PDF DOI

PageGuide: Browser extension to assist users in navigating a webpage and locating information

Tin Nguyen, Thang T. Truong, Runtao Zhou, Trung Bui, Chirag Agarwal, Anh Totti Nguyen · 2026

Users browsing the web daily struggle to quickly locate relevant information in cluttered pages, complete unfamiliar multi-step tasks, and stay focused amid distracting content. State-of-the-art AI as…

Read Paper →
Computer Science Preprint PDF DOI

On the Minimum Distances of Some Families of BCH Codes

Yaqi Chen, Hao Chen, Cunsheng Ding, Huimin Lao · 2026

BCH codes form an important class of cyclic codes, which have applications in communication and data storage systems. Although the BCH bound provides a lower bound on the minimum distance of BCH codes…

Read Paper →
Computer Science Preprint PDF DOI

A Note on Interdiction of Linear Minimization Problems

Yu Cong, Kangyi Tian · 2026

Motivated by the FPTAS for connectivity interdiction of Huang et al. (IPCO'24), we isolate the part of the argument that does not use cuts. The setting is a minimization problem over a feasible-set fa…

Read Paper →
Computer Science Preprint PDF DOI

UNSEEN: A Cross-Stack LLM Unlearning Defense against AR-LLM Social Engineering Attacks

Tianlong Yu, Yang Yang, Xiao Luo, Lihong Liu, Fudu Xing, Zui Tao, Kailong Wang, Gaoyang Liu, Ting Bi · 2026

Emerging AR-LLM-based Social Engineering attack (e.g., SEAR) is at the edge of posing great threats to real-world social life. In such AR-LLM-SE attack, the attacker can leverage AR (Augmented Reality…

Read Paper →
Computer Science Preprint PDF DOI

On the hull of linearized polynomial codes

Daniele Bartoli, Giovanni Giuseppe Grimaldi, Pantelimon Stanica · 2026

Motivated by entanglement-assisted quantum error-correcting codes, where the hull dimension determines the number of required pre-shared entangled pairs, we study hulls of two families of $\mathbb{F}_…

Read Paper →
Computer Science Preprint PDF DOI

Counting All Lattice Rectangles in the Square Grid in Near-Linear Time

Dmitry Babichev, Sergey Babichev · 2026

We study the exact counting problem for all lattice rectangles contained in the square $[0,n)\times[0,n)$, including non-axis-parallel ones. Starting from the standard parametrization by a primitive d…

Read Paper →
Computer Science Preprint PDF DOI

How Hard is it to Decide if a Fact is Relevant to a Query?

Meghyn Bienvenu, Diego Figueira, Pierre Lafourcade · 2026

We consider the following fundamental problem: given a database D, Boolean conjunctive query (CQ) q, and fact f in D, decide whether f is relevant to q wrt. D, i.e., does f belong to a minimal subset …

Read Paper →
Computer Science Preprint PDF DOI

Kernelization Bounds for Constrained Coloring

Ishay Haviv · 2026

We study the kernel complexity of constraint satisfaction problems over a finite domain, parameterized by the number of variables, whose constraint language consists of two relations: the non-equality…

Read Paper →
Computer Science Preprint PDF DOI

Following the Eye-Tracking Evidence: Established Web-Search Assumptions Fail in Carousel Interfaces

Jingwei Kang, Maarten de Rijke, Harrie Oosterhuis · 2026

Carousel interfaces have been the de-facto standard for streaming media services for over a decade. Yet, there has been very little research into user behavior with such interfaces, which thus remains…

Read Paper →
Computer Science Preprint PDF DOI

Mythos and the Unverified Cage: Z3-Based Pre-Deployment Verification for Frontier-Model Sandbox Infrastructure

Dominik Blain · 2026

The April 2026 Claude Mythos sandbox escape exposed a critical weakness in frontier AI containment: the infrastructure surrounding advanced models remains susceptible to formally characterizable arith…

Read Paper →
Page 1 of 273 Next →