Octahedrons with Equally Many Lattice Points. - Yuri F. Bilu; Thomas Stoll; Robert F. Tichy (Period. Math. Hung., 2000)

Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences. - Elyot Grant; Jeffrey O. Shallit; Thomas Stoll (CoRR, 2008)

Newman's phenomenon for generalized Thue-Morse sequences. - Michael Drmota; Thomas Stoll (Discret. Math., 2008)

On the Total Weight of Weighted Matchings of Segment Graphs. - Thomas Stoll; Jiang Zeng (Electron. J. Comb., 2009)

Abstraction In A Unit-Based Audio Processing System. - Thomas Stoll (ICMC, 2010)

A Fancy Way to Obtain the Binary Digits of 759250125√2. - Thomas Stoll (Am. Math. Mon., 2010)

Reconstruction Problems for Graphs, Krawtchouk Polynomials, and Diophantine Equations. - Thomas Stoll (Structural Analysis of Complex Networks, 2011)

CBPSC: Corpus-based Processing for SuperCollider. - Thomas Stoll (ICMC, 2011)

Safety requirements and safety functions for decentralized controlled autonomous systems. - Andreas Trenkle; Zazilia Seibold; Thomas Stoll (ICAT, 2013)

Layout-optimized sorting of goods with decentralized controlled conveying modules. - Zazilia Seibold; Thomas Stoll; Kai Furmans (SysCon, 2013)

SoundScapeTK: A Platform for Mobile Soundscapes. - Thomas Stoll (ICMC, 2014)

Thue-Morse Along Two Polynomial Subsequences. - Thomas Stoll (WORDS, 2015)

Monitoring and control of flexible transport equipment. - Miriam Schleipen; Michael Okon; Robert Henßen; Thomas Hövelmeyer; Andreas Wagner; Gerhard Wolff; Halit Demir; Matthias Jentsch; Marco Gebhardt; Thomas Stoll; Dennis Asi (Autom., 2015)

On digital blocks of polynomial values and extractions in the Rudin-Shapiro sequence. - Thomas Stoll (RAIRO Theor. Informatics Appl., 2016)

Construction of Some Nonautomatic Sequences by Cellular Automata. - Irène Marcovici; Thomas Stoll; Pierre-Adrien Tahay (Automata, 2018)

On Subwords in the Base-q Expansion of Polynomial and Exponential Functions. - Hajime Kaneko; Thomas Stoll (Integers, 2018)

Discrete correlations of order 2 of generalised Rudin-Shapiro sequences: a combinatorial approach. - Irène Marcovici; Thomas Stoll; Pierre-Adrien Tahay (CoRR, 2020)

Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences. - Damien Jamet; Pierre Popoli; Thomas Stoll (Cryptogr. Commun., 2021)

On the binary digits of n and n2. - Karam Aloui; Damien Jamet; Hajime Kaneko; Steffen Kopecki; Pierre Popoli; Thomas Stoll (Theor. Comput. Sci., 2023)

Provable randomness over lightweight permutations. - Juan Di Mauro; Hamid Boukkerou; Gilles Millerioux; Marine Minier; Thomas Stoll (Cryptogr. Commun., 2025)