Michael Vielhaber

Orcid: 0000-0002-6094-1334

Affiliations:
  • Hochschule Bremerhaven, Bremerhaven, Germany


According to our database1, Michael Vielhaber authored at least 23 papers between 1996 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Friedman's "Long Finite Sequences": The End of the Busy Beaver Contest.
CoRR, 2023

2022
Rational complexity of binary sequences, FℚSRs, and pseudo-ultrametric continued fractions in ℝ.
Cryptogr. Commun., 2022

2014
On the linear complexity of multisequences, bijections between ℤahlen and ℕumber tuples, and partitions.
Proceedings of the Applied Algebra and Number Theory, 2014

2013
Computation of functions on n bits by asynchronous clocking of cellular automata.
Nat. Comput., 2013

2012
Computing by Temporal Order: Asynchronous Cellular Automata
Proceedings of the Proceedings 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires, 2012

Improved results on the probabilistic theory of the joint linear complexity of multisequences.
Sci. China Inf. Sci., 2012

The Linear Complexity Deviation of Multisequences: Formulae for Finite Lengths and Asymptotic Distributions.
Proceedings of the Sequences and Their Applications - SETA 2012, 2012

Reduce-by-Feedback: Timing Resistant and DPA-Aware Modular Multiplication Plus: How to Break RSA by DPA.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2012, 2012

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

2008
The asymptotic normalized linear complexity of multisequences.
J. Complex., 2008

TRIVIUM's output partially autocancels.
IACR Cryptol. ePrint Arch., 2008

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

Breaking ONE.FIVIUM by AIDA an Algebraic IV Differential Attack.
IACR Cryptol. ePrint Arch., 2007

The Battery-Discharge-Model: A Class of Stochastic Finite Automata to Simulate Multidimensional Continued Fraction Expansion
CoRR, 2007

2006
Towards a General Theory of Simultaneous Diophantine Approximation of Formal Power Series: Multidimensional Linear Complexity
CoRR, 2006

The Hausdorff Dimension of the Set of <i>r</i>-Perfect <i>M</i>-Multisequences.
Proceedings of the Sequences and Their Applications, 2006

2005
On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set.
Proceedings of the Implementation and Application of Automata, 2005

2004
Structural and Computational Complexity of Isometries and their Shift Commutators
Electron. Colloquium Comput. Complex., 2004

A Unified View on Sequence Complexity Measures as Isometries.
Proceedings of the Sequences and Their Applications, 2004

1999
An Algorithm for Shifted Continued Fraction Expansions in Parallel Linear Time.
Theor. Comput. Sci., 1999

1998
Simultaneous Shifted Continued Fraction Expansions in Quadratic Time.
Appl. Algebra Eng. Commun. Comput., 1998

1997
Linear Complexity Profiles: Hausdorff Dimensions for Almost Perfect Profiles and Measures for General Profiles.
J. Complex., 1997

1996
Tree Complexity and a Doubly Exponential Gap between Structured and Random Sequences.
J. Complex., 1996


  Loading...