[ 2017 ]


[ 48 ]
Clément Pernet and Arne Storjohann. Time and space efficient generators for quasiseparable matrices. CoRR, abs/1701.00396, 2017. [ http ]
@article{DBLP:journals/corr/PernetS17,
 author = {Cl{\'{e}}ment Pernet and
Arne Storjohann},
 journal = {CoRR},
 title = {Time and space efficient generators for quasiseparable matrices},
 url = {http://arxiv.org/abs/1701.00396},
 volume = {abs/1701.00396},
 year = {2017}
}



[ 2016 ]


[ 47 ]
Johan S. R. Nielsen and Arne Storjohann. Algorithms for simultaneous padé approximations. CoRR, abs/1602.00836, 2016. [ http ]
@article{DBLP:journals/corr/NielsenS16,
 author = {Johan S. R. Nielsen and
Arne Storjohann},
 journal = {CoRR},
 title = {Algorithms for Simultaneous Pad{\'{e}} Approximations},
 url = {http://arxiv.org/abs/1602.00836},
 volume = {abs/1602.00836},
 year = {2016}
}

[ 46 ]
Johan Sebastian Rosenkilde and Arne Storjohann. Algorithms for simultaneous padé approximations. In Sergei A. Abramov, Eugene V. Zima, and Xiao-Shan Gao, editors, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2016, Waterloo, ON, Canada, July 19-22, 2016, pages 405-412. ACM, 2016. [ http ]
@inproceedings{DBLP:conf/issac/RosenkildeS16,
 author = {Johan Sebastian Rosenkilde and
Arne Storjohann},
 booktitle = {Proceedings of the {ACM} on International Symposium on Symbolic and
Algebraic Computation, {ISSAC} 2016, Waterloo, ON, Canada, July 19-22, 2016},
 doi = {10.1145/2930889.2930933},
 editor = {Sergei A. Abramov and
Eugene V. Zima and
Xiao{-}Shan Gao},
 pages = {405--412},
 publisher = {ACM},
 title = {Algorithms for Simultaneous Pad{\'{e}} Approximations},
 url = {http://doi.acm.org/10.1145/2930889.2930933},
 year = {2016}
}



[ 2015 ]


[ 45 ]
Arne Storjohann. On the complexity of inverting integer and polynomial matrices. Computational Complexity, 24:777-821, 2015. [ http ]
@article{DBLP:journals/cc/Storjohann15,
 author = {Arne Storjohann},
 doi = {10.1007/s00037-015-0106-7},
 journal = {Computational Complexity},
 pages = {777--821},
 title = {On the complexity of inverting integer and polynomial matrices},
 url = {http://dx.doi.org/10.1007/s00037-015-0106-7},
 volume = {24},
 year = {2015}
}

[ 44 ]
Wei Zhou, George Labahn, and Arne Storjohann. A deterministic algorithm for inverting a polynomial matrix. J. Complexity, 31:162-173, 2015. [ http ]
@article{DBLP:journals/jc/ZhouLS15,
 author = {Wei Zhou and
George Labahn and
Arne Storjohann},
 doi = {10.1016/j.jco.2014.09.004},
 journal = {J. Complexity},
 pages = {162--173},
 title = {A deterministic algorithm for inverting a polynomial matrix},
 url = {http://dx.doi.org/10.1016/j.jco.2014.09.004},
 volume = {31},
 year = {2015}
}

[ 43 ]
Storjohann, Arne and Yang, Shiyun. A relaxed algorithm for online matrix inversion. In ISSAC'15-Proceedings of the 2015 ACM International Symposium on Symbolic and Algebraic Computation, pages 339-346. ACM, New York, 2015.
@incollection{MR3388318,
 author = {Storjohann, Arne and Yang, Shiyun},
 booktitle = {I{SSAC}'15---{P}roceedings of the 2015 {ACM} {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 pages = {339--346},
 publisher = {ACM, New York},
 title = {A relaxed algorithm for online matrix inversion},
 year = {2015}
}

[ 42 ]
Arne Storjohann and Shiyun Yang. A relaxed algorithm for online matrix inversion. In Kazuhiro Yokoyama, Steve Linton, and Daniel Robertz, editors, Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2015, Bath, United Kingdom, July 06 - 09, 2015, pages 339-346. ACM, 2015. [ http ]
@inproceedings{DBLP:conf/issac/StorjohannY15,
 author = {Arne Storjohann and
Shiyun Yang},
 booktitle = {Proceedings of the 2015 {ACM} on International Symposium on Symbolic
and Algebraic Computation, {ISSAC} 2015, Bath, United Kingdom, July
06 - 09, 2015},
 doi = {10.1145/2755996.2756672},
 editor = {Kazuhiro Yokoyama and
Steve Linton and
Daniel Robertz},
 pages = {339--346},
 publisher = {ACM},
 title = {A Relaxed Algorithm for Online Matrix Inversion},
 url = {http://doi.acm.org/10.1145/2755996.2756672},
 year = {2015}
}



[ 2014 ]


[ 41 ]
Storjohann, Arne and Yang, Shiyun. Linear independence oracles and applications to rectangular and low rank linear systems. In ISSAC 2014-Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pages 381-388. ACM, New York, 2014. [ http ]
@incollection{MR3239950,
 author = {Storjohann, Arne and Yang, Shiyun},
 booktitle = {I{SSAC} 2014---{P}roceedings of the 39th {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 doi = {10.1145/2608628.2608673},
 pages = {381--388},
 publisher = {ACM, New York},
 title = {Linear independence oracles and applications to rectangular
and low rank linear systems},
 url = {http://dx.doi.org/10.1145/2608628.2608673},
 year = {2014}
}



[ 2013 ]


[ 40 ]
Claude-Pierre Jeannerod, Clément Pernet, and Arne Storjohann. Rank-profile revealing gaussian elimination and the CUP matrix decomposition. J. Symb. Comput., 56:46-68, 2013. [ http ]
@article{DBLP:journals/jsc/JeannerodPS13,
 author = {Claude{-}Pierre Jeannerod and
Cl{\'{e}}ment Pernet and
Arne Storjohann},
 doi = {10.1016/j.jsc.2013.04.004},
 journal = {J. Symb. Comput.},
 pages = {46--68},
 title = {Rank-profile revealing Gaussian elimination and the {CUP} matrix decomposition},
 url = {http://dx.doi.org/10.1016/j.jsc.2013.04.004},
 volume = {56},
 year = {2013}
}

[ 39 ]
Pauderis, Colton and Storjohann, Arne. Computing the invariant structure of integer matrices: fast algorithms into practice. In ISSAC 2013-Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, pages 307-314. ACM, New York, 2013. [ http ]
@incollection{MR3206372,
 author = {Pauderis, Colton and Storjohann, Arne},
 booktitle = {I{SSAC} 2013---{P}roceedings of the 38th {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 doi = {10.1145/2465506.2465955},
 pages = {307--314},
 publisher = {ACM, New York},
 title = {Computing the invariant structure of integer matrices: fast
algorithms into practice},
 url = {http://dx.doi.org/10.1145/2465506.2465955},
 year = {2013}
}



[ 2012 ]


[ 38 ]
Somit Gupta, Soumojit Sarkar, Arne Storjohann, and Johnny Valeriote. Triangular x-basis decompositions and derandomization of linear algebra algorithms over k[x]. J. Symb. Comput., 47:422-453, 2012. [ http ]
@article{DBLP:journals/jsc/GuptaSSV12,
 author = {Somit Gupta and
Soumojit Sarkar and
Arne Storjohann and
Johnny Valeriote},
 doi = {10.1016/j.jsc.2011.09.006},
 journal = {J. Symb. Comput.},
 pages = {422--453},
 title = {Triangular x-basis decompositions and derandomization of linear algebra
algorithms over K[x]},
 url = {http://dx.doi.org/10.1016/j.jsc.2011.09.006},
 volume = {47},
 year = {2012}
}

[ 37 ]
Pauderis, Colton and Storjohann, Arne. Deterministic unimodularity certification. In ISSAC 2012-Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, pages 281-288. ACM, New York, 2012. [ http ]
@incollection{MR3206315,
 author = {Pauderis, Colton and Storjohann, Arne},
 booktitle = {I{SSAC} 2012---{P}roceedings of the 37th {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 doi = {10.1145/2442829.2442870},
 pages = {281--288},
 publisher = {ACM, New York},
 title = {Deterministic unimodularity certification},
 url = {http://dx.doi.org/10.1145/2442829.2442870},
 year = {2012}
}

[ 36 ]
Zhou, Wei, Labahn, George, and Storjohann, Arne. Computing minimal nullspace bases. In ISSAC 2012-Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, pages 366-373. ACM, New York, 2012. [ http ]
@incollection{MR3206326,
 author = {Zhou, Wei and Labahn, George and Storjohann, Arne},
 booktitle = {I{SSAC} 2012---{P}roceedings of the 37th {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 doi = {10.1145/2442829.2442881},
 pages = {366--373},
 publisher = {ACM, New York},
 title = {Computing minimal nullspace bases},
 url = {http://dx.doi.org/10.1145/2442829.2442881},
 year = {2012}
}



[ 2011 ]


[ 35 ]
Claude-Pierre Jeannerod, Clément Pernet, and Arne Storjohann. Rank-profile revealing gaussian elimination and the CUP matrix decomposition. CoRR, abs/1112.5717, 2011. [ http ]
@article{DBLP:journals/corr/abs-1112-5717,
 author = {Claude{-}Pierre Jeannerod and
Cl{\'{e}}ment Pernet and
Arne Storjohann},
 journal = {CoRR},
 title = {Rank-profile revealing Gaussian elimination and the {CUP} matrix decomposition},
 url = {http://arxiv.org/abs/1112.5717},
 volume = {abs/1112.5717},
 year = {2011}
}

[ 34 ]
Bright, Curtis and Storjohann, Arne. Vector rational number reconstruction. In ISSAC 2011-Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, pages 51-57. ACM, New York, 2011. [ http ]
@incollection{MR2895194,
 author = {Bright, Curtis and Storjohann, Arne},
 booktitle = {I{SSAC} 2011---{P}roceedings of the 36th {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 doi = {10.1145/1993886.1993900},
 pages = {51--57},
 publisher = {ACM, New York},
 title = {Vector rational number reconstruction},
 url = {http://dx.doi.org/10.1145/1993886.1993900},
 year = {2011}
}

[ 33 ]
Gupta, Somit and Storjohann, Arne. Computing Hermite forms of polynomial matrices. In ISSAC 2011-Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, pages 155-162. ACM, New York, 2011. [ http ]
@incollection{MR2895207,
 author = {Gupta, Somit and Storjohann, Arne},
 booktitle = {I{SSAC} 2011---{P}roceedings of the 36th {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 doi = {10.1145/1993886.1993913},
 pages = {155--162},
 publisher = {ACM, New York},
 title = {Computing {H}ermite forms of polynomial matrices},
 url = {http://dx.doi.org/10.1145/1993886.1993913},
 year = {2011}
}

[ 32 ]
Sarkar, Soumojit and Storjohann, Arne. Normalization of row reduced matrices. In ISSAC 2011-Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, pages 297-303. ACM, New York, 2011. [ http ]
@incollection{MR2895225,
 author = {Sarkar, Soumojit and Storjohann, Arne},
 booktitle = {I{SSAC} 2011---{P}roceedings of the 36th {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 doi = {10.1145/1993886.1993931},
 pages = {297--303},
 publisher = {ACM, New York},
 title = {Normalization of row reduced matrices},
 url = {http://dx.doi.org/10.1145/1993886.1993931},
 year = {2011}
}



[ 2010 ]




[ 2009 ]


[ 31 ]
Storjohann, Arne. Integer matrix rank certification. In ISSAC 2009-Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, pages 333-340. ACM, New York, 2009. [ http ]
@incollection{MR2742721,
 author = {Storjohann, Arne},
 booktitle = {I{SSAC} 2009---{P}roceedings of the 2009 {I}nternational
{S}ymposium on {S}ymbolic and {A}lgebraic {C}omputation},
 doi = {10.1145/1576702.1576748},
 pages = {333--340},
 publisher = {ACM, New York},
 title = {Integer matrix rank certification},
 url = {http://dx.doi.org/10.1145/1576702.1576748},
 year = {2009}
}



[ 2008 ]




[ 2007 ]


[ 30 ]
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, and Gilles Villard. Faster inversion and other black box matrix computations using efficient block projections. CoRR, abs/cs/0701188, 2007. [ http ]
@article{DBLP:journals/corr/abs-cs-0701188,
 author = {Wayne Eberly and
Mark Giesbrecht and
Pascal Giorgi and
Arne Storjohann and
Gilles Villard},
 journal = {CoRR},
 title = {Faster Inversion and Other Black Box Matrix Computations Using Efficient
Block Projections},
 url = {http://arxiv.org/abs/cs/0701188},
 volume = {abs/cs/0701188},
 year = {2007}
}

[ 29 ]
Eberly, Wayne, Giesbrecht, Mark, Giorgi, Pascal, Storjohann, Arne, and Villard, Gilles. Faster inversion and other black box matrix computations using efficient block projections. In ISSAC 2007, pages 143-150. ACM, New York, 2007. [ http ]
@incollection{MR2396196,
 author = {Eberly, Wayne and Giesbrecht, Mark and Giorgi, Pascal and
Storjohann, Arne and Villard, Gilles},
 booktitle = {I{SSAC} 2007},
 doi = {10.1145/1277548.1277569},
 pages = {143--150},
 publisher = {ACM, New York},
 title = {Faster inversion and other black box matrix computations using
efficient block projections},
 url = {http://dx.doi.org/10.1145/1277548.1277569},
 year = {2007}
}

[ 28 ]
Pernet, Clément and Storjohann, Arne. Faster algorithms for the characteristic polynomial. In ISSAC 2007, pages 307-314. ACM, New York, 2007. [ http ]
@incollection{MR2402276,
 author = {Pernet, Cl\'ement and Storjohann, Arne},
 booktitle = {I{SSAC} 2007},
 doi = {10.1145/1277548.1277590},
 pages = {307--314},
 publisher = {ACM, New York},
 title = {Faster algorithms for the characteristic polynomial},
 url = {http://dx.doi.org/10.1145/1277548.1277590},
 year = {2007}
}

[ 27 ]
Olesh, Zach and Storjohann, Arne. The vector rational function reconstruction problem. In Computer algebra 2006, pages 137-149. World Sci. Publ., Hackensack, NJ, 2007. [ http ]
@incollection{MR2528454,
 author = {Olesh, Zach and Storjohann, Arne},
 booktitle = {Computer algebra 2006},
 doi = {10.1142/9789812778857_0008},
 pages = {137--149},
 publisher = {World Sci. Publ., Hackensack, NJ},
 title = {The vector rational function reconstruction problem},
 url = {http://dx.doi.org/10.1142/9789812778857_0008},
 year = {2007}
}



[ 2006 ]


[ 26 ]
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, and Gilles Villard. Solving sparse integer linear systems. CoRR, abs/cs/0603082, 2006. [ http ]
@article{DBLP:journals/corr/abs-cs-0603082,
 author = {Wayne Eberly and
Mark Giesbrecht and
Pascal Giorgi and
Arne Storjohann and
Gilles Villard},
 journal = {CoRR},
 title = {Solving Sparse Integer Linear Systems},
 url = {http://arxiv.org/abs/cs/0603082},
 volume = {abs/cs/0603082},
 year = {2006}
}

[ 25 ]
Eberly, Wayne, Giesbrecht, Mark, Giorgi, Pascal, Storjohann, Arne, and Villard, Gilles. Solving sparse rational linear systems. In ISSAC 2006, pages 63-70. ACM, New York, 2006. [ http ]
@incollection{MR2289102,
 author = {Eberly, Wayne and Giesbrecht, Mark and Giorgi, Pascal and
Storjohann, Arne and Villard, Gilles},
 booktitle = {I{SSAC} 2006},
 doi = {10.1145/1145768.1145785},
 pages = {63--70},
 publisher = {ACM, New York},
 title = {Solving sparse rational linear systems},
 url = {http://dx.doi.org/10.1145/1145768.1145785},
 year = {2006}
}

[ 24 ]
Arne Storjohann. Notes on computing minimal approximant bases. In Wolfram Decker, Mike Dewar, Erich Kaltofen, and Stephen M. Watt, editors, Challenges in Symbolic Computation Software, 02.07. - 07.07.2006, volume 06271. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2006. [ http ]
@inproceedings{DBLP:conf/dagstuhl/Storjohann06,
 author = {Arne Storjohann},
 booktitle = {Challenges in Symbolic Computation Software, 02.07. - 07.07.2006},
 editor = {Wolfram Decker and
Mike Dewar and
Erich Kaltofen and
Stephen M. Watt},
 publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
 title = {Notes on computing minimal approximant bases},
 url = {http://drops.dagstuhl.de/opus/volltexte/2006/776},
 volume = {06271},
 year = {2006}
}



[ 2005 ]


[ 23 ]
Arne Storjohann and Gilles Villard. Computing the rank and a small nullspace basis of a polynomial matrix. CoRR, abs/cs/0505030, 2005. [ http ]
@article{DBLP:journals/corr/abs-cs-0505030,
 author = {Arne Storjohann and
Gilles Villard},
 journal = {CoRR},
 title = {Computing the Rank and a Small Nullspace Basis of a Polynomial Matrix},
 url = {http://arxiv.org/abs/cs/0505030},
 volume = {abs/cs/0505030},
 year = {2005}
}

[ 22 ]
Arne Storjohann. The shifted number system for fast linear algebra on integer matrices. J. Complexity, 21:609-650, 2005. [ http ]
@article{DBLP:journals/jc/Storjohann05,
 author = {Arne Storjohann},
 doi = {10.1016/j.jco.2005.04.002},
 journal = {J. Complexity},
 pages = {609--650},
 title = {The shifted number system for fast linear algebra on integer matrices},
 url = {http://dx.doi.org/10.1016/j.jco.2005.04.002},
 volume = {21},
 year = {2005}
}

[ 21 ]
Chen, Zhuliang and Storjohann, Arne. A BLAS based C library for exact linear algebra on integer matrices. In ISSAC'05, pages 92-99. ACM, New York, 2005. [ http ]
@incollection{MR2280534,
 author = {Chen, Zhuliang and Storjohann, Arne},
 booktitle = {I{SSAC}'05},
 doi = {10.1145/1073884.1073899},
 pages = {92--99},
 publisher = {ACM, New York},
 title = {A {BLAS} based {C} library for exact linear algebra on integer
matrices},
 url = {http://dx.doi.org/10.1145/1073884.1073899},
 year = {2005}
}

[ 20 ]
Storjohann, Arne and Villard, Gilles. Computing the rank and a small nullspace basis of a polynomial matrix. In ISSAC'05, pages 309-316. ACM, New York, 2005. [ http ]
@incollection{MR2280562,
 author = {Storjohann, Arne and Villard, Gilles},
 booktitle = {I{SSAC}'05},
 doi = {10.1145/1073884.1073927},
 pages = {309--316},
 publisher = {ACM, New York},
 title = {Computing the rank and a small nullspace basis of a polynomial
matrix},
 url = {http://dx.doi.org/10.1145/1073884.1073927},
 year = {2005}
}



[ 2004 ]


[ 19 ]
Thom Mulders and Arne Storjohann. Certified dense linear system solving. J. Symb. Comput., 37:485-510, 2004. [ http ]
@article{DBLP:journals/jsc/MuldersS04,
 author = {Thom Mulders and
Arne Storjohann},
 doi = {10.1016/j.jsc.2003.07.004},
 journal = {J. Symb. Comput.},
 pages = {485--510},
 title = {Certified dense linear system solving},
 url = {http://dx.doi.org/10.1016/j.jsc.2003.07.004},
 volume = {37},
 year = {2004}
}

[ 18 ]
Saunders, B. David, Storjohann, Arne, and Villard, Gilles. Matrix rank certification. Electron. J. Linear Algebra, 11:16-23, 2004. [ http ]
@article{MR2033474,
 author = {Saunders, B. David and Storjohann, Arne and Villard, Gilles},
 doi = {10.13001/1081-3810.1118},
 journal = {Electron. J. Linear Algebra},
 pages = {16--23},
 title = {Matrix rank certification},
 url = {http://dx.doi.org/10.13001/1081-3810.1118},
 volume = {11},
 year = {2004}
}



[ 2003 ]


[ 17 ]
Thom Mulders and Arne Storjohann. On lattice reduction for polynomial matrices. J. Symb. Comput., 35:377-401, 2003. [ http ]
@article{DBLP:journals/jsc/MuldersS03,
 author = {Thom Mulders and
Arne Storjohann},
 doi = {10.1016/S0747-7171(02)00139-6},
 journal = {J. Symb. Comput.},
 pages = {377--401},
 title = {On lattice reduction for polynomial matrices},
 url = {http://dx.doi.org/10.1016/S0747-7171(02)00139-6},
 volume = {35},
 year = {2003}
}

[ 16 ]
Arne Storjohann. High-order lifting and integrality certification. J. Symb. Comput., 36:613-648, 2003. [ http ]
@article{DBLP:journals/jsc/Storjohann03,
 author = {Arne Storjohann},
 doi = {10.1016/S0747-7171(03)00097-X},
 journal = {J. Symb. Comput.},
 pages = {613--648},
 title = {High-order lifting and integrality certification},
 url = {http://dx.doi.org/10.1016/S0747-7171(03)00097-X},
 volume = {36},
 year = {2003}
}

[ 15 ]
Jürgen Gerhard, Mark Giesbrecht, Arne Storjohann, and Eugene V. Zima. Shiftless decomposition and polynomial-time rational summation. In J. Rafael Sendra, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2003, Drexel University, Philadelphia, Pennsylvania, USA, August 3-6, 2003, Proceedings, pages 119-126. ACM, 2003. [ http ]
@inproceedings{DBLP:conf/issac/GerhardGSZ03,
 author = {J{\"{u}}rgen Gerhard and
Mark Giesbrecht and
Arne Storjohann and
Eugene V. Zima},
 booktitle = {Symbolic and Algebraic Computation, International Symposium {ISSAC}
2003, Drexel University, Philadelphia, Pennsylvania, USA, August 3-6, 2003, Proceedings},
 doi = {10.1145/860854.860887},
 editor = {J. Rafael Sendra},
 pages = {119--126},
 publisher = {ACM},
 title = {Shiftless decomposition and polynomial-time rational summation},
 url = {http://doi.acm.org/10.1145/860854.860887},
 year = {2003}
}



[ 2002 ]


[ 14 ]
Mark Giesbrecht and Arne Storjohann. Computing rational forms of integer matrices. J. Symb. Comput., 34:157-172, 2002. [ http ]
@article{DBLP:journals/jsc/GiesbrechtS02,
 author = {Mark Giesbrecht and
Arne Storjohann},
 doi = {10.1006/jsco.2002.0554},
 journal = {J. Symb. Comput.},
 pages = {157--172},
 title = {Computing Rational Forms of Integer Matrices},
 url = {http://dx.doi.org/10.1006/jsco.2002.0554},
 volume = {34},
 year = {2002}
}

[ 13 ]
Arne Storjohann. High-order lifting. In Teo Mora, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2002, Lille, France, July 7-10, 2002, Proceedings, pages 246-254. ACM, 2002. [ http ]
@inproceedings{DBLP:conf/issac/Storjohann02,
 author = {Arne Storjohann},
 booktitle = {Symbolic and Algebraic Computation, International Symposium {ISSAC}
2002, Lille, France, July 7-10, 2002, Proceedings},
 doi = {10.1145/780506.780538},
 editor = {Teo Mora},
 pages = {246--254},
 publisher = {ACM},
 title = {High-order lifting},
 url = {http://doi.acm.org/10.1145/780506.780538},
 year = {2002}
}



[ 2001 ]


[ 12 ]
Giesbrecht, Mark, Jacobson, Jr., Michael, and Storjohann, Arne. Algorithms for large integer matrix problems. In Applied algebra, algebraic algorithms and error-correcting codes (Melbourne, 2001), volume 2227, pages 297-307. Springer, Berlin, 2001. [ http ]
@incollection{MR1913476,
 author = {Giesbrecht, Mark and Jacobson, Jr., Michael and Storjohann, Arne},
 booktitle = {Applied algebra, algebraic algorithms and error-correcting
codes ({M}elbourne, 2001)},
 doi = {10.1007/3-540-45624-4_31},
 pages = {297--307},
 publisher = {Springer, Berlin},
 title = {Algorithms for large integer matrix problems},
 url = {http://dx.doi.org/10.1007/3-540-45624-4_31},
 volume = {2227},
 year = {2001}
}

[ 11 ]
Storjohann, Arne. Deterministic computation of the Frobenius form (extended abstract). In 42nd IEEE Symposium on Foundations of Computer Science (Las Vegas, NV, 2001), pages 368-377. IEEE Computer Soc., Los Alamitos, CA, 2001.
@incollection{MR1948725,
 author = {Storjohann, Arne},
 booktitle = {42nd {IEEE} {S}ymposium on {F}oundations of {C}omputer
{S}cience ({L}as {V}egas, {NV}, 2001)},
 pages = {368--377},
 publisher = {IEEE Computer Soc., Los Alamitos, CA},
 title = {Deterministic computation of the {F}robenius form (extended
abstract)},
 year = {2001}
}

[ 10 ]
Arne Storjohann. Deterministic computation of the frobenius form. In 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 14-17 October 2001, Las Vegas, Nevada, USA, pages 368-377. IEEE Computer Society, 2001. [ http ]
@inproceedings{DBLP:conf/focs/Storjohann01,
 author = {Arne Storjohann},
 booktitle = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001, 14-17 October 2001, Las Vegas, Nevada, {USA}},
 doi = {10.1109/SFCS.2001.959911},
 pages = {368--377},
 publisher = {{IEEE} Computer Society},
 title = {Deterministic Computation of the Frobenius Form},
 url = {http://dx.doi.org/10.1109/SFCS.2001.959911},
 year = {2001}
}



[ 2000 ]


[ 9 ]
Thom Mulders and Arne Storjohann. Rational solutions of singular linear systems. In Carlo Traverso, editor, Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, ISSAC 2000, St. Andrews, United Kingdom, August 6-10, 2000, pages 242-249. ACM, 2000. [ http ]
@inproceedings{DBLP:conf/issac/MuldersS00,
 author = {Thom Mulders and
Arne Storjohann},
 booktitle = {Proceedings of the 2000 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} 2000, St. Andrews, United Kingdom, August 6-10, 2000},
 doi = {10.1145/345542.345644},
 editor = {Carlo Traverso},
 pages = {242--249},
 publisher = {ACM},
 title = {Rational solutions of singular linear systems},
 url = {http://doi.acm.org/10.1145/345542.345644},
 year = {2000}
}



[ 1999 ]


[ 8 ]
Thom Mulders and Arne Storjohann. Diophantine linear system solving. In Keith O. Geddes, Bruno Salvy, and Samuel S. Dooley, editors, Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, ISSAC '99, Vancouver, B.C., Canada, July 29-31, 1999, pages 181-188. ACM, 1999. [ http ]
@inproceedings{DBLP:conf/issac/MuldersS99,
 author = {Thom Mulders and
Arne Storjohann},
 booktitle = {Proceedings of the 1999 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} '99, Vancouver, B.C., Canada, July 29-31, 1999},
 doi = {10.1145/309831.309905},
 editor = {Keith O. Geddes and
Bruno Salvy and
Samuel S. Dooley},
 pages = {181--188},
 publisher = {ACM},
 title = {Diophantine Linear System Solving},
 url = {http://doi.acm.org/10.1145/309831.309905},
 year = {1999}
}



[ 1998 ]


[ 7 ]
Storjohann, Arne. Computing Hermite and Smith normal forms of triangular integer matrices. Linear Algebra Appl., 282:25-45, 1998. [ http ]
@article{MR1648292,
 author = {Storjohann, Arne},
 doi = {10.1016/S0024-3795(98)10012-5},
 journal = {Linear Algebra Appl.},
 pages = {25--45},
 title = {Computing {H}ermite and {S}mith normal forms of triangular
integer matrices},
 url = {http://dx.doi.org/10.1016/S0024-3795(98)10012-5},
 volume = {282},
 year = {1998}
}

[ 6 ]
Storjohann, Arne and Mulders, Thom. Fast algorithms for linear algebra modulo N. In Algorithms-ESA '98 (Venice), volume 1461, pages 139-150. Springer, Berlin, 1998. [ http ]
@incollection{MR1683348,
 author = {Storjohann, Arne and Mulders, Thom},
 booktitle = {Algorithms---{ESA} '98 ({V}enice)},
 doi = {10.1007/3-540-68530-8_12},
 pages = {139--150},
 publisher = {Springer, Berlin},
 title = {Fast algorithms for linear algebra modulo {$N$}},
 url = {http://dx.doi.org/10.1007/3-540-68530-8_12},
 volume = {1461},
 year = {1998}
}

[ 5 ]
Thom Mulders and Arne Storjohann. The modulo N extended GCD problem for polynomials. In Volker Weispfenning and Barry M. Trager, editors, Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, ISSAC '98, Rostock, Germany, August 13-15, 1998, pages 105-112. ACM, 1998. [ http ]
@inproceedings{DBLP:conf/issac/MuldersS98,
 author = {Thom Mulders and
Arne Storjohann},
 booktitle = {Proceedings of the 1998 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} '98, Rostock, Germany, August 13-15, 1998},
 doi = {10.1145/281508.281586},
 editor = {Volker Weispfenning and
Barry M. Trager},
 pages = {105--112},
 publisher = {ACM},
 title = {The Modulo \emph{N} Extended {GCD} Problem for Polynomials},
 url = {http://doi.acm.org/10.1145/281508.281586},
 year = {1998}
}

[ 4 ]
Arne Storjohann. An O(n^3) algorithm for the frobenius normal form. In Volker Weispfenning and Barry M. Trager, editors, Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, ISSAC '98, Rostock, Germany, August 13-15, 1998, pages 101-105. ACM, 1998. [ http ]
@inproceedings{DBLP:conf/issac/Storjohann98,
 author = {Arne Storjohann},
 booktitle = {Proceedings of the 1998 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} '98, Rostock, Germany, August 13-15, 1998},
 doi = {10.1145/281508.281570},
 editor = {Volker Weispfenning and
Barry M. Trager},
 pages = {101--105},
 publisher = {ACM},
 title = {An \emph{O}(\emph{n}\({}^{\mbox{3}}\)) Algorithm for the Frobenius
Normal Form},
 url = {http://doi.acm.org/10.1145/281508.281570},
 year = {1998}
}



[ 1997 ]


[ 3 ]
Storjohann, Arne and Labahn, George. A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix. Linear Algebra Appl., 253:155-173, 1997. [ http ]
@article{MR1431172,
 author = {Storjohann, Arne and Labahn, George},
 doi = {10.1016/0024-3795(95)00743-1},
 journal = {Linear Algebra Appl.},
 pages = {155--173},
 title = {A fast {L}as {V}egas algorithm for computing the {S}mith
normal form of a polynomial matrix},
 url = {http://dx.doi.org/10.1016/0024-3795(95)00743-1},
 volume = {253},
 year = {1997}
}

[ 2 ]
Arne Storjohann. A solution to the extended GCD problem with applications. In Bruce W. Char, Paul S. Wang, and Wolfgang Küchlin, editors, Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, ISSAC '97, Maui, Hawaii, USA, July 21-23, 1997, pages 109-116. ACM, 1997.
@inproceedings{DBLP:conf/issac/Storjohann97,
 author = {Arne Storjohann},
 booktitle = {Proceedings of the 1997 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} '97, Maui, Hawaii, USA, July 21-23, 1997},
 editor = {Bruce W. Char and
Paul S. Wang and
Wolfgang K{\"{u}}chlin},
 pages = {109--116},
 publisher = {ACM},
 title = {A Solution to the Extended {GCD} Problem with Applications},
 year = {1997}
}

[ 1 ]
Storjohann, Arne. A solution to the extended GCD problem with applications. In Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (Kihei, HI), pages 109-116. ACM, New York, 1997. [ http ]
@inproceedings{MR1809976,
 author = {Storjohann, Arne},
 booktitle = {Proceedings of the 1997 {I}nternational {S}ymposium on
{S}ymbolic and {A}lgebraic {C}omputation ({K}ihei, {HI})},
 doi = {10.1145/258726.258762},
 pages = {109--116},
 publisher = {ACM, New York},
 title = {A solution to the extended {GCD} problem with applications},
 url = {http://dx.doi.org/10.1145/258726.258762},
 year = {1997}
}