default search action
Volker Strassen
Person information
- affiliation: University of Konstanz, Department of Mathematics and Statistics , Germany
- award (2011): Konrad Zuse Medal
- award (2008): Knuth Prize
- award (2003): Paris Kanellakis Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [c6]Volker Strassen:
Asymptotic spectrum and matrix multiplication. ISSAC 2012: 6-7
2000 – 2009
- 2009
- [c5]Volker Strassen:
Probability, algorithms and complexity. SODA 2009: 565
1990 – 1999
- 1990
- [p1]Volker Strassen:
Algebraic Complexity Theory. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 633-672
1980 – 1989
- 1986
- [c4]Volker Strassen:
The Asymptotic Spectrum of Tensors and the Exponent of Matrix Multiplication. FOCS 1986: 49-54 - 1983
- [j13]Volker Strassen:
The Computational Complexity of Continued Fractions. SIAM J. Comput. 12(1): 1-27 (1983) - [j12]Walter Baur, Volker Strassen:
The Complexity of Partial Derivatives. Theor. Comput. Sci. 22: 317-330 (1983) - 1981
- [j11]A. Alder, Volker Strassen:
On the Algorithmic Complexity of Associative Algebras. Theor. Comput. Sci. 15: 201-211 (1981) - [c3]Volker Strassen:
The computational complexity of continued fractions. SYMSACC 1981: 51-67 - 1980
- [j10]Joachim von zur Gathen, Volker Strassen:
Some Polynomials that are Hard to Compute. Theor. Comput. Sci. 11: 331-335 (1980)
1970 – 1979
- 1979
- [c2]A. Alder, Volker Strassen:
The algorithmic complexity of linear algebras. Algorithms in Modern Mathematics and Computer Science 1979: 343-354 - 1978
- [j9]Robert Solovay, Volker Strassen:
Erratum: A Fast Monte-Carlo Test for Primality. SIAM J. Comput. 7(1): 118 (1978) - 1977
- [j8]Robert Solovay, Volker Strassen:
A Fast Monte-Carlo Test for Primality. SIAM J. Comput. 6(1): 84-85 (1977) - 1976
- [j7]Volker Strassen:
Computational Complexity over Finite Fields. SIAM J. Comput. 5(2): 324-331 (1976) - [e1]Ernst Specker, Volker Strassen:
Komplexität von Entscheidungsproblemen, Ein Seminar. Lecture Notes in Computer Science 43, Springer 1976, ISBN 3-540-07805-3 [contents] - 1975
- [j6]Volker Strassen:
Die Berechnungskomplexität der Symbolischen Differentiation von Interpolationspolynomen. Theor. Comput. Sci. 1(1): 21-25 (1975) - 1974
- [j5]Volker Strassen:
Polynomials with Rational Coefficients Which are Hard to Compute. SIAM J. Comput. 3(2): 128-149 (1974) - 1973
- [j4]Volker Strassen:
Berechnung und Programm. II. Acta Informatica 2: 64-79 (1973) - [j3]Volker Strassen:
Berechnungen in partiellen Algebren endlichen Typs. Computing 11(3): 181-196 (1973) - 1972
- [j2]Volker Strassen:
Berechnung und Programm. I. Acta Informatica 1: 320-335 (1972) - [c1]Volker Strassen:
Evaluation of Rational Functions. Complexity of Computer Computations 1972: 1-10 - 1971
- [j1]Arnold Schönhage, Volker Strassen:
Schnelle Multiplikation großer Zahlen. Computing 7(3-4): 281-292 (1971)
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-05-02 21:48 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: