| 2026 | AofA | Fringe Subtrees of Split Trees. | Cecilia Holmgren, Jasper Ischebeck, Svante Janson |
| 2024 | AofA | Depth-First Search Performance in Random Digraphs. | Philippe Jacquet, Svante Janson |
| 2024 | AofA | Bit-Array-Based Alternatives to HyperLogLog. | Svante Janson, Jrmie O. Lumbroso, Robert Sedgewick |
| 2024 | AofA | Fringe Trees for Random Trees with Given Vertex Degrees. | Gabriel Berzunza Ojeda, Cecilia Holmgren, Svante Janson |
| 2022 | AofA | Depth-First Search Performance in a Random Digraph with Geometric Degree Distribution. | Philippe Jacquet, Svante Janson |
| 2020 | AofA | Hidden Words Statistics for Large Patterns. | Svante Janson, Wojciech Szpankowski |
| 2018 | AofA | Inversions in Split Trees and Conditional Galton-Watson Trees. | Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman |
| 2018 | AofA | Patterns in Random Permutations Avoiding Some Other Patterns (Keynote Speakers). | Svante Janson |
| 2017 | AAAI | Phragmn's Voting Methods and Justified Representation. | Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner |
| 2014 | LATIN | Weighted Staircase Tableaux, Asymmetric Exclusion Process, and Eulerian Type Recurrences. | Pawel Hitczenko, Svante Janson |
| 2009 | ISIT | An optimal result for codes identifying sets of words. | Svante Janson, Tero Laihonen |
| 2004 | CPM | On the Average Sequence Complexity. | Svante Janson, Stefano Lonardi, Wojciech Szpankowski |
| 2004 | DCC | On the Average Sequence Complexity. | Svante Janson, Stefano Lonardi, Wojciech Szpankowski |
| 2004 | SODA | The number of bit comparisons used by Quicksort: an average-case analysis. | James Allen Fill, Svante Janson |