No. Title Author Year
1 Counting Connected Subgraphs with Maximum-Degree-Aware Sieving Björklund, Andreas et al. 2018
2 Engineering Motif Search for Large Motifs Kaski, Petteri et al. 2018
3 Generalized Kakeya Sets for Polynomial Evaluation and Faster Computation of Fermionants Björklund, Andreas et al. 2018
4 Tensor Network Complexity of Multilinear Maps Austrin, Per et al. 2018
5 Directed Hamiltonicity and Out-Branchings via Generalized Laplacians Björklund, Andreas et al. 2017
6 The First Parameterized Algorithms and Computational Experiments Challenge Dell, Holger et al. 2017
7 Dense Subset Sum May Be the Hardest Austrin, Per et al. 2016
8 Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time Karppa, Matti et al. 2016
9 Subset Sum in the Absence of Concentration Austrin, Per et al. 2015
10 Probably Optimal Graph Motifs Björklund, Andreas et al. 2013
Current Page :
Number of result pages: 2
Number of documents: 12

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