No. Title Author Year
1 String Factorization via Prefix Free Families Kraus, Matan et al. 2023
2 On the Hardness of Set Disjointness and Set Intersection with Bounded Universe Goldstein, Isaac et al. 2019
3 Improved Space-Time Tradeoffs for kSUM Goldstein, Isaac et al. 2018
4 Can We Recover the Cover? Amir, Amihood et al. 2017
5 Orthogonal Vectors Indexing Goldstein, Isaac et al. 2017
6 Structure and Hardness in P (Dagstuhl Seminar 16451) Lewenstein, Moshe et al. 2017
7 Front Matter, Table of Contents, Preface Grossi, Roberto et al. 2016
8 How Hard is it to Find (Honest) Witnesses? Goldstein, Isaac et al. 2016
9 LIPIcs, Volume 54, CPM'16, Complete Volume Grossi, Roberto et al. 2016
10 Space-Efficient String Indexing for Wildcard Pattern Matching Lewenstein, Moshe et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 10

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