Author of the publication

AttentionLeak: What Does Human Attention Reveal About Information Visualisation?

, , , , , and . International Conference on Document Analysis and Recognition, page 1-11. Cham, Springer Nature Switzerland, (September 2025)
DOI: 10.1007/978-3-032-04627-7_5

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.

 

Other publications of authors with the same name

Characterizing the semantics of terminological cycles with the help of finite automata.. Description Logics, volume 410 of URA-CNRS, (1997)Extensions to Description Logics., , and . Description Logic Handbook, page 219-261. Cambridge University Press, (2003)A Formal Definition of Online Abuse-Freeness., , and . SecureComm, volume 50 of Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, page 484-497. Springer, (2010)Approximating most specific concepts in description logics with existential restrictions., and . AI Commun., 15 (1): 47-59 (2002)Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking., , and . IACR Cryptology ePrint Archive, (2014)On the Relationships Between Notions of Simulation-Based Security., , , and . IACR Cryptology ePrint Archive, (2006)Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation., and . IACR Cryptology ePrint Archive, (2008)Approximating Most Specific Concepts in Description Logics with Existential Restrictions., and . KI/ÖGAI, volume 2174 of Lecture Notes in Computer Science, page 33-47. Springer, (2001)Computing Least Common Subsumers in Description Logics with Existential Restrictions., , and . IJCAI, page 96-103. Morgan Kaufmann, (1999)iUC: Flexible Universal Composability Made Simple., , , and . ASIACRYPT (3), volume 11923 of Lecture Notes in Computer Science, page 191-221. Springer, (2019)