A Critical Pair Enumeration Algorithm for String Diagram Rewriting
Fuente:
arXiv
Saved in:
| Main Authors: | Matsui, Anna, Obi, Innocent, Sabbagh, Guillaume, Torres, Leo, Kessler, Diana, Meleiro, Juan F., Muroya, Koko |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Amortized Analysis via Coalgebra
by: Grodin, Harrison, et al.
Published: (2024)
by: Grodin, Harrison, et al.
Published: (2024)
Certified binary search tree on W-types
by: Arengas, Gustavo
Published: (2024)
by: Arengas, Gustavo
Published: (2024)
Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
by: Kobayashi, Yasuaki, et al.
Published: (2023)
by: Kobayashi, Yasuaki, et al.
Published: (2023)
Matching (Multi)Cut: Algorithms, Complexity, and Enumeration
by: Gomes, Guilherme C. M., et al.
Published: (2024)
by: Gomes, Guilherme C. M., et al.
Published: (2024)
All-Pairs Suffix-Prefix on Fully Dynamic Set of Strings
by: Kikuchi, Masaru, et al.
Published: (2024)
by: Kikuchi, Masaru, et al.
Published: (2024)
Enumeration Algorithms for Conjunctive Queries with Projection
by: Deep, Shaleen, et al.
Published: (2021)
by: Deep, Shaleen, et al.
Published: (2021)
Algorithms for Parameterized String Matching with Mismatches
by: Saha, Apurba, et al.
Published: (2024)
by: Saha, Apurba, et al.
Published: (2024)
Algorithms for the local and the global postage stamp problem
by: Palais, Léo Colisson, et al.
Published: (2026)
by: Palais, Léo Colisson, et al.
Published: (2026)
String Indexing with Compressed Patterns
by: Bille, Philip, et al.
Published: (2019)
by: Bille, Philip, et al.
Published: (2019)
Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings
by: Cleary, Alan M., et al.
Published: (2024)
by: Cleary, Alan M., et al.
Published: (2024)
An Algorithm for the Longest Common Subsequence and Substring Problem for Multiple Strings
by: Li, Rao
Published: (2024)
by: Li, Rao
Published: (2024)
An Approximation Algorithm for $K$-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints
by: Kurita, Kazuhiro, et al.
Published: (2022)
by: Kurita, Kazuhiro, et al.
Published: (2022)
Transversal Rank, Conformality and Enumeration
by: Schirneck, Martin
Published: (2026)
by: Schirneck, Martin
Published: (2026)
From Amortized to Worst Case Delay in Enumeration Algorithms
by: Capelli, Florent, et al.
Published: (2021)
by: Capelli, Florent, et al.
Published: (2021)
String Indexing for Top-$k$ Close Consecutive Occurrences
by: Bille, Philip, et al.
Published: (2020)
by: Bille, Philip, et al.
Published: (2020)
A Simple Algorithm for Trimmed Multipoint Evaluation
by: Fischer, Nick, et al.
Published: (2025)
by: Fischer, Nick, et al.
Published: (2025)
Suffix Random Access via Function Inversion: A Key for Asymmetric Streaming String Algorithms
by: Charalampopoulos, Panagiotis, et al.
Published: (2026)
by: Charalampopoulos, Panagiotis, et al.
Published: (2026)
Faster Algorithms for Average-Case Orthogonal Vectors and Closest Pair Problems
by: Alman, Josh, et al.
Published: (2024)
by: Alman, Josh, et al.
Published: (2024)
Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties
by: Matsui, Tomomi, et al.
Published: (2016)
by: Matsui, Tomomi, et al.
Published: (2016)
FlexFlood: Efficiently Updatable Learned Multi-dimensional Index
by: Hidaka, Fuma, et al.
Published: (2024)
by: Hidaka, Fuma, et al.
Published: (2024)
Fast Construction of Partitioned Learned Bloom Filter with Theoretical Guarantees
by: Sato, Atsuki, et al.
Published: (2024)
by: Sato, Atsuki, et al.
Published: (2024)
Gapped String Indexing in Subquadratic Space and Sublinear Query Time
by: Bille, Philip, et al.
Published: (2022)
by: Bille, Philip, et al.
Published: (2022)
Enumeration kernels for Vertex Cover and Feedback Vertex Set
by: Bougeret, Marin, et al.
Published: (2025)
by: Bougeret, Marin, et al.
Published: (2025)
Enumerating All Directed Spanning Trees in Optimal Time
by: Gawrychowski, Paweł, et al.
Published: (2026)
by: Gawrychowski, Paweł, et al.
Published: (2026)
Online String Attractors
by: Whittington, Philip
Published: (2024)
by: Whittington, Philip
Published: (2024)
Confluence of the Node-Domination and Edge-Domination Hypergraph Rewrite Rules
by: Amarilli, Antoine, et al.
Published: (2025)
by: Amarilli, Antoine, et al.
Published: (2025)
PCF Learned Sort: a Learning Augmented Sort Algorithm with $O(n \log\log n)$ Expected Complexity
by: Sato, Atsuki, et al.
Published: (2024)
by: Sato, Atsuki, et al.
Published: (2024)
A Simple, Nearly-Optimal Algorithm for Differentially Private All-Pairs Shortest Distances
by: Campbell, Jesse, et al.
Published: (2024)
by: Campbell, Jesse, et al.
Published: (2024)
Enumerating m-Length Walks in Directed Graphs with Constant Delay
by: Adamson, Duncan, et al.
Published: (2024)
by: Adamson, Duncan, et al.
Published: (2024)
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
by: Cai, Xinwei, et al.
Published: (2023)
by: Cai, Xinwei, et al.
Published: (2023)
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
by: Conte, Alessio, et al.
Published: (2024)
by: Conte, Alessio, et al.
Published: (2024)
Quantum Algorithm for the Multiple String Matching Problem
by: Khadiev, Kamil, et al.
Published: (2024)
by: Khadiev, Kamil, et al.
Published: (2024)
String Covering: A Survey
by: Mhaskar, Neerja, et al.
Published: (2022)
by: Mhaskar, Neerja, et al.
Published: (2022)
Scalable Distributed String Sorting
by: Kurpicz, Florian, et al.
Published: (2024)
by: Kurpicz, Florian, et al.
Published: (2024)
Pattern Discovery in Colored Strings
by: Lipták, Zsuzsanna, et al.
Published: (2020)
by: Lipták, Zsuzsanna, et al.
Published: (2020)
Minimizers in Semi-Dynamic Strings
by: Zuba, Wiktor, et al.
Published: (2025)
by: Zuba, Wiktor, et al.
Published: (2025)
Elastic-Degenerate String Comparison
by: Gabory, Esteban, et al.
Published: (2024)
by: Gabory, Esteban, et al.
Published: (2024)
Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs
by: Mu, Ta-Yu, et al.
Published: (2024)
by: Mu, Ta-Yu, et al.
Published: (2024)
A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs
by: Das, Debarati, et al.
Published: (2026)
by: Das, Debarati, et al.
Published: (2026)
Engineering Algorithms for $\ell$-Isolated Maximal Clique Enumeration
by: D'Elia, Marco, et al.
Published: (2025)
by: D'Elia, Marco, et al.
Published: (2025)
Similar Items
-
Amortized Analysis via Coalgebra
by: Grodin, Harrison, et al.
Published: (2024) -
Certified binary search tree on W-types
by: Arengas, Gustavo
Published: (2024) -
Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
by: Kobayashi, Yasuaki, et al.
Published: (2023) -
Matching (Multi)Cut: Algorithms, Complexity, and Enumeration
by: Gomes, Guilherme C. M., et al.
Published: (2024) -
All-Pairs Suffix-Prefix on Fully Dynamic Set of Strings
by: Kikuchi, Masaru, et al.
Published: (2024)