1 citations · 1 across the 4 of their papers we have counts for
4 papers
cs.DM2006
Computing Fibonacci numbers on a Turing Machine
Alex Vinokur
A Turing machine that computes Fibonacci numbers is described.
cs.DM2004
Fibonacci-Like Polynomials Produced by m-ary Huffman Codes for Absolutely Ordered Sequences
Alex Vinokur
Fibonacci-like polynomials produced by m-ary Huffman codes for absolutely ordered sequences have been described.
cs.LO2004
Turing Machine with Faults, Failures and Recovery
Alex Vinokur
A Turing machine with faults, failures and recovery (TMF) is described. TMF is (weakly) non-deterministic Turing machine consisting of five semi-infinite tapes (Master Tape, Synchr…
cs.DM2004★ 1 cited
Fibonacci connection between Huffman codes and Wythoff array
Alex Vinokur
Fibonacci connection between non-decreasing sequences of positive integers producing maximum height Huffman trees and the Wythoff array has been proved.