default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRalph-Hardo Schulz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j18]Helmut Witten, Ralph-Hardo Schulz:
RSA&Co in der Schule - Moderne Kryptologie, alte Mathematik, raffinierte Protokolle. Neue Folge (Teil 4). LOG IN 30(163/164): 97-103 (2010)- [j17]Helmut Witten, Ralph-Hardo Schulz:
RSA & Co in der Schule - Teil 5: Der Miller-Rabin-Primzahltest. LOG IN 30(166/167): 92-106 (2010) - [j16]Ralph-Hardo Schulz, Helmut Witten:
Zeit-Experimente zur Faktorisierung - Ein Beitrag zur Didaktik der Kryptologie. LOG IN 30(166/167): 107-114 (2010)
2000 – 2009
- 2008
- [j15]Helmut Witten, Ralph-Hardo Schulz:
RSA & Co. in der Schule - Moderne Kryptologie, alte Mathematik, raffinierte Protokolle. Neue Folge - Teil 3: RSA und die elementare Zahlentheorie. LOG IN 28(152): 60-70 (2008) - 2007
- [j14]Sabine Giese, Ralph-Hardo Schulz:
Divisible designs with dual translation group. Des. Codes Cryptogr. 43(1): 41-45 (2007) - 2006
- [j13]Helmut Witten, Ralph-Hardo Schulz:
RSA & Co. in der Schule - Moderne Kryptologie, alte Mathematik, raffinierte Protokolle (Neue Folge - Teil 1: RSA für Einsteiger). LOG IN 26(140): 45-54 (2006) - 2005
- [j12]Sabine Giese, Hans Havlicek, Ralph-Hardo Schulz:
Some constructions of divisible designs from Laguerre geometries. Discret. Math. 301(1): 74-82 (2005) - 2001
- [c1]Ralph-Hardo Schulz:
Check Character Systems and Anti-symmetric Mappings. Computational Discrete Mathematics 2001: 136-147 - 2000
- [j11]Ralph-Hardo Schulz, Antonino Giorgio Spera:
Automorphisms of Constant Weight Codes and of Divisible Designs. Des. Codes Cryptogr. 20(1): 89-97 (2000)
1990 – 1999
- 1999
- [j10]Helmut Witten, Irmgard Letzner, Ralph-Hardo Schulz:
RSA & Co. in der Schule - Teil 3: Flußchiffren, perfekte Sicherheit und Zufall per Computer. LOG IN 19(2): 50- (1999) - 1998
- [j9]Ralph-Hardo Schulz, Antonino Giorgio Spera:
Construction of Divisible Designs from Translation Planes. Eur. J. Comb. 19(4): 479-486 (1998) - [j8]Helmut Witten, Irmgard Letzner, Ralph-Hardo Schulz:
RSA & Co. in der Schule - Moderne Kryptologie, alte Mathematik, raffinierte Protokolle (Teil 1). LOG IN 18(3/4): 57- (1998) - [j7]Helmut Witten, Irmgard Letzner, Ralph-Hardo Schulz:
RSA & Co. in der Schule - Moderne Kryptologie, alte Mathematik, raffinierte Protokolle (Teil 2). LOG IN 18(5): 31- (1998) - 1997
- [j6]Claudia Broecker, Ralph-Hardo Schulz, Gernot Stroth:
Check Character Systems Using Chevalley Groups. Des. Codes Cryptogr. 10(2): 137-143 (1997) - 1996
- [j5]Ralph-Hardo Schulz:
Check character systems over groups and orthogonal Latin squares. Appl. Algebra Eng. Commun. Comput. 7(2): 125-132 (1996) - [j4]Ralph-Hardo Schulz:
Primfaktorzerlegung. LOG IN 16(5/6): 22- (1996) - 1991
- [j3]Ralph-Hardo Schulz:
A note on check character systems using Latin squares. Discret. Math. 97(1-3): 371-375 (1991)
1980 – 1989
- 1985
- [j2]Ralph-Hardo Schulz:
On the Classification of Translation Group-divisible Designs. Eur. J. Comb. 6(4): 369-374 (1985)
1970 – 1979
- 1973
- [j1]Ralph-Hardo Schulz:
On the Lines of Special Block Designs. J. Comb. Theory A 14(1): 102-112 (1973)
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 21: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:
