A
Menu
January 01, 2025 conference-paper Open access Aachen paper

Wagner’s Algorithm Provably Runs in Subexponential Time for $$\textrm{SIS}^\infty $$

Lecture notes in computer science, pp. 353–384

DOI: 10.1007/978-3-032-01855-7_12 Full text (OA) OpenAlex

Authors 3

  1. Léo Ducas Aachen

    Leiden University · Centrum Wiskunde & Informatica

    Affiliation as printed

    Centrum Wiskunde & Informatica, Amsterdam, The Netherlands

    Leiden University, Leiden, The Netherlands

  2. Lynn Engelberts corresponding

    Centrum Wiskunde & Informatica · QuSoft

    Affiliation as printed

    Centrum Wiskunde & Informatica, Amsterdam, The Netherlands

    QuSoft, Amsterdam, The Netherlands

  3. Johanna Loyer

    Centrum Wiskunde & Informatica

    Affiliation as printed

    Centrum Wiskunde & Informatica, Amsterdam, The Netherlands

Cited by 2 stored of 2

2 results

No patents citing this paper on Lens.org (checked 2026-10-11).

References 30