Expertini Research Research

Browse Research Papers

11,769+ open-access research outputs.

โœ• Clear
๐Ÿ” john p. cunningham ๐Ÿ“‚ Computer Science
Showing 11769 results for "john p. cunningham" in Computer Science
Computer Science Preprint PDF DOI

SimEval-IR: A Unified Toolkit and Benchmark Suite for Evaluating User Simulators and Search Sessions

Saber Zerhoudi ยท 2026

User simulators are increasingly central to interactive information retrieval, yet the community lacks standardized evaluation tools. Simulators serve two objectives, behavioral realism (matching realโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Toward a Characterization of Simulation Between Arithmetic Theories

Hunter Monroe ยท 2026

We study when a sound arithmetic theory $\mathcal S{\supseteq}S^1_2$ with polynomial-time decidable axioms efficiently proves the bounded consistency statements $Con_{\mathcal S{+}\phi}(n)$ for a trueโ€ฆ

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

Solving Hypergraph Laplacian Systems in Almost-Linear Time

Yuichi Yoshida ยท 2026

For a connected weighted hypergraph, we give a randomized almost-linear-time solver for the Poisson problem for the cut-based hypergraph Laplacian in the natural input size $P=\sum_{e\in E}|e|$, the sโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm

Shisheng Li ยท 2026

Buchbinder and Feldman recently gave a deterministic $(1-1/e-\varepsilon)$-approximation for maximizing a non-negative monotone submodular function subject to a matroid constraint, with query complexiโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem

Lucas Meijer, Till Miltzow, Johanna Ockenfels, Milos Stojakovic ยท 2026

In the (Nesting) Bird Box Problem we are given a polygonal domain P and a number k and we want to know if there is a set B of k points inside P such that no two points in B can see each other. The undโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

On the Complexity of Robust Markov Decision Processes and Bisimulation Metrics

Marnix Suilen, Guillermo A. Perez ยท 2026

Robust Markov decision processes (RMDPs) extend standard Markov decision processes (MDPs) to account for uncertainty in the transition probabilities. RMDPs have an uncertainty set that defines a set oโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

A Sufficient-Statistic Reduction of the Information Bottleneck to a Low-Dimensional Problem

Joss Armstrong ยท 2026

We show that if the conditional distribution p(C | T) factors through a sufficient statistic {\phi}(T), then the Information Bottleneck (IB) problem for (T, C) is exactly equivalent to the IB problem โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Comparing Smart Contract Paradigms: A Preliminary Study of Security and Developer Experience

Matteo Vaccargiu, Andrea Pinna, Maria Ilaria Lunesu, Giuseppe Destefanis ยท 2026

Smart contract vulnerabilities have caused billions in financial losses, raising questions about whether programming language paradigms can reduce security overhead. While imperative languages like Soโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

When to Retrieve During Reasoning: Adaptive Retrieval for Large Reasoning Models

Dongxin Guo, Jikun Wu, Siu Ming Yiu ยท 2026

Large reasoning models such as DeepSeek-R1 and OpenAI o1 generate extended chains of thought spanning thousands of tokens, yet their integration with retrieval-augmented generation (RAG) remains fundaโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

An Empirical Security Evaluation of LLM-Generated Cryptographic Rust Code

Mohamed Elsayed, Kenneth Fulton, Jeong Yang ยท 2026

Developers and organizations are using Large Language Models (LLMs) to generate security-critical code more frequently than ever, including cryptographic solutions for their products. This study preseโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Recurrence-Based Nonlinear Vocal Dynamics as Digital Biomarkers for Depression Detection from Conversational Speech

Himadri S Samanta ยท 2026

Digital biomarkers for depression have largely relied on static acoustic descriptors, pooled summary statistics, or conventional machine learning representations. Such approaches may miss nonlinear teโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

LLM-Guided Issue Generation from Uncovered Code Segments

Diany Pressato, Honghao Tan, Mariam Elmoazen, Shin Hwei Tan ยท 2026

Developers are increasingly overwhelmed by AI-generated issue reports that lack actionability and reproducibility, eroding trust in automated bug detection tools. In this paper, we present IssueSpecteโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Two Efficient Message-passing Exclusive Scan Algorithms

Jesper Larsson Traff ยท 2026

Parallel scan primitives compute element-wise inclusive or exclusive prefix sums of input vectors contributed by $p$ consecutively ranked processors under an associative, possibly expensive, binary opโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Testing Robustness of Temporal Transportation Networks via Interval Separators

Riccardo Dondi, Mohammad Mehdi Hosseinzadeh ยท 2026

This paper addresses the problem of identifying time interval separators in temporal networks. We introduce d-MinIntSep, a new variant of the temporal separator problem, which models failures as time โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

On the Minimum Distances of Some Families of Goppa Codes and BCH Codes

Yaqi Chen, Hao Chen, Cunsheng Ding, Huimin Lao ยท 2026

Goppa codes form an important class of alternant codes with wide applications in algebraic coding theory and code-based cryptography. Determining the true minimum distance of a Goppa code is a difficuโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

People, IT, and Structuration (PIS): An Integrative Theoretical Framework for Management Information Systems

Wei Huang, Xiaofang Cai, Qiaozhen Guo, Xiaosong Wu, Xin Tang ยท 2026

The Management Information Systems (MIS) discipline has long grappled with how to theorize the complex, mutually constitutive relationships among people, information technology, and organizational strโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

On the Average-Case Performance of Greedy for Maximum Coverage

Eric Balkanski, Jason Chatzitheodorou, Flore Sentenac ยท 2026

For the classical maximum coverage problem, the greedy algorithm achieves a worst-case $1-1/e$ approximation, which is optimal unless $\text{P} = \text{NP}$. The notion of coverage appears in a wide rโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Verification of Correlated Equilibria in Concurrent Reachability Games

Senthil Rajasekaran, Jean-Francois Raskin, Moshe Y. Vardi ยท 2026

As part of an effort to apply the rigorous guarantees of formal verification to multi-agent systems, the field of equilibrium analysis, also called rational verification, studies equilibria in multiplโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Measuring the Unmeasurable: Markov Chain Reliability for LLM Agents

Phat T. Tran-Truong, Xuan-Bach Le ยท 2026

Large language model (LLM) agents increasingly operate as sequential software systems, but their reliability is often summarized by scalar benchmark metrics. Metrics such as pass$@k$, pass$^k$, and thโ€ฆ

Read Paper โ†’
Page 1 of 589 Next โ†’