Expertini Research Research

Browse Research Papers

204+ open-access research outputs.

✕ Clear
🔍 julia hartmann 📂 Computer Science
Showing 204 results for "julia hartmann" in Computer Science
Computer Science Preprint PDF DOI

Arboretum.hs: Symbolic manipulation for algebras of graphs

Eugen Bronasco, Jean-Luc Falcone, Gilles Vilmart · 2026

We design the Arboretum$.$hs package for symbolic computations with algebras of trees and more general graphs in Haskell. Thanks to the declarative nature of functional programming, the package's impl…

Read Paper →
Computer Science Preprint PDF DOI

SignatureTensors.jl: A Package for Signature Tensors in Julia

Gabriel Riffo, Leonard Schmitz · 2026

We introduce SignatureTensors.jl, a new package for computing signature tensors of paths in julia. We present its core functionality and demonstrate its use through illustrative examples. The package …

Read Paper →
Computer Science Preprint PDF DOI

Explainable PQC: A Layered Interpretive Framework for Post-Quantum Cryptographic Security Assumptions

Daisuke Ishii, Rizwan Jahangir · 2026

This paper studies how post-quantum cryptographic (PQC) security assumptions can be represented and communicated through a structured, layered framework that is useful for technical interpretation but…

Read Paper →
Computer Science Preprint PDF DOI

StreamSampling.jl: Efficient Sampling from Data Streams in Julia

Adriano Meligrana · 2026

StreamSampling$.$jl is a Julia library designed to provide general and efficient methods for sampling from data streams in a single pass, even when the total number of items is unknown. In this paper,…

Read Paper →
Computer Science Preprint PDF DOI

A chaotic flux cipher based on the random cubic family $f_{c_n}(z)=z^3+c_n z$

Pouya Mehdipour, Alexandre Miranda Alves, Gerardo Honorato, Mostafa Salarinoghabi · 2026

This paper presents a symmetric stream cipher that utilizes the dynamic properties of random cubic mappings in the complex plane to generate pseudo-random key streams. The system is based on the itera…

Read Paper →
Computer Science Preprint PDF DOI

High-Performance Portable GPU Primitives for Arbitrary Types and Operators in Julia

Emmanuel Pilliat (ENSAI) · 2026

Portable GPU frameworks such as Kokkos and RAJA reduce the burden of cross-architecture development but typically incur measurable overhead on fundamental parallel primitives relative to vendor-optimi…

Read Paper →
Computer Science Preprint PDF DOI

Agentic Scientific Simulation: Execution-Grounded Model Construction and Reconstruction

Knut-Andreas Lie, Olav M{o}yner, Elling Svee, Jakob Torben · 2026

LLM agents are increasingly used for code generation, but physics-based simulation poses a deeper challenge: natural-language descriptions of simulation models are inherently underspecified, and diffe…

Read Paper →
Computer Science Preprint PDF DOI

The Distance Spectrum of IEEE 802.11 Binary Convolutional Codes

Rethna Pulikkoonattu · 2026

Binary convolutional coding (BCC) has been a cornerstone of the IEEE 802.11 wireless LAN standard since its inception, and it remains relevant today across the full generational arc from the legacy 80…

Read Paper →
Computer Science Preprint PDF DOI

Expansive homeomorphisms on complexity quasi-metric spaces

Yae U. Gaba · 2026

The complexity quasi-metric of Schellekens is a topological framework in which the asymmetry of computational comparisons -- ``$A$ is at most as fast as $B$'' carrying different information than ``$B$…

Read Paper →
Computer Science Preprint PDF DOI

Computing an approximation of the partial Weyl closure of a holonomic module

Hadrien Brochet · 2026

The Weyl closure is a basic operation in algebraic analysis: it converts a system of differential operators with rational coefficients into an equivalent system with polynomial coefficients. In additi…

Read Paper →
Computer Science Preprint PDF DOI

Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations

Hamzah Khan, Dong Ho Lee, Jingqi Li, Tianyu Qiu, Christian Ellis, Jesse Milzman, Wesley Suttle, David Fridovich-Keil · 2026

Multi-robot coordination often exhibits hierarchical structure, with some robots' decisions depending on the planned behaviors of others. While game theory provides a principled framework for such int…

Read Paper →
Computer Science Preprint PDF DOI

DaggerFFT: A Distributed FFT Framework Using Task Scheduling in Julia

Sana Taghipour Anvari, Julian Samaroo, Matin Raayai Ardakani, David Kaeli · 2026

The Fast Fourier Transform (FFT) is a fundamental numerical technique with widespread application in a range of scientific problems. As scientific simulations attempt to exploit exascale systems, ther…

Read Paper →
Computer Science Preprint PDF DOI

Hierarchical Precision and Recursion for Accelerating Symmetric Linear Solves on MXUs

Vicki Carrica, Rabab Alomairy, Evelyne Ringoot, Alan Edelman · 2026

Symmetric linear solves are fundamental to a wide range of scientific and engineering applications, from climate modeling and structural analysis to machine learning and optimization. These workloads …

Read Paper →
Computer Science Preprint PDF DOI

A data structure for monomial ideals with applications to signature Gr\"obner bases

Pierre Lairez, Rafael Mohr, Theo Ternier · 2026

We introduce monomial divisibility diagrams (MDDs), a data structure for monomial ideals that supports insertion of new generators and fast membership tests. MDDs stem from a canonical tree representa…

Read Paper →
Computer Science Preprint PDF DOI

Multi-Language Benchmark Generation via L-Systems

Vinicius Francisco da Silva, Heitor Leite, Fernando Magno Quintao Pereira · 2025

L-systems are a mathematical formalism proposed by biologist Aristid Lindenmayer with the aim of simulating organic structures such as trees, snowflakes, flowers, and other branching phenomena. They a…

Read Paper →
Computer Science Preprint PDF DOI

A High-level Synthesis Toolchain for the Julia Language

Benedict Short, Ian McInerney, John Wickerson · 2025

With the push towards Exascale computing and data-driven methods, problem sizes have increased dramatically, increasing the computational requirements of the underlying algorithms. This has led to a p…

Read Paper →
Computer Science Preprint PDF DOI

Optimizations on Graph-Level for Domain Specific Computations in Julia and Application to QED

Anton Reinhard, Simeon Ehrig, Rene Widera, Michael Bussmann, Uwe Hernandez Acosta · 2025

Complex computational problems in science often consist of smaller parts that can have largely distinct compute requirements from one another. For optimal efficiency, analyzing each subtask and schedu…

Read Paper →
Computer Science Preprint PDF DOI

Herb.jl: A Unifying Program Synthesis Library

Tilman Hinnerichs, Reuben Gardos Reid, Jaap de Jong, Bart Swinkels, Pamela Wochner, Nicolae Filat, Tudor Magurescu, Issa Hanou, Sebastijan Dumancic · 2025

Program synthesis -- the automatic generation of code given a specification -- is one of the most fundamental tasks in artificial intelligence (AI) and the dream of many programmers. Numerous synthesi…

Read Paper →
Computer Science Preprint PDF DOI

Efficient Symbolic Computation via Hash Consing

Bowen Zhu, Aayush Sabharwal, Songchen Tan, Yingbo Ma, Alan Edelman, Christopher Rackauckas · 2025

Symbolic computation systems suffer from memory inefficiencies due to redundant storage of structurally identical subexpressions, commonly known as expression swell, which degrades performance in both…

Read Paper →
Computer Science Preprint PDF DOI

The Syntax and Semantics of einsum

Maurice Wenig, Paul G. Rump, Mark Blacher, Joachim Giesen · 2025

In 2011, einsum was introduced to NumPy as a practical and convenient notation for tensor expressions in machine learning, quantum circuit simulation, and other fields. It has since been implemented i…

Read Paper →
Page 1 of 11 Next →