Expertini Research Research

Browse Research Papers

448+ open-access research outputs.

✕ Clear
🔍 celeste barnaby 📂 Computer Science
Showing 448 results for "celeste barnaby" in Computer Science
Computer Science Preprint PDF DOI

Reproducible Automated Program Repair Is Hard -- Experiences With the Defects4J Dataset

Adam Krafczyk, Klaus Schmid · 2026

In the research of automated program repair (APR), benchmark datasets consisting of known defects in combination with test suites that indicate the defects are of high importance. They allow for an ev…

Read Paper →
Computer Science Preprint PDF DOI

A simple $(2+\epsilon)$-approximation for knapsack interdiction

Noah Weninger · 2026

In the knapsack interdiction problem, there are $n$ items, each with a non-negative profit, interdiction cost, and packing weight. There is also an interdiction budget and a capacity. The objective is…

Read Paper →
Computer Science Preprint PDF DOI

Coordinatewise Balanced Covering for Linear Gain Graphs, with an Application to Coset-List Min-2-Lin over Powers of Two

Faruk Alpay, Levent Sarioglu · 2026

We study a list-constrained extension of modular equation deletion over powers of two, called Coset-List Min-2-Lin$^{\pm}$ over $\mathbb{Z}/2^d\mathbb{Z}$. Each variable is restricted to a dyadic cose…

Read Paper →
Computer Science Preprint PDF DOI

Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds

Amit Berman, Yaron Shany, Itzhak Tamo · 2026

Products of MDS codes are of major practical importance; for a recent example, they are used in Data Availability Sampling (DAS) in blockchain networks such as Celestia and as part of the Ethereum roa…

Read Paper →
Computer Science Preprint PDF DOI

Don't Let AI Agents YOLO Your Files: Shifting Information and Control to Filesystems for Agent Safety and Autonomy

Shawn Wanxiang Zhong, Junxuan Liao, Jing Liu, Mai Zheng, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau · 2026

AI coding agents operate directly on users' filesystems, where they regularly corrupt data, delete files, and leak secrets. Current approaches force a tradeoff between safety and autonomy: unrestricte…

Read Paper →
Computer Science Preprint PDF DOI

Can we Watermark Low-Entropy LLM Outputs?

Noam Mazor, Andrew Morgan, Rafael Pass · 2026

A recent and exciting thread of work focuses on developing methods for watermarking the output of large language models (LLMs). We focus on provably undetectable watermarking-that is, schemes that do …

Read Paper →
Computer Science Preprint PDF DOI

Shortest Paths in Geodesic Unit-Disk Graphs

Bruce W. Brewer, Haitao Wang · 2026

Let $S$ be a set of $n$ points in a polygon $P$ with $m$ vertices. The geodesic unit-disk graph $G(S)$ induced by $S$ has vertex set $S$ and contains an edge between two vertices whenever their geodes…

Read Paper →
Computer Science Preprint PDF DOI

The Semantic Arrow of Time, Part IV: Why Transactions Fail

Paul Borrill · 2026

This is the fourth of five papers comprising The Semantic Arrow of Time. Parts I-III established that computing's hidden arrow of time is semantic rather than thermodynamic, that bilateral transaction…

Read Paper →
Computer Science Preprint PDF DOI

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation

Guy Blelloch, Andrew Brady, Laxman Dhulipala, Jeremy Fineman, Kishen Gowda, Chase Hutton · 2026

A low out-degree orientation directs each edge of an undirected graph with the goal of minimizing the maximum out-degree of a vertex. In the parallel batch-dynamic setting, one can insert or delete ba…

Read Paper →
Computer Science Preprint PDF DOI

Privacy Control in Conversational LLM Platforms: A Walkthrough Study

Zhuoyang Li, Yanlai Wu, Yao Li, Xinning Gui, Yuhan Luo · 2026

Large language models (LLMs) are increasingly integrated into daily life through conversational interfaces, processing user data via natural language inputs and exhibiting advanced reasoning capabilit…

Read Paper →
Computer Science Preprint PDF DOI

Hardness and Tractability of T_{h+1}-Free Edge Deletion

Ajinkya Gaikwad, Soumen Maity, Leeja R · 2026

We study the parameterized complexity of the T(h+1)-Free Edge Deletion problem. Given a graph G and integers k and h, the task is to delete at most k edges so that every connected component of the res…

Read Paper →
Computer Science Preprint PDF DOI

iTIMO: An LLM-empowered Synthesis Dataset for Travel Itinerary Modification

Zhuoxuan Huang, Yunshan Ma, Hongyu Zhang, Hua Ma, Zhu Sun · 2026

Addressing itinerary modification is crucial for enhancing the travel experience as it is a frequent requirement during traveling. However, existing research mainly focuses on fixed itinerary planning…

Read Paper →
Computer Science Preprint PDF DOI

Evolving with AI: A Longitudinal Analysis of Developer Logs

Agnia Sergeyuk, Eric Huang, Dariia Karaeva, Anastasiia Serova, Yaroslav Golubev, Iftekhar Ahmed · 2026

AI-powered coding assistants are rapidly becoming fixtures in professional IDEs, yet their sustained influence on everyday development remains poorly understood. Prior research has focused on short-te…

Read Paper →
Computer Science Preprint PDF DOI

Dynamic Pattern Matching with Wildcards

Arshia Ataee Naeini, Amir-Parsa Mobed, Masoud Seddighin, Saeed Seddighin · 2026

We study the fully dynamic pattern matching problem where the pattern may contain up to kwildcard symbols, each matching any symbol of the alphabet. Both the text and the pattern are subject to update…

Read Paper →
Computer Science Preprint PDF DOI

A $O^*((2 + \epsilon)^k)$ Time Algorithm for Cograph Deletion Using Unavoidable Subgraphs in Large Prime Graphs

Manuel Lafond, Francis Sarrazin · 2026

We study the parameterized complexity of the Cograph Deletion problem, which asks whether one can delete at most $k$ edges from a graph to make it $P_4$-free. This is a well-known graph modification p…

Read Paper →
Computer Science Preprint PDF DOI

Deletion Considered Harmful

Paul Englefield, Russell Beale · 2025

In a world of information overload, understanding how we can most effectively manage information is crucial to success. We set out to understand how people view deletion, the removal of material no lo…

Read Paper →
Computer Science Preprint PDF DOI

Distributed Places and Safe Net Reduction

Victor Khomenko, Maciej Koutny, Alex Yakovlev · 2025

Being able to find small Petri nets with the same behaviour as formal specifications of concurrent systems benefits both effective verification and practical implementation of such systems. This paper…

Read Paper →
Computer Science Preprint PDF DOI

ByteShield: Adversarially Robust End-to-End Malware Detection through Byte Masking

Daniel Gibert, Felip Manya · 2025

Research has proven that end-to-end malware detectors are vulnerable to adversarial attacks. In response, the research community has proposed defenses based on randomized and (de)randomized smoothing.…

Read Paper →
Computer Science Preprint PDF DOI

Analyzing Deviations from Monotonic Trends through Database Repair

Shunit Agmon, Jonathan Gal, Amir Gilad, Ester Livshits, Or Mutay, Brit Youngmann, Benny Kimelfeld · 2025

Datasets often exhibit violations of expected monotonic trends - for example, higher education level correlating with higher average salary, newer homes being more expensive, or diabetes prevalence in…

Read Paper →
Computer Science Preprint PDF DOI

The Graph-Embedded Hazard Model (GEHM): Stochastic Network Survival Dynamics on Economic Graphs

Diego Vallarino · 2025

This paper develops a nonlinear evolution framework for modelling survival dynamics on weighted economic networks by coupling a graph-based $p$-Laplacian diffusion operator with a stochastic structura…

Read Paper →
Page 1 of 23 Next →