{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T16:25:45Z","timestamp":1781713545123,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":61,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,5,25]],"date-time":"2025-05-25T00:00:00Z","timestamp":1748131200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,5,26]]},"DOI":"10.1145\/3728179.3728180","type":"proceedings-article","created":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T14:09:58Z","timestamp":1747318198000},"page":"156-166","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Accelerating Linear Programming Performance: A Hardware-Software Co-Design Approach for the Simplex Method"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-8769-8015","authenticated-orcid":false,"given":"Marcus","family":"Bednara","sequence":"first","affiliation":[{"name":"Fraunhofer Institute for Integrated Circuits IIS, N\u00fcrnberg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3457-1755","authenticated-orcid":false,"given":"Kristin","family":"Braun","sequence":"additional","affiliation":[{"name":"Fraunhofer Institute for Integrated Circuits IIS, N\u00fcrnberg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6230-6978","authenticated-orcid":false,"given":"Martina","family":"Kuchlbauer","sequence":"additional","affiliation":[{"name":"Fraunhofer Institute for Integrated Circuits IIS, N\u00fcrnberg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-8413-0482","authenticated-orcid":false,"given":"Carsten","family":"Sigwarth","sequence":"additional","affiliation":[{"name":"Fraunhofer Institute for Integrated Circuits IIS, N\u00fcrnberg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,5,25]]},"reference":[{"key":"e_1_3_3_1_2_2","unstructured":"Tobias Achterberg. 2007. Constraint integer programming. (2007)."},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","unstructured":"Tobias Achterberg and Timo Berthold. 2009. Hybrid Branching. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5547 LNCS (2009) 309\u2013311. 10.1007\/978-3-642-01929-6_23","DOI":"10.1007\/978-3-642-01929-6_23"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","unstructured":"Tobias Achterberg Thorsten Koch and Alexander Martin. 2005. Branching rules revisited. Operations Research Letters 33 (1 2005) 42\u201354. Issue 1. 10.1016\/J.ORL.2004.04.002","DOI":"10.1016\/J.ORL.2004.04.002"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","unstructured":"Tobias Achterberg and Roland Wunderling. 2013. Mixed Integer Programming: Analyzing 12 Years of Progress. Facets of Combinatorial Optimization: Festschrift for Martin Gr\u00f6tschel 9783642381898 (1 2013) 449\u2013481. 10.1007\/978-3-642-38189-8_18","DOI":"10.1007\/978-3-642-38189-8_18"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA47549.2020.00029"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"publisher","unstructured":"Samuel Bayliss Christos\u00a0S. Bouganis George\u00a0A. Constantinides and Wayne Luk. 2006. An FPGA implementation of the simplex algorithm. Proceedings - 2006 IEEE International Conference on Field Programmable Technology FPT 2006 (2006) 49\u201355. 10.1109\/FPT.2006.270294","DOI":"10.1109\/FPT.2006.270294"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","unstructured":"Pietro Belotti Christian Kirches Sven Leyffer Jeff Linderoth James Luedtke and Ashutosh Mahajan. 2013. Mixed-integer nonlinear optimization. Acta Numer. 22 (2013) 1\u2013131. 10.1017\/S0962492913000032","DOI":"10.1017\/S0962492913000032"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","unstructured":"M. Benichou J.\u00a0M. Gauthier G. Hentges and G. Ribiere. 1977. The efficient solution of large-scale linear programming problems-some algorithmic techniques and computational results. Mathematical Programming 13 (12 1977) 280\u2013322. Issue 1. 10.1007\/BF01584344\/METRICS","DOI":"10.1007\/BF01584344\/METRICS"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","unstructured":"Bertossi and Bonuccelli. 1987. A VLSI Implementation of the Simplex Algorithm. IEEE Trans. Comput. C-36 2 (1987) 241\u2013247. 10.1109\/TC.1987.1676889","DOI":"10.1109\/TC.1987.1676889"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.5555\/548834"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35514-6_2"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","unstructured":"Robert\u00a0E. Bixby. 1992. Implementing the Simplex Method: The Initial Basis. https:\/\/doi.org\/10.1287\/ijoc.4.3.267 4 (8 1992) 266\u2013284. Issue 3. 10.1287\/IJOC.4.3.267","DOI":"10.1287\/IJOC.4.3.267"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","unstructured":"Robert\u00a0E. Bixby. 1994. Progress in Linear Programming. ORSA Journal on Computing 6 (2 1994) 15\u201322. Issue 1. 10.1287\/IJOC.6.1.15","DOI":"10.1287\/IJOC.6.1.15"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"publisher","unstructured":"Robert\u00a0E. Bixby. 2002. Solving Real-World Linear Programs: A Decade and More of Progress. https:\/\/doi.org\/10.1287\/opre.50.1.3.17780 50 (2 2002) 3\u201315. Issue 1. 10.1287\/OPRE.50.1.3.17780","DOI":"10.1287\/OPRE.50.1.3.17780"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"crossref","unstructured":"Robert\u00a0E Bixby. 2012. A brief history of linear and mixed-integer programming computation. Documenta Mathematica 2012 (2012) 107\u2013121.","DOI":"10.4171\/dms\/6\/16"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"publisher","unstructured":"Robert\u00a0E. Bixby Mary Fenelon Zonghao Gu Ed Rothberg and Roland Wunderling. 2000. MIP: Theory and Practice \u2014 Closing the Gap. (2000) 19\u201349. 10.1007\/978-0-387-35514-6_2","DOI":"10.1007\/978-0-387-35514-6_2"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","unstructured":"Robert\u00a0E. Bixby Mary Fenelon Zonghao Gu Ed Rothberg and Roland Wunderling. 2004. 18. Mixed-Integer Programming: A Progress Report. MOS-SIAM Series on Optimization (1 2004) 309\u2013325. 10.1137\/1.9780898718805.CH18","DOI":"10.1137\/1.9780898718805.CH18"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"crossref","unstructured":"Robert\u00a0G Bland Donald Goldfarb and Michael\u00a0J Todd. 1981. The ellipsoid method: A survey. Operations research 29 6 (1981) 1039\u20131091.","DOI":"10.1287\/opre.29.6.1039"},{"key":"e_1_3_3_1_20_2","volume-title":"The SCIP Optimization Suite 9.0","author":"Bolusani Suresh","year":"2024","unstructured":"Suresh Bolusani, Mathieu Besan\u00e7on, Ksenia Bestuzheva, Antonia Chmiela, Jo\u00e3o Dion\u00edsio, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Mohammed Ghannam, Ambros Gleixner, Christoph Graczyk, Katrin Halbig, Ivo Hedtke, Alexander Hoen, Christopher Hojny, Rolf van\u00a0der Hulst, Dominik Kamp, Thorsten Koch, Kevin Kofler, Jurgen Lentz, Julian Manns, Gioni Mexi, Erik M\u00fchmer, Marc\u00a0E. Pfetsch, Franziska Schl\u00f6sser, Felipe Serrano, Yuji Shinano, Mark Turner, Stefan Vigerske, Dieter Weninger, and Lixing Xu. 2024. The SCIP Optimization Suite 9.0. ZIB-Report 24-02-29. Zuse Institute Berlin. https:\/\/nbn-resolving.org\/urn:nbn:de:0297-zib-95528"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.5555\/26975"},{"key":"e_1_3_3_1_22_2","unstructured":"Kristin Braun and Robert Burlacu. 2023. A computational study for piecewise linear relaxations of mixed-integer nonlinear programs. (2023). https:\/\/optimization-online. org\/2023\/09\/a-computational-study-for-piecewise-linear-relaxations-of-mixed-integer-nonlinear-programs"},{"key":"e_1_3_3_1_23_2","volume-title":"Linear Programming and Extensions","author":"Dantzig George\u00a0B.","year":"1963","unstructured":"George\u00a0B. Dantzig. 1963. Linear Programming and Extensions. Princeton University Press, Princeton. https:\/\/doi.org\/doi:10.1515\/9781400884179"},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/87252.88081"},{"key":"e_1_3_3_1_25_2","unstructured":"Willard\u00a0Lawrence Eastman. 1958. Linear programming with pattern constraints: a thesis. Ph.\u00a0D. Dissertation. Harvard University."},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"publisher","unstructured":"John\u00a0J. Forrest and Donald Goldfarb. 1992. Steepest-edge simplex algorithms for linear programming. Mathematical Programming 57 (5 1992) 341\u2013374. Issue 1-3. 10.1007\/BF01581089\/METRICS","DOI":"10.1007\/BF01581089\/METRICS"},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"publisher","unstructured":"Bj\u00f6rn Gei\u00dfler Alexander Martin Antonio Morsi and Lars Schewe. 2012. Using Piecewise Linear Functions for Solving MINLPs. (2012) 287\u2013314. 10.1007\/978-1-4614-1927-3_10","DOI":"10.1007\/978-1-4614-1927-3_10"},{"key":"e_1_3_3_1_28_2","first-page":"12","volume-title":"Young Researcher Symposium (YRS) 2013","author":"Gensheimer Florian","year":"2013","unstructured":"Florian Gensheimer, Michael Helmling, and Stefan Scholl. 2013. Towards Hardware Implementation of the Simplex Algorithm for LP Decoding. In Young Researcher Symposium (YRS) 2013. 12."},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"publisher","unstructured":"Ambros Gleixner Gregor Hendel Gerald Gamrath Tobias Achterberg Michael Bastubbe Timo Berthold Philipp\u00a0M. Christophel Kati Jarck Thorsten Koch Jeff Linderoth Marco L\u00fcbbecke Hans\u00a0D. Mittelmann Derya Ozyurt Ted\u00a0K. Ralphs Domenico Salvagnin and Yuji Shinano. 2021. MIPLIB 2017: Data-Driven Compilation of the 6th Mixed-Integer Programming Library. Mathematical Programming Computation (2021). 10.1007\/s12532-020-00194-3","DOI":"10.1007\/s12532-020-00194-3"},{"key":"e_1_3_3_1_30_2","doi-asserted-by":"crossref","unstructured":"Donald Goldfarb and John\u00a0K Reid. 1977. A practicable steepest-edge simplex algorithm. Mathematical Programming 12 (1977) 361\u2013371.","DOI":"10.1007\/BF01593804"},{"key":"e_1_3_3_1_31_2","doi-asserted-by":"publisher","unstructured":"Ralph\u00a0E. Gomory. 1958. Outline of an Algorithm for Integer Solutions to Linear Programs. Bull. Amer. Math. Soc. 64 (1958) 275\u2013278. Issue 5. 10.1090\/S0002-9904-1958-10224-4","DOI":"10.1090\/S0002-9904-1958-10224-4"},{"key":"e_1_3_3_1_32_2","unstructured":"Gurobi Optimization LLC. 2024. Gurobi Optimizer Reference Manual. https:\/\/www.gurobi.com"},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"publisher","unstructured":"Paula\u00a0M.J. Harris. 1973. Pivot selection methods of the Devex LP code. Mathematical Programming 5 (12 1973) 1\u201328. Issue 1. 10.1007\/BF01580108\/METRICS","DOI":"10.1007\/BF01580108\/METRICS"},{"key":"e_1_3_3_1_34_2","doi-asserted-by":"publisher","unstructured":"Q. Huangfu and J.\u00a0A.\u00a0J. Hall. 2018. Parallelizing the dual revised simplex method. Mathematical Programming Computation 10 1 (2018) 119\u2013142. 10.1007\/s12532-017-0130-5","DOI":"10.1007\/s12532-017-0130-5"},{"key":"e_1_3_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/FPT.2010.5681439"},{"key":"e_1_3_3_1_36_2","doi-asserted-by":"publisher","unstructured":"Juan\u00a0Luis Jerez George\u00a0Anthony Constantinides and Eric\u00a0C. Kerrigan. 2011. An FPGA implementation of a sparse quadratic programming solver for constrained predictive control(FPGA \u201911). Association for Computing Machinery New York NY USA 209\u2013218. 10.1145\/1950413.1950454","DOI":"10.1145\/1950413.1950454"},{"key":"e_1_3_3_1_37_2","doi-asserted-by":"publisher","unstructured":"Congfeng Jiang Tiantian Fan Honghao Gao Weisong Shi Liangkai Liu Christophe C\u00e9rin and Jian Wan. 2020. Energy aware edge computing: A survey. Computer Communications 151 (2020) 556\u2013580. 10.1016\/j.comcom.2020.01.004","DOI":"10.1016\/j.comcom.2020.01.004"},{"key":"e_1_3_3_1_38_2","doi-asserted-by":"publisher","unstructured":"Michael J\u00fcnger Denis Naddef William\u00a0R. Pulleyblank Giovanni Rinaldi Thomas\u00a0M. Liebling George\u00a0L. Nemhauser Gerhard Reinelt and Laurence\u00a0A. Wolsey. 2010. 50 years of integer programming 1958-2008: From the early years to the state-of-the-art. 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art (2010) 1\u2013804. 10.1007\/978-3-540-68279-0\/COVER","DOI":"10.1007\/978-3-540-68279-0\/COVER"},{"key":"e_1_3_3_1_39_2","first-page":"1093","volume-title":"Doklady Akademii Nauk","author":"Khachiyan Leonid\u00a0Genrikhovich","year":"1979","unstructured":"Leonid\u00a0Genrikhovich Khachiyan. 1979. A polynomial algorithm in linear programming. In Doklady Akademii Nauk, Vol.\u00a0244. Russian Academy of Sciences, 1093\u20131096."},{"key":"e_1_3_3_1_40_2","unstructured":"Victor Klee and George\u00a0J Minty. 1972. How good is the simplex algorithm. Inequalities 3 3 (1972) 159\u2013175."},{"key":"e_1_3_3_1_41_2","doi-asserted-by":"publisher","unstructured":"Thorsten Koch Tobias Achterberg Erling Andersen Oliver Bastert Timo Berthold Robert\u00a0E. Bixby Emilie Danna Gerald Gamrath Ambros\u00a0M. Gleixner Stefan Heinz Andrea Lodi Hans Mittelmann Ted Ralphs Domenico Salvagnin Daniel\u00a0E. Steffy and Kati Wolter. 2011. MIPLIB 2010. Mathematical Programming Computation 3 2 (2011) 103\u2013163. 10.1007\/s12532-011-0025-9","DOI":"10.1007\/s12532-011-0025-9"},{"key":"e_1_3_3_1_42_2","doi-asserted-by":"publisher","unstructured":"Thorsten Koch Timo Berthold Jaap Pedersen and Charlie Vanaret. 2022. Progress in mathematical programming solvers from 2001 to 2020. EURO Journal on Computational Optimization 10 (1 2022) 100031. 10.1016\/J.EJCO.2022.100031","DOI":"10.1016\/J.EJCO.2022.100031"},{"key":"e_1_3_3_1_43_2","doi-asserted-by":"publisher","unstructured":"Ailsa\u00a0H. Land and Alison\u00a0G. Doig. 1960. An Automatic Method of Solving Discrete Programming Problems. Econometrica 28 (7 1960) 497. Issue 3. 10.2307\/1910129","DOI":"10.2307\/1910129"},{"key":"e_1_3_3_1_44_2","doi-asserted-by":"publisher","unstructured":"Carlton\u00a0E. Lemke. 1954. The dual method of solving the linear programming problem. Naval Research Logistics Quarterly 1 (3 1954) 36\u201347. Issue 1. 10.1002\/NAV.3800010107","DOI":"10.1002\/NAV.3800010107"},{"key":"e_1_3_3_1_45_2","doi-asserted-by":"publisher","unstructured":"Harry\u00a0M. Markowitz and Alan\u00a0S. Manne. 1957. On the Solution of Discrete Programming Problems. Econometrica 25 (1 1957) 84. Issue 1. 10.2307\/1907744","DOI":"10.2307\/1907744"},{"key":"e_1_3_3_1_46_2","unstructured":"John\u00a0E Mitchell. 2002. Branch-and-cut algorithms for combinatorial optimization problems. Handbook of applied optimization 1 1 (2002) 65\u201377."},{"key":"e_1_3_3_1_47_2","doi-asserted-by":"publisher","unstructured":"G. Noble S. Nalesh S. Kala and A. Kumar. 2024. Configurable sparse matrix - matrix multiplication accelerator on FPGA: A systematic design space exploration approach with quantization effects. Alexandria Engineering Journal 91 (Feb. 2024) 84\u201394. 10.1016\/j.aej.2024.01.075","DOI":"10.1016\/j.aej.2024.01.075"},{"key":"e_1_3_3_1_48_2","doi-asserted-by":"publisher","unstructured":"William Orchard-Hays. 1969. Advanced Linear-Programming Computing Techniques. Comput. J. 12 (8 1969) 232\u2013232. Issue 3. 10.1093\/COMJNL\/12.3.232","DOI":"10.1093\/COMJNL\/12.3.232"},{"key":"e_1_3_3_1_49_2","doi-asserted-by":"crossref","unstructured":"Manfred Padberg and Giovanni Rinaldi. 1991. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM review 33 1 (1991) 60\u2013100.","DOI":"10.1137\/1033004"},{"key":"e_1_3_3_1_50_2","doi-asserted-by":"publisher","unstructured":"Antonio Roldao and George\u00a0A. Constantinides. 2010. A High Throughput FPGA-Based Floating Point Conjugate Gradient Implementation for Dense Matrices. ACM Trans. Reconfigurable Technol. Syst. 3 1 Article 1 (Jan. 2010) 19\u00a0pages. 10.1145\/1661438.1661439","DOI":"10.1145\/1661438.1661439"},{"key":"e_1_3_3_1_51_2","volume-title":"Theory of linear and integer programming","author":"Schrijver Alexander","year":"1998","unstructured":"Alexander Schrijver. 1998. Theory of linear and integer programming. John Wiley & Sons."},{"key":"e_1_3_3_1_52_2","doi-asserted-by":"publisher","unstructured":"Steve Smale. 1983. On the average number of steps of the simplex method of linear programming. Mathematical Programming 27 (10 1983) 241\u2013262. Issue 3. 10.1007\/BF02591902\/METRICS","DOI":"10.1007\/BF02591902\/METRICS"},{"key":"e_1_3_3_1_53_2","first-page":"122","volume-title":"North American SystemC Users\u2019 Group, Design Automation Conference","volume":"79","author":"Snyder Wilson","year":"2004","unstructured":"Wilson Snyder. 2004. Verilator and systemperl. In North American SystemC Users\u2019 Group, Design Automation Conference, Vol.\u00a079. 122\u2013148. https:\/\/verilator.org\/"},{"key":"e_1_3_3_1_54_2","doi-asserted-by":"publisher","unstructured":"Linghao Song Yuze Chi Atefeh Sohrabizadeh Young-kyu Choi Jason Lau and Jason Cong. 2022. Sextans: A Streaming Accelerator for General-Purpose Sparse-Matrix Dense-Matrix Multiplication. (2022) 65\u201377. 10.1145\/3490422.3502357","DOI":"10.1145\/3490422.3502357"},{"key":"e_1_3_3_1_55_2","doi-asserted-by":"publisher","unstructured":"Daniel\u00a0A. Spielman and Shang\u00a0Hua Teng. 2004. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of the ACM (JACM) 51 (5 2004) 385\u2013463. Issue 3. 10.1145\/990308.990310","DOI":"10.1145\/990308.990310"},{"key":"e_1_3_3_1_56_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA47549.2020.00062"},{"key":"e_1_3_3_1_57_2","volume-title":"GEMM accelerator","author":"Suresh Vignesh","year":"2021","unstructured":"Vignesh Suresh. 2021. GEMM accelerator. https:\/\/github.com\/vsuresh95\/gemm_accelerator_stratus"},{"key":"e_1_3_3_1_58_2","doi-asserted-by":"publisher","unstructured":"Tam\u00e1s Terlaky and Shuzhong Zhang. 1993. Pivot rules for linear programming: A survey on recent theoretical developments. Annals of Operations Research 46-47 (3 1993) 203\u2013233. Issue 1. 10.1007\/BF02096264\/METRICS","DOI":"10.1007\/BF02096264\/METRICS"},{"key":"e_1_3_3_1_59_2","doi-asserted-by":"crossref","unstructured":"Robert\u00a0J Vanderbei. 1998. Linear programming: foundations and extensions. Journal of the Operational Research Society 49 1 (1998) 94\u201394.","DOI":"10.1057\/palgrave.jors.2600987"},{"key":"e_1_3_3_1_60_2","doi-asserted-by":"publisher","unstructured":"Zishen Wan Bo Yu Thomas\u00a0Yuang Li Jie Tang Yuhao Zhu Yu Wang Arijit Raychowdhury and Shaoshan Liu. 2021. A Survey of FPGA-Based Robotic Computing. IEEE Circuits and Systems Magazine 21 2 (2021) 48\u201374. 10.1109\/MCAS.2021.3071609","DOI":"10.1109\/MCAS.2021.3071609"},{"key":"e_1_3_3_1_61_2","doi-asserted-by":"publisher","unstructured":"John\u00a0Alasdair Warwicker and Steffen Rebennack. 2023. Mixed-Integer Programming Formulations for Piecewise Linear Functions. Encyclopedia of Optimization (2023) 1\u20137. 10.1007\/978-3-030-54621-2_791-1","DOI":"10.1007\/978-3-030-54621-2_791-1"},{"key":"e_1_3_3_1_62_2","unstructured":"Roland Wunderling. 1996. Paralleler und Objektorientierter Simplex. (11 1996). https:\/\/opus4.kobv.de\/opus4-zib\/frontdoor\/index\/index\/docId\/538"}],"event":{"name":"HEART 2025: 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies","location":"Kumamoto Japan","acronym":"HEART 2025"},"container-title":["Proceedings of the 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3728179.3728180","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3728179.3728180","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:19:05Z","timestamp":1750295945000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3728179.3728180"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,25]]},"references-count":61,"alternative-id":["10.1145\/3728179.3728180","10.1145\/3728179"],"URL":"https:\/\/doi.org\/10.1145\/3728179.3728180","relation":{},"subject":[],"published":{"date-parts":[[2025,5,25]]},"assertion":[{"value":"2025-05-25","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}