No. Title Author Year
1 An Improved Protocol for the Exactly-N Problem Linial, Nati et al. 2021
2 On the Communication Complexity of High-Dimensional Permutations Linial, Nati et al. 2018
3 The Cover Number of a Matrix and its Algorithmic Applications Alon, Noga et al. 2014
4 Approximation norms and duality for communication complexity lower bounds Lee, Troy et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 4


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