The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Volker Strassen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. A. Alder, Volker Strassen
    The algorithmic complexity of linear algebras. [Citation Graph (0, 0)][DBLP]
    Algorithms in Modern Mathematics and Computer Science, 1979, pp:343-354 [Conf]
  2. Volker Strassen
    The Asymptotic Spectrum of Tensors and the Exponent of Matrix Multiplication [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:49-54 [Conf]
  3. Volker Strassen
    Berechnung und Programm. I [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1972, v:1, n:, pp:320-355 [Journal]
  4. Volker Strassen
    Berechnung und Programm. II [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1973, v:2, n:, pp:64-79 [Journal]
  5. Robert Solovay, Volker Strassen
    A Fast Monte-Carlo Test for Primality. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:1, pp:84-85 [Journal]
  6. Robert Solovay, Volker Strassen
    Erratum: A Fast Monte-Carlo Test for Primality. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:1, pp:118- [Journal]
  7. Volker Strassen
    Polynomials with Rational Coefficients Which Are Hard to Compute. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1974, v:3, n:2, pp:128-149 [Journal]
  8. Volker Strassen
    Computational Complexity Over Finite Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1976, v:5, n:2, pp:324-331 [Journal]
  9. Volker Strassen
    The Computational Complexity of Continued Fractions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:1, pp:1-27 [Journal]
  10. A. Alder, Volker Strassen
    On the Algorithmic Complexity of Associative Algebras. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:15, n:, pp:201-211 [Journal]
  11. Walter Baur, Volker Strassen
    The Complexity of Partial Derivatives. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:22, n:, pp:317-330 [Journal]
  12. Joachim von zur Gathen, Volker Strassen
    Some Polynomials that are Hard to Compute. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:331-335 [Journal]
  13. Volker Strassen
    Die Berechnungskomplexität der Symbolischen Differentiation von Interpolationspolynomen. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1975, v:1, n:1, pp:21-25 [Journal]

  14. Probability, algorithms and complexity. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002