( en | de | ru )

 

Disambiguation of "Hoffmann, Stefan"

Author of the publication

copydeleteadd this publication to your clipboard
Deep Voxel-Guided Morphometry (VGM): Learning Regional Brain Changes in Serial MRI.

, , , , , , , , , and . MLCN/RNO-AI@MICCAI, volume 12449 of Lecture Notes in Computer Science, page 159-168. Springer, (2020)

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

Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes., , , , , and . OR, page 331-338. Springer, (2019)State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets.. LATA, volume 12638 of Lecture Notes in Computer Science, page 318-330. Springer, (2021)Commutative Regular Languages with Product-Form Minimal Automata.. DCFS, volume 13037 of Lecture Notes in Computer Science, page 51-63. Springer, (2021)Reset Complexity and Completely Reachable Automata with Simple Idempotents.. DCFS, volume 13439 of Lecture Notes in Computer Science, page 85-99. Springer, (2022)Completely Distinguishable Automata and the Set of Synchronizing Words.. DLT, volume 13911 of Lecture Notes in Computer Science, page 128-142. Springer, (2023)Powerless Security., , , and . ACNS (2), volume 12147 of Lecture Notes in Computer Science, page 213-232. Springer, (2020)New characterizations of primitive permutation groups with applications to synchronizing automata.. Inf. Comput., 295 (Part B): 105086 (December 2023)State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets.. CoRR, (2020)Constrained Synchronization for Monotonic and Solvable Automata and Automata with Simple Idempotents.. CIAA, volume 13266 of Lecture Notes in Computer Science, page 225-237. Springer, (2022)Automata-Theoretical Regularity Characterizations for the Iterated Shuffle on Commutative Regular Languages.. DLT, volume 13257 of Lecture Notes in Computer Science, page 164-176. Springer, (2022)