Cover Image

Optimizations and extensions for fair join pattern matching

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Karras, Ioannis
Format:	Preprint
Published:	2025
Subjects:	Programming Languages Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Towards Efficient Hash Maps in Functional Array Languages
by: Due, William Henrich, et al.
Published: (2025)

AbsInf: A Lightweight Object to Represent float('inf') in Dijkstra's Algorithm
by: Bellamkonda, Anjan, et al.
Published: (2025)

Implementing Binary Search Trees in GP 2 (Extended Abstract)
by: Alaoui, Ziad Ismaili, et al.
Published: (2026)

Diagram Control and Model Order for Sugiyama Layouts
by: Domrös, Sören, et al.
Published: (2024)

Efficient Dynamic Algorithms to Predict Short Races
by: Zhang, Minjian, et al.
Published: (2026)

A Note on Dynamic Bidirected Dyck-Reachability with Cycles
by: Zhang, Qirun
Published: (2024)

Parsing Millions of URLs per Second
by: Nizipli, Yagiz, et al.
Published: (2023)

Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling
by: Huang, Qunsheng, et al.
Published: (2024)

Declarative Concurrent Data Structures
by: Raza, Aun, et al.
Published: (2024)

Faster two-dimensional pattern matching with $k$ mismatches
by: Ellert, Jonas, et al.
Published: (2024)

Amortized Analysis via Coalgebra
by: Grodin, Harrison, et al.
Published: (2024)

High-level quantum algorithm programming using Silq
by: Bezganovic, Viktorija, et al.
Published: (2024)

Deep Learning and Machine Learning -- Python Data Structures and Mathematics Fundamental: From Theory to Practice
by: Chen, Silin, et al.
Published: (2024)

Quantum Backtracking in Qrisp Applied to Sudoku Problems
by: Seidel, Raphael, et al.
Published: (2024)

Corecursive Coding of High Computational Derivatives and Power Series
by: Karczmarczuk, Jerzy
Published: (2025)

Verified Purely Functional Catenable Real-Time Deques
by: Viennot, Jules, et al.
Published: (2025)

A bargain for mergesorts -- How to prove your mergesort correct and stable, almost for free
by: Cohen, Cyril, et al.
Published: (2024)

Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
by: Leutgeb, Lorenz, et al.
Published: (2022)

Markovian protocols and an upper bound on the extension complexity of the matching polytope
by: Szusterman, M.
Published: (2026)

$k$-times bin packing and its application to fair electricity distribution
by: Baghel, Dinesh Kumar, et al.
Published: (2023)

Approximations for Fault-Tolerant Total and Partial Positive Influence Domination
by: Lamprou, Ioannis, et al.
Published: (2025)

Optimization with pattern-avoiding input
by: Berendsohn, Benjamin Aram, et al.
Published: (2023)

Online matching on stochastic block model
by: Cherifa, Maria, et al.
Published: (2025)

Suffix sorting via matching statistics
by: Lipták, Zsuzsanna, et al.
Published: (2022)

Dynamic online matching with budget refills
by: Cherifa, Maria, et al.
Published: (2024)

Improved fixed-parameter bounds for Min-Sum-Radii and Diameters $k$-clustering and their fair variants
by: Banerjee, Sandip, et al.
Published: (2025)

Graph matching based on similarities in structure and attributes
by: Candelier, Raphaël
Published: (2024)

Online matching games in bipartite expanders and applications
by: Bauwens, Bruno, et al.
Published: (2022)

Counting perfect matchings and Hamiltonian cycles faster
by: Li, Baitian
Published: (2023)

Online matching with delays and stochastic arrival times
by: Mari, Mathieu, et al.
Published: (2022)

Computing maximal palindromes in non-standard matching models
by: Mieno, Takuya, et al.
Published: (2022)

A customizable inexact subgraph matching algorithm for attributed graphs
by: Benko, Tatyana, et al.
Published: (2025)

A framework for boosting matching approximation: parallel, distributed, and dynamic
by: Mitrović, Slobodan, et al.
Published: (2025)

Finding sparse induced subgraphs on graphs of bounded induced matching treewidth
by: Bodlaender, Hans L., et al.
Published: (2025)

Permutation patterns in streams
by: Berendsohn, Benjamin Aram
Published: (2025)

Enabling AI ASICs for Zero Knowledge Proof
by: Tong, Jianming, et al.
Published: (2026)

Parameterized Linear Time Transitive Closure
by: Kritikakis, Giorgos, et al.
Published: (2024)

Towards counterfactual fairness through auxiliary variables
by: Tian, Bowei, et al.
Published: (2024)

Approximate counting of permutation patterns
by: Ben-Eliezer, Omri, et al.
Published: (2024)

Compact representations of pattern-avoiding permutations
by: Kozma, László, et al.
Published: (2025)