-
Discrete mathematical problems in Quantum Field Theory
-
Automatic generation of Feynman diagrams
-
Graphs, combinatorics
-
QGRAF a Fortran program for generating Feynman diagrams (in symbolic form)
-
QGRAF–R a Fortran program for computing particle number conservation rules and ‘solving’ inclusive processes
-
Feynman graph generation and propagator mixing, I
Comput. Phys. Commun. 269 (2021) 108103
https://doi.org/10.1016/j.cpc.2021.108103
-
From Feynman rules to conserved quantum numbers, III
Comput. Phys. Commun. 260 (2021) 107740
https://doi.org/10.1016/j.cpc.2020.107740
-
From Feynman rules to conserved quantum numbers, II
Comput. Phys. Commun. 215 (2017) 13–19
https://doi.org/10.1016/j.cpc.2017.01.027
-
From Feynman rules to conserved quantum numbers, I
Comput. Phys. Commun. 214 (2017) 83–90
https://doi.org/10.1016/j.cpc.2017.01.025
-
On the combinatorics of leftist trees
Discrete Appl. Math. 109 (2001) 253–278
https://doi.org/10.1016/S0166-218X(00)00250-X
-
The 3–loop QCD calculation of the moments of deep inelastic structure functions
S.A. Larin, P. Nogueira, T. van Ritbergen, J.A.M. Vermaseren
Nucl. Phys. B 492 (1997) 338–378
https://doi.org/10.1016/S0550-3213(97)80038-7
-
Initial-final state interference in e + e − → H  μ + μ −
P. Nogueira, J.C. Romão
Z. Phys. C 60 (1993) 757–762
https://doi.org/10.1007/BF01558407
-
Automatic Feynman graph generation
J. Comput. Phys. 105 (1993) 279–289
https://doi.org/10.1006/jcph.1993.1074
-
Further references may be found at
-
For the e-mail address please follow this link.