#### Filter Results:

- Full text PDF available (4)

#### Publication Year

1989

2006

- This year (0)
- Last five years (0)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- J K Rivers, A W Kopf, +4 authors M Levenstein
- Cancer
- 1990

A total of 452 patients with dysplastic nevi (DN) were followed prospectively by repetitive, complete cutaneous examinations in order to determine the clinical features of early malignant melanomas (MM) arising in them. Sixteen patients (3.5%) developed 18 newly diagnosed MM during an average follow-up period of 27 months. Twelve of the 18 MM were in situ… (More)

- D S Rigel, J K Rivers, +4 authors M Levenstein
- Cancer
- 1989

A total of 452 white patients, classified into four dysplastic nevi groups, were followed prospectively by repetitive, complete cutaneous examinations using total-body photographs taken on entry into the study. Sixteen patients (3.5%) developed 18 newly diagnosed malignant melanomas (MM) during an average follow-up period of 27 months. Twelve of the 18 MM… (More)

- Alex Vinokur
- ArXiv
- 2004

A non-decreasing sequence of positive integer weights P = {p1,. .. , p2, pn} is called k-ordered if an intermediate sequence of weights produced by Huffman algorithm for initial sequence P on i-th step satisfies the following conditions: p

- Alex Vinokur
- ArXiv
- 2004

A Turing machine with faults, failures and recovery (TMF) is described. TMF is (weakly) non-deterministic Turing machine consisting of five semi-infinite Repair Phase). C++ Simulator of a Turing machine with faults, failures and recovery has been developed. In contrast to practical situation a regular Turing Machine never fails [1]. Some Turing machine that… (More)

- Alex Vinokur
- ArXiv
- 2006

A Turing machine that computes Fibonacci numbers is described .

- Alex Vinokur
- ArXiv
- 2004

A non-decreasing sequence of positive integer weights P ={p 1 , p 2 ,…, p n } (n = N*(m-1) + 1, N is number of non-leaves of m-ary tree) is called absolutely ordered if the intermediate sequences of weights produced by m-ary Huffman algorithm for initial sequence P on i-th step satisfy the following conditions 2 , ,) (1) (− = < + N 0 i p p i m i m. Let T be… (More)

- ‹
- 1
- ›