|
|
|
|
|
Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
We consider the communication complexity of the Hamming distance of two strings. Bille et al. [SPIRE 2018] considered the communication complexity of the longest common prefix (LCP) problem in the setting where the two parties have their strings in a com...
ver más
|
|
|
|
|
|
|
|
|
|
|
Zhuo Xu, Josh W. Albrecht, Shreyas S. Kolapkar, Stas Zinchik and Ezra Bar-Ziv
This study provides a pathway to remove chlorine from the solid wastes, and to produce low-cost solid fuels with enhanced properties for power applications.
|
|
|
|
|
|
|
|
|
|
|
D. Shtienberg, Y. Elad, M. Bornstein, G. Ziv, A. Grava, and S. Cohen
Pág. 97 - 104
|
|
|
|
|
|
|
|
|
|
|
Landau, H. J. Mazo, J. E. Shamai, S. Ziv, J.
Pág. 1237 - 1242
|
|
|
|
|
|