No. Title Author Year
1 Coverability in VASS Revisited: Improving Rackoff’s Bound to Obtain Conditional Optimality Künnemann, Marvin et al. 2023
2 Dynamic Data Structures for Parameterized String Problems Olkowski, Jędrzej et al. 2023
3 Computing Generalized Convolutions Faster Than Brute Force Esmer, Barış Can et al. 2022
4 Isolation Schemes for Problems on Decomposable Graphs Nederlof, Jesper et al. 2022
5 Knapsack and Subset Sum with Small Items Polak, Adam et al. 2021
6 Equal-Subset-Sum Faster Than the Meet-in-the-Middle Mucha, Marcin et al. 2019
7 On Problems Equivalent to (min,+)-Convolution Cygan, Marek et al. 2017
8 Improved Distance Queries and Cycle Counting by Frobenius Normal Form Sankowski, Piotr et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 8

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI