References
- Baksys, D. and Sakalauskas, L., Simulation and testing of FIFO clearing algorithms. Inform. Technol. Control, 2010, 39(1), 25–31.
- Brouwer, D., System and method of implementing massive early terminations of long term financial contracts, TriOptima US Patent 8,306,905, Filed July 18, 2011.
- CCRO, Credit risk management, Credit Risk Management Working Group 4, 2002.
- Cont, R. and Kokholm, T., Central clearing of OTC derivatives: Bilateral vs multilateral netting. Stat. Risk Model., 2014, 31(1), 3–22.
- Cont, R. and Moussa, A., Too interconnected to fail: default contagion and systemic risk in financial networks. Working Paper, Columbia Centre for Financial Engineering, 2009.
- Duffie, D. and Zhu, H., Does a central clearing counterparty reduce counterparty risk. Rev. Asset Pricing Stud., 2011, 1(1), 74–95.
- Gizycki, M. and Gray, B., Default risk and derivatives: An empirical analysis of bilateral netting. Research Discussion Paper, Bank Supervision Department, Reserve Bank of Australia (9409), 1994.
- Gregory, J., Central Counterparties, 2014 (John Wiley & Sons).
- Humes, C. Jr, Lauretto, M.S., Nakano, F., Pereira, C.A.B., Rafare, G.F.G. and Stern, J.M., Token-ring clearing heuristic for currency circulation. AIP Conference Proceedings, 2012, 1490(1), 179–188.
- Johnson, D., Finding all of the elementary circuits of a directed graph. SIAM Comput., 1975, 4(1), 77–84.
- Ledrut, E. and Upper, C., Changing post-trading arrangements for OTC derivatives. BIS Quart. Rev., 2007, December, 83–95.
- Mengle, D., Concentration of OTC derivatives among major dealers. ISDA Res. Notes, 2010, (4), 1–7.
- Murphy, D., OTC Derivatives, Bilateral Trading and Central Clearing: An Introduction to Regulatory Policy, Market Impact and Systemic Risk, 2013 (Palgrave Macmillan).
- OCC, Risk management of financial derivatives. In Comptroller’s Handbook, 1997, 1–186.
- O’Kane, D., Counterparty risk minimization by the optimal netting of OTC derivative trades. J. Deriv., 2016, 24(2), 66–87.
- Tarjan, R., Depth-first search and linear graph algorithms. SIAM J. Comput., 1972, 1(2), 146–160.