Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
103
click to vote
ESA
2005
Springer
155
views
Algorithms
»
more
ESA 2005
»
A Loopless Gray Code for Minimal Signed-Binary Representations
15 years 8 months ago
Download
infolab.stanford.edu
A string . . . a2a1a0 over the alphabet {−1, 0, 1} is said to be a minimal signed-binary representation of an integer n if n = k≥0 ak2k and the number of non-zero digits is ...
Gurmeet Singh Manku, Joe Sawada
claim paper
Read More »