Complexity Of Numerical Algorithms
Complexity of Numerical Algorithms is the theoretical measure of computational resources required by numerical algorithms to solve mathematical problems, distinguished by its focus on the efficiency and scalability of operations involving real or floating-point arithmetic.
474
Publications
37.6K
Citations
883
Authors
440
Institutions
Publications per year
2017–2026
64
Parents
474
1–5 of 474
883
7
h-index
6
h-index
6
h-index
5
h-index
Centre National de la Recherche Scientifique, France
5 publications · 104 citations
5
h-index
1–5 of 883
440
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
15 h-index
36 publications
1K citations

Centre National de la Recherche Scientifique
Paris, France
15 h-index
35 publications
1.2K citations
University of California, Berkeley
Berkeley, United States
11 h-index
19 publications
1K citations
Laboratoire Lorrain de Recherche en Informatique et ses Applications
Nancy, France
8 h-index
14 publications
263 citations
Stanford University
Stanford, United States
7 h-index
14 publications
5K citations
Université Claude Bernard Lyon 1
Villeurbanne, France
7 h-index
14 publications
299 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
7 h-index
9 publications
288 citations
Columbia University
New York, United States
7 h-index
7 publications
265 citations
1–8 of 440
13 publications · 1.9K citations
13
h-index
MCOM · 12 publications · 1.2K citations
12
h-index
12 publications · 629 citations
11
h-index
TOMS · 11 publications · 441 citations
11
h-index
10 publications · 334 citations
10
h-index
1–5