default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMike Müller
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2015
[b1]Mike Müller:
Avoiding and Enforcing Repetitive Structures in Words. University of Kiel, 2015
Journal Articles
- 2019
- [j9]Michael Codish
, Luís Cruz-Filipe, Thorsten Ehlers, Mike Müller, Peter Schneider-Kamp:
Sorting networks: To the end and back again. J. Comput. Syst. Sci. 104: 184-201 (2019) - 2017
- [j8]Florin Manea, Mike Müller, Dirk Nowotka, Shinnosuke Seki:
The extended equation of Lyndon and Schützenberger. J. Comput. Syst. Sci. 85: 132-167 (2017) - [j7]Stepan Holub, Mike Müller:
Fully bordered words. Theor. Comput. Sci. 684: 53-58 (2017) - 2015
- [j6]Mike Müller, Svetlana Puzynina, Michaël Rao:
On Shuffling of Infinite Square-Free Words. Electron. J. Comb. 22(1): 1 (2015) - [j5]Pedro Pablo Alarcón, Fernando Arroyo, Henning Bordihn, Victor Mitrana, Mike Müller:
Ambiguity of the Multiple Interpretations on Regular Languages. Fundam. Informaticae 138(1-2): 85-95 (2015) - [j4]Florin Manea, Mike Müller, Dirk Nowotka:
Cubic patterns with permutations. J. Comput. Syst. Sci. 81(7): 1298-1310 (2015) - [j3]Tero Harju, Mike Müller:
A note on short palindromes in square-free words. Theor. Comput. Sci. 562: 658-659 (2015) - [j2]Tero Harju, Mike Müller:
Square-free shuffles of words. Theor. Comput. Sci. 601: 29-38 (2015) - 2014
- [j1]Jürgen Dassow, Florin Manea, Robert Mercas, Mike Müller:
Inner Palindromic Closure. Int. J. Found. Comput. Sci. 25(8): 1049-1064 (2014)
Conference and Workshop Papers
- 2015
- [c6]Thorsten Ehlers, Mike Müller:
New Bounds on Optimal Sorting Networks. CiE 2015: 167-176 - 2014
- [c5]Florin Manea, Mike Müller, Dirk Nowotka, Shinnosuke Seki:
Generalised Lyndon-Schützenberger Equations. MFCS (1) 2014: 402-413 - 2013
- [c4]Jürgen Dassow, Florin Manea, Robert Mercas, Mike Müller:
Inner Palindromic Closure. Developments in Language Theory 2013: 155-166 - [c3]Florin Manea, Mike Müller, Dirk Nowotka:
On the Pseudoperiodic Extension of u^l = v^m w^n. FSTTCS 2013: 475-486 - 2012
- [c2]Florin Manea, Mike Müller, Dirk Nowotka:
The Avoidability of Cubes under Permutations. Developments in Language Theory 2012: 416-427 - [c1]Cristian Grozea, Florin Manea, Mike Müller, Dirk Nowotka:
String Matching with Involutions. UCNC 2012: 106-117
Informal and Other Publications
- 2015
- [i6]Thorsten Ehlers, Mike Müller:
New Bounds on Optimal Sorting Networks. CoRR abs/1501.06946 (2015) - [i5]Stepan Holub, Mike Müller:
Binary words with the fewest unbordered conjugates. CoRR abs/1504.02222 (2015) - [i4]Michael Codish, Luís Cruz-Filipe, Thorsten Ehlers, Mike Müller, Peter Schneider-Kamp:
Sorting Networks: to the End and Back Again. CoRR abs/1507.01428 (2015) - 2014
- [i3]Mike Müller, Svetlana Puzynina, Michaël Rao:
Infinite square-free self-shuffling words. CoRR abs/1401.6536 (2014) - [i2]Thorsten Ehlers, Mike Müller:
Faster Sorting Networks for $17$, $19$ and $20$ Inputs. CoRR abs/1410.2736 (2014) - 2013
- [i1]Tero Harju, Mike Müller:
Square-Free Shuffles of Words. CoRR abs/1309.2137 (2013)
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-10-07 22: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:
