Expertini Research Research

Browse Research Papers

7,444+ open-access research outputs.

✕ Clear
🔍 f. loeser 📂 Computer Science
Showing 7444 results for "f. loeser" in Computer Science
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

Cross-lingual Comparison of Research Funding Projects with Multilingual Sentence-BERT: Evidence from KAKENHI, NIH, NSF, and UKRI

Miki Kimura-Ida · 2026

Cross-national comparison of research funding projects is increasingly important for science policy and strategic planning, but language differences remain a major obstacle. In particular, KAKENHI pro…

Read Paper →
Computer Science Preprint PDF DOI

Counting own goals: High-level assessment of the economic relationship between the ICT and the Oil and Gas sectors and its environmental implications

Gauthier Roussilhe, Beatrice Dromard, Srinjoy Mitra · 2026

The ICT sector has been one of the most successful and fastest-growing industry in history. While the environmental issue in this sector has mainly been addressed by assessing its footprint and, to a …

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

Hierarchies of No-regret Algorithms

R. Xu, E. Yachbes, J. Zhang · 2026

Our paper studies the setting of players using no-regret algorithms in various two-player games. We address whether having stronger regret guarantees or playing against an opponent with weaker regret …

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

Knowledge Lever Risk Management for Software Engineering: A Stochastic Framework for Mitigating Knowledge Loss

Mark Chua, Samuel Ajila · 2026

Software engineering (SE) organizations operate in a knowledge-intensive domain where critical assets -- architectural expertise, design rationale, and system intuition -- are overwhelmingly tacit and…

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 →
Page 1 of 373 Next →