The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Albrecht Beutelspacher: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Albrecht Beutelspacher
    Perfect and Essentially Perfect Authentication Schemes. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1987, pp:167-170 [Conf]
  2. Albrecht Beutelspacher
    Geometric Structures as Threshold Schemes. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1986, pp:46- [Conf]
  3. Albrecht Beutelspacher
    How to Say ``No''. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1989, pp:491-496 [Conf]
  4. Albrecht Beutelspacher, Ute Rosenbaum
    Essentially l-Fold Secure Authentication Systems. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:294-305 [Conf]
  5. Albrecht Beutelspacher, Michael Gundlach
    Möglichkeiten des Einsatzes einer Chipkarte zur Realisierung von Sicherungsfunktionen an Büroarbeitsplätzen. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1987, pp:501-510 [Conf]
  6. Albrecht Beutelspacher, Ute Rosenbaum
    Kann man mit kryptographischen Methoden Viren erkennen? [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung (1), 1989, pp:564-578 [Conf]
  7. Albrecht Beutelspacher, Ute Rosenbaum
    Sicherer Zugang zu Betriebssystemen mit der Chip-Karte. [Citation Graph (0, 0)][DBLP]
    GI-Fachgespräch über Rechenzentren, 1989, pp:186-193 [Conf]
  8. Albrecht Beutelspacher, Ferenc Wettl
    On 2-Level Secret Sharing. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1993, v:3, n:2, pp:127-134 [Journal]
  9. Albrecht Beutelspacher, Thomas Hueske, Axel Pfau
    Kann man mit Bits bezahlen? [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1993, v:16, n:2, pp:99-106 [Journal]
  10. Albrecht Beutelspacher
    How to communicate efficiently. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1990, v:54, n:2, pp:312-316 [Journal]
  11. Albrecht Beutelspacher, Dorothea Seeger
    Characterizing the line set of a baer subspace. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1987, v:45, n:1, pp:152-156 [Journal]
  12. Klaus-Cl. Becker, Albrecht Beutelspacher
    Datenverschlüsselung. [Citation Graph (0, 0)][DBLP]
    LOG IN, 1996, v:16, n:5/6, pp:16-0 [Journal]
  13. Albrecht Beutelspacher, Dieter Jungnickel, Paul C. van Oorschot, Scott A. Vanstone
    Pair-Splitting Sets in AG(m, q). [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:451-459 [Journal]
  14. Albrecht Beutelspacher
    On extremal intersection numbers of a block design. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:42, n:1, pp:37-49 [Journal]
  15. Albrecht Beutelspacher, Franco Eugeni
    On the type of partial t-spreads in finite projective spaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:3, pp:241-257 [Journal]
  16. Albrecht Beutelspacher, Inge Schestag
    Finite linear spaces in which any n-gon is euclidean. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:59, n:3, pp:207-220 [Journal]
  17. Albrecht Beutelspacher, Klaus Metsch
    Embedding finite linear spaces in projective planes, II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:219-230 [Journal]
  18. Albrecht Beutelspacher, Ulf Lamberty
    Strongly resolvable (r, lambda)-designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:45, n:2-3, pp:141-152 [Journal]
  19. Albrecht Beutelspacher
    A combinatorial characterization of geometric spreads. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:97, n:1-3, pp:59-62 [Journal]

Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002