Feedback on the Current Page
Benjamin Kraner, Luca Pennella, Nicolò Vallarano, Claudio J. Tessone. LucaPennella/money-in-motion-lsts (Dataset, Token transfer and velocity data from Ethereum). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@misc{dagstuhl-artifact-24344,
title = {{LucaPennella/money-in-motion-lsts}},
author = {Kraner, Benjamin and Pennella, Luca and Vallarano, Nicol\`{o} and Tessone, Claudio J.},
note = {Dataset, Swiss Diamond Coin Foundation, European Union - Next Generation EU (visited on 2025-10-06)},
url = {https://github.com/LucaPennella/money-in-motion-lsts},
doi = {10.4230/artifacts.24344},
}
Lars Gottesbüren, Nikolai Maas, Dominik Rosch, Peter Sanders, Daniel Seemaier. KaMinPar (Software, Source Code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@misc{dagstuhl-artifact-24666,
title = {{KaMinPar}},
author = {Gottesb\"{u}ren, Lars and Maas, Nikolai and Rosch, Dominik and Sanders, Peter and Seemaier, Daniel},
note = {Software, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:2ec38dbccb676136f71dc1796d6a06b450c48c6d}{\texttt{swh:1:dir:2ec38dbccb676136f71dc1796d6a06b450c48c6d}} (visited on 2025-10-01)},
url = {https://github.com/KaHIP/KaMinPar/commit/73eeaa2371c6826e166c9ca1383996f14d8c7a2a},
doi = {10.4230/artifacts.24666},
}
Jannik Olbrich. lg (Software, Source Code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@misc{dagstuhl-artifact-24673,
title = {{lg}},
author = {Olbrich, Jannik},
note = {Software, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:0274cae4abb893b49bc035ef3a57986a418afe40}{\texttt{swh:1:dir:0274cae4abb893b49bc035ef3a57986a418afe40}} (visited on 2025-10-01)},
url = {https://gitlab.com/qwerzuiop/lyndongrammar},
doi = {10.4230/artifacts.24673},
}
Vincent Despré, Camille Lanuel, Marc Pouget, Monique Teillaud. Implementation of the ε-net algorithm (Software). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@misc{dagstuhl-artifact-24672,
title = {{Implementation of the \epsilon-net algorithm}},
author = {Despr\'{e}, Vincent and Lanuel, Camille and Pouget, Marc and Teillaud, Monique},
note = {Software, ANR Abysm, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:2fab64276f7d193b0b712c135fa9eebba62f0509;origin=https://github.com/camille-lanuel/ESA_2025_implementation_epsilon_net;visit=swh:1:snp:746a88c723aa2bdc5fda86b1aab596931229dcb5;anchor=swh:1:rev:a97883aef3bfd9ee69ee5dbb8ec117ddc72f7686}{\texttt{swh:1:dir:2fab64276f7d193b0b712c135fa9eebba62f0509}} (visited on 2025-10-01)},
url = {https://github.com/camille-lanuel/ESA_2025_implementation_epsilon_net},
doi = {10.4230/artifacts.24672},
}
Emil Toftegaard Gæde, Ivor van der Hoog, Eva Rotenberg, Tord Stordalen. A Dynamic Piecewise-Linear Geometric Index with Worst-Case Guarantees (Software, Source Code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@misc{impl_index,
title = {{A Dynamic Piecewise-Linear Geometric Index with Worst-Case Guarantees}},
author = {G{\ae}de, Emil Toftegaard and van der Hoog, Ivor and Rotenberg, Eva and Stordalen, Tord},
note = {Software, Carlsberg Fonden CF21-0302, Villum Fonden VIL37507, Marie Skłodowska-Curie 899987, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:b8763eb0504d33beb81ee89d230a30dca8ab0b66;origin=https://github.com/Sgelet/DynamicLearnedIndex;visit=swh:1:snp:4cb5f98448fd35e1092239476b3dd4b7fa157fa9;anchor=swh:1:rev:e668899dab95046384f68723e53e0aacbad32feb}{\texttt{swh:1:dir:b8763eb0504d33beb81ee89d230a30dca8ab0b66}} (visited on 2025-10-01)},
url = {https://github.com/Sgelet/DynamicLearnedIndex},
doi = {10.4230/artifacts.24667},
}
Emil Toftegaard Gæde, Ivor van der Hoog, Eva Rotenberg, Tord Stordalen. Testbed for our learned index repository (Software, Test Bed). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@misc{impl_bench,
title = {{Testbed for our learned index repository}},
author = {G{\ae}de, Emil Toftegaard and van der Hoog, Ivor and Rotenberg, Eva and Stordalen, Tord},
note = {Software, Carlsberg Fonden CF21-0302, Villum Fonden VIL37507, Marie Skłodowska-Curie 899987, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:07ea25cfc176438933c1a5507bfdad3ba9461ab6;origin=https://github.com/Sgelet/LearnedIndexBench;visit=swh:1:snp:b64d98b5a181116695f4f7960511292c6601df13;anchor=swh:1:rev:c3ad0ca2e0149fd2be070b37ba57b12a447bbf71}{\texttt{swh:1:dir:07ea25cfc176438933c1a5507bfdad3ba9461ab6}} (visited on 2025-10-01)},
url = {https://github.com/Sgelet/LearnedIndexBench},
doi = {10.4230/artifacts.24668},
}
Ernestine Grossmann, Henrik Reinstädtler, Eva Rotenberg, Christian Schulz, Ivor van der Hoog, Juliette Vlieghe. Implementation of our dynamic algorithm for minimum orientation (Software, Source Code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@misc{dagstuhl-artifact-24670,
title = {{Implementation of our dynamic algorithm for minimum orientation}},
author = {Grossmann, Ernestine and Reinst\"{a}dtler, Henrik and Rotenberg, Eva and Schulz, Christian and van der Hoog, Ivor and Vlieghe, Juliette},
note = {Software, Villum Fonden VIL37507, DFG SCHU 2567/8-1, Marie Skłodowska-Curie 899987, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:0ea52feafca9f6d8ce3ee893686fde2510513e9e;origin=https://github.com/DynGraphLab/DynDeltaApprox;visit=swh:1:snp:d75d11daa88538aaa86297daef487996502d243b;anchor=swh:1:rev:f8c3028a966664ce26b0f32c08de00dec2103127}{\texttt{swh:1:dir:0ea52feafca9f6d8ce3ee893686fde2510513e9e}} (visited on 2025-10-01)},
url = {https://github.com/DynGraphLab/DynDeltaApprox},
doi = {10.4230/artifacts.24670},
}
Henrik Reinstädtler, S M Ferdous, Alex Pothen, Bora Uçar, Christian Schulz. HeiHGM/Streaming (Software). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@misc{dagstuhl-artifact-24674,
title = {{HeiHGM/Streaming}},
author = {Reinst\"{a}dtler, Henrik and Ferdous, S M and Pothen, Alex and U\c{c}ar, Bora and Schulz, Christian},
note = {Software, DFG-SCHU 2567/8-1, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:4e4522550296fb38202457ce7371bf7034ae45d9;origin=https://github.com/HeiHGM/Streaming;visit=swh:1:snp:981431da5340cbbf116e22fe0896634c2d164c50;anchor=swh:1:rev:acc7c88e5544a70f356db838f4027629ae8ffb4b}{\texttt{swh:1:dir:4e4522550296fb38202457ce7371bf7034ae45d9}} (visited on 2025-10-01)},
url = {https://github.com/HeiHGM/Streaming},
doi = {10.4230/artifacts.24674},
}
Stefan Hermann, Sebastian Kirmayer, Hans-Peter Lehmann, Stefan Walzer. Engineering Minimal k-Perfect Hash Functions (Software). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@misc{sourceCodekPHF,
title = {{Engineering Minimal k-Perfect Hash Functions}},
author = {Hermann, Stefan and Kirmayer, Sebastian and Lehmann, Hans-Peter and Walzer, Stefan},
note = {Software, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:e6756f018691a80adc68d839fd3617d8f5e2d0b0;origin=https://github.com/stefanfred/engineering-k-perfect-hashing;visit=swh:1:snp:8b568d1c8fe1e13f6ef95d3b2774fc59c259d6b5;anchor=swh:1:rev:2c269037dad34b69a68b56fed38c98656f02c133}{\texttt{swh:1:dir:e6756f018691a80adc68d839fd3617d8f5e2d0b0}} (visited on 2025-10-01)},
url = {https://github.com/stefanfred/engineering-k-perfect-hashing},
doi = {10.4230/artifacts.24698},
}
Joshua Marc Könen, Heiko Röglin, Tarek Stuck. Bicriteria Aggregation (Software). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@misc{dagstuhl-artifact-24714,
title = {{Bicriteria Aggregation}},
author = {K\"{o}nen, Joshua Marc and R\"{o}glin, Heiko and Stuck, Tarek},
note = {Software, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:b6eacf189792239e9115cf288be27c6753b8df17;origin=https://github.com/Tarek-pub/Bicriteria_Aggregation;visit=swh:1:snp:6062d834e514947614ecb3cd421cafb02a5cd7f5;anchor=swh:1:rev:029970db0ee7425b1739d3c87bfa94e3f9081dbd}{\texttt{swh:1:dir:b6eacf189792239e9115cf288be27c6753b8df17}} (visited on 2025-10-01)},
url = {https://github.com/Tarek-pub/Bicriteria_Aggregation},
doi = {10.4230/artifacts.24714},
}
Joshua Marc Könen, Heiko Röglin, Tarek Stuck. Bicriteria Aggregation Plotting (InteractiveResource). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@misc{dagstuhl-artifact-24713,
title = {{Bicriteria Aggregation Plotting}},
author = {K\"{o}nen, Joshua Marc and R\"{o}glin, Heiko and Stuck, Tarek},
note = {InteractiveResource (visited on 2025-10-01)},
url = {https://github.com/Tarek-pub/Bicriteria_Aggregation_plotting},
doi = {10.4230/artifacts.24713},
}
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer, Jonatan Ziegler. ByteHamster/ConsensusRecSplit (Software, Source code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@misc{dagstuhl-artifact-23789,
title = {{ByteHamster/ConsensusRecSplit}},
author = {Lehmann, Hans-Peter and Sanders, Peter and Walzer, Stefan and Ziegler, Jonatan},
note = {Software, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:eeef738e12bea287eae54a77ce81241587a91767;origin=https://github.com/ByteHamster/ConsensusRecSplit;visit=swh:1:snp:4e488d15839a07248b34bebacd139581927693ba;anchor=swh:1:rev:11deea62b5b507fbac5419ad14c9e2cc0b3ffff8}{\texttt{swh:1:dir:eeef738e12bea287eae54a77ce81241587a91767}} (visited on 2025-10-01)},
url = {https://github.com/ByteHamster/ConsensusRecSplit},
doi = {10.4230/artifacts.23789},
}
Hans-Peter Lehmann. ByteHamster/MPHF-Experiments (Software, Comparison with competitors). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@misc{dagstuhl-artifact-23790,
title = {{ByteHamster/MPHF-Experiments}},
author = {Lehmann, Hans-Peter},
note = {Software, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:7b02eda8ffa5a9d61a086ff2fc34fb0fbdc3eff4;origin=https://github.com/ByteHamster/MPHF-Experiments;visit=swh:1:snp:368a276aa02ccd3cf9f73f14764499ba9a4bff85;anchor=swh:1:rev:d4501ce780b534f0c5a285874558788e49ff3198}{\texttt{swh:1:dir:7b02eda8ffa5a9d61a086ff2fc34fb0fbdc3eff4}} (visited on 2025-10-01)},
url = {https://github.com/ByteHamster/MPHF-Experiments},
doi = {10.4230/artifacts.23790},
}
Burak Ekici, Tadayoshi Kamegai, Nobuko Yoshida. Subject Reduction and Progress for Synchronous MPST (Software, Source Code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@misc{dagstuhl-artifact-24677,
title = {{Subject Reduction and Progress for Synchronous MPST}},
author = {Ekici, Burak and Kamegai, Tadayoshi and Yoshida, Nobuko},
note = {Software, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:dde907697cf2446177177fa14a2d21b1c08149f5;origin=https://github.com/Apiros3/smpst-sr-smer;visit=swh:1:snp:3a02010b54199925764021babd0e391fa180a01b;anchor=swh:1:rev:583edde920ef3833382ff6c9130f0d20db90744b}{\texttt{swh:1:dir:dde907697cf2446177177fa14a2d21b1c08149f5}} (visited on 2025-09-22)},
url = {https://github.com/Apiros3/smpst-sr-smer},
doi = {10.4230/artifacts.24677},
}
Asta Halkjær From, Anders Schlichtkrull. Analytic Completeness (Software, Mechanization). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@misc{dagstuhl-artifact-23798,
title = {{Analytic Completeness}},
author = {From, Asta Halkj{\ae}r and Schlichtkrull, Anders},
note = {Software, version 1.0., swhId: \href{https://archive.softwareheritage.org/swh:1:dir:1bea24a089edbdbc233081a23b0dc45963bf6c8f;origin=https://github.com/astahfrom/Analytic_Completeness;visit=swh:1:snp:1c9ea048be7f3b4c9f6ed573e2d87ba0b8480717;anchor=swh:1:rev:cd6a06dd8478287763c6e820e51581322faa7f2c}{\texttt{swh:1:dir:1bea24a089edbdbc233081a23b0dc45963bf6c8f}} (visited on 2025-09-22)},
url = {https://github.com/astahfrom/Analytic_Completeness},
doi = {10.4230/artifacts.23798},
}