Expertini Research Research

Browse Research Papers

23,827+ open-access research outputs.

โœ• Clear
๐Ÿ” min lin ๐Ÿ“‚ Computer Science
Showing 23827 results for "min lin" in Computer Science
Computer Science Preprint PDF DOI

Beyond Code, We Are People: A Systematic Mapping of 25 Years of Literature on Soft Skills in Agile Development Teams

Israely Lima, Lucas Moura Lourenco, Marcio Ribeiro, Ivan Machado, Carla Ilane Bezerra ยท 2026

Software development is a sociotechnical and human-centered endeavor in which human factors directly influence quality, productivity, and innovation capacity. In this context, career development in coโ€ฆ

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

Users' Activity Logs: the Good, the Bad, the Misconception, and the Disastrous

Eman Alashwali ยท 2026

Most service providers, such as Google, save logs from data generated by users while using the service. Many service providers provide users with privacy controls to manage whether, how, and for how lโ€ฆ

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

Online Monotone Metric Embeddings

Christian Coester, Yichen Huang ยท 2026

Metric embeddings into structured spaces, particularly hierarchically well-separated trees (HSTs), are a fundamental tool in the design of online algorithms. In the classical online embedding setting,โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

A 3GPP Perspective on Spectrum Sharing for the 5G-to-6G Migration: From DSS to MRSS

Xingqin Lin ยท 2026

Dynamic spectrum sharing (DSS) played an important role in the 4G-to-5G transition by allowing 5G new radio (NR) to enter valuable legacy spectrum without immediate static refarming. Yet practical depโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

MISES: Minimal Information Sufficiency for Effective Service

Joss Armstrong ยท 2026

Category-based coordination mechanisms allocate resources by mapping a declared service category to a fixed resource profile, without observing individual demand types. We establish three results for โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Path-Reporting Distance Oracles for Vertex-Labeled Graphs

Ofer Neiman, Alon Spector ยท 2026

Let $G=(V,E)$ be a weighted undirected graph, with $n$ vertices. A distance oracle is a data structure that can quickly answer distance queries, with some stretch factor. A seminal work of \cite{TZ01}โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Existence and Constructions of Strict Function-Correcting Codes with Data Protection

Charul Rajput, B. Sundar Rajan, Ragnar Freij-Hollanti, Camilla Hollanti ยท 2026

Function-correcting codes with data protection simultaneously protect both the data and a function of the data at distinct error-correction levels. When the function receives strictly stronger protectโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Can Cross-Layer Design Bridge Security and Efficiency? A Robust Authentication Framework for Healthcare Information Exchange Systems

Khalid M. Ezzat, Muhammad El-Saba, Mahmoud A. Shawky ยท 2026

As healthcare systems become increasingly interconnected, ensuring secure and continuous device authentication in health information exchange (HIE) networks is critical to safeguarding patient data anโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Flashback: A Reversible Bilateral Run-Peeling Decomposition of Strings

Thomas Konstantinovsky, Gur Yaari ยท 2026

We introduce Flashback, a reversible string decomposition that repeatedly peels the maximal leading and trailing character runs from a sentinel-wrapped input, recording each pair as one bilateral tokeโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Hard-to-Sample Distributions from Robust Extractors

Farzan Byramji, Daniel M. Kane, Jackson Morris, Anthony Ostuni ยท 2026

We provide a unified method for constructing explicit distributions which are difficult for restricted models of computation to generate. Our constructions are based on a new notion of robust extractoโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

SWE-Edit: Rethinking Code Editing for Efficient SWE-Agent

Yikai Zhang, Jiaxin Pei, Kenan Li, Maoquan Wang, Jin Pan, Yu Kang, Shengyu Fu, Elsie Nallipogu, Junjie Hu, Yufan Huang, Zijian Jin ยท 2026

Large language model agents have achieved remarkable progress on software engineering tasks, yet current approaches suffer from a fundamental context coupling problem: the standard code editing interfโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

On the Role of Time Series Clustering in Traffic Matrix Prediction

Martha Cash, Charlotte Fowler, Alexander M. Wyglinski ยท 2026

This paper analyzes the role of time-series clustering in traffic matrix (TM) prediction. Traffic flows within a TM often exhibit heterogeneous behavior, which can reduce the effectiveness of global fโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Decoding Delay Guarantees of Space Regulated Multiple Access Random Wireless Networks using Successive Interference Cancellation

Kevin Zagalo, Jean-Marie Gorce, Francois Baccelli ยท 2026

This paper is focused on decoding delay guarantees in wireless networks, where messages have a given signal-to-interference-plus-noise ratio threshold $\eta_0$ to meet in order to be successfully decoโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width

Benjamin Bergougnoux, Vera Chekan, Stefan Kratsch ยท 2026

In this work we contribute to the study of the fine-grained complexity of problems parameterized by multi-clique-width, which was initiated by F\"urer [ITCS 2017] and pursued further by Chekan and Kraโ€ฆ

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

On the degradations of Binary-Input Discrete Memoryless Channels

Yadong Jiao, Xiaoyan Cheng, Yuansheng Tang, Ming Xu ยท 2026

For the polar codes introduced by Arikan in 2009, the first code family achieving the capacity of binary-input discrete memoryless channels (BIDMCs) with low-complexity encoding and decoding, it is crโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Central Limit Theorem for Mutation Systems

Liav Koram, Ohad Elishco ยท 2026

DNA-based storage has emerged as a promising alternative to traditional data storage methods, offering unmatched advantages in data density, longevity, and sustainability. Two main approaches have devโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

An Efficient Streaming Algorithm for Approximating Graphlet Distributions

Marco Bressan, T-H. Hubert Chan, Qipeng Kuang, Mauro Sozio ยท 2026

In recent years, the problem of computing the frequencies of the induced $k$-vertex subgraphs of a graph, or \emph{$k$-graphlets}, has become central. One approach for this problem is to sample $k$-grโ€ฆ

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