No. Title Author Year
1 Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding Das, Debarati et al. 2022
2 A Linear-Time n^{0.4}-Approximation for Longest Common Subsequence Bringmann, Karl et al. 2021
3 Approximate Trace Reconstruction via Median String (In Average-Case) Chakraborty, Diptarka et al. 2021
4 Approximate Online Pattern Matching in Sublinear Time Chakraborty, Diptarka et al. 2019
5 Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication Das, Debarati et al. 2018
6 Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity Chakraborty, Diptarka et al. 2018
7 Sparse Weight Tolerant Subgraph for Single Source Shortest Path Chakraborty, Diptarka et al. 2018
8 Dimension, Pseudorandomness and Extraction of Pseudorandomness Agrawal, Manindra et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 8

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