Boost

Boost provides free peer-reviewed portable C++ source libraries. We emphasize libraries that work well with the C++ Standard Library. Boost libraries are intended to be widely useful, and usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. We aim to establish ”existing practice” and provide reference implementations so that Boost libraries are suitable for eventual standardization. Ten Boost libraries are included in the C++ Standards Committee’s Library Technical Report (TR1) and in the new C++11 Standard. C++11 also includes several more Boost libraries in addition to those from TR1. More Boost libraries are proposed for TR2.


References in zbMATH (referenced in 163 articles )

Showing results 1 to 20 of 163.
Sorted by year (citations)

1 2 3 ... 7 8 9 next

  1. Abate, Alessandro; Bessa, Iury; Cordeiro, Lucas; David, Cristina; Kesseli, Pascal; Kroening, Daniel; Polgreen, Elizabeth: Automated formal synthesis of provably safe digital controllers for continuous plants (2020)
  2. Auer, Ekaterina; Rauh, Andreas; Kersten, Julia: Experiments-based parameter identification on the GPU for cooperative systems (2020)
  3. Johansson, Fredrik: Computing the Lambert (W) function in arbitrary-precision complex interval arithmetic (2020)
  4. Reguly, István Z.; Mudalige, Gihan R.: Productivity, performance, and portability for computational fluid dynamics applications (2020)
  5. Bohn, Adam; Faenza, Yuri; Fiorini, Samuel; Fisikopoulos, Vissarion; Macchia, Marco; Pashkovich, Kanstantsin: Enumeration of 2-level polytopes (2019)
  6. Dimitrios Michail, Joris Kinable, Barak Naveh, John V Sichi: JGraphT - A Java library for graph data structures and algorithms (2019) arXiv
  7. Green, Kevin R.; Bohn, Tanner A.; Spiteri, Raymond J.: Direct function evaluation versus lookup tables: when to use which? (2019)
  8. Kiefer, Nicholas; Oremek, Maximilian J.; Hoeft, Andreas; Zenker, Sven: Model-based quantification of left ventricular diastolic function in critically ill patients with atrial fibrillation from routine data: a feasibility study (2019)
  9. Koster, A. M. C. A.; Scheidweiler, R.; Tieves, M.: A flow based pruning scheme for enumerative equitable coloring algorithms (2019)
  10. Kress, Dominik; Müller, David; Nossack, Jenny: A worker constrained flexible job shop scheduling problem with sequence-dependent setup times (2019)
  11. Møyner, Olav; Nilsen, Halvor Møll: Multiresolution coupled vertical equilibrium model for fast flexible simulation of CO(_2) storage (2019)
  12. Ramani, Arjun S.; Eikmeier, Nicole; Gleich, David F.: Coin-flipping, Ball-dropping, and Grass-hopping for generating random graphs from matrices of edge probabilities (2019)
  13. Andersen, Jakob L.; Merkle, Daniel: A generic framework for engineering graph canonization algorithms (2018)
  14. Berglund, Martin; Bester, Willem; van der Merwe, Brink: Formalising Boost POSIX regular expression matching (2018)
  15. Cavoretto, Roberto; Schneider, Teseo; Zulian, Patrick: \textscOpenCLbased parallel algorithm for RBF-PUM interpolation (2018)
  16. Griewank, Andreas; Streubel, Tom; Lehmann, Lutz; Radons, Manuel; Hasenfelder, Richard: Piecewise linear secant approximation via algorithmic piecewise differentiation (2018)
  17. Harrison, A. P.; Joseph, D.: High performance rearrangement and multiplication routines for sparse tensor arithmetic (2018)
  18. Navas-Palencia, Guillermo: Fast and accurate algorithm for the generalized exponential integral (E_\nu(x)) for positive real order (2018)
  19. Patel, Namrata K.; Bhalla, Amneet Pal Singh; Patankar, Neelesh A.: A new constraint-based formulation for hydrodynamically resolved computational neuromechanics of swimming animals (2018)
  20. Pellicanò, Nicola; Le Hégarat-Mascle, Sylvie; Aldea, Emanuel: 2CoBel: a scalable belief function representation for 2D discernment frames (2018)

1 2 3 ... 7 8 9 next