Monotonicity testing and shortest-path routing on the cube
暂无分享,去创建一个
Sourav Chakraborty | Arie Matsliah | Jop Briët | David García-Soriano | S. Chakraborty | A. Matsliah | J. Briët | David García-Soriano | Sourav Chakraborty
[1] A. Mullin,et al. Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .
[2] Dana Ron,et al. On Disjoint Chains of Subsets , 2001, J. Comb. Theory, Ser. A.
[3] Ronitt Rubinfeld,et al. Spot-checkers , 1998, STOC '98.
[4] Kyomin Jung,et al. Transitive-Closure Spanners of the Hypercube and the Hypergrid , 2009, Electron. Colloquium Comput. Complex..
[5] Ronitt Rubinfeld,et al. Monotonicity testing over general poset domains , 2002, STOC '02.
[6] Farhad Shahrokhi,et al. The maximum concurrent flow problem , 1990, JACM.
[7] Eldar Fischer. On the strength of comparisons in property testing , 2004, Inf. Comput..
[8] Anna Lubiw,et al. Counterexample to a Conjecture of Szymanski on Hypercube Routing , 1990, Inf. Process. Lett..
[9] Kyomin Jung,et al. Transitive-Closure Spanners , 2008, SIAM J. Comput..
[10] Abbas Yongaçoglu,et al. On the k-pairs problem , 2008, 2008 IEEE International Symposium on Information Theory.
[11] Dana Ron,et al. Improved Testing Algorithms for Monotonicity , 1999, Electron. Colloquium Comput. Complex..
[12] Robert D. Kleinberg,et al. On the capacity of information networks , 2006, IEEE Transactions on Information Theory.
[13] V. Benes,et al. Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .
[14] Dana Ron,et al. Testing Monotonicity , 2000, Comb..
[15] April Rasala Lehman. Network coding , 2005 .
[16] Sae-Young Chung,et al. Network coding , 2008, Journal of Communications and Networks.
[17] Arnab Bhattacharyya. A Note on the Distance to Monotonicity of Boolean Functions , 2008, Electron. Colloquium Comput. Complex..
[18] Ronitt Rubinfeld,et al. Spot-Checkers , 2000, J. Comput. Syst. Sci..
[19] Bernard Chazelle,et al. Information theory in property testing and monotonicity testing in higher dimension , 2005, Inf. Comput..
[20] Eyal Kushilevitz,et al. Testing Monotonicity over Graph Products , 2004, ICALP.
[21] Ted H. Szymanski,et al. On the Permutation Capability of a Circuit-Switched Hypercube , 1989, International Conference on Parallel Processing.
[22] Matemática,et al. Society for Industrial and Applied Mathematics , 2010 .
[23] Joshua Brody,et al. Property Testing Lower Bounds via Communication Complexity , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.