Expertini Research Research

Browse Research Papers

434+ open-access research outputs.

✕ Clear
🔍 stepan holub 📂 Computer Science
Showing 434 results for "stepan holub" in Computer Science
Computer Science Preprint PDF DOI

Guess-Verify-Refine: Data-Aware Top-K for Sparse-Attention Decoding on Blackwell via Temporal Correlation

Long Cheng, Ritchie Zhao, Timmy Liu, Mindy Li, Xianjie Qiao, Kefeng Duan, Yu-Jung Chen, Xiaoming Chen, Bita Darvish Rouhani, June Yang · 2026

Sparse-attention decoders rely on exact Top-K selection to choose the most important key-value entries for each query token. In long-context LLM serving, this Top-K stage runs once per decode query an…

Read Paper →
Computer Science Preprint PDF DOI

BEAT: Tokenizing and Generating Symbolic Music by Uniform Temporal Steps

Lekai Qian, Haoyu Gu, Jingwei Zhao, Ziyu Wang · 2026

Tokenizing music to fit the general framework of language models is a compelling challenge, especially considering the diverse symbolic structures in which music can be represented (e.g., sequences, g…

Read Paper →
Computer Science Preprint PDF DOI

OpenDC-STEAM: Realistic Modeling and Systematic Exploration of Composable Techniques for Sustainable Datacenters

Dante Niewenhuis, Sacheendra Talluri, Alexandru Iosup, Tiziano de Matteis · 2026

The need to reduce datacenter carbon footprint is urgent. While many sustainability techniques have been proposed, they are often evaluated in isolation, using limited setups or analytical models that…

Read Paper →
Computer Science Preprint PDF DOI

A Note on the Equivalence Between Zero-knowledge and Quantum CSS Codes

Noga Ron-Zewi, Mor Weiss · 2026

Zero-knowledge codes, introduced by Decatur, Goldreich, and Ron (ePrint 1997), are error-correcting codes in which few codeword symbols reveal no information about the encoded message, and have been e…

Read Paper →
Computer Science Preprint PDF DOI

How to Steal Reasoning Without Reasoning Traces

Tingwei Zhang, John X. Morris, Vitaly Shmatikov · 2026

Many large language models (LLMs) use reasoning to generate responses but do not reveal their full reasoning traces (a.k.a. chains of thought), instead outputting only final answers and brief reasonin…

Read Paper →
Computer Science Preprint PDF DOI

A Core Calculus for Type-safe Product Lines of C Programs

Ferruccio Damiani (University of Turin), Daisuke Kimura (Toho University), Luca Paolini (University of Turin), Makoto Tatsuta (National Institute of Informatics) · 2026

In this paper we: (1) propose Lightweight C (LC), namely a core calculus that formalizes a proper subset of the ANSI C without preprocessor directives; (2) define Colored LC (CLC), namely LC endowed w…

Read Paper →
Computer Science Preprint PDF DOI

Two Remarks about Game Semantics of Classical Logic

Thierry Coquand (Chalmers University of Technology, University of Gothenburg) · 2026

We present and explain two unpublished remarks of Stefano Berardi connected to game semantics.…

Read Paper →
Computer Science Preprint PDF DOI

Learning Foundations Beneath the Stars

Felice Cardone (University of Turin), Luca Paolini (University of Turin) · 2026

Foundations of computer science are a key area in theoretical research, one to which Stefano has made significant contributions, particularly from a logical and proof-theoretic perspective. Recently, …

Read Paper →
Computer Science Preprint PDF DOI

Lambdas at the Far Edge: a Tale of Flying Lambdas and Lambdas on Wheels

Giorgio Audrito (Department of Computer Science (DI) University of Turin, Turin, Italy), Daniele Bortoluzzi (Department of Computer Science (DI) University of Turin, Turin, Italy), Ferruccio Damiani (Department of Computer Science (DI) University of Turin, Turin, Italy), Giordano Scarso (Department of Computer Science (DI) University of Turin, Turin, Italy), Gianluca Torta (Department of Computer Science (DI) University of Turin, Turin, Italy), Andrea Basso (MITO Technology, Milan, Italy), Monica Cochi (Torino Airport), Lorenzo Gusman (Torino Airport), Lorenzo Comba (Department of Agricultural, Forest, Food Sciences (DiSAFA) University of Turin, Turin, Italy), Paolo Gay (Department of Agricultural, Forest, Food Sciences (DiSAFA) University of Turin, Turin, Italy), Paola Dal Zovo (Concept Engineering Reply, Turin, Italy), Giada Galati (Eurix, Turin, Italy), Francesco Gallo (Eurix, Turin, Italy), Aljaz Grdadolnik (Faculty of Computer, Information Science University of Ljubljana, Ljubljana, Slovenia), Massimo Pescarollo (Department of Economics, Statistics Cognetti de Martiis, University of Turin, Turin, Italy), Paola Pisano (Department of Economics, Statistics, Cognetti de Martiis, University of Turin, Turin, Italy) · 2026

Aggregate Programming (AP) is a paradigm for programming the collective behaviour of sets of distributed devices, possibly situated at the network far edge, by relying on asynchronous proximity-based …

Read Paper →
Computer Science Preprint PDF DOI

Logics and Type Theory: essays dedicated to Stefano Berardi on the occasion of his 1000000th birthday

Thorsten Altenkirch, Franco Barbanera, Ferruccio Damiani, Ugo de'Liguoro · 2026

Proof Theory and Type Theory are two branches of mathematical logic and theoretical computer science that explore the structure of mathematical proofs and the foundations of computation. Both are cruc…

Read Paper →
Computer Science Preprint PDF DOI

A two-steps tensor eigenvector centrality for nodes and hyperedges in hypergraphs

Qing Xu, Chunmeng Liu, Changjiang Bu, Jihong Shen · 2026

Hypergraphs have been a powerful tool to represent higher-order interactions, where hyperedges can connect an arbitrary number of nodes. Quantifying the relative importance of nodes and hyperedges in …

Read Paper →
Computer Science Preprint PDF DOI

Simplify to Amplify: Achieving Information-Theoretic Bounds with Fewer Steps in Spectral Community Detection

Sie Hendrata Dharmawan, Peter Chin · 2026

We propose a streamlined spectral algorithm for community detection in the two-community stochastic block model (SBM) under constant edge density assumptions. By reducing algorithmic complexity throug…

Read Paper →
Computer Science Preprint PDF DOI

Constructions of linear codes from vectorial plateaued functions and their subfield codes with applications to quantum CSS codes

Virginio Fratianni, Sihem Mesnager · 2026

Linear codes over finite fields parameterized by functions have proven to be a powerful tool in coding theory, yielding optimal and few-weight codes with significant applications in secret sharing, au…

Read Paper →
Computer Science Preprint PDF DOI

The Baby Steps of the European Union Vulnerability Database: An Empirical Inquiry

Jukka Ruohonen · 2026

A new European Union Vulnerability Database (EUVD) was introduced via a legislative act in 2022. The paper examines empirically the meta-data content of the new EUVD. According to the results, activel…

Read Paper →
Computer Science Preprint PDF DOI

A Multiliteracy Model for Interactive Visualization Literacy: Definitions, Literacies, and Steps for Future Research

Gabriela Molina Leon, Benjamin Bach, Matheus Valentim, Niklas Elmqvist · 2026

This paper presents a theoretical model for interactive visualization literacy to describe how people use interactive data visualizations and systems. Literacies have become an important concept in de…

Read Paper →
Computer Science Preprint PDF DOI

First Steps, Lasting Impact: Platform-Aware Forensics for the Next Generation of Analysts

Vinayak Jain, Sneha Sudhakaran, Saranyan Senthivel · 2026

The reliability of cyber forensic evidence acquisition is strongly influenced by the underlying operating systems, Windows, macOS, and Linux - due to inherent variations in file system structures, enc…

Read Paper →
Computer Science Preprint PDF DOI

RECURSUM: Automated Code Generation for Recurrence Relations Exceeds Expert Optimization via LayeredCodegen

Ruben Dario Guerrero · 2026

Automated code generation can systematically exceed expert hand-optimization for recurrence relations-computational primitives ubiquitous in orthogonal polynomials, special functions, numerical integr…

Read Paper →
Computer Science Preprint PDF DOI

STEAD: Robust Provably Secure Linguistic Steganography with Diffusion Language Model

Yuang Qi, Na Zhao, Qiyi Yao, Benlong Wu, Weiming Zhang, Nenghai Yu, Kejiang Chen · 2026

Recent provably secure linguistic steganography (PSLS) methods rely on mainstream autoregressive language models (ARMs) to address historically challenging tasks, that is, to disguise covert communica…

Read Paper →
Computer Science Preprint PDF DOI

Quantum CSS LDPC Codes based on Dyadic Matrices for Belief Propagation-based Decoding

Alessio Baldelli, Massimo Battaglioni, Jonathan Mandelbaum, Sisi Miao, Laurent Schmalen · 2026

Quantum low-density parity-check (QLDPC) codes provide a practical balance between error-correction capability and implementation complexity in quantum error correction (QEC). In this paper, we propos…

Read Paper →
Computer Science Preprint PDF DOI

Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra

Cheuk Ting Li · 2025

We propose using confusion hypergraphs (hyperconfusions) as a model of information. In contrast to the conventional approach using random variables, we can now perform conjunction, disjunction and imp…

Read Paper →
Page 1 of 22 Next →