default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJakob Jonsson
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[i5]Ruy Fabila Monroy, Jakob Jonsson, Pavel Valtr, David R. Wood:
The exact chromatic number of the convex segment disjointness graph. CoRR abs/1804.01057 (2018)- 2016
- [i4]Kathleen M. Moriarty, Burt Kaliski, Jakob Jonsson, Andreas Rusch:
PKCS #1: RSA Cryptography Specifications Version 2.2. RFC 8017: 1-78 (2016) - 2013
- [j12]Jakob Jonsson:
Hom Complexes of Set Systems. Electron. J. Comb. 20(1): 4 (2013) - 2010
- [j11]Jakob Jonsson:
Certain Homology Cycles of the Independence Complex of Grids. Discret. Comput. Geom. 43(4): 927-950 (2010) - [j10]Jakob Jonsson:
More Torsion in the Homology of the Matching Complex. Exp. Math. 19(3): 363-383 (2010)
2000 – 2009
- 2009
- [j9]Jakob Jonsson:
Hard Squares with Negative Activity on Cylinders with Odd Circumference. Electron. J. Comb. 16(2) (2009) - [j8]Jakob Jonsson, Annie Carter, David Callan:
Oddly Triangulated Polygons: 11298 [2007, 547]. Am. Math. Mon. 116(4): 371-372 (2009) - 2008
- [j7]Jakob Jonsson:
Exact sequences for the homology of the matching complex. J. Comb. Theory A 115(8): 1504-1526 (2008) - 2007
- [j6]Jakob Jonsson:
Problem 11298. Am. Math. Mon. 114(6): 547 (2007) - 2006
- [j5]Jakob Jonsson:
Hard Squares with Negative Activity and Rhombus Tilings of the Plane. Electron. J. Comb. 13(1) (2006) - 2005
- [j4]Jakob Jonsson:
Optimal Decision Trees on Simplicial Complexes. Electron. J. Comb. 12 (2005) - [j3]Jakob Jonsson:
Generalized triangulations and diagonal-free subsets of stack polyominoes. J. Comb. Theory A 112(1): 117-142 (2005) - [j2]Jakob Jonsson:
Simplicial Complexes of Graphs and Hypergraphs with a Bounded Covering Number. SIAM J. Discret. Math. 19(3): 633-650 (2005) - [c5]Jakob Jonsson, Matthew J. B. Robshaw:
Securing RSA-KEM via the AES. Public Key Cryptography 2005: 29-46 - 2003
- [j1]Jakob Jonsson:
On the topology of simplicial complexes related to 3-connected and Hamiltonian graphs. J. Comb. Theory A 104(1): 169-199 (2003) - [i3]Jakob Jonsson, Burt Kaliski:
Public-Key Cryptography Standards (PKCS) #1: RSA Cryptography Specifications Version 2.1. RFC 3447: 1-72 (2003) - 2002
- [c4]Jakob Jonsson, Burton S. Kaliski Jr.:
On the Security of RSA Encryption in TLS. CRYPTO 2002: 127-142 - [c3]Jakob Jonsson:
On the Security of CTR + CBC-MAC. Selected Areas in Cryptography 2002: 76-93 - [i2]Jakob Jonsson:
An OAEP Variant With a Tight Security Proof. IACR Cryptol. ePrint Arch. 2002: 34 (2002) - 2001
- [c2]Craig Gentry, Jakob Jonsson, Jacques Stern, Michael Szydlo:
Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001. ASIACRYPT 2001: 1-20 - [i1]Jakob Jonsson:
Security Proofs for the RSA-PSS Signature Scheme and Its Variants. IACR Cryptol. ePrint Arch. 2001: 53 (2001) - 2000
- [c1]Johan Håstad, Jakob Jonsson, Ari Juels, Moti Yung:
Funkspiel schemes: an alternative to conventional tamper resistance. CCS 2000: 125-133
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-06-10 20:28 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:
