We can represent an array A[1..n] of digits using ceiling(n log2 10) bits on a regular computer, such that reading or writing any A[i] value can be done in constant time.
Come hear the details at my talk tommorow (Wednesday, 12pm, Wozniak lounge, Soda Hall, Berkeley). The write-up is forthcoming, and will be posted here.
Isn't it generalization of your trits paper?
ReplyDeleteIt's an improvement of my FOCS paper... There, the redundancy was n / polylog(n), while now it is essentially zero.
ReplyDeleteseems intriguing
ReplyDeleteFYI:
ReplyDeletehttp://eccc.hpi-web.de/eccc-reports/2009/TR09-005/index.html
Mihai, have you written this down yet? Did you make slides for your presentation?
ReplyDeleteI'm gathering material for my graduate data structures class and am curious to see if this is something I can include.