Expertini Research Research

Browse Research Papers

25,935+ open-access research outputs.

✕ Clear
🔍 p. k. lam 📂 Computer Science
Showing 25935 results for "p. k. lam" in Computer Science
Computer Science Preprint PDF DOI

Efficient Multivector Retrieval with Token-Aware Clustering and Hierarchical Indexing

Silvio Martinico, Franco Maria Nardini, Cosimo Rulli, Rossano Venturini · 2026

Multivector retrieval models achieve state-of-the-art effectiveness through fine-grained token-level representations, but their deployment incurs substantial computational and memory costs. Current so…

Read Paper →
Computer Science Preprint PDF DOI

Towards Neuro-symbolic Causal Rule Synthesis, Verification, and Evaluation Grounded in Legal and Safety Principles

Zainab Rehan, Christian Medeiros Adriano, Sona Ghahremani, Holger Giese · 2026

Rule-based systems remain central in safety-critical domains but often struggle with scalability, brittleness, and goal misspecification. These limitations can lead to reward hacking and failures in f…

Read Paper →
Computer Science Preprint PDF DOI

Characterizing Path-Independent Fees: A Route to Zero Impermanent Loss in CPMMs

Andrey Voronin, Roman Vlasov, Vladimir Gorgadze, Andrey Seoev, Yury Yanovich · 2026

Constant Product Market Makers use fees that are typically fixed proportions of trade size. When these fees are automatically reinvested into the pool, as in Uniswap~V2 and some designs of Uniswap V4,…

Read Paper →
Computer Science Preprint PDF DOI

From Mirage to Grounding: Towards Reliable Multimodal Circuit-to-Verilog Code Generation

Guang Yang, Xing Hu, Xiang Chen, Xin Xi · 2026

Multimodal large language models (MLLMs) are increasingly used to translate visual artifacts into code, from UI mockups into HTML to scientific plots into Python scripts. A circuit diagram can be view…

Read Paper →
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

NeocorRAG: Less Irrelevant Information, More Explicit Evidence, and More Effective Recall via Evidence Chains

Shiyao Peng, Qianhe Zheng, Zhuodi Hao, Zichen Tang, Rongjin Li, Qing Huang, Jiayu Huang, Jiacheng Liu, Yifan Zhu, Haihong E · 2026

Although precise recall is a core objective in Retrieval-Augmented Generation (RAG), a critical oversight persists in the field: improvements in retrieval performance do not consistently translate to …

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

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

Monadic Presburger Predicates have Robust Population Protocols

Philipp Czerner, Javier Esparza, Vincent Fischer, Roland Guttenberg, Julian Pins, Simon Reilich · 2026

Population protocols are a model of distributed computation in which a collection of indistinguishable finite-state agents interact randomly in pairs to decide a predicate of their initial configurati…

Read Paper →
Computer Science Preprint PDF DOI

Temporal Routing in Static Networks: The Schedule Completion Problem

Michelle Doring, Niklas Mohrin, George Skretas · 2026

We introduce the TemporallyEdgeDisjointScheduleCompletion (TEDSC) problem in which we need to cover a set of temporal edge demands $D$ by routing $k$ temporal walks through a directed static graph whi…

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

LLM-as-a-Judge for Human-AI Co-Creation: A Reliability-Aware Evaluation Framework for Coding

Md Faizul Ibne Amin, Yutaka Watanobe, Daniel M. Muepu, Haruto Suzuki, Kenta Nanaumi, Md Mostafizer Rahman · 2026

LLMs are increasingly employed both as judges for evaluating open-ended outputs and as co-creation partners in AI-assisted programming; yet rigorous evaluation in human-AI co-creation settings remains…

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

Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time

Loukas Georgiadis, Evangelos Kipouridis, Evangelos Kosinas, Charis Papadopoulos, Nikos Parotsidis · 2026

Computing edge-connected components in directed and undirected graphs is a fundamental and well-studied problem in graph algorithms. In a very recent breakthrough, Korhonen [STOC 2025] showed that for…

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

Strongly Refuting Random CSP without Literals

Siu On Chan, Tommaso d'Orsi, Jeff Xu · 2026

Under what condition is a random constraint satisfaction problem hard to refute by the sum-of-squares (SoS) algorithm? A sufficient condition is t-wise uniformity, that is, each constraint has a t-wis…

Read Paper →
Computer Science Preprint PDF DOI

The Synthetic Social Graph: Emergent Behavior in AI Agent Communities

Sungguk Cha, DongWook Kim · 2026

Large language model (LLM) agents are increasingly deployed in social settings, yet little is known about how they interact in open-ended environments. We present the first comprehensive sociological …

Read Paper →
Computer Science Preprint PDF DOI

Addressing the Reality Gap: A Three-Tension Framework for Agentic AI Adoption

Jason Fournier (Imagine Learning), Kacper {L}odzikowski (Adam Mickiewicz University, Poznan, Poland) · 2026

Generative AI has rapidly entered education through free consumer tools, outpacing the ability of schools and universities to respond. Now a new wave of more autonomous agentic AI systems--with the ca…

Read Paper →
Computer Science Preprint PDF DOI

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases

Michael T.M. Emmerich · 2026

We study exact fixed-cardinality Solow--Polasky diversity subset selection on ordered finite $\ell_1$ sets, with monotone biobjective Pareto fronts and their higher-dimensional staircase analogues as …

Read Paper →
Computer Science Preprint PDF DOI

Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs

Liam Roditty, Ariel Sapir · 2026

We introduce a generalized family of $\left( 2\cdot \left\lfloor \frac{k}{2} \right\rfloor-1, 2\cdot \left\lceil \frac{k}{2} \right\rceil \cdot W_{1} +\max\left\{0,2\cdot\left(\left\lceil\frac{k}{2}\r…

Read Paper →
Page 1 of 1297 Next →