default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArne Storjohann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j16]Stavros Birmpilis, George Labahn, Arne Storjohann
:
A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix. J. Symb. Comput. 116: 146-182 (2023)- [j15]Stavros Birmpilis, George Labahn, Arne Storjohann:
A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix. ACM Trans. Algorithms 19(4): 37:1-37:36 (2023) - 2022
- [c34]Haomin Li, Arne Storjohann:
Computing a Basis for an Integer Lattice: A Special Case. ISSAC 2022: 303-310 - [i9]Stavros Birmpilis, George Labahn, Arne Storjohann:
A cubic algorithm for computing the Hermite normal form of a nonsingular integer matrix. CoRR abs/2209.10685 (2022) - 2021
- [j14]Johan Rosenkilde, Arne Storjohann:
Algorithms for simultaneous Hermite-Padé approximations. J. Symb. Comput. 102: 279-303 (2021) - [i8]Stavros Birmpilis, George Labahn, Arne Storjohann:
A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix. CoRR abs/2111.09949 (2021) - 2020
- [c33]Stavros Birmpilis, George Labahn, Arne Storjohann:
A Las Vegas algorithm for computing the smith form of a nonsingular integer matrix. ISSAC 2020: 38-45
2010 – 2019
- 2019
- [c32]Stavros Birmpilis, George Labahn, Arne Storjohann:
Deterministic Reduction of Integer Nonsingular Linear System Solving to Matrix Multiplication. ISSAC 2019: 58-65 - 2018
- [j13]Clément Pernet, Arne Storjohann:
Time and space efficient generators for quasiseparable matrices. J. Symb. Comput. 85: 224-246 (2018) - 2017
- [c31]Erich L. Kaltofen, Clément Pernet, Arne Storjohann, Cleveland Waddell:
Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction. ISSAC 2017: 237-244 - [c30]Mohamed Khochtali, Johan Rosenkilde, Arne Storjohann:
Popov Form Computation for Matrices of Ore Polynomials. ISSAC 2017: 253-260 - [c29]Saba Aflaki, Matthias Volk, Borzoo Bonakdarpour, Joost-Pieter Katoen, Arne Storjohann:
Automated Fine Tuning of Probabilistic Self-Stabilizing Algorithms. SRDS 2017: 94-103 - [i7]Clément Pernet, Arne Storjohann:
Time and space efficient generators for quasiseparable matrices. CoRR abs/1701.00396 (2017) - 2016
- [j12]Silvana Ilie, Arne Storjohann:
Abstracts of the 2015 east coast computer algebra day. ACM Commun. Comput. Algebra 50(1): 35-39 (2016) - [c28]Johan Sebastian Rosenkilde, Arne Storjohann:
Algorithms for Simultaneous Padé Approximations. ISSAC 2016: 405-412 - [i6]Johan Sebastian Rosenkilde Nielsen, Arne Storjohann:
Algorithms for Simultaneous Padé Approximations. CoRR abs/1602.00836 (2016) - 2015
- [j11]Arne Storjohann:
On the complexity of inverting integer and polynomial matrices. Comput. Complex. 24(4): 777-821 (2015) - [j10]Wei Zhou, George Labahn, Arne Storjohann:
A deterministic algorithm for inverting a polynomial matrix. J. Complex. 31(2): 162-173 (2015) - [c27]Arne Storjohann, Shiyun Yang:
A Relaxed Algorithm for Online Matrix Inversion. ISSAC 2015: 339-346 - 2014
- [j9]Arne Storjohann, Shiyun Yang:
A Relaxed Algorithm for Online Matrix Inversion. ACM Commun. Comput. Algebra 48(3/4): 140-142 (2014) - [c26]Arne Storjohann, Shiyun Yang:
Linear independence oracles and applications to rectangular and low rank linear systems. ISSAC 2014: 381-388 - 2013
- [j8]Claude-Pierre Jeannerod, Clément Pernet, Arne Storjohann:
Rank-profile revealing Gaussian elimination and the CUP matrix decomposition. J. Symb. Comput. 56: 46-68 (2013) - [c25]Colton Pauderis, Arne Storjohann:
Computing the invariant structure of integer matrices: fast algorithms into practice. ISSAC 2013: 307-314 - 2012
- [j7]Somit Gupta, Soumojit Sarkar, Arne Storjohann, Johnny Valeriote:
Triangular x-basis decompositions and derandomization of linear algebra algorithms over K[x]. J. Symb. Comput. 47(4): 422-453 (2012) - [c24]Colton Pauderis, Arne Storjohann:
Deterministic unimodularity certification. ISSAC 2012: 281-288 - [c23]Wei Zhou, George Labahn, Arne Storjohann:
Computing minimal nullspace bases. ISSAC 2012: 366-373 - 2011
- [c22]Curtis Bright, Arne Storjohann:
Vector rational number reconstruction. ISSAC 2011: 51-58 - [c21]Somit Gupta, Arne Storjohann:
Computing hermite forms of polynomial matrices. ISSAC 2011: 155-162 - [c20]Soumojit Sarkar, Arne Storjohann:
Normalization of row reduced matrices. ISSAC 2011: 297-304 - [i5]Claude-Pierre Jeannerod, Clément Pernet, Arne Storjohann:
Rank-profile revealing Gaussian elimination and the CUP matrix decomposition. CoRR abs/1112.5717 (2011) - 2010
- [j6]Burçin Eröcal, Arne Storjohann:
Nullspace computation over rational function fields for symbolic summation. ACM Commun. Comput. Algebra 44(3/4): 109-110 (2010)
2000 – 2009
- 2009
- [c19]Arne Storjohann:
Integer matrix rank certification. ISSAC 2009: 333-340 - 2007
- [c18]Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard:
Faster inversion and other black box matrix computations using efficient block projections. ISSAC 2007: 143-150 - [c17]Clément Pernet, Arne Storjohann:
Faster algorithms for the characteristic polynomial. ISSAC 2007: 307-314 - [i4]Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard:
Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections. CoRR abs/cs/0701188 (2007) - 2006
- [c16]Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard:
Solving sparse rational linear systems. ISSAC 2006: 63-70 - [i3]Arne Storjohann:
Notes on computing minimal approximant bases. Challenges in Symbolic Computation Software 2006 - [i2]Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard:
Solving Sparse Integer Linear Systems. CoRR abs/cs/0603082 (2006) - 2005
- [j5]Arne Storjohann:
The shifted number system for fast linear algebra on integer matrices. J. Complex. 21(4): 609-650 (2005) - [c15]Zhuliang Chen, Arne Storjohann:
A BLAS based C library for exact linear algebra on integer matrices. ISSAC 2005: 92-99 - [c14]Arne Storjohann, Gilles Villard:
Computing the rank and a small nullspace basis of a polynomial matrix. ISSAC 2005: 309-316 - [i1]Arne Storjohann, Gilles Villard:
Computing the Rank and a Small Nullspace Basis of a Polynomial Matrix. CoRR abs/cs/0505030 (2005) - 2004
- [j4]Thom Mulders, Arne Storjohann:
Certified dense linear system solving. J. Symb. Comput. 37(4): 485-510 (2004) - 2003
- [j3]Thom Mulders, Arne Storjohann:
On lattice reduction for polynomial matrices. J. Symb. Comput. 35(4): 377-401 (2003) - [j2]Arne Storjohann:
High-order lifting and integrality certification. J. Symb. Comput. 36(3-4): 613-648 (2003) - [c13]Jürgen Gerhard, Mark Giesbrecht, Arne Storjohann, Eugene V. Zima:
Shiftless decomposition and polynomial-time rational summation. ISSAC 2003: 119-126 - 2002
- [j1]Mark Giesbrecht, Arne Storjohann:
Computing Rational Forms of Integer Matrices. J. Symb. Comput. 34(3): 157-172 (2002) - [c12]Arne Storjohann:
High-order lifting. ISSAC 2002: 246-254 - 2001
- [c11]Mark Giesbrecht, Michael J. Jacobson Jr., Arne Storjohann:
Algorithms for Large Integer Matrix Problems. AAECC 2001: 297-307 - [c10]Arne Storjohann:
Deterministic Computation of the Frobenius Form. FOCS 2001: 368-377 - 2000
- [c9]Thom Mulders, Arne Storjohann:
Rational solutions of singular linear systems. ISSAC 2000: 242-249
1990 – 1999
- 1999
- [c8]Thom Mulders, Arne Storjohann:
Diophantine Linear System Solving. ISSAC 1999: 181-188 - 1998
- [c7]Arne Storjohann, Thom Mulders:
Fast Algorithms for for Linear Algebra Modulo N. ESA 1998: 139-150 - [c6]Arne Storjohann:
An O(n3) Algorithm for the Frobenius Normal Form. ISSAC 1998: 101-105 - [c5]Thom Mulders, Arne Storjohann:
The Modulo N Extended GCD Problem for Polynomials. ISSAC 1998: 105-112 - 1997
- [c4]Arne Storjohann:
A Solution to the Extended GCD Problem with Applications. ISSAC 1997: 109-116 - 1996
- [c3]Arne Storjohann, George Labahn:
Asymptotically Fast Computation of Hermite Normal Forms of Integer Matrices. ISSAC 1996: 259-266 - [c2]Arne Storjohann:
Near Optimal Algorithms for Computing Smith Normal Forms of Integer Matrices. ISSAC 1996: 267-274 - 1995
- [c1]Arne Storjohann, George Labahn:
Preconditioning of Rectangular Polynomial Matrices for Efficient Hermite Normal Form Computation. ISSAC 1995: 119-125
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-04-25 05:44 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:
