Tree Complexity and a Doubly Exponential Gap between Structured and Random Sequences. - Harald Niederreiter; Michael Vielhaber 001 (J. Complex., 1996)

Linear Complexity Profiles: Hausdorff Dimensions for Almost Perfect Profiles and Measures for General Profiles. - Harald Niederreiter; Michael Vielhaber 001 (J. Complex., 1997)

Simultaneous Shifted Continued Fraction Expansions in Quadratic Time. - Harald Niederreiter; Michael Vielhaber 001 (Appl. Algebra Eng. Commun. Comput., 1998)

An Algorithm for Shifted Continued Fraction Expansions in Parallel Linear Time. - Harald Niederreiter; Michael Vielhaber 001 (Theor. Comput. Sci., 1999)

A Unified View on Sequence Complexity Measures as Isometries. - Michael Vielhaber 001 (SETA, 2004)

Structural and Computational Complexity of Isometries and their Shift Commutators - Mónica del Pilar Canales Chacon; Michael Vielhaber 001 (Electron. Colloquium Comput. Complex., 2004)

On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set. - Michael Vielhaber 001; Mónica del Pilar Canales Chacon (CIAA, 2005)

The Hausdorff Dimension of the Set of r-Perfect M-Multisequences. - Michael Vielhaber 001; Mónica del Pilar Canales Chacon (SETA, 2006)

Towards a General Theory of Simultaneous Diophantine Approximation of Formal Power Series: Multidimensional Linear Complexity - Michael Vielhaber 001; Mónica del Pilar Canales Chacon (CoRR, 2006)

The Battery-Discharge-Model: A Class of Stochastic Finite Automata to Simulate Multidimensional Continued Fraction Expansion - Michael Vielhaber 001; Mónica del Pilar Canales Chacon (CoRR, 2007)

Breaking ONE.FIVIUM by AIDA an Algebraic IV Differential Attack. - Michael Vielhaber 001 (IACR Cryptol. ePrint Arch., 2007)

Continued Fraction Expansion as Isometry - The Law of the Iterated Logarithm for Linear, Jump, and 2-Adic Complexity. - Michael Vielhaber 001 (IEEE Trans. Inf. Theory, 2007)

TRIVIUM's output partially autocancels. - Michael Vielhaber 001 (IACR Cryptol. ePrint Arch., 2008)

The asymptotic normalized linear complexity of multisequences. - Michael Vielhaber 001; Mónica del Pilar Canales Chacon (J. Complex., 2008)

AIDA Breaks BIVIUM (A&B) in 1 Minute Dual Core CPU Time. - Michael Vielhaber 001 (IACR Cryptol. ePrint Arch., 2009)

Reduce-by-Feedback: Timing Resistant and DPA-Aware Modular Multiplication Plus: How to Break RSA by DPA. - Michael Vielhaber 001 (CHES, 2012)

The Linear Complexity Deviation of Multisequences: Formulae for Finite Lengths and Asymptotic Distributions. - Michael Vielhaber 001; Mónica del Pilar Canales Chacon (SETA, 2012)

Improved results on the probabilistic theory of the joint linear complexity of multisequences. - Harald Niederreiter; Michael Vielhaber 001; Li-Ping Wang 001 (Sci. China Inf. Sci., 2012)

Computing by Temporal Order: Asynchronous Cellular Automata - Michael Vielhaber 001 (AUTOMATA & JAC, 2012)

Computation of functions on n bits by asynchronous clocking of cellular automata. - Michael Vielhaber 001 (Nat. Comput., 2013)

On the linear complexity of multisequences, bijections between ℤahlen and ℕumber tuples, and partitions. - Michael Vielhaber 001 (Applied Algebra and Number Theory, 2014)

Rational complexity of binary sequences, FℚSRs, and pseudo-ultrametric continued fractions in ℝ. - Michael Vielhaber 001; Mónica del Pilar Canales Chacon; Sergio Jara Ceballos (Cryptogr. Commun., 2022)

Friedman's "Long Finite Sequences": The End of the Busy Beaver Contest. - Michael Vielhaber 001; Mónica del Pilar Canales Chacon; Sergio Jara Ceballos (CoRR, 2023)