default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Stoll
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j9]Karam Aloui, Damien Jamet, Hajime Kaneko, Steffen Kopecki, Pierre Popoli
, Thomas Stoll:
On the binary digits of n and n2. Theor. Comput. Sci. 939: 119-139 (2023)- 2021
- [j8]Damien Jamet, Pierre Popoli, Thomas Stoll:
Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences. Cryptogr. Commun. 13(5): 791-814 (2021) - 2018
- [j7]Hajime Kaneko, Thomas Stoll:
On Subwords in the Base-q Expansion of Polynomial and Exponential Functions. Integers 18A: A11 (2018) - 2016
- [j6]Thomas Stoll:
On digital blocks of polynomial values and extractions in the Rudin-Shapiro sequence. RAIRO Theor. Informatics Appl. 50(1): 93-99 (2016) - 2015
- [j5]Miriam Schleipen, Michael Okon, Robert Henßen, Thomas Hövelmeyer, Andreas Wagner, Gerhard Wolff, Halit Demir, Matthias Jentsch, Marco Gebhardt, Thomas Stoll, Dennis Asi:
Monitoring and control of flexible transport equipment. Autom. 63(12): 977-991 (2015) - 2010
- [j4]Thomas Stoll:
A Fancy Way to Obtain the Binary Digits of 759250125√2. Am. Math. Mon. 117(7): 611-617 (2010) - 2009
- [j3]Thomas Stoll, Jiang Zeng:
On the Total Weight of Weighted Matchings of Segment Graphs. Electron. J. Comb. 16(1) (2009) - 2008
- [j2]Michael Drmota, Thomas Stoll:
Newman's phenomenon for generalized Thue-Morse sequences. Discret. Math. 308(7): 1191-1208 (2008) - 2000
- [j1]Yuri F. Bilu, Thomas Stoll, Robert F. Tichy:
Octahedrons with Equally Many Lattice Points. Period. Math. Hung. 40(2): 229-238 (2000)
Conference and Workshop Papers
- 2018
- [c7]Irène Marcovici, Thomas Stoll, Pierre-Adrien Tahay:
Construction of Some Nonautomatic Sequences by Cellular Automata. Automata 2018: 113-126 - 2015
- [c6]Thomas Stoll:
Thue-Morse Along Two Polynomial Subsequences. WORDS 2015: 47-58 - 2014
- [c5]Thomas Stoll:
SoundScapeTK: A Platform for Mobile Soundscapes. ICMC 2014 - 2013
- [c4]Andreas Trenkle, Zazilia Seibold, Thomas Stoll:
Safety requirements and safety functions for decentralized controlled autonomous systems. ICAT 2013: 1-6 - [c3]Zazilia Seibold, Thomas Stoll, Kai Furmans:
Layout-optimized sorting of goods with decentralized controlled conveying modules. SysCon 2013: 628-633 - 2011
- [c2]Thomas Stoll:
CBPSC: Corpus-based Processing for SuperCollider. ICMC 2011 - 2010
- [c1]Thomas Stoll:
Abstraction In A Unit-Based Audio Processing System. ICMC 2010
Parts in Books or Collections
- 2011
- [p1]Thomas Stoll:
Reconstruction Problems for Graphs, Krawtchouk Polynomials, and Diophantine Equations. Structural Analysis of Complex Networks 2011: 293-317
Informal and Other Publications
- 2020
- [i2]Irène Marcovici, Thomas Stoll, Pierre-Adrien Tahay:
Discrete correlations of order 2 of generalised Rudin-Shapiro sequences: a combinatorial approach. CoRR abs/2006.13162 (2020) - 2008
- [i1]Elyot Grant, Jeffrey O. Shallit, Thomas Stoll:
Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences. CoRR abs/0812.3186 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
