Expertini Research Research

Browse Research Papers

4,664+ open-access research outputs.

✕ Clear
🔍 john corring 📂 Computer Science
Showing 4664 results for "john corring" in Computer Science
Computer Science Preprint PDF DOI

Online Coloring for Graphs of Large Odd Girth

Hirotaka Yoneda, Masataka Yoneda · 2026

We study the problem of online coloring for graphs with large odd girth. The best previously known algorithm uses $O(n^{1/2})$ colors, which was discovered by Kierstead in 1998. This algorithm works w…

Read Paper →
Computer Science Preprint PDF DOI

Libra: Accelerating Socket I/O via Programmable Selective Data Copying

Kairui Zhou, Shengkai Lin, Wei Zhang, Shizhen Zhao · 2026

Layer-7 (L7) proxies are critical to modern cloud-native systems, yet their performance is increasingly bottlenecked by copying entire payloads across the kernel-user boundary. Existing approaches red…

Read Paper →
Computer Science Preprint PDF DOI

Hypencoder Revisited: Reproducibility and Analysis of Non-Linear Scoring for First-Stage Retrieval

Arne Eichholtz, Yongkang Li, Jutte Vijverberg, Tobias Groot, Mohammad Aliannejadi · 2026

The Hypencoder, proposed by Killingback et al., is a retrieval framework that replaces the fixed inner-product scoring function used in standard bi-encoders with a query-specific neural network (the $…

Read Paper →
Computer Science Preprint PDF DOI

Cognitive Atrophy and Systemic Collapse in AI-Dependent Software Engineering

Frank Ginac · 2026

The integration of Large Language Models (LLMs) into the software development lifecycle (SDLC) masks a critical socio-technical failure: Cognitive-Systemic Collapse. This paper introduces "Epistemolog…

Read Paper →
Computer Science Preprint PDF DOI

Using Large Language Models for Black-Box Testing of FMU-Based Simulations

Abdullah Mughees, Gaadha Sudheerbabu, Tanwir Ahmad, Dragos Truscan, Mikael Manng{aa}rd, Kristian Klemets · 2026

We propose a human in the loop approach for black-box testing of Functional Mock-up Units (FMUs) using Large Language Models (LLMs). The goal is to reduce the manual effort in defining test scenarios …

Read Paper →
Computer Science Preprint PDF DOI

Maximum Weight Independent Set in Hereditary Classes of Ordered Graphs

Pawe{l} Rafa{l} Bielinski, Marta Piecyk, Pawe{l} Rzazewski · 2026

The complexity of classical computational problems in graph classes defined by forbidding induced subgraphs is one of the central topics of algorithmic graph theory. Recently, there has been a growi…

Read Paper →
Computer Science Preprint PDF DOI

Coloring for dispersion: A polynomial-time algorithm for cardinality-constrained 2-anticlustering

Nguyen Khoa Tran, Lin Mu, Martin Papenberg, Gunnar W. Klau · 2026

The $k$-Maximum Dispersion Problem with Cardinality Constraints ($k$-MDCC) asks for a partition of a given item set with pairwise dissimilarities into $k$ cardinality-constrained groups such that the …

Read Paper →
Computer Science Preprint PDF DOI

A Theory of Hanoi Omega-Automata and Games

Emmanuel Filiot, Allen Joseph, Guillermo A. Perez, Saina Sunny · 2026

The Hanoi Omega-Automata (HOA) format has established itself as the definitive standard for encoding $\omega$-regular automata in modern synthesis tools. While HOA is widely adopted due to its succinc…

Read Paper →
Computer Science Preprint PDF DOI

Prism-Reranker: Beyond Relevance Scoring -- Jointly Producing Contributions and Evidence for Agentic Retrieval

Dun Zhang · 2026

Modern retrieval pipelines increasingly serve downstream consumers like retrieval-augmented generation (RAG) and autonomous agents that need more than a scalar relevance score. A reranker that only te…

Read Paper →
Computer Science Preprint PDF DOI

LaissezCloud: Continuous Resource Renegotiation for the Public Cloud

Tejas Harith, Antoine Kaufmann · 2026

Public clouds increasingly expose heterogeneous hardware, but their allocation interface remains built around rigid on-demand and spot service classes. This makes it hard to satisfy time-varying tenan…

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

Black-Box Skill Stealing Attack from Proprietary LLM Agents: An Empirical Study

Zihan Wang, Rui Zhang, Yu Liu, Chi Liu, Qingchuan Zhao, Hongwei Li, Guowen Xu · 2026

Large language model (LLM) agents increasingly rely on skills to package reusable capabilities through instructions, tools, and resources. High-quality skills embed expert knowledge, curated workflows…

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

Dynamic Construction of the Lov\'asz Local Lemma

Bernhard Haeupler, Slobodan Mitrovic, Srikkanth Ramachandran, Wen-Horng Sheu, Robert Tarjan · 2026

This paper proves that a wide class of local search algorithms extend as is to the fully dynamic setting with an adaptive adversary, achieving an amortized $\tilde{O}(1)$ number of local-search steps …

Read Paper →
Computer Science Preprint PDF DOI

Fully Dynamic Algorithms for Coloring Triangle-Free Graphs

Sepehr Assadi, Helia Yazdanyar · 2026

A celebrated result of Johansson in graph theory states that every triangle-free graph of maximum degree $\Delta$ can be properly colored with $O(\Delta/\ln\Delta)$ colors, improving upon the "greedy …

Read Paper →
Computer Science Preprint PDF DOI

Scaling Worst-Case Optimal Datalog to GPUs

Yihao Sun, Kunting Qi, Thomas Gilray, Sidharth Kumar, Kristopher Micinski · 2026

Datalog is a declarative logic-programming language used for complex analytic reasoning workloads such as program analysis and graph analytics. Datalog's popularity is due to its unique price-point, m…

Read Paper →
Computer Science Preprint PDF DOI

3DPipe: A Pipelined GPU Framework for Scalable Generalized Spatial Join over Polyhedral Objects

Lyuheng Yuan, Da Yan, Akhlaque Ahmad, Fusheng Wang · 2026

Spatial join is a fundamental operation in spatial databases. With the rapid growth of 3D data in applications such as LiDAR-based object detection and 3D digital pathology, there is an increasing nee…

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

Bayesian Active Learning with Gaussian Processes Guided by LLM Relevance Scoring for Dense Passage Retrieval

Junyoung Kim, Anton Korikov, Jiazhou Liang, Justin Cui, Yifan Simon Liu, Qianfeng Wen, Mark Zhao, Scott Sanner · 2026

While Large Language Models (LLMs) exhibit exceptional zero-shot relevance modeling, their high computational cost necessitates framing passage retrieval as a budget-constrained global optimization pr…

Read Paper →
Computer Science Preprint PDF DOI

Position: No Retroactive Cure for Infringement during Training

Satoru Utsunomiya, Masaru Isonuma, Junichiro Mori, Ichiro Sakata · 2026

As generative AI faces intensifying legal challenges, the machine learning community has increasingly relied on post-hoc mitigation -- especially machine unlearning and inference-time guardrails -- to…

Read Paper →
Page 1 of 234 Next →