Expertini Research Research

Browse Research Papers

3,140+ open-access research outputs.

โœ• Clear
๐Ÿ” ying li ๐Ÿ“‚ Computer Science
Showing 3140 results for "ying li" 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

On Higher-Order Probabilistic Verification via the Weighted Relational Model of Linear Logic

Ugo Dal Lago, Guido Fiorillo, Paolo Pistone ยท 2026

The problem of determining whether a probabilistic program terminates almost surely (i.e.~with probability one) is undecidable, and actually $\Pi^0_2$-complete. For this reason, a growing literature hโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Hot Fixing in the Wild

Carol Hanna, Karine Even-Mendoza, W.B. Langdon, Mar Zamorano Lopez, Justyna Petke, Federica Sarro ยท 2026

Despite the operational importance of hot fixes, large-scale evidence on how they reshape routine maintenance workflows, particularly in the era of autonomous coding agents, remains limited. We analysโ€ฆ

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

New Convex Programming Technique for Nash Social Welfare and Scheduling

Yuda Feng, Weijiang Hu, Shi Li ยท 2026

We propose a new convex programming relaxation for the weighted Nash social welfare (NSW) problem that achieves a matching $(e^{1/e}\approx 1.445)$-approximation via the rounding algorithm of Feng andโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Constructive Separations from Gate Elimination

Marco Carmosino, Ngu Dang, Tim Jackman ยท 2026

Gate elimination is the primary technique for proving explicit lower bounds against general Boolean circuits, including Li and Yang's state-of-the-art $3.1n - o(n)$ bound for affine dispersers (STOC 2โ€ฆ

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

Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams

Cheng Jiang, Yinchen Liu, Huacheng Yu ยท 2026

A fundamental question in streaming complexity is whether every space-efficient turnstile algorithm is implicitly a linear sketch. The landmark work of Li, Nguyen, and Woodruff [LNW14] established an โ€ฆ

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

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 โ†’
Computer Science Preprint PDF DOI

Symphony: Taming Step Misalignments in the Network for Ring-based Collective Operations

Yuze Jin, Xin Zhe Khooi, Ruyi Yao, Mun Choon Chan ยท 2026

Ring-based collective operations are widely used in distributed AI training due to their efficient bandwidth utilization. While ring communication excels at pipelining, its performance is heavily depeโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Module Lattice Security (Part I): Unconditional Verification of Weber's Conjecture for $k \le 12$

Ming-Xing Luo ยท 2026

Weber's conjecture (1886) governs three aspects of lattice-based cryptography: the solvability of the Principal Ideal Problem, the freeness of modules over rings of integers, and the tightness of worsโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

A Quasi-Experiment comparing the health of unhoused people who have and have not experienced an eviction in King County, WA

Ihsan Kahveci, Timothy A. Thomas, Nathalie E. Williams, Janelle Rothfolk, Cathea Carey, Paul Hebert, Amy Hagopian, Zack W. Almquist ยท 2026

Home eviction poses a significant threat to housing stability, a critical determinant of health. This study examines the relationship between eviction and health and substance use within the unhoused โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

The Semi-Executable Stack: Agentic Software Engineering and the Expanding Scope of SE

Robert Feldt, Per Lenberg, Julian Frattini, Dhasarathy Parthasarathy ยท 2026

AI-based systems, currently driven largely by LLMs and tool-using agentic harnesses, are increasingly discussed as a possible threat to software engineering. Foundation models get stronger, agents canโ€ฆ

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