@inproceedings{bc7962a42a954687aed27f777fd386ee,

title = "How fast can we multiply large integers on an actual computer?",

abstract = "We provide two complexity measures that can be used to measure the running time of algorithms to compute multiplications of long integers. The random access machine with unit or logarithmic cost is not adequate for measuring the complexity of a task like multiplication of long integers. The Turing machine is more useful here, but fails to take into account the multiplication instruction for short integers, which is available on physical computing devices. An interesting outcome is that the proposed refined complexity measures do not rank the well known multiplication algorithms the same way as the Turing machine model.",

author = "Martin F{\"u}rer",

year = "2014",

doi = "10.1007/978-3-642-54423-1_57",

language = "English (US)",

isbn = "9783642544224",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "660--670",

booktitle = "LATIN 2014",

address = "Germany",

note = "11th Latin American Theoretical Informatics Symposium, LATIN 2014 ; Conference date: 31-03-2014 Through 04-04-2014",

}