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 147 articles )

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

1 2 3 ... 6 7 8 next

  1. Dimitrios Michail, Joris Kinable, Barak Naveh, John V Sichi: JGraphT - A Java library for graph data structures and algorithms (2019) arXiv
  2. Koster, A. M. C. A.; Scheidweiler, R.; Tieves, M.: A flow based pruning scheme for enumerative equitable coloring algorithms (2019)
  3. Kress, Dominik; Müller, David; Nossack, Jenny: A worker constrained flexible job shop scheduling problem with sequence-dependent setup times (2019)
  4. Andersen, Jakob L.; Merkle, Daniel: A generic framework for engineering graph canonization algorithms (2018)
  5. Berglund, Martin; Bester, Willem; van der Merwe, Brink: Formalising Boost POSIX regular expression matching (2018)
  6. Cavoretto, Roberto; Schneider, Teseo; Zulian, Patrick: \textscOpenCLbased parallel algorithm for RBF-PUM interpolation (2018)
  7. Griewank, Andreas; Streubel, Tom; Lehmann, Lutz; Radons, Manuel; Hasenfelder, Richard: Piecewise linear secant approximation via algorithmic piecewise differentiation (2018)
  8. Harrison, A. P.; Joseph, D.: High performance rearrangement and multiplication routines for sparse tensor arithmetic (2018)
  9. Navas-Palencia, Guillermo: Fast and accurate algorithm for the generalized exponential integral (E_\nu(x)) for positive real order (2018)
  10. Pellicanò, Nicola; Le Hégarat-Mascle, Sylvie; Aldea, Emanuel: 2CoBel: a scalable belief function representation for 2D discernment frames (2018)
  11. Tuzun, Robert E.; Sikora, Adam S.: Verification of the Jones unknot conjecture up to 22 crossings (2018)
  12. A. Arbona, B. Minano, A. Rigo, C. Bona, C. Palenzuela, A. Artigues, C. Bona-Casas, J. Masso: Simflowny 2: An upgraded platform for scientific modeling and simulation (2017) arXiv
  13. Byfut, Andreas; Schröder, Andreas: Unsymmetric multi-level hanging nodes and anisotropic polynomial degrees in (H^1)-conforming higher-order finite element methods (2017)
  14. Dowsley, Rafael; Michalas, Antonis; Nagel, Matthias; Paladi, Nicolae: A survey on design and implementation of protected searchable data in the cloud (2017)
  15. Einkemmer, Lukas; Tokman, Mayya; Loffeld, John: On the performance of exponential integrators for problems in magnetohydrodynamics (2017)
  16. Jomo, John N.; Zander, Nils; Elhaddad, Mohamed; Özcan, Ali; Kollmannsberger, Stefan; Mundani, Ralf-Peter; Rank, Ernst: Parallelization of the multi-level (hp)-adaptive finite cell method (2017)
  17. Marić, Tomislav: Lagrangian/Eulerian numerical methods for fluid interface advection on unstructured meshes (2017)
  18. Samaké, Abdoulaye; Rampal, Pierre; Bouillon, Sylvain; Ólason, Einar: Parallel implementation of a Lagrangian-based model on an adaptive mesh in C++: application to sea-ice (2017)
  19. Shinaoka, Hiroshi; Gull, Emanuel; Werner, Philipp: Continuous-time hybridization expansion quantum impurity solver for multi-orbital systems with complex hybridizations (2017)
  20. Vömel, Christof; de Lorenzi, Flavio; Beer, Samuel; Fuchs, Erwin: The secret life of keys: on the calculation of mechanical lock systems (2017)

1 2 3 ... 6 7 8 next