3 papers
cs.DB2026
C^2: Cache-Conscious Succinct Tries with Adaptive Unary Path Compression
Kepan Zhang, Tiancheng Zhao, Helen Xu
Succinct tries are powerful string dictionaries because of their low memory footprint and fast query performance. However, existing succinct trie implementations face two key chall…
cs.CL2025
OSVBench: Benchmarking LLMs on Specification Generation Tasks for Operating System Verification
Shangyu Li, Juyong Jiang, Tiancheng Zhao +1
We introduce OSVBench, a new benchmark for evaluating Large Language Models (LLMs) on the task of generating complete formal specifications for verifying the functional correctness…
cs.DC2025
pdGRASS: A Fast Parallel Density-Aware Algorithm for Graph Spectral Sparsification
Tiancheng Zhao, Zekun Yin, Huihai An +4
Graph Spectral Sparsification (GSS) identifies an ultra-sparse subgraph, or sparsifier, whose Laplacian matrix closely approximates the spectral properties of the original graph, e…