{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:44:13Z","timestamp":1775054653226,"version":"3.50.1"},"reference-count":13,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T00:00:00Z","timestamp":1690502400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T00:00:00Z","timestamp":1690502400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1134\/s0361768823020056","type":"journal-article","created":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T09:02:21Z","timestamp":1690534941000},"page":"355-359","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Using Dynamic Memory Reallocation in GInv"],"prefix":"10.1134","volume":"49","author":[{"given":"Yu. A.","family":"Blinkov","sequence":"first","affiliation":[]},{"given":"E. Yu.","family":"Shchetinin","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"key":"3749_CR1","volume-title":"Gr\u00f6bner bases: A Buchberger algorithmic method in polynomial ideal theory, Recent Trends in Multidimensional System Theory","author":"B. Buchberger","year":"1985","unstructured":"Buchberger, B., Gr\u00f6bner bases: A Buchberger algorithmic method in polynomial ideal theory, Recent Trends in Multidimensional System Theory, Bose, N.K., Ed., Dordrecht: Reidel, 1985, vol. 6, pp. 184\u2013232."},{"key":"3749_CR2","unstructured":"Zharkov, A.Yu. and Blinkov, Yu.A., Involutive systems of algebraic equations, Programmirovanie, 1994, no. 1, pp. 53\u201356."},{"key":"3749_CR3","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/S0378-4754(97)00128-6","volume":"45","author":"V.P. Gerdt","year":"1998","unstructured":"Gerdt, V.P. and Blinkov, Yu.A., Minimal involutive bases, Math. Comput. Simul., 1998, vol. 45, pp. 543\u2013560.","journal-title":"Math. Comput. Simul."},{"key":"3749_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J.-C. Faug\u00e9re","year":"1999","unstructured":"Faug\u00e9re, J.-C., A new efficient algorithm for computing Gr\u00f6bner bases (F4), J. Pure Appl. Algebra, 1999, vol.\u00a0139, nos. 1\u20133, pp. 61\u201388.","journal-title":"J. Pure Appl. Algebra"},{"key":"3749_CR5","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1134\/S0361768808020096","volume":"34","author":"Yu.A. Blinkov","year":"2008","unstructured":"Blinkov, Yu.A. and Gerdt, V.P., Specialized computer algebra system GINV, Program. Comput. Software, 2008, vol. 34, pp. 112\u2013123.","journal-title":"Program. Comput. Software"},{"key":"3749_CR6","doi-asserted-by":"crossref","unstructured":"McCarthy, J., Recursive functions of symbolic expressions and their computation by machine, Part I, Commun. ACM, 1960, no. 4, pp. 184\u2013195.","DOI":"10.1145\/367177.367199"},{"key":"3749_CR7","doi-asserted-by":"crossref","unstructured":"Bansal, A., Goel, S., Shah, P., Sanyal, A., and Kumar, P., Garbage collection using a finite liveness domain, Proc. ACM SIGPLAN ISMM, 2020, pp. 1\u201315.","DOI":"10.1145\/3381898.3397208"},{"key":"3749_CR8","doi-asserted-by":"crossref","unstructured":"Yang, A.M., \u00d6sterlund, E., Wilhelmsson, J., Nyblom, H., and Wrigstad, T., ThinGC: Complete isolation with marginal overhead, Proc. ACM SIGPLAN ISMM, 2020, pp. 74\u201386.","DOI":"10.1145\/3381898.3397213"},{"key":"3749_CR9","doi-asserted-by":"crossref","unstructured":"Onozawa, H., Ugawa, T., and Iwasaki, H., Fusuma: Double-ended threaded compaction, Proc. ACM SIGPLAN ISMM, 2021, pp. 94\u2013106.","DOI":"10.1145\/3459898.3463903"},{"key":"3749_CR10","doi-asserted-by":"crossref","unstructured":"Tripp, C., Hyde, D., and Grossman-Ponemon, B., FRC: A high-performance concurrent parallel deferred reference counter for C++, Proc. ACM SIGPLAN ISMM, 2018, pp. 14\u201328.","DOI":"10.1145\/3210563.3210569"},{"key":"3749_CR11","doi-asserted-by":"crossref","unstructured":"Seyri, A., Pan, A., and Vamanan, B., MemSweeper: Virtualizing cluster memory management for high memory utilization and isolation, Proc. ACM SIGPLAN ISMM, 2022, pp. 15\u201328.","DOI":"10.1145\/3520263.3534651"},{"key":"3749_CR12","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1023\/A:1007130618376","volume":"27","author":"V.P. Gerdt","year":"2001","unstructured":"Gerdt, V.P., Yanovich, D.A., and Blinkov, Yu.A., Fast search for the Janet divisor, Program. Comput. Software, 2001, vol. 27, pp. 22\u201324.","journal-title":"Program. Comput. Software"},{"key":"3749_CR13","first-page":"433","volume":"11","author":"A.S. Popov","year":"2008","unstructured":"Popov, A.S., Cubature formulas on a sphere that are invariant to the icosahedron rotation group, Sib. Zh. Vychisl. Mat., 2008, vol. 11, no. 4, pp. 433\u2013440.","journal-title":"Sib. Zh. Vychisl. Mat."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768823020056.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768823020056","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768823020056.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:52:11Z","timestamp":1775011931000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768823020056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,28]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["3749"],"URL":"https:\/\/doi.org\/10.1134\/s0361768823020056","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,28]]},"assertion":[{"value":"1 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}