Integer Multiplication

Integer Multiplication is a computational problem in arithmetic complexity theory that involves the task of computing the product of two integers, distinguished within the class of arithmetic operations by its fundamental role in enabling efficient algorithmic decomposition via divide-and-conquer strategies such as Karatsuba's algorithm.

321

Publications

17.7K

Citations

664

Authors

280

Institutions

Publications per year

2017–2026

49

Authors

664

  1. JV
    Joris van der Hoeven

    Centre National de la Recherche Scientifique, France

    9 publications · 365 citations

    9

    h-index

  2. AG
    Andrew G. Dempster

    UNSW Sydney, Australia

    8 publications · 561 citations

    8

    h-index

  3. DH
    David Harvey

    UNSW Sydney, Australia

    7 publications · 334 citations

    7

    h-index

  4. MM
    M.D. Macleod

    University of Cambridge, United Kingdom

    7 publications · 464 citations

    7

    h-index

  5. GL
    Grégoire Lecerf

    École Polytechnique, France

    5 publications · 132 citations

    5

    h-index

1–5 of 664

Venues

  1. IEEE Transactions on Computers

    35 publications · 1.4K citations

    22

    h-index

  2. SIAM Journal on Computing

    12 publications · 1.8K citations

    11

    h-index

  3. Mathematics of Computation

    MCOM · 9 publications · 3.7K citations

    9

    h-index

  4. arXiv (Cornell University)

    Repository · 7 publications · 126 citations

    7

    h-index

  5. Journal of the ACM

    JACM · 5 publications · 1.1K citations

    5

    h-index

1–5