Modular Form Computations
Modular Form Computations is a computational methodology in Computational Number Theory that specifically involves the algorithmic construction, manipulation, and analysis of modular forms and their arithmetic invariants through finite approximations, Fourier expansions, Hecke operators, and associated L-functions.
1.1K
Publications
47.9K
Citations
1.1K
Authors
536
Institutions
Publications per year
2017–2026
111
Parents
1.1K
1–5 of 1.1K
1.1K
16
h-index
13
h-index
13
h-index
12
h-index
11
h-index
1–5 of 1.1K
536
Max Planck Institute for Mathematics
Bonn, Germany
19 h-index
33 publications
2K citations
Princeton University
Princeton, United States
17 h-index
25 publications
2.1K citations

Centre National de la Recherche Scientifique
Paris, France
16 h-index
30 publications
907 citations
University of Wisconsin–Madison
Madison, United States
15 h-index
24 publications
1.4K citations
Max Planck Society
Munich, Germany
14 h-index
16 publications
1K citations
Harvard University
Cambridge, United States
12 h-index
18 publications
2.1K citations
University of Illinois Urbana-Champaign
Urbana, United States
12 h-index
18 publications
446 citations

University of Cologne
Cologne, Germany
12 h-index
19 publications
925 citations
1–8 of 536
43 publications · 5.8K citations
39
h-index
55 publications · 1.3K citations
22
h-index
DMJ · 36 publications · 1.7K citations
22
h-index
24 publications · 3.4K citations
21
h-index
TRAN · 34 publications · 1.5K citations
20
h-index
1–5