default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Vielhaber 0001
Person information
- affiliation: Hochschule Bremerhaven, Bremerhaven, Germany
Other persons with the same name
- Michael Vielhaber 0002 — Saarland University, Institute of Engineering Design, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i9]Michael Vielhaber, Mónica del Pilar Canales Chacon, Sergio Jara Ceballos:
Friedman's "Long Finite Sequences": The End of the Busy Beaver Contest. CoRR abs/2303.02855 (2023)- 2022
- [j9]Michael Vielhaber
, Mónica del Pilar Canales Chacon, Sergio Jara Ceballos:
Rational complexity of binary sequences, FℚSRs, and pseudo-ultrametric continued fractions in ℝ. Cryptogr. Commun. 14(2): 433-457 (2022)
2010 – 2019
- 2014
- [p1]Michael Vielhaber:
On the linear complexity of multisequences, bijections between ℤahlen and ℕumber tuples, and partitions. Applied Algebra and Number Theory 2014: 307-335 - 2013
- [j8]Michael Vielhaber:
Computation of functions on n bits by asynchronous clocking of cellular automata. Nat. Comput. 12(3): 307-322 (2013) - 2012
- [j7]Harald Niederreiter, Michael Vielhaber, Li-Ping Wang:
Improved results on the probabilistic theory of the joint linear complexity of multisequences. Sci. China Inf. Sci. 55(1): 165-170 (2012) - [c6]Michael Vielhaber:
Reduce-by-Feedback: Timing Resistant and DPA-Aware Modular Multiplication Plus: How to Break RSA by DPA. CHES 2012: 463-475 - [c5]Michael Vielhaber, Mónica del Pilar Canales Chacon:
The Linear Complexity Deviation of Multisequences: Formulae for Finite Lengths and Asymptotic Distributions. SETA 2012: 168-180 - [c4]Michael Vielhaber:
Computing by Temporal Order: Asynchronous Cellular Automata. AUTOMATA & JAC 2012: 166-176
2000 – 2009
- 2009
- [i8]Michael Vielhaber:
AIDA Breaks BIVIUM (A&B) in 1 Minute Dual Core CPU Time. IACR Cryptol. ePrint Arch. 2009: 402 (2009) - 2008
- [j6]Michael Vielhaber, Mónica del Pilar Canales Chacon:
The asymptotic normalized linear complexity of multisequences. J. Complex. 24(3): 410-422 (2008) - [i7]Michael Vielhaber:
TRIVIUM's output partially autocancels. IACR Cryptol. ePrint Arch. 2008: 377 (2008) - 2007
- [j5]Michael Vielhaber:
Continued Fraction Expansion as Isometry - The Law of the Iterated Logarithm for Linear, Jump, and 2-Adic Complexity. IEEE Trans. Inf. Theory 53(11): 4383-4391 (2007) - [i6]Michael Vielhaber, Mónica del Pilar Canales Chacon:
The Battery-Discharge-Model: A Class of Stochastic Finite Automata to Simulate Multidimensional Continued Fraction Expansion. CoRR abs/0705.4134 (2007) - [i5]Michael Vielhaber, Mónica del Pilar Canales Chacon:
The Asymptotic Normalized Linear Complexity of Multisequences. CoRR abs/0705.4138 (2007) - [i4]Michael Vielhaber:
Breaking ONE.FIVIUM by AIDA an Algebraic IV Differential Attack. IACR Cryptol. ePrint Arch. 2007: 413 (2007) - 2006
- [c3]Michael Vielhaber, Mónica del Pilar Canales Chacon:
The Hausdorff Dimension of the Set of r-Perfect M-Multisequences. SETA 2006: 259-270 - [i3]Michael Vielhaber, Mónica del Pilar Canales Chacon:
Towards a General Theory of Simultaneous Diophantine Approximation of Formal Power Series: Multidimensional Linear Complexity. CoRR abs/cs/0607030 (2006) - 2005
- [c2]Michael Vielhaber, Mónica del Pilar Canales Chacon:
On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set. CIAA 2005: 356-357 - [i2]Michael Vielhaber:
Continued Fraction Expansion as Isometry: The Law of the Iterated Logarithm for Linear, Jump, and 2--Adic Complexity. CoRR abs/cs/0511089 (2005) - 2004
- [c1]Michael Vielhaber:
A Unified View on Sequence Complexity Measures as Isometries. SETA 2004: 143-153 - [i1]Mónica del Pilar Canales Chacon, Michael Vielhaber:
Structural and Computational Complexity of Isometries and their Shift Commutators. Electron. Colloquium Comput. Complex. TR04 (2004)
1990 – 1999
- 1999
- [j4]Harald Niederreiter, Michael Vielhaber:
An Algorithm for Shifted Continued Fraction Expansions in Parallel Linear Time. Theor. Comput. Sci. 226(1-2): 93-104 (1999) - 1998
- [j3]Harald Niederreiter, Michael Vielhaber:
Simultaneous Shifted Continued Fraction Expansions in Quadratic Time. Appl. Algebra Eng. Commun. Comput. 9(2): 125-138 (1998) - 1997
- [j2]Harald Niederreiter, Michael Vielhaber:
Linear Complexity Profiles: Hausdorff Dimensions for Almost Perfect Profiles and Measures for General Profiles. J. Complex. 13(3): 353-383 (1997) - 1996
- [j1]Harald Niederreiter, Michael Vielhaber:
Tree Complexity and a Doubly Exponential Gap between Structured and Random Sequences. J. Complex. 12(3): 187-198 (1996)
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 22:47 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:
