    @PhdThesis{akishina4D,
        title={Four-dimensional event reconstruction in the CBM experiment},
        author={Akishina, Valentina},
        year={2016},
        school={Johann Wolfgang Goethe-Universität, Fachbereich Informatik und Mathematik},
        url = {inis.iaea.org/search/search.aspx?orig_q=RN:49093434}
    }
    
    @article{intel_sustainability,
        author = {Curry, Edward and Guyon, Bill and Sheridan, Charles and Donnellan, Brian},
        year = {2012},
        month = {06},
        pages = {61-74},
        title = {Developing an Sustainable IT Capability: Lessons From Intel's Journey},
        volume = {11},
        journal = {MIS Quarterly Executive}
    }
    
    @article{game_of_life,
        title={The fantastic combinations of John Conway’s new solitaire game “life”},
        author={Gardner, Martin},
        journal={Scientific American},
        volume={223},
        pages={120--123},
        year={1970},
        url={web.stanford.edu/class/sts145/Library/life.pdf},
        cited = {2022-10-07}
    }
    
    @article{Hough1959MachineAO,
        author = "Hough, P. V. C.",
        editor = "Kowarski, L.",
        title = "{Machine Analysis of Bubble Chamber Pictures}",
        journal = "Conf. Proc. C",
        volume = "590914",
        pages = "554--558",
        year = "1959",
        url = "inspirehep.net/files/53d80b0393096ba4afe34f5b65152090"
    }

    @article{ALICE,
      author        = "Rohr, David and Gorbunov, Sergey and Lindenstruth, Volker",
      collaboration = "ALICE",
      title         = "{GPU-accelerated track reconstruction in the ALICE High
                       Level Trigger. GPU-accelerated track reconstruction in the
                       ALICE High Level Trigger}",
      archivePrefix = "arXiv",
      eprint        = "1712.09430",
      journal       = "J. Phys.: Conf. Ser.",
      volume        = "898",
      number        = "3",
      pages         = "032030",
      year          = "2017",
      url           = "http://cds.cern.ch/record/2297452",
      note          = "8 pages, 7 figures, contribution to CHEP 2016 conference",
      doi           = "10.1088/1742-6596/898/3/032030",
    }
    
    @article{flame_graph,
        author = {Gregg, Brendan},
        title = {The Flame Graph},
        year = {2016},
        issue_date = {June 2016},
        publisher = {Association for Computing Machinery},
        address = {New York, NY, USA},
        volume = {59},
        howpublished = "online",
        number = {6},
        issn = {0001-0782},
        url = {https://doi.org/10.1145/2909476},
        doi = {10.1145/2909476},
        abstract = {This visualization of software execution is a new necessity for performance profiling and debugging.},
        journal = {Commun. ACM},
        month = {may},
        pages = {48–57},
        numpages = {10}
    }

    @misc{mellanox,
        title = "Mellanox ConnectX-6 VPI Adapter Card",
        subtitle = "Product brief",
        institute = "Mellanox Technologies",
        year = "2016",
        howpublished = "online",
        URL = "https://www.chipict.com/wp-content/uploads/2018/09/PB_ConnectX-6_VPI_Card.pdf",
        key = "Mellanox"
        }

    @webpage{cutress_2017, 
        title = {Intel Lists Knights Mill Xeon Phi on ARK: Up to 72 cores at 320W with QFMA and VNNI}, 
        URL = {https://www.anandtech.com/show/12172/intel-lists-knights-mill-xeon-phi-on-ark-up-to-72-cores-at-320w-with-qfma-and-vnni}, 
        journal = {anandtech.com}, 
        publisher = {AnandTech}, 
        author = {Cutress, Ian}, 
        year = {2017}, 
        month = {12},
        day = {19},
        howpublished = {online},
        cited = {2023-04-04}
        } 

     @webpage{cutress_shilov_2019, 
        title = {The Larrabee Chapter Closes: Intel's Final Xeon Phi Processors Now in EOL}, 
        URL = {https://www.anandtech.com/show/14305/intel-xeon-phi-knights-mill-now-eol}, 
        journal = {anandtech.com}, 
        publisher = {AnandTech}, 
        author = {Cutress, Ian and Shilov, Anton}, 
        year = {2019}, 
        month = {05},
        day = {07},
        cited = {2023-04-04},
        howpublished = {online}
        } 
    
    @article{hough_watershed_transforms,
        author = {Toquica Cáceres, Hans},
        year = {2017},
        month = {03},
        pages = {1-11},
        title = {Hough and Watershed Transforms Algorithms Brief Review},
        doi = {10.13140/RG.2.2.35718.98889},
        url = {www.researchgate.net/publication/315495322_Hough_and_Watershed_Transforms_Algorithms_Brief_Review}
    }
    
    @website{desmos,
        year =         "2015",
        title =        "Desmos Graphing Calculator",
        howpublished = "online",
        url =          "www.desmos.com",
        cited =        "2022-10-07",
        key =          "Desmos Graphing Calculator"
    }
    
    @webpage{gfg_bisection,
        institution =  {GeeksforGeeks},
        year =         "2021",
        month =        "04",
        day =          "06",
        title =        "Program for Bisection Method",
        howpublished = "online",
        url =          "www.geeksforgeeks.org/program-for-bisection-method",
        cited =        "2022-7-27",
        key =          "Bisection method"
    }
    
    @article{julia,
        author = {Bezanson, Jeff and Edelman, Alan and Karpinski, Stefan and Shah, Viral B.},
        title = {Julia: A Fresh Approach to Numerical Computing},
        journal = {SIAM Review},
        volume = {59},
        number = {1},
        pages = {65-98},
        year = {2017},
        doi = {10.1137/141000671},
        URL = {doi.org/10.1137/141000671},
        eprint = {doi.org/10.1137/141000671},
        abstract = { Bridging cultures that have often been distant, Julia combines expertise from the diverse fields of computer science and computational science to create a new approach to numerical computing. Julia is designed to be easy and fast and questions notions generally held to be “laws of nature" by practitioners of numerical computing: \beginlist \item High-level dynamic programs have to be slow. \item One must prototype in one language and then rewrite in another language for speed or deployment. \item There are parts of a system appropriate for the programmer, and other parts that are best left untouched as they have been built by the experts. \endlist We introduce the Julia programming language and its design---a dance between specialization and abstraction. Specialization allows for custom treatment. Multiple dispatch, a technique from computer science, picks the right algorithm for the right circumstance. Abstraction, which is what good computation is really about, recognizes what remains the same after differences are stripped away. Abstractions in mathematics are captured as code through another technique from computer science, generic programming. Julia shows that one can achieve machine performance without sacrificing human convenience. }
    }
    
    @webpage{complex_exponential,
        author = {Duncan, Andrew},
        institution =  {Cerwin Vega! Inc.},
        year =         "1988",
        month =        "05",
        title =        "The analytic impulse",
        howpublished = "online",
        url =          "www.andrewduncan.net/air/",
        cited =        "2022-7-20",
        key =          "Analytic impulse"
    }
    
    @webpage{gsi_green_cube_covid,
        institution =  {GSI Helmholtzzentrum für Schwerionenforschung},
        year =         "2022",
        month =        "04",
        day =          "25",
        title =        "Green IT Cube becomes research and transfer center",
        howpublished = "online",
        url =          "www.gsi.de/en/start/news/details?tx_news_pi1\%5Baction\%5D=detail&tx_news_pi1\%5Bcontroller\%5D=News&tx_news_pi1\%5Bnews\%5D=5343&cHash=2b65707d6cffc3d40119b25ea374574e",
        cited =        "2022-2-07",
        key =          "Green IT Cube"
    }
    
    @webpage{gsi_green_cube_overview,
        institution =  {GSI Helmholtzzentrum für Schwerionenforschung},
        title =        "Green IT Cube: supercomputing center for GSI and FAIR",
        year =         "2021",
        month =        "06",
        day =          "01",
        howpublished = "online",
        url =          "www.gsi.de/en/researchaccelerators/research_an_overview/green-it-cube",
        cited =        "2022-2-07",
        key =          "Green IT Cube overview"
    }
    
    @article{duda_generalized_hough,
        author = {Duda, Richard O. and Hart, Peter E.},
        title = {Use of the Hough Transformation to Detect Lines and Curves in Pictures},
        year = {1972},
        issue_date = {Jan. 1972},
        publisher = {Association for Computing Machinery},
        address = {New York, NY, USA},
        volume = {15},
        number = {1},
        issn = {0001-0782},
        url = {doi.org/10.1145/361237.361242},
        doi = {10.1145/361237.361242},
        abstract = {Hough has proposed an interesting and computationally efficient procedure for detecting lines in pictures. This paper points out that the use of angle-radius rather than slope-intercept parameters simplifies the computation further. It also shows how the method can be used for more general curve fitting, and gives alternative interpretations that explain the source of its efficiency.},
        journal = {Commun. ACM},
        month = {jan},
        pages = {11–15},
        numpages = {5},
        keywords = {point-line transformation, line detection, curve detection, colinear points, picture processing, Hough transformation, pattern recognition}
    }

    @webpage{kalman_website,
      author =       "Alex Becker",
      title =        "Kalman Filter",
      year =         "2022",
      howpublished = "online",
      url =          "www.kalmanfilter.net",
      cited =        "2022-05-07"
    }
    
    @webpage{kalman_example,
      author =       "Alex Becker",
      title =        "Multidimensional Kalman Filter",
      subtitle =     "Examples",
      howpublished = "online",
      year =         "2022",
      url =          "www.kalmanfilter.net/multiExamples.html",
      cited =        "2022-05-07"
    }
    
    @webpage{kalman_Q_matrix,
      author =       "Alex Becker",
      title =        "Covariance Extrapolation Equation",
      subtitle =     "Constructing the process noise matrix Q",
      howpublished = "online",
      year =         "2022",
      url =          "www.kalmanfilter.net/covextrap.html#withQ",
      cited =        "2022-15-07"
    }
    
    @article{simd_kalman_filter,
        title = {Fast SIMDized Kalman filter based track fit},
        journal = {Computer Physics Communications},
        volume = {178},
        number = {5},
        pages = {374-383},
        year = {2008},
        issn = {0010-4655},
        doi = {doi.org/10.1016/j.cpc.2007.10.001},
        url = {www.sciencedirect.com/science/article/pii/S0010465507004262},
        author = {S. Gorbunov and U. Kebschull and I. Kisel and V. Lindenstruth and W.F.J. Müller},
        keywords = {High energy physics, CBM experiment, Data reconstruction, Track fit, Kalman filter, SIMD instruction set, Cell Broadband Engine},
        abstract = {Modern high energy physics experiments have to process terabytes of input data produced in particle collisions. The core of many data reconstruction algorithms in high energy physics is the Kalman filter. Therefore, the speed of Kalman filter based algorithms is of crucial importance in on-line data processing. This is especially true for the combinatorial track finding stage where the Kalman filter based track fit is used very intensively. Therefore, developing fast reconstruction algorithms, which use maximum available power of processors, is important, in particular for the initial selection of events which carry signals of interesting physics. One of such powerful feature supported by almost all up-to-date PC processors is a SIMD instruction set, which allows packing several data items in one register and to operate on all of them, thus achieving more operations per clock cycle. The novel Cell processor extends the parallelization further by combining a general-purpose PowerPC processor core with eight streamlined coprocessing elements which greatly accelerate vector processing applications. In the investigation described here, after a significant memory optimization and a comprehensive numerical analysis, the Kalman filter based track fitting algorithm of the CBM experiment has been vectorized using inline operator overloading. Thus the algorithm continues to be flexible with respect to any CPU family used for data reconstruction. Because of all these changes the SIMDized Kalman filter based track fitting algorithm takes 1 μs per track that is 10000 times faster than the initial version. Porting the algorithm to a Cell Blade computer gives another factor of 10 of the speedup. Finally, we compare performance of the tracking algorithm running on three different CPU architectures: Intel Xeon, AMD Opteron and Cell Broadband Engine.}
    }
    
    @misc{green_cube_powerpoint,
        author = {Kollegger, Thorsten},
        institution = {GSI Helmholtzzentrum für Schwerionenforschung},
        howpublished = {online},
        url = {indico.cern.ch/event/325439/contributions/756690/attachments/631354/868855/20150330-TKollegger-GreenCubeGSI.pdf},
        year = {2015},
        month = {3},
        day = {30},
        title = {Green Cube GSI},
        subtitle = {FAIR Tier 0},
        cited = {2022-27-04}
    }
    
    @article{Hansroul:192472,
        author        = "Hansroul, M and Jeremie, H and Savard, D",
        title         = "{Fast circle fit with the conformal mapping method}",
        journal       = "Nucl. Instrum. Methods Phys. Res., A",
        reportNumber  = "CERN-DD-88-20, 2-3",
        volume        = "270",
        pages         = "498-501. 5 p",
        month         = "Nov",
        year          = "1988",
        url           = "cds.cern.ch/record/192472",
    }
    
    @webpage{rk4_picture,
        author = {Benjamin Schmiedel},
        howpublished = {online},
        url = {lowebms.readthedocs.io/en/latest/code/rk4.html},
        cited = {2022-07-24},
        title = {Runge-Kutta 4th order scheme},
        publisher = {Read the Docs, Inc},
        key = {Runge-Kutta},
        year = {2019}
    }
    
    @book{INM,
        author = {Fajmon, Břetislav and Hlavičková, Irena and Novák, Michal and Vítovec, Jiří},
        url = {matika.umat.feec.vutbr.cz/inovace/texty/INM/CZ/INM_plna_verze_CZ.pdf},
        publisher = {VUT v Brně},
        howpublished = "online",
        cited = "2022-17-07",
        title = {Numerická matematika a pravděpodobnost},
        subtitle = "Informační technologie",
        year = 2014
    }
    
    @book{shapiro2001,
        added-at = {2009-02-25T00:40:10.000+0100},
        address = {Upper Saddle River, NJ, USA},
        author = {Stockman, George and Shapiro, Linda G.},
        biburl = {www.bibsonomy.org/bibtex/28cbeb1b8a9683e50d56c23c4ca785aae/omarques},
        interhash = {55ed4617551e367c4ee4a45e4b7c7912},
        intrahash = {8cbeb1b8a9683e50d56c23c4ca785aae},
        isbn = {0130307963},
        url = {nana.lecturer.pens.ac.id/index_files/referensi/computer_vision/Computer\%20Vision.pdf},
        publisher = {Prentice Hall PTR},
        timestamp = {2009-02-25T00:41:06.000+0100},
        title = {Computer Vision},
        year = 2001
    }
    
    @book{cellular_automata,
        author = {Kari, Jarkko},
        title = {Cellular Automata},
        year = {2013},
        pages = {133},
        publisher = {University of Turku},
        url = {www.cs.tau.ac.il/~nachumd/models/CA.pdf}
    }
    
    @book{probabilistic_robotics,
        author = {Thrun, Sebastian and Burgard, Wolfram and Fox, Dieter},
        year = {2005},
        month = {01},
        pages = {667},
        title = {Probabilistic Robotics (Intelligent Robotics and Autonomous Agents)},
        isbn = {0262201623}
    }
    
    @book{cbm_physbook,
        author = {Friman, B. and Höhne, Caudia and Knoll, Jörn and Leupold, Stefan and Randrup, Jorgen and Rapp, Ralf and Senger, Peter},
        year = {2011},
        month = {01},
        pages = {},
        title = {The CBM Physics Book: Compressed Baryonic Matter in Laboratory Experiments},
        volume = {814},
        isbn = {978-3-642-13292-6},
        journal = {Lecture Notes in Physics},
        doi = {10.1007/978-3-642-13293-3}
    }
    
    @inproceedings{fair_hesr,
        author = {Tölle, Raimund and Bongardt, K. and Dietrich, J. and Esser, F. and Felden, Olaf and Greven, R. and Hansen, G. and Klehr, F. and Lehrach, Andreas and Lorentz, Bernd and Maier, Rahel and Prasuhn, D. and Raccanelli, A. and Schmitt, M. and Senichev, Y. and Senicheva, E. and Stassen, R. and Stockhorst, H. and Steck, M. and Hinterberger, F.},
        year = {2007},
        month = {07},
        pages = {1442 - 1444},
        title = {HESR at fair: status of technical planning},
        doi = {10.1109/PAC.2007.4440783}
    }
    
    @article{AUMANN20073,
        title = {Prospects of nuclear structure at the future GSI accelerators},
        journal = {Progress in Particle and Nuclear Physics},
        volume = {59},
        number = {1},
        pages = {3-21},
        year = {2007},
        note = {International Workshop on Nuclear Physics 28th Course},
        issn = {0146-6410},
        doi = {doi.org/10.1016/j.ppnp.2006.12.018},
        url = {www.sciencedirect.com/science/article/pii/S0146641006000974},
        author = {Thomas Aumann},
        keywords = {Radioactive beams, Experimental methods, Nuclear structure, Reactions, Astrophysics},
        abstract = {The accelerator complex FAIR (International Facility for Antiproton and Ion Research) will provide a unique combination of accelerators and storage rings for a multidisciplinary scientific program. The FAIR accelerator complex constitutes a substantial extension of the present GSI systems and will use the existing accelerators after several upgrades as an injector. This new facility comprises as an integral part a next-generation rare-isotope beam facility based on the production and separation of secondary beams produced by fragmentation or fission of energetic high-intensity primary ion beams. An advanced experimental program including new and unique concepts promises a new quality in investigations of nuclei far away from stability. A brief overview on the facility is presented with emphasis on the radioactive-beam facility. The experimental program and its related instrumentation is discussed briefly.}
    }
    
    @article{kisel_akishina_online_CBM,
        author = {Akishina, Valentina and Kisel, Ivan},
        year = {2018},
        month = {01},
        pages = {01002},
        title = {Online Event Reconstruction in the CBM Experiment at FAIR},
        volume = {173},
        journal = {EPJ Web of Conferences},
        doi = {10.1051/epjconf/201817301002}
    }
    
    @Article{particles2040031,
        AUTHOR = {Senger, Peter},
        TITLE = {Exploring Cosmic Matter in the Laboratory—The Compressed Baryonic Matter Experiment at FAIR},
        JOURNAL = {Particles},
        VOLUME = {2},
        YEAR = {2019},
        NUMBER = {4},
        PAGES = {499--510},
        URL = {www.mdpi.com/2571-712X/2/4/31},
        ISSN = {2571-712X},
        ABSTRACT = {The Compressed Baryonic Matter (CBM) experiment is one of four scientific pillars of the future Facility for Antiproton and Ion Research (FAIR) in Darmstadt. In collisions between heavy nuclei at FAIR energies, it is expected that the matter in the reaction zone is compressed to more than five times saturation density, corresponding to the density in the core of a massive neutron star. This offers the unique opportunity to study in the laboratory the high-density equation-of-state (EOS) of nuclear matter, and to search for new phases of Quantum Chromo Dynamics (QCD) matter at large baryon-chemical potentials. Promising experimental observables sensitive to the EOS and to possible phase transitions will be discussed, together with a brief description of the CBM experiment.},
        DOI = {10.3390/particles2040031}
    }
    
    @Book{ ElementaryParticles,
        title = { Elementary particles },
        author = { Frisch, David H and Thorndike, Alan M., 1918- and Commission on College Physics },
        publisher = { Princeton, New Jersey : Van Nostrand [for the] Commission on College Physics },
        year = { 1964 },
        type = { Book; Book/Illustrated },
        subjects = { Particles; Particles (Nuclear physics) },
        language = { English },
        note = { Includes bibliographies },
        catalogue-url = { trove.nla.gov.au/work/10596518 }
    }
    
    @article{rackauckas2017differentialequations,
        title={Differentialequations.jl--a performant and feature-rich ecosystem for solving differential equations in julia},
        author={Rackauckas, Christopher and Nie, Qing},
        journal={Journal of Open Research Software},
        volume={5},
        number={1},
        year={2017},
        publisher={Ubiquity Press}
    }
    
    @article{beal2018gekko,
        title={GEKKO Optimization Suite},
        author={Beal, Logan and Hill, Daniel and Martin, R and Hedengren, John},
        journal={Processes},
        volume={6},
        number={8},
        pages={106},
        year={2018},
        doi={10.3390/pr6080106},
        publisher={Multidisciplinary Digital Publishing Institute}
    }
    
    @article{cbm_overview_klochov,
        title = {The Compressed Baryonic Matter Experiment at FAIR},
        journal = {Nuclear Physics A},
        volume = {1005},
        pages = {121945},
        year = {2021},
        note = {The 28th International Conference on Ultra-relativistic Nucleus-Nucleus Collisions: Quark Matter 2019},
        issn = {0375-9474},
        doi = {doi.org/10.1016/j.nuclphysa.2020.121945},
        url = {www.sciencedirect.com/science/article/pii/S0375947420302554},
        author = {V. Klochkov},
        keywords = {CBM, FAIR, heavy-ion collisions, QCD phase diagram, new heavy-ion accelerator facilities},
        abstract = {The Compressed Baryonic Matter (CBM) experiment at FAIR aims to study the area of the QCD phase diagram at high net baryon densities and moderate temperatures using heavy-ion collisions. The FAIR accelerator will provide high-intensity heavy-ion beams up to Au ions in the beam momentum range 3.5A-12A GeV/c per nucleon. In order to achieve it's physics goals and to perform multi-differential measurements of rare probes such as multistrange hadrons or hypernuclei, CBM plans to operate at unprecedented peak interaction rates of up to 10 MHz. Following an introduction into the physics program of the CBM, recent developments related to the preparation of the experiment, physics performance studies, and detector components tests within the so-called FAIR PHASE-0 program are discussed. In particular, the status of the mCBM project at GSI, which operated with high-intensity beams for the first time last year and combines various CBM detector subsystems with a common data acquisition system (DAQ), are presented.}
    }
    
    @webpage{fair_overview,
        title =        "The universe in the lab",
        howpublished = "online",
        publisher =    "Facility for Antiproton and Ion Research in Europe",
        key =          "Facility for Antiproton and Ion Research",
        url =          "www.fair-center.eu/overview",
        cited =        "2022-17-04"
    }
    
    @webpage{fair_accelerator,
        title =        "The accelerator facility of FAIR and GSI",
        howpublished = "online",
        publisher =    "Facility for Antiproton and Ion Research in Europe",
        key =          "Facility for Antiproton and Ion Research",
        url =          "www.fair-center.eu/overview/accelerator",
        cited =        "2022-17-04"
    }
    
    @webpage{gsi_about,
        title =        "GSI - About us",
        howpublished = "online",
        publisher =    "GSI Helmholtzzentrum für Schwerionenforschung",
        key =          "GSI Helmholtzzentrum",
        url =          "www.gsi.de/en/about_us",
        cited =        "2022-17-04"
    }
    
    @webpage{fair_construction_site,
        title =         "Großbaustelle in Darmstadt: Rohbau des Fair-Tunnels ist fertig",
        author =        "Kabel, Claudia",
        howpublished =  "online",
        publisher =     "Frankfurter Rundshau",
        day =           "7",
        month =         "6",
        year =          "2021",
        revised =       "Aktualizováno 10.6.2021",
        key =           "Kabel",
        url =           "www.fr.de/rhein-main/darmstadt/grossbaustelle-in-darmstadt-rohbau-des-fair-tunnels-ist-fertig-90792726.html",
        cited =        "2022-18-04"
    }
}