Publications and preprints

All publications

1. [1]

   Shortest paths on k-compressed graphs in near-linear time

   Ilse Brede and Tomasz Ruel.

   Proceedings of the Symposium on Algorithmic Foundations (SAF 2026), pp. 112–131.

   • Best paper award
   • Graph algorithms

   PDFPreprintCode
   2026
   Show BibTeX

   @inproceedings{brede2026compressed,
     author    = {Brede, Ilse and Ruel, Tomasz},
     title     = {Shortest paths on k-compressed graphs in near-linear time},
     booktitle = {Proc. Symposium on Algorithmic Foundations},
     pages     = {112--131},
     year      = {2026}
   }

2. [2]

   A mechanised proof of a wait-free priority queue

   Ilse Brede, Mei Kawabata and Jonas Felber.

   Preprint, submitted September 2026.

   • Preprint
   • Verification
   • Concurrency

   PDFPreprintCode
   2026
   Show BibTeX

   @misc{brede2026waitfree,
     author    = {Brede, Ilse and Kawabata, Mei and Felber, Jonas},
     title     = {A mechanised proof of a wait-free priority queue},
     note      = {Preprint},
     year      = {2026}
   }

3. [3]

   Decrease-key is (almost) free: a lazy heap for sparse graphs

   Adaeze Okonkwo-Hale and Ilse Brede.

   Preprint, June 2026.

   • Preprint
   • Graph algorithms
   • Data structures

   PDFPreprint
   2026
   Show BibTeX

   @misc{okonkwohale2026lazyheap,
     author    = {Okonkwo-Hale, Adaeze and Brede, Ilse},
     title     = {Decrease-key is (almost) free: a lazy heap for sparse graphs},
     note      = {Preprint},
     year      = {2026}
   }

4. [4]

   Linearisability checking by bounded replay

   Jonas Felber and Ilse Brede.

   Proceedings of the Workshop on Verified Systems (WVS 2025), pp. 41–55.

   • Verification
   • Concurrency

   PDFPreprintCode
   2025
   Show BibTeX

   @inproceedings{felber2025replay,
     author    = {Felber, Jonas and Brede, Ilse},
     title     = {Linearisability checking by bounded replay},
     booktitle = {Proc. Workshop on Verified Systems},
     pages     = {41--55},
     year      = {2025}
   }

5. [5]

   Succinct adjacency for road networks

   Ilse Brede, Priya Ramaswamy-Lund and Ruth Ellacombe.

   Journal of Discrete Computation 14(2), pp. 201–236.

   • Graph algorithms
   • Data structures

   PDFPreprint
   2025
   Show BibTeX

   @article{brede2025roads,
     author    = {Brede, Ilse and Ramaswamy-Lund, Priya and Ellacombe, Ruth},
     title     = {Succinct adjacency for road networks},
     journal   = {Journal of Discrete Computation},
     volume    = {14},
     number    = {2},
     pages     = {201--236},
     year      = {2025}
   }

6. [6]

   Teaching loop invariants with stepwise visualisation

   Ilse Brede and Kofi Mensah-Bright.

   Proceedings of the Forum on Computing Education (FoCE 2025), pp. 9–16.

   • Education

   PDFPreprintCode
   2025
   Show BibTeX

   @inproceedings{brede2025invariants,
     author    = {Brede, Ilse and Mensah-Bright, Kofi},
     title     = {Teaching loop invariants with stepwise visualisation},
     booktitle = {Proc. Forum on Computing Education},
     pages     = {9--16},
     year      = {2025}
   }

7. [7]

   Lock-free queues under weak memory, revisited

   Mei Kawabata and Ilse Brede.

   Proceedings of the Conference on Concurrent Programs (CCP 2024), pp. 77–94.

   • Concurrency
   • Verification

   PDF
   2024
   Show BibTeX

   @inproceedings{kawabata2024weakmem,
     author    = {Kawabata, Mei and Brede, Ilse},
     title     = {Lock-free queues under weak memory, revisited},
     booktitle = {Proc. Conference on Concurrent Programs},
     pages     = {77--94},
     year      = {2024}
   }

8. [8]

   Bidirectional search with certified bounds

   Tomasz Ruel, Ilse Brede and Lior Benami.

   Proceedings of the Symposium on Algorithmic Foundations (SAF 2024), pp. 305–322.

   • Graph algorithms
   • Verification

   PDF
   2024
   Show BibTeX

   @inproceedings{ruel2024bidir,
     author    = {Ruel, Tomasz and Brede, Ilse and Benami, Lior},
     title     = {Bidirectional search with certified bounds},
     booktitle = {Proc. Symposium on Algorithmic Foundations},
     pages     = {305--322},
     year      = {2024}
   }

9. [9]

   Rank and select in two cache lines

   Ilse Brede and Ruth Ellacombe.

   Proceedings of the Colloquium on Data Structures (CoDS 2023), pp. 18–30.

   • Data structures

   PDFCode
   2023
   Show BibTeX

   @inproceedings{brede2023rankselect,
     author    = {Brede, Ilse and Ellacombe, Ruth},
     title     = {Rank and select in two cache lines},
     booktitle = {Proc. Colloquium on Data Structures},
     pages     = {18--30},
     year      = {2023}
   }

10. [10]

    Proof-carrying shortest path trees

    Ilse Brede.

    PhD thesis, Pellbrook University.

    • Graph algorithms
    • Verification

    PDF
    2022
    Show BibTeX

    @phdthesis{brede2022thesis,
      author    = {Brede, Ilse},
      title     = {Proof-carrying shortest path trees},
      school    = {Pellbrook University},
      year      = {2022}
    }

11. [11]

    Compact routing labels for planar graphs

    Ilse Brede and Lior Benami.

    Proceedings of the Colloquium on Data Structures (CoDS 2021), pp. 64–79.

    • Graph algorithms
    • Data structures

    PDF
    2021
    Show BibTeX

    @inproceedings{brede2021routing,
      author    = {Brede, Ilse and Benami, Lior},
      title     = {Compact routing labels for planar graphs},
      booktitle = {Proc. Colloquium on Data Structures},
      pages     = {64--79},
      year      = {2021}
    }

No paper matches both filters. Try another year, or ask me about work in progress.