On a reconstruction problem for sequences

Journal of Combinatorial Theory. Series A

Volumn 77, Issue 2, 1997, Pages 344-348

  Krasikov, I ^a   Roditty, Y ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031073038     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.1997.2732     Document Type: Article

References (5)

1. 1. J. A. Bondy, A graph reconstructor's manual, "Surveys in Combinatorics" (A. D. Keedwell, Ed.), pp. 221-252.
2. 2. P. Borwein and C. Engalls, The Prouhet-Tarry-Escott problem revisited, Ens. Math. 40 (1994), 3-27.
3. 3. P. Borwein, T. Erdelyi, and G. Kos, Littewood-type problems on [0, 1], preprint.
4. 4. L. I. Kalashnik, The reconstruction of a word from fragments, in "Numerical Mathematics and Computer Technology," pp. 56-57, Akad. Nauk Ukrain. SSR Inst. Mat., Preprint IV, (1973). [Russian]
5. 5. B. Manvel, A. Meyerowitz, A. Schwenk, K. Smith, and P. Stockmeyer, Reconstruction of sequences, Discrete Math. 94 (1991), 209-219.