No. Title Author Year
1 New Algorithms for Distributed Sliding Windows Gayen, Sutanu et al. 2018
2 On Pseudodeterministic Approximation Algorithms Dixon, Peter et al. 2018
3 A Note on the Advice Complexity of Multipass Randomized Logspace Dixon, Peter et al. 2016
4 New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs Chakraborty, Diptarka et al. 2014
5 Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs Datta, Samir et al. 2011
6 Kolmogorov Complexity in Randomness Extraction Hitchcock, John M. et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 6


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