Fetching the paper…
Reading the bibliography…
Reduze is a computer program for reducing Feynman integrals to master integrals employing a variant of Laporta's reduction algorithm.
H. Whitney, “2-isomorphic graphs,” American Journal of Mathematics 55 (1933) 245
1933
Earlier work this paper cites.
G. ’t Hooft and M. J. G. Veltman, “Regularization And Renormalization Of Gauge Fields,” Nucl. Phys. B 44
1972
Earlier work this paper cites.
J. Hopcroft and R. Tarjan, “Efficient algorithms for graph manipulation,” Communications of the ACM, vol. 16 number 6 (1973) 372
1973
Earlier work this paper cites.
J. Hopcroft and R. E. Tarjan, “Dividing a graph into triconnected components,” SIAM Journal on Computing 2 (1973) 135
1973
Earlier work this paper cites.
F. V. Tkachov, “A Theorem On Analytical Calculability Of Four Loop Renormalization Group Functions,” Phys. Lett. B 100
1981
Earlier work this paper cites.
K. G. Chetyrkin and F. V. Tkachov, “Integration By Parts: The Algorithm To Calculate Beta Functions In 4 Loops,” Nucl. Phys. B 192
1981
Earlier work this paper cites.
B. D. McKay, “Practical graph isomorphism,” 10th. Manitoba Conference on Numerical Mathematics and Computing, Winnipeg, 1980; Congressus Numerantium, 30 (1981) 45
1981
Earlier work this paper cites.
J.A.M. Vermaseren, ”Symbolic Manipulation with FORM, Version 2,” CAN, Amsterdam, 1991; “New features of FORM,” math-ph/0010025, http://www.nikhef.nl/~form
1991
Earlier work this paper cites.
P. Nogueira, ”Automatic Feynman graph generation,“ J. Comput. Phys. 105 (1993) 279
1993
Earlier work this paper cites.
T. Gehrmann and E. Remiddi, “Differential equations for two-loop four-point functions,” Nucl. Phys. B 580
2000
Cited alongside, same era.
S. Laporta, “High-precision calculation of multi-loop Feynman integrals by difference equations,” Int. J. Mod. Phys. A 15
2000
Cited alongside, same era.
T. Hahn, “Generating Feynman diagrams and amplitudes with FeynArts 3,” Comput. Phys. Commun. 140
2001
Cited alongside, same era.
C. Gutwenger and P. Mutzel, “A Linear Time Implementation of SPQR-Trees,” in J. Marks (ed.), Graph Drawing 2000, vol. 1984 of Lect. Notes in Comp. Science, Springer-Verlag (2001) 70. Open source implementation: OGDF
2001
Cited alongside, same era.
C. Anastasiou and A. Lazopoulos, “Automatic integral reduction for higher order perturbative calculations,” JHEP 0407
2004
Cited alongside, same era.
2008
Later among the works it cites.
A. V. Smirnov, “Algorithm FIRE – Feynman Integral REduction,” JHEP 0810
2008
Later among the works it cites.
Wolfram Research, Inc., Mathematica, Version 7.0, Champaign, IL (2008)
2008
Later among the works it cites.
C. Studerus, “Reduze - Feynman Integral Reduction in C++,” Comput. Phys. Commun. 181
2010
Later among the works it cites.
C. Bogner and S. Weinzierl, “Feynman graph polynomials,” Int. J. Mod. Phys. A 25
2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M.B. Monagan, K.O. Geddes, K.M. Heal, G. Labahn, S.M. Vorkoetter, J. McCarron and P. DeMarco, ”Maple 10 Programming Guide,“ Maplesoft, Waterloo ON, Canada, (2005)
2005
Cited alongside, same era.
A. V. Smirnov and V. A. Smirnov, “Applying Gröbner bases to solve reduction problems for Feynman integrals,” JHEP 0601
2006
Cited alongside, same era.
A. V. Smirnov, “An Algorithm to construct Gröbner bases for solving integration by parts relations,” JHEP 0604
2006
Cited alongside, same era.
Cited in the paper.
M. Tentyukov and J. Fleischer, “DIANA, A Program for Feynman diagram evaluation,” hep-ph/9905560
Cited in the paper.
Oracle Berkeley DB 11g, http://www.oracle.com
Cited in the paper.
C. W. Bauer, A. Frink and R. Kreckel, “Introduction to the GiNaC Framework for Symbolic Computation within the C++ Programming Language,” arXiv:cs/0004015, http://www.ginac.de
Cited in the paper.
2011
Later among the works it cites.
A. G. Grozin, “Integration by parts: An Introduction,” Int. J. Mod. Phys. A 26
2011
Later among the works it cites.