70 citations · 123 across the 26 of their papers we have counts for
3 papers · 1 filter
A Cost-Aware Probability Monad for Liquid Haskell
Matthias Hetzenberger, Georg Moser, Florian Zuleger
Probabilistic algorithms and data structures are widely used to obtain favourable expected performance guarantees. While their mathematical analysis is often well understood, mecha…
Automated Amortised Analysis of Skew Heaps and Leftist Heaps (Extended Version)
Armin Walch, Georg Moser, Berry Schoenmakers +1
We study the fully automated amortised analysis of purely functional data structures like skew heaps, as well as weight- and rank-biased leftist heaps. For that we generalise earli…
Regular Grammars as Effective Representations of Recognizable Sets of Series-Parallel Graphs
Marius Bozga, Radu Iosif, Florian Zuleger
Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable…