default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Hess
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]Manuel Brenner, Florian Hess, Georgia Koppe, Daniel Durstewitz:
Integrating Multimodal Data for Joint Generative Modeling of Complex Dynamics. ICML 2024- [c15]Niclas Alexander Göring, Florian Hess, Manuel Brenner, Zahra Monfared, Daniel Durstewitz:
Out-of-Domain Generalization in Dynamical Systems Reconstruction. ICML 2024 - [c14]Christoph Jürgen Hemmer, Manuel Brenner, Florian Hess, Daniel Durstewitz:
Optimal Recurrent Network Topologies for Dynamical Systems Reconstruction. ICML 2024 - [i11]Niclas Alexander Göring, Florian Hess, Manuel Brenner, Zahra Monfared, Daniel Durstewitz:
Out-of-Domain Generalization in Dynamical Systems Reconstruction. CoRR abs/2402.18377 (2024) - [i10]Christoph Jürgen Hemmer, Manuel Brenner, Florian Hess, Daniel Durstewitz:
Optimal Recurrent Network Topologies for Dynamical Systems Reconstruction. CoRR abs/2406.04934 (2024) - 2023
- [c13]Florian Hess, Zahra Monfared, Manuel Brenner, Daniel Durstewitz:
Generalized Teacher Forcing for Learning Chaotic Dynamics. ICML 2023: 13017-13049 - [i9]Florian Hess, Zahra Monfared, Manuel Brenner, Daniel Durstewitz:
Generalized Teacher Forcing for Learning Chaotic Dynamics. CoRR abs/2306.04406 (2023) - 2022
- [c12]Manuel Brenner, Florian Hess, Jonas M. Mikhaeil
, Leonard F. Bereska, Zahra Monfared, Po-Chen Kuo, Daniel Durstewitz:
Tractable Dendritic RNNs for Reconstructing Nonlinear Dynamical Systems. ICML 2022: 2292-2320 - [i8]Manuel Brenner, Florian Hess, Jonas M. Mikhaeil, Leonard F. Bereska, Zahra Monfared, Po-Chen Kuo, Daniel Durstewitz:
Tractable Dendritic RNNs for Reconstructing Nonlinear Dynamical Systems. CoRR abs/2207.02542 (2022)
2010 – 2019
- 2016
- [j10]María Isabel González Vasco, Florian Hess, Rainer Steinwandt:
Combined schemes for signature and encryption: The public-key and the identity-based setting. Inf. Comput. 247: 1-10 (2016) - 2013
- [j9]Florian Hess, Philipp Fürnstahl, Luigi-Maria Gallo, Andreas Schweizer:
3D Analysis of the Proximal Interphalangeal Joint Kinematics during Flexion. Comput. Math. Methods Medicine 2013: 138063:1-138063:7 (2013) - 2012
- [c11]Florian Hess:
Generalised Jacobians in Cryptography and Coding Theory. WAIFI 2012: 1-15
2000 – 2009
- 2009
- [j8]Seiichi Matsuda, Naoki Kanayama, Florian Hess, Eiji Okamoto:
Optimised Versions of the Ate and Twisted Ate Pairings. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(7): 1660-1667 (2009) - 2008
- [j7]Steven D. Galbraith, Florian Hess, Frederik Vercauteren:
Aspects of Pairing Inversion. IEEE Trans. Inf. Theory 54(12): 5719-5728 (2008) - [c10]Florian Hess:
Pairing Lattices. Pairing 2008: 18-38 - [i7]Florian Hess:
Pairing Lattices. IACR Cryptol. ePrint Arch. 2008: 125 (2008) - [i6]María Isabel González Vasco, Florian Hess, Rainer Steinwandt:
Combined (identity-based) public key schemes. IACR Cryptol. ePrint Arch. 2008: 466 (2008) - 2007
- [c9]Robert Granger, Florian Hess, Roger Oyono, Nicolas Thériault, Frederik Vercauteren:
Ate Pairing on Hyperelliptic Curves. EUROCRYPT 2007: 430-447 - [c8]Seiichi Matsuda, Naoki Kanayama, Florian Hess, Eiji Okamoto:
Optimised Versions of the Ate and Twisted Ate Pairings. IMACC 2007: 302-312 - [c7]Steven D. Galbraith, Florian Hess, Frederik Vercauteren:
Hyperelliptic Pairings. Pairing 2007: 108-131 - [i5]Seiichi Matsuda, Naoki Kanayama, Florian Hess, Eiji Okamoto:
Optimised versions of the Ate and Twisted Ate Pairings. IACR Cryptol. ePrint Arch. 2007: 13 (2007) - [i4]Steven D. Galbraith, Florian Hess, Frederik Vercauteren:
Aspects of Pairing Inversion. IACR Cryptol. ePrint Arch. 2007: 256 (2007) - 2006
- [j6]Florian Hess, Nigel P. Smart, Frederik Vercauteren:
The Eta Pairing Revisited. IEEE Trans. Inf. Theory 52(10): 4595-4602 (2006) - [e1]Florian Hess, Sebastian Pauli, Michael E. Pohst:
Algorithmic Number Theory, 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings. Lecture Notes in Computer Science 4076, Springer 2006, ISBN 3-540-36075-1 [contents] - [i3]Florian Hess, Nigel P. Smart, Frederik Vercauteren:
The Eta Pairing Revisited. IACR Cryptol. ePrint Arch. 2006: 110 (2006) - 2005
- [j5]Florian Hess, Igor E. Shparlinski:
On the Linear Complexity and Multidimensional Distribution of Congruential Generators over Elliptic Curves. Des. Codes Cryptogr. 35(1): 111-117 (2005) - 2004
- [j4]Florian Hess:
On the security of the verifiably-encrypted signature scheme of Boneh, Gentry, Lynn and Shacham. Inf. Process. Lett. 89(3): 111-114 (2004) - [c6]Florian Hess:
An Algorithm for Computing Isomorphisms of Algebraic Function Fields. ANTS 2004: 263-271 - 2003
- [j3]Florian Hess, Sebastian Pauli, Michael E. Pohst:
Computing the multiplicative group of residue class rings. Math. Comput. 72(243): 1531-1548 (2003) - [c5]Florian Hess:
The GHS Attack Revisited. EUROCRYPT 2003: 374-387 - 2002
- [j2]Pierrick Gaudry, Florian Hess, Nigel P. Smart:
Constructive and Destructive Facets of Weil Descent on Elliptic Curves. J. Cryptol. 15(1): 19-46 (2002) - [j1]Florian Hess:
Computing Riemann-Roch Spaces in Algebraic Function Fields and Related Topics. J. Symb. Comput. 33(4): 425-445 (2002) - [c4]Florian Hess:
An Algorithm for Computing Weierstrass Points. ANTS 2002: 357-371 - [c3]Steven D. Galbraith, Florian Hess, Nigel P. Smart:
Extending the GHS Weil Descent Attack. EUROCRYPT 2002: 29-44 - [c2]Florian Hess:
Efficient Identity Based Signature Schemes Based on Pairings. Selected Areas in Cryptography 2002: 310-324 - [i2]Florian Hess:
Exponent Group Signature Schemes and Efficient Identity Based Signature Schemes Based on Pairings. IACR Cryptol. ePrint Arch. 2002: 12 (2002) - 2001
- [c1]Florian Hess, Gadiel Seroussi, Nigel P. Smart:
Two Topics in Hyperelliptic Cryptography. Selected Areas in Cryptography 2001: 181-189 - [i1]Steven D. Galbraith, Florian Hess, Nigel P. Smart:
Extending the GHS Weil Descent Attack. IACR Cryptol. ePrint Arch. 2001: 54 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-04 01:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
