Similar Items: On the Complexity of the Matching Problem of Regular Expressions with Backreferences
- Towards Settling the Complexity of the Lettericity Problem
- On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
- Set Parameterized Matching via Multi-Layer Hashing
- A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching
- A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
- Accelerated Relax-and-Round for Concave Coverage Problems