Stop the war!
Остановите войну!
for scientists:
default search action
Discrete Applied Mathematics, Volume 212
Volume 212, October 2016
- Jan Holub:
Editorial: Stringology Algorithms. 1 - Ali Alatabbi, M. Sohel Rahman, W. F. Smyth:
Computing covers using prefix tables. 2-9 - Lior Aronovich, Ron Asher, Danny Harnik, Michael Hirsch, Shmuel T. Klein, Yair Toaff:
Similarity based deduplication with small data chunks. 10-22 - Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto:
Closed factorization. 23-29 - Haoyue Bai, Frantisek Franek, William F. Smyth:
The New Periodicity Lemma revisited. 30-36 - David Becerra, Juan Mendivelso, Yoan J. Pinzón:
A multiobjective optimization algorithm for the weighted LCS. 37-47 - Bastien Cazaux, Eric Rivals:
The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings. 48-60 - Shuhei Denzumi, Ryo Yoshinaka, Hiroki Arimura, Shin-ichi Minato:
Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations. 61-80 - Antoine Deza, Frantisek Franek, Mei Jiang:
A computational substantiation of the d-step approach to the number of distinct squares problem. 81-87 - Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston, William F. Smyth:
A note on easy and efficient computation of full abelian periods of a word. 88-95 - Szymon Grabowski:
New tabulation and sparse dynamic programming based techniques for sequence similarity problems. 96-103 - Michael Hirsch, Ariel Ish-Shalom, Shmuel T. Klein:
Optimal partitioning of data chunks in deduplication systems. 104-114 - Shmuel T. Klein, Dana Shapira:
Random access to Fibonacci encoded files. 115-128
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.