Expertini Research Research

Browse Research Papers

5,140+ open-access research outputs.

✕ Clear
🔍 qing wang 📂 Computer Science
Showing 5140 results for "qing wang" in Computer Science
Computer Science Preprint PDF DOI

FlashRT: Towards Computationally and Memory Efficient Red-Teaming for Prompt Injection and Knowledge Corruption

Yanting Wang, Chenlong Yin, Ying Chen, Jinyuan Jia · 2026

Long-context large language models (LLMs)-for example, Gemini-3.1-Pro and Qwen-3.5-are widely used to empower many real-world applications, such as retrieval-augmented generation, autonomous agents, a…

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

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

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

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 (In)approximability of MaxMin Independent Set Reconfiguration

Hung P. Hoang, Naoto Ohsaka, Rin Saito, Yuma Tamura · 2026

In the Independent Set Reconfiguration problem under the Token Addition/Removal rule, given a graph $G$ and two independent sets $I$ and $J$ of $G$, we want to transform $I$ into $J$ by adding and rem…

Read Paper →
Computer Science Preprint PDF DOI

Secure Conformance Checking using Token-based Replay and Homomorphic Encryption

Luis-Armando Rodriguez-Flores, Luciano Garcia-Banuelos, Abel Armas-Cervantes, Astrid-Monserrat Rivera-Partida · 2026

Conformance checking, one of the main process mining operations, aims to identify discrepancies between a process model and an event log. The model represents the expected behaviour, whereas the event…

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

A more versatile model for enumerative kernelization: a case study for Vertex Cover

Marin Bougeret, Guilherme C. M. Gomes, Ignasi Sau · 2026

Enumerative kernelization is a recent promising at the intersection of parameterized complexity and enumeration algorithms, with two proposed models. The first, known as enum-kernels and due to Creign…

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

Interconnecting Regional QKD Networks: Hybrid Key Delivery Across Quantum Domains

David Barral, Aitor Brazaola-Vicario, Diego Cifrian, Natalia Costas, Gonzalo Blazquez, Ana Fernandez-Vilas, Iago F. Llovo, Pedro Otero-Garcia, Pablo P. Rejo, Alejandra Ruiz, Juan Villasuso, Manuel Fernandez-Veiga · 2026

QKD technology is being increasingly adopted inside the network core for protecting information transport against any form of computational attacks. However, the use of QKD for wide-area internetworki…

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

Compositional security definitions for higher-order where declassification

Jan Menz, Andrew K. Hirsch, Peixuan Li, Deepak Garg · 2026

To ensure programs do not leak private data, we often want to be able to provide formal guarantees ensuring such data is handled correctly. Often, we cannot keep such data secret entirely; instead pro…

Read Paper →
Computer Science Preprint PDF DOI

User Experiences with MPI RMA and ULFM in a Resilient Key-Value Store Implementation

Claudia Fohry, Rainer Fink · 2026

As hardware failures such as node losses become increasingly common, MPI programmers may want to save vulnerable data in a resilient store. While third-party storage solutions such as Redis or the Haz…

Read Paper →
Computer Science Preprint PDF DOI

Optimal Phylogenetic Reconstruction from Sampled Quartets

Dionysis Arvanitakis, Vaggos Chatziafratis, Yiyuan Luo, Konstantin Makarychev · 2026

Quartet Reconstruction, the task of recovering a phylogenetic tree from smaller trees on four species called \textit{quartets}, is a well-studied problem in theoretical computer science with far-reach…

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 →
Page 1 of 257 Next →