Expertini Research Research

Browse Research Papers

154+ open-access research outputs.

✕ Clear
🔍 matan levy 📂 Computer Science
Showing 154 results for "matan levy" in Computer Science
Computer Science Preprint PDF DOI

Near-Optimal Constructive Bounds for $\ell_2$ Prefix Discrepancy and Steinitz Problems via Affine Spectral Independence

Kunal Dutta, Agastya Vibhuti Jha, Haotian Jiang · 2026

A classical result of Steinitz from 1913 \cite{Ste13}, answering an earlier question of Riemann and L\'evy (e.g., \cite{Lev05}), states that for any norm $\|\cdot\|$ in $\mathbb{R}^d$ and any set of v…

Read Paper →
Computer Science Preprint PDF DOI

Almost-Uniform Edge Sampling: Leveraging Independent-Set and Local Graph Queries

Tomer Adar, Amit Levi · 2026

A central theme in sublinear graph algorithms is the relationship between counting and sampling: can the ability to approximately count a combinatorial structure be leveraged to sample it nearly unifo…

Read Paper →
Computer Science Preprint PDF DOI

Universal Shuffle Asymptotics, Part III: Dominant-Block Quotient Geometry and Hybrid Gaussian--Compound-Poisson Limits in Finite-Alphabet Shuffle Privacy

Alex Shvets · 2026

Part I of this series (arXiv:2602.09029) establishes a sharp Gaussian (LAN/GDP) limit theory for neighboring shuffle experiments in the fixed full-support regime. Part II (arXiv:2603.10073) identifies…

Read Paper →
Computer Science Preprint PDF DOI

Intermittent Cauchy walks enable optimal 3D search across target shapes and sizes

Matteo Stromieri, Emanuele Natale, Amos Korman · 2026

Target shape, not just size, plays a pivotal role in determining detectability during random search. We analyze intermittent L\'evy walks in three dimensions, and mathematically prove that the widely …

Read Paper →
Computer Science Preprint PDF DOI

Empirical Impact of Dimensionality on Random Geometric SAT

Flora Radiker · 2026

The Boolean Satisfiability Problem is perhaps one of the most well-known problems in theoretical computer science. On the one hand, it is proven to be NP-complete, which means that it is generally con…

Read Paper →
Computer Science Preprint PDF DOI

Exploiting Liquidity Exhaustion Attacks in Intent-Based Cross-Chain Bridges

Andre Augusto, Christof Ferreira Torres, Andre Vasconcelos, Miguel Correia · 2026

Intent-based cross-chain bridges have emerged as an alternative to traditional interoperability protocols by allowing off-chain entities (\emph{solvers}) to immediately fulfill users' orders by fronti…

Read Paper →
Computer Science Preprint PDF DOI

Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General

David Shmoys, Varun Suriyanarayana, Seeun William Umboh · 2026

The Joint Replenishment Problem (JRP) is a classical inventory management problem, that aims to model the trade-off between coordinating orders for multiple commodities (and their cost) with holding c…

Read Paper →
Computer Science Preprint PDF DOI

Computing Distinguishing Formulae for Threshold-Based Behavioural Distances

Jonas Forster, Lutz Schroder, Paul Wild, Barbara Konig, Pedro Nora · 2026

Behavioural distances generally offer more fine-grained means of comparing quantitative systems than two-valued behavioural equivalences. They often relate to quantitative modalities, which generate q…

Read Paper →
Computer Science Preprint PDF DOI

Economic Warehouse Lot Scheduling: Breaking the 2-Approximation Barrier

Danny Segev · 2026

The economic warehouse lot scheduling problem is a foundational inventory-theory model, capturing computational challenges in dynamically coordinating replenishment decisions for multiple commodities …

Read Paper →
Computer Science Preprint PDF DOI

Functional uniqueness and stability of Gaussian priors in optimal L1 estimation

Leighton Barnes, Alex Dytso · 2025

This paper studies the functional uniqueness and stability of Gaussian priors in optimal $L^1$ estimation. While it is well known that the Gaussian prior uniquely induces linear conditional means unde…

Read Paper →
Computer Science Preprint PDF DOI

Calculating Web Impact Factor for University Websites of Jammu and Kashmir: A Study

Muneer Ahmad, M Sadik Batcha, Wasim Rashid, Obaid Hafiz · 2025

This paper examines and explores the web impact factor through a webometric study of the present 12 University Websites of Jammu and Kashmir. Identifies the domain systems of the websites; analyzes th…

Read Paper →
Computer Science Preprint PDF DOI

Generalized Kantorovich-Rubinstein Duality beyond Hausdorff and Kantorovich

Paul Wild, Lutz Schroder, Karla Messing, Barbara Konig, Jonas Forster · 2025

The classical Kantorovich-Rubinstein duality guarantees coincidence between metrics on the space of probability distributions defined on the one hand via transport plans (couplings) and on the other h…

Read Paper →
Computer Science Preprint PDF DOI

From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids

Joshua Brakensiek, Yeyuan Chen, Manik Dhar, Zihan Zhang · 2025

In coding theory, a common question is to understand the threshold rates of various local properties of codes, such as their list decodability and list recoverability. A recent work Levi, Mosheiff, an…

Read Paper →
Computer Science Preprint PDF DOI

Gobernanza y trazabilidad "a prueba de AI Act" para casos de uso legales: un marco t\'ecnico-jur\'idico, m\'etricas forenses y evidencias auditables

Alex Dantart · 2025

This paper presents a comprehensive governance framework for AI systems in the legal sector, designed to ensure verifiable compliance with the EU AI Act. The framework integrates a normative mapping o…

Read Paper →
Computer Science Preprint PDF DOI

Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes

Fernando Granha Jeronimo, Nikhil Shagrithaya · 2025

We present a general framework for derandomizing random linear codes with respect to a broad class of properties, known as local properties, which encompass several standard notions such as distance, …

Read Paper →
Computer Science Preprint PDF DOI

Pay More Attention To Audio: Mitigating Imbalance of Cross-Modal Attention in Large Audio Language Models

Junyu Wang, Ziyang Ma, Zhengding Luo, Tianrui Wang, Meng Ge, Xiaobao Wang, Longbiao Wang · 2025

Large Audio-Language Models (LALMs) often suffer from audio-textual attention imbalance, prioritizing text over acoustic information, particularly in the multi-modal fusion layers of the Transformer a…

Read Paper →
Computer Science Preprint PDF DOI

JAM: A Tiny Flow-based Song Generator with Fine-grained Controllability and Aesthetic Alignment

Renhang Liu, Chia-Yu Hung, Navonil Majumder, Taylor Gautreaux, Amir Ali Bagherzadeh, Chuan Li, Dorien Herremans, Soujanya Poria · 2025

Diffusion and flow-matching models have revolutionized automatic text-to-audio generation in recent times. These models are increasingly capable of generating high quality and faithful audio outputs c…

Read Paper →
Computer Science Preprint PDF DOI

$\epsilon$-Distance via L\'evy-Prokhorov Lifting

Josee Desharnais, Ana Sokolova · 2025

The most studied and accepted pseudometric for probabilistic processes is one based on the Kantorovich distance between distributions. It comes with many theoretical and motivating results, in particu…

Read Paper →
Computer Science Preprint PDF DOI

Tight simulation of a distribution using conditional samples

Tomer Adar · 2025

We present an algorithm for simulating a distribution using prefix conditional samples (Adar, Fischer and Levi, 2024), as well as ``prefix-compatible'' conditional models such as the interval model (C…

Read Paper →
Computer Science Preprint PDF DOI

Encoding call-by-push-value in the pi-calculus

Benjamin Bennetzen, Nikolaj Rossander Kristensen, Peter Buus Steffensen · 2025

In this report we define an encoding of Levys call-by-push-value lambda-calculus (CBPV) in the pi-calculus, and prove that our encoding is both sound and complete. We present informal (by-hand) proofs…

Read Paper →
Page 1 of 8 Next →