( en | de | ru )

 

Disambiguation of "Hoffmann, Stefan"

Author of the publication

copydeleteadd this publication to your clipboard
Boykottpartizipation

. Gabler Edition Wissenschaft Gabler, Wiesbaden, 1. Aufl. edition, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stefan Hoffmann

Stefan Hoffmann

Stefan Hoffmann

Stefan Hoffmann

Stefan Hoffmann

 

Other publications of authors with the same name

Optimales Online-Marketing. Gabler-Edition Wissenschaft Dt. Univ.-Verl. u.a., Wiesbaden, (1998)Extensions to Minimal Synchronizing Words., and . J. Autom. Lang. Comb., 24 (2-4): 287-307 (2019)Consumer behavior in augmented shopping reality. A review, synthesis, and research agenda., and . Frontiers Virtual Real., (2022)Paradoxes Datenschutzverhalten., and . HMD Prax. Wirtsch., 58 (6): 1535-1551 (2021)Cross-Task and Cross-Participant Classification of Cognitive Load in an Emergency Simulation Game., , , , , , , , and . IEEE Trans. Affect. Comput., 14 (2): 1558-1571 (April 2023)Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components - (Extended Abstract)., , and . WALCOM, volume 11355 of Lecture Notes in Computer Science, page 175-187. Springer, (2019)Nachhaltigkeitsinformationen zu Lebensmitteln am Point-of-Sale mittels mobiler Augmented Reality., , , and . GIL Jahrestagung, volume P-278 of LNI, page 131-134. GI, (2018)The n-ary Initial Literal and Literal Shuffle.. Stringology, page 61-74. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2021)State Complexity Investigations on Commutative Languages - the Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages.. DCFS, volume 13037 of Lecture Notes in Computer Science, page 64-75. Springer, (2021)Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words.. LATA, volume 12638 of Lecture Notes in Computer Science, page 305-317. Springer, (2021)