John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
In this short note, we show a simple characterization of integers that reach records for a sequence described by adding binary strings to runs of 1's and 0's in a binary representation. In particular, we show that this set does not depend on the added strings as long as they are nonempty and of the same length.
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences