Expertini Research Research

Browse Research Papers

5,541+ open-access research outputs.

โœ• Clear
๐Ÿ” gordon king ๐Ÿ“‚ Computer Science
Showing 5541 results for "gordon king" in Computer Science
Computer Science Preprint PDF DOI

NeuroRing: Scaling Spiking Neural Networks via Multi-FPGA Bidirectional Ring Topologies and Stream-Dataflow Architectures

Muhammad Ihsan Al Hafiz, Artur Podobas ยท 2026

Spiking neural networks (SNNs) are a promising paradigm for energy-efficient event-driven computation, but large-scale SNN execution remains challenging because sparse spike communication and synchronโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

A Monadic Implementation of Functional Logic Programs

Michael Hanus, Kai-Oliver Prott, Finn Teegen ยท 2026

Functional logic languages are a high-level approach to programming by combining the most important declarative features. They abstract from small-step operational details so that programmers can concโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Resume-ing Control: (Mis)Perceptions of Agency Around GenAI Use in Recruiting Workflows

Sajel Surati, Rosanna Bellini, Emily Black ยท 2026

When generative AI (genAI) systems are used in high-stakes decision-making, its recommended role is to aid, rather than replace, human decision-making. However, there is little empirical exploration oโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

A proof of Jordan curve theorem based on the sweepline algorithm for trapezoidal decomposition of a polygon

Apurva Mudgal ยท 2026

We prove the Jordan curve theorem by generalizing the sweepline algorithm for trapezoidal decomposition of a polygon. Our proof uses Zorn's lemma (or, equivalently the axiom of choice). Though severalโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph

Afrouz Jabal Ameli, Tomohiro Koana, Jesper Nederlof, Shengzhe Wang ยท 2026

The Strongly Connected Steiner Subgraph (SCSS) problem is a well-studied network design problem that asks for a minimum subgraph that strongly connects a given set of terminals. In this paper, we presโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

AI as Consumer and Participant: A Co-Design Agenda for MBSE Substrates and Methodology

Siyuan Ji ยท 2026

AI tools are being deployed over MBSE models today, and those models were not designed for this kind of consumption. The problem is not simply that tools hallucinate: well-prompted frontier models proโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Assistants, Not Architects: The Role of LLMs in Networked Systems Design

Pratyush Sahu, Rahul Bothra, Venkat Arun, Brighten Godfrey, Akshay Narayan, Ahmed Saeed ยท 2026

Designing the architecture of modern networked systems requires navigating a large, combinatorial space of hardware, systems, and configuration choices with complex cross-layer interactions. Architectโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

PSP: An Interpretable Per-Dimension Accent Benchmark for Indic Text-to-Speech

Venkata Pushpak Teja Menta ยท 2026

Standard text-to-speech (TTS) evaluation measures intelligibility (WER, CER) and overall naturalness (MOS, UTMOS) but does not quantify accent. A synthesiser may score well on all four yet sound non-nโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Offline Evaluation Measures of Fairness in Recommender Systems

Theresia Veronika Rampisela ยท 2026

The evaluation of recommender system fairness has become increasingly important, especially with recent legislation that emphasises the development of fair and responsible artificial intelligence. Thiโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

KubePACS: Kubernetes Cluster Using Performant, Highly Available, and Cost Efficient Spot Instances

Taeyoon Kim, Kyumin Kim, Enrique Molina-Gimenez, Pedro Garcia-Lopez, Kyungyong Lee ยท 2026

Cloud users aim to minimize cost while maximizing performance by selecting the most suitable instance types for their workloads. To reduce expenses, spot instances have been widely adopted due to theiโ€ฆ

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

Distance Field Rasterization for End-to-End Mesh Reconstruction

Jinkai Cui, Kaiwen Song, Chumeng Niu, Juyong Zhang ยท 2026

Rasterization based methods have recently enabled high-quality novel view synthesis at real-time rates, but their underlying volumetric primitives do not expose a direct, globally consistent surface rโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Rejection Sampling is Optimal for Relative Entropy Coding

Spencer Hill, Fady Alajaji, Tamas Linder, Gergely Flamich ยท 2026

In relative entropy coding, a sender aims to design a stochastic code such that, on input $X \sim P_X$, the receiver can generate a sample $Y \sim P_{Y \mid X}$. It is a standard result that (1) this โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Polynomial Lower Bounds for Arithmetic Circuits over Non-Commutative Rings

Ran Raz ยท 2026

We prove a lower bound of $\Omega\left(n^{1.5}\right)$ for the number of product gates in non-commutative arithmetic circuits for an explicit $n$-variate degree-$n$ polynomial $f_{n}$ (over every fielโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Parity Tests with Ties

Ron Kupfer ยท 2026

We extend the Ting--Yao randomized maximum-finding algorithm [TY94] to inputs that need not be pairwise distinct: each parity test $P(i,B)=\prod_{a\in B}(x_i-x_a):0$ on $B\subseteq[n]\setminus\{i\}$ iโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Explicit Factorization of $x^{p+1}-1$ over $\mathbb{Z}_{p^e}$: A Structural Approach via Dickson Polynomials

Yongchao Wang, Yang Ding, Jiansheng Yang, Zhiqiu Huang ยท 2026

Let $p$ be an odd prime. The factorization of the polynomial $x^{p+1}-1$ over the integer residue ring $\mathbb{Z}_{p^e}$ is pivotal for constructing cyclic codes with Hermitian symmetry, a critical rโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Students Know AI Should Not Replace Thinking, but How Do They Regulate It? The TACO Framework for Human-AI Cognitive Partnership

Cecilia Ka Yuk Chan ยท 2026

As generative artificial intelligence becomes increasingly embedded in educational practice, a central concern is whether students use AI as cognitive support or as a substitute for thinking. Prior reโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

From Finite Enumeration to Universal Proof: Ring-Theoretic Foundations for PQC Hardware Masking Verification

Ray Iskander, Khaled Kirah ยท 2026

Formal verification of masking in post-quantum cryptographic (PQC) hardware relies on SMT solvers over finite domains. Our prior work established structural dependency analysis at scale [1] and quantiโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Safety-Aware AoI Scheduling for LEO Satellite-Assisted Autonomous Driving

Kangkang Sun, Junyi He, Juntong Liu, Xiuzhen Chen, Jianhua Li, Minyi Guo ยท 2026

Autonomous platoons traversing infrastructure gaps increasingly depend on LEO satellite backhaul for safety-critical updates, yet no existing framework jointly addresses compound Doppler from simultanโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

React-ing to Grace Hopper 200: Five Open-Weights Coding Models, One React Native App, One GH200, One Weekend

Alex Potanin ยท 2026

We evaluate five state-of-the-art open-weights coding language models -- Kimi-K2.5 (at Q3 and Q4 quantizations), GLM-5.1, Qwen3-Coder-480B, and DeepSeek-V3.2 -- on a single multi-file React Native appโ€ฆ

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