Expertini Research Research

Browse Research Papers

65+ open-access research outputs.

✕ Clear
🔍 henrik eisenmann 📂 Computer Science
Showing 65 results for "henrik eisenmann" in Computer Science
Computer Science Preprint PDF DOI

Expregular functions

Thomas Colcombet, Nathan Lhote, Pierre Ohlmann · 2026

Polyregular functions form a robust class of string-to-string functions with polynomial growth, as evidenced by Bojanczyk (2018). This class admits numerous descriptions and enjoys several closure p…

Read Paper →
Computer Science Preprint PDF DOI

Rediscovering Recurring Routing Results

Xiao Song, John Heidemann · 2025

Routing is central to networking performance, including: (1) latency in anycast services and websites served from multiple locations,(2) networking expenses and throughput in multi-homed enterprises, …

Read Paper →
Computer Science Preprint PDF DOI

Optimistic Higher-Order Superposition

Alexander Bentkamp, Jasmin Blanchette, Matthias Hetzenberger, Uwe Waldmann · 2025

The $\lambda$-superposition calculus is a successful approach to proving higher-order formulas. However, some parts of the calculus are extremely explosive, notably due to the higher-order unifier enu…

Read Paper →
Computer Science Preprint PDF DOI

Cognifying Education: Mapping AI's transformative role in emotional, creative, and collaborative learning

Mikael Gorsky, Ilya Levin · 2025

Artificial intelligence (AI) is rapidly reshaping educational practice, challenging long held assumptions about teaching and learning. This article integrates conceptual perspectives from recent books…

Read Paper →
Computer Science Preprint PDF DOI

Cryptography from Lossy Reductions: Towards OWFs from ETH, and Beyond

Pouria Fallahpour, Alex B. Grilo, Garazi Muguruza, Mahshid Riahinia · 2025

One-way functions (OWFs) form the foundation of modern cryptography, yet their unconditional existence remains a major open question. In this work, we study this question by exploring its relation to …

Read Paper →
Computer Science Preprint PDF DOI

Creative Telescoping

Shaoshi Chen, Manuel Kauers, Christoph Koutschan · 2025

These notes on creative telescoping are based on a series of lectures at the Institut Henri Poincare in November and December 2023.…

Read Paper →
Computer Science Preprint PDF DOI

Overlapping Biclustering

Matthias Bentert, P{aa}l Gr{o}n{aa}s Drange, Erlend Haugen · 2025

We study the problem of transforming bipartite graphs into bicluster graphs. Abu-Khzam, Isenmann, and Merchad [IWOCA '25] introduced two variants of this problem. In both problems, the goal is to tran…

Read Paper →
Computer Science Preprint PDF DOI

The Right to AI

Rashid Mushkani, Hugo Berard, Allison Cohen, Shin Koeski · 2025

This paper proposes a Right to AI, which asserts that individuals and communities should meaningfully participate in the development and governance of the AI systems that shape their lives. Motivated …

Read Paper →
Computer Science Preprint PDF DOI

Dudeney's Dissection is Optimal

Erik D. Demaine, Tonan Kamata, Ryuhei Uehara · 2024

In 1907, Henry Ernest Dudeney posed a puzzle: ``cut any equilateral triangle \dots\ into as few pieces as possible that will fit together and form a perfect square'' (without overlap, via translation …

Read Paper →
Computer Science Preprint PDF DOI

A Cut-free, Sound and Complete Russellian Theory of Definite Descriptions

Andrzej Indrzejczak, Nils Kurbis · 2024

We present a sequent calculus for first-order logic with lambda terms and definite descriptions. The theory formalised by this calculus is essentially Russellian, but avoids some of its well known dra…

Read Paper →
Computer Science Preprint PDF DOI

HETRI: Heterogeneous Ising Multiprocessing

Husrev C{i}lasun, Abhimanyu Kumar, Ziqing Zeng, Nafisa Sadaf Prova, Sachin S. Sapatnekar, Ulya R. Karpuzcu · 2024

Ising machines are effective solvers for complex combinatorial optimization problems. The idea is mapping the optimal solution(s) to a combinatorial optimization problem to the minimum energy state(s)…

Read Paper →
Computer Science Preprint PDF DOI

New Fault Domains for Conformance Testing of Finite State Machines

Frits Vaandrager, Ivo Melse · 2024

A fault domain reflects a tester's assumptions about faults that may occur in an implementation and that need to be detected during testing. A fault domain that has been widely studied in the literatu…

Read Paper →
Computer Science Preprint PDF DOI

Simply-typed constant-domain modal lambda calculus I: distanced beta reduction and combinatory logic

Sean Walsh · 2024

A system $\boldsymbol\lambda_{\theta}$ is developed that combines modal logic and simply-typed lambda calculus, and that generalizes the system studied by Montague and Gallin. Whereas Montague and Gal…

Read Paper →
Computer Science Preprint PDF DOI

Why Algorithms Remain Unjust: Power Structures Surrounding Algorithmic Activity

Andrew Balch · 2024

Algorithms are unavoidable in our social lives, yet often perpetuate social injustices. The popular means of addressing this is through algorithmic reformism: fine-tuning algorithms themselves to be m…

Read Paper →
Computer Science Preprint PDF DOI

Proceedings 18th International Workshop on Logical and Semantic Frameworks, with Applications and 10th Workshop on Horn Clauses for Verification and Synthesis

Temur Kutsia (RISC, Johannes Kepler University Linz), Daniel Ventura (INF, Universidade Federal de Goias), David Monniaux (CNRS - Verimag), Jose F. Morales (IMDEA) · 2024

This volume contains * The post-proceedings of the Eighteenth Logical and Semantic Frameworks with Applications (LSFA 2023). The meeting was held on July 1-2, 2023, organised by the Sapienza Univers…

Read Paper →
Computer Science Preprint PDF DOI

Verified completeness in Henkin-style for intuitionistic propositional logic

Huayu Guo, Dongheng Chen, Bruno Bentzen · 2023

This paper presents a formalization of the classical proof of completeness in Henkin-style developed by Troelstra and van Dalen for intuitionistic logic with respect to Kripke models. The completeness…

Read Paper →
Computer Science Preprint PDF DOI

Alternating (In)Dependence-Friendly Logic

Dylan Bellier, Massimo Benerecetti, Dario Della Monica, Fabio Mogavero · 2023

Hintikka and Sandu originally proposed Independence Friendly Logic (IF) as a first-order logic of imperfect information to describe game-theoretic phenomena underlying the semantics of natural languag…

Read Paper →
Computer Science Preprint PDF DOI

Synthesis with Explicit Dependencies

Priyanka Golia, Subhajit Roy, Kuldeep S. Meel · 2023

Quantified Boolean Formulas (QBF) extend propositional logic with quantification $\forall, \exists$. In QBF, an existentially quantified variable is allowed to depend on all universally quantified var…

Read Paper →
Computer Science Preprint PDF DOI

The Future of Work: Agile in a Hybrid World

Dennis Mancl (MSWX Software Experts), Steven D. Fraser (Innoxec) · 2022

An agile organization adapts what they are building to match their customer's evolving needs. Agile teams also adapt to changes in their organization's work environment. The latest change is the evolv…

Read Paper →
Computer Science Preprint PDF DOI

HEGrid: A High Efficient Multi-Channel Radio Astronomical Data Gridding Framework in Heterogeneous Computing Environments

Hao Wang, Ce Yu, Jian Xiao, Shanjiang Tang, Min Long, Ming Zhu · 2022

The challenge to fully exploit the potential of existing and upcoming scientific instruments like large single-dish radio telescopes is to process the collected massive data effectively and efficientl…

Read Paper →
Page 1 of 4 Next →