Publications

Publications by Arne_Storjohann

Back to list of all publications

Select publications by year:

Stavros Birmpilis, George Labahn, and Arne Storjohann. A fast algorithm for computing the smith normal form with multipliers for a nonsingular integer matrix. CoRR, abs/2111.09949, 2021. [ http ]

BibTeX

@article{DBLP:journals/corr/abs-2111-09949,
 author = {Stavros Birmpilis and
George Labahn and
Arne Storjohann},
 journal = {CoRR},
 title = {A fast algorithm for computing the Smith normal form with multipliers
for a nonsingular integer matrix},
 url = {https://arxiv.org/abs/2111.09949},
 volume = {abs/2111.09949},
 year = {2021}
}

[ 48 ]

Johan Rosenkilde and Arne Storjohann. Algorithms for simultaneous hermite-padé approximations. J. Symb. Comput., 102:279--303, 2021. [ http ]

BibTeX

@article{DBLP:journals/jsc/RosenkildeS21,
 author = {Johan Rosenkilde and
Arne Storjohann},
 doi = {10.1016/j.jsc.2019.07.026},
 journal = {J. Symb. Comput.},
 pages = {279--303},
 title = {Algorithms for simultaneous Hermite-Pad{\'{e}} approximations},
 url = {https://doi.org/10.1016/j.jsc.2019.07.026},
 volume = {102},
 year = {2021}
}

[ 2020 ]

[ 2019 ]

[ 47 ]

Stavros Birmpilis, George Labahn, and Arne Storjohann. Deterministic reduction of integer nonsingular linear system solving to matrix multiplication. In James H. Davenport, Dongming Wang, Manuel Kauers, and Russell J. Bradford, editors, Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, ISSAC 2019, Beijing, China, July 15-18, 2019, pages 58--65. ACM, 2019. [ http ]

BibTeX

@inproceedings{DBLP:conf/issac/BirmpilisLS19,
 author = {Stavros Birmpilis and
George Labahn and
Arne Storjohann},
 booktitle = {Proceedings of the 2019 on International Symposium on Symbolic and
Algebraic Computation, {ISSAC} 2019, Beijing, China, July 15-18, 2019},
 doi = {10.1145/3326229.3326263},
 editor = {James H. Davenport and
Dongming Wang and
Manuel Kauers and
Russell J. Bradford},
 pages = {58--65},
 publisher = {{ACM}},
 title = {Deterministic Reduction of Integer Nonsingular Linear System Solving
to Matrix Multiplication},
 url = {https://doi.org/10.1145/3326229.3326263},
 year = {2019}
}

[ 2018 ]

[ 46 ]

Clément Pernet and Arne Storjohann. Time and space efficient generators for quasiseparable matrices. J. Symb. Comput., 85:224--246, 2018. [ http ]

BibTeX

@article{DBLP:journals/jsc/PernetS18,
 author = {Cl{\'{e}}ment Pernet and
Arne Storjohann},
 doi = {10.1016/j.jsc.2017.07.010},
 journal = {J. Symb. Comput.},
 pages = {224--246},
 title = {Time and space efficient generators for quasiseparable matrices},
 url = {https://doi.org/10.1016/j.jsc.2017.07.010},
 volume = {85},
 year = {2018}
}

[ 2017 ]

[ 45 ]

Erich L. Kaltofen, Clément Pernet, Arne Storjohann, and Cleveland Waddell. Early termination in parametric linear system solving and rational function vector recovery with error correction. In Michael A. Burr, Chee K. Yap, and Mohab Safey El Din, editors, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017, pages 237--244. ACM, 2017. [ http ]

BibTeX

@inproceedings{DBLP:conf/issac/KaltofenPSW17,
 author = {Erich L. Kaltofen and
Cl{\'{e}}ment Pernet and
Arne Storjohann and
Cleveland Waddell},
 booktitle = {Proceedings of the 2017 {ACM} on International Symposium on Symbolic
and Algebraic Computation, {ISSAC} 2017, Kaiserslautern, Germany,
July 25-28, 2017},
 doi = {10.1145/3087604.3087645},
 editor = {Michael A. Burr and
Chee K. Yap and
Mohab Safey El Din},
 pages = {237--244},
 publisher = {{ACM}},
 title = {Early Termination in Parametric Linear System Solving and Rational
Function Vector Recovery with Error Correction},
 url = {https://doi.org/10.1145/3087604.3087645},
 year = {2017}
}

[ 44 ]

Mohamed Khochtali, Johan Rosenkilde, and Arne Storjohann. Popov form computation for matrices of ore polynomials. In Michael A. Burr, Chee K. Yap, and Mohab Safey El Din, editors, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017, pages 253--260. ACM, 2017. [ http ]

BibTeX

@inproceedings{DBLP:conf/issac/KhochtaliRS17,
 author = {Mohamed Khochtali and
Johan Rosenkilde and
Arne Storjohann},
 booktitle = {Proceedings of the 2017 {ACM} on International Symposium on Symbolic
and Algebraic Computation, {ISSAC} 2017, Kaiserslautern, Germany,
July 25-28, 2017},
 doi = {10.1145/3087604.3087650},
 editor = {Michael A. Burr and
Chee K. Yap and
Mohab Safey El Din},
 pages = {253--260},
 publisher = {{ACM}},
 title = {Popov Form Computation for Matrices of Ore Polynomials},
 url = {https://doi.org/10.1145/3087604.3087650},
 year = {2017}
}

[ 43 ]

Saba Aflaki, Matthias Volk, Borzoo Bonakdarpour, Joost-Pieter Katoen, and Arne Storjohann. Automated fine tuning of probabilistic self-stabilizing algorithms. In 36th IEEE Symposium on Reliable Distributed Systems, SRDS 2017, Hong Kong, Hong Kong, September 26-29, 2017, pages 94--103. IEEE Computer Society, 2017. [ http ]

BibTeX

@inproceedings{DBLP:conf/srds/AflakiVBKS17,
 author = {Saba Aflaki and
Matthias Volk and
Borzoo Bonakdarpour and
Joost{-}Pieter Katoen and
Arne Storjohann},
 booktitle = {36th {IEEE} Symposium on Reliable Distributed Systems, {SRDS} 2017,
Hong Kong, Hong Kong, September 26-29, 2017},
 doi = {10.1109/SRDS.2017.22},
 pages = {94--103},
 publisher = {{IEEE} Computer Society},
 title = {Automated Fine Tuning of Probabilistic Self-Stabilizing Algorithms},
 url = {https://doi.org/10.1109/SRDS.2017.22},
 year = {2017}
}

[ 2016 ]

[ 42 ]

Silvana Ilie and Arne Storjohann. Abstracts of the 2015 east coast computer algebra day. ACM Commun. Comput. Algebra, 50:35--39, 2016. [ http ]

BibTeX

@article{DBLP:journals/cca/IlieS16,
 author = {Silvana Ilie and
Arne Storjohann},
 doi = {10.1145/2930964.2930969},
 journal = {{ACM} Commun. Comput. Algebra},
 pages = {35--39},
 title = {Abstracts of the 2015 east coast computer algebra day},
 url = {https://doi.org/10.1145/2930964.2930969},
 volume = {50},
 year = {2016}
}

[ 41 ]

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 ]

BibTeX

@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 = {https://doi.org/10.1145/2930889.2930933},
 year = {2016}
}

[ 2015 ]

[ 40 ]

Arne Storjohann. On the complexity of inverting integer and polynomial matrices. Comput. Complex., 24:777--821, 2015. [ http ]

BibTeX

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

[ 39 ]

Wei Zhou, George Labahn, and Arne Storjohann. A deterministic algorithm for inverting a polynomial matrix. J. Complex., 31:162--173, 2015. [ http ]

BibTeX

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

[ 38 ]

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 ]

BibTeX

@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 = {https://doi.org/10.1145/2755996.2756672},
 year = {2015}
}

[ 2014 ]

[ 37 ]

Arne Storjohann and Shiyun Yang. A relaxed algorithm for online matrix inversion. ACM Commun. Comput. Algebra, 48:140--142, 2014. [ http ]

BibTeX

@article{DBLP:journals/cca/StorjohannY14,
 author = {Arne Storjohann and
Shiyun Yang},
 doi = {10.1145/2733693.2733713},
 journal = {{ACM} Commun. Comput. Algebra},
 pages = {140--142},
 title = {A Relaxed Algorithm for Online Matrix Inversion},
 url = {https://doi.org/10.1145/2733693.2733713},
 volume = {48},
 year = {2014}
}

[ 36 ]

Arne Storjohann and Shiyun Yang. Linear independence oracles and applications to rectangular and low rank linear systems. In Katsusuke Nabeshima, Kosaku Nagasaka, Franz Winkler, and Ágnes Szántó, editors, International Symposium on Symbolic and Algebraic Computation, ISSAC '14, Kobe, Japan, July 23-25, 2014, pages 381--388. ACM, 2014. [ http ]

BibTeX

@inproceedings{DBLP:conf/issac/StorjohannY14,
 author = {Arne Storjohann and
Shiyun Yang},
 booktitle = {International Symposium on Symbolic and Algebraic Computation, {ISSAC}
'14, Kobe, Japan, July 23-25, 2014},
 doi = {10.1145/2608628.2608673},
 editor = {Katsusuke Nabeshima and
Kosaku Nagasaka and
Franz Winkler and
{\'{A}}gnes Sz{\'{a}}nt{\'{o}}},
 pages = {381--388},
 publisher = {{ACM}},
 title = {Linear independence oracles and applications to rectangular and low
rank linear systems},
 url = {https://doi.org/10.1145/2608628.2608673},
 year = {2014}
}

[ 2013 ]

[ 35 ]

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 ]

BibTeX

@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 = {https://doi.org/10.1016/j.jsc.2013.04.004},
 volume = {56},
 year = {2013}
}

[ 34 ]

Colton Pauderis and Arne Storjohann. Computing the invariant structure of integer matrices: fast algorithms into practice. In Manuel Kauers, editor, International Symposium on Symbolic and Algebraic Computation, ISSAC'13, Boston, MA, USA, June 26-29, 2013, pages 307--314. ACM, 2013. [ http ]

BibTeX

@inproceedings{DBLP:conf/issac/PauderisS13,
 author = {Colton Pauderis and
Arne Storjohann},
 booktitle = {International Symposium on Symbolic and Algebraic Computation, ISSAC'13,
Boston, MA, USA, June 26-29, 2013},
 doi = {10.1145/2465506.2465955},
 editor = {Manuel Kauers},
 pages = {307--314},
 publisher = {{ACM}},
 title = {Computing the invariant structure of integer matrices: fast algorithms
into practice},
 url = {https://doi.org/10.1145/2465506.2465955},
 year = {2013}
}

[ 2012 ]

[ 33 ]

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 ]

BibTeX

@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 = {https://doi.org/10.1016/j.jsc.2011.09.006},
 volume = {47},
 year = {2012}
}

[ 32 ]

Colton Pauderis and Arne Storjohann. Deterministic unimodularity certification. In Joris van der Hoeven and Mark van Hoeij, editors, International Symposium on Symbolic and Algebraic Computation, ISSAC'12, Grenoble, France - July 22 - 25, 2012, pages 281--288. ACM, 2012. [ http ]

BibTeX

@inproceedings{DBLP:conf/issac/PauderisS12,
 author = {Colton Pauderis and
Arne Storjohann},
 booktitle = {International Symposium on Symbolic and Algebraic Computation, ISSAC'12,
Grenoble, France - July 22 - 25, 2012},
 doi = {10.1145/2442829.2442870},
 editor = {Joris van der Hoeven and
Mark van Hoeij},
 pages = {281--288},
 publisher = {{ACM}},
 title = {Deterministic unimodularity certification},
 url = {https://doi.org/10.1145/2442829.2442870},
 year = {2012}
}

[ 31 ]

Wei Zhou, George Labahn, and Arne Storjohann. Computing minimal nullspace bases. In Joris van der Hoeven and Mark van Hoeij, editors, International Symposium on Symbolic and Algebraic Computation, ISSAC'12, Grenoble, France - July 22 - 25, 2012, pages 366--373. ACM, 2012. [ http ]

BibTeX

@inproceedings{DBLP:conf/issac/ZhouLS12,
 author = {Wei Zhou and
George Labahn and
Arne Storjohann},
 booktitle = {International Symposium on Symbolic and Algebraic Computation, ISSAC'12,
Grenoble, France - July 22 - 25, 2012},
 doi = {10.1145/2442829.2442881},
 editor = {Joris van der Hoeven and
Mark van Hoeij},
 pages = {366--373},
 publisher = {{ACM}},
 title = {Computing minimal nullspace bases},
 url = {https://doi.org/10.1145/2442829.2442881},
 year = {2012}
}

[ 2011 ]

[ 30 ]

Curtis Bright and Arne Storjohann. Vector rational number reconstruction. In Éric Schost and Ioannis Z. Emiris, editors, Symbolic and Algebraic Computation, International Symposium, ISSAC 2011 (co-located with FCRC 2011), San Jose, CA, USA, June 7-11, 2011, Proceedings, pages 51--58. ACM, 2011. [ http ]

BibTeX

@inproceedings{DBLP:conf/issac/BrightS11,
 author = {Curtis Bright and
Arne Storjohann},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2011 (co-located with {FCRC} 2011), San Jose, CA, USA, June 7-11,
2011, Proceedings},
 doi = {10.1145/1993886.1993900},
 editor = {{\'{E}}ric Schost and
Ioannis Z. Emiris},
 pages = {51--58},
 publisher = {{ACM}},
 title = {Vector rational number reconstruction},
 url = {https://doi.org/10.1145/1993886.1993900},
 year = {2011}
}

[ 29 ]

Somit Gupta and Arne Storjohann. Computing hermite forms of polynomial matrices. In Éric Schost and Ioannis Z. Emiris, editors, Symbolic and Algebraic Computation, International Symposium, ISSAC 2011 (co-located with FCRC 2011), San Jose, CA, USA, June 7-11, 2011, Proceedings, pages 155--162. ACM, 2011. [ http ]

BibTeX

@inproceedings{DBLP:conf/issac/GuptaS11,
 author = {Somit Gupta and
Arne Storjohann},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2011 (co-located with {FCRC} 2011), San Jose, CA, USA, June 7-11,
2011, Proceedings},
 doi = {10.1145/1993886.1993913},
 editor = {{\'{E}}ric Schost and
Ioannis Z. Emiris},
 pages = {155--162},
 publisher = {{ACM}},
 title = {Computing hermite forms of polynomial matrices},
 url = {https://doi.org/10.1145/1993886.1993913},
 year = {2011}
}

[ 28 ]

Soumojit Sarkar and Arne Storjohann. Normalization of row reduced matrices. In Éric Schost and Ioannis Z. Emiris, editors, Symbolic and Algebraic Computation, International Symposium, ISSAC 2011 (co-located with FCRC 2011), San Jose, CA, USA, June 7-11, 2011, Proceedings, pages 297--304. ACM, 2011. [ http ]

BibTeX

@inproceedings{DBLP:conf/issac/SarkarS11,
 author = {Soumojit Sarkar and
Arne Storjohann},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2011 (co-located with {FCRC} 2011), San Jose, CA, USA, June 7-11,
2011, Proceedings},
 doi = {10.1145/1993886.1993931},
 editor = {{\'{E}}ric Schost and
Ioannis Z. Emiris},
 pages = {297--304},
 publisher = {{ACM}},
 title = {Normalization of row reduced matrices},
 url = {https://doi.org/10.1145/1993886.1993931},
 year = {2011}
}

[ 2010 ]

[ 27 ]

Burçin Eröcal and Arne Storjohann. Nullspace computation over rational function fields for symbolic summation. ACM Commun. Comput. Algebra, 44:109--110, 2010. [ http ]

BibTeX

@article{DBLP:journals/cca/ErocalS10,
 author = {Bur{\c{c}}in Er{\"{o}}cal and
Arne Storjohann},
 doi = {10.1145/1940475.1940489},
 journal = {{ACM} Commun. Comput. Algebra},
 pages = {109--110},
 title = {Nullspace computation over rational function fields for symbolic summation},
 url = {https://doi.org/10.1145/1940475.1940489},
 volume = {44},
 year = {2010}
}

[ 2009 ]

[ 26 ]

Arne Storjohann. Integer matrix rank certification. In Jeremy R. Johnson, Hyungju Park, and Erich Kaltofen, editors, Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings, pages 333--340. ACM, 2009. [ http ]

BibTeX

@inproceedings{DBLP:conf/issac/Storjohann09,
 author = {Arne Storjohann},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings},
 doi = {10.1145/1576702.1576748},
 editor = {Jeremy R. Johnson and
Hyungju Park and
Erich Kaltofen},
 pages = {333--340},
 publisher = {{ACM}},
 title = {Integer matrix rank certification},
 url = {https://doi.org/10.1145/1576702.1576748},
 year = {2009}
}

[ 2008 ]

[ 2007 ]

[ 25 ]

Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, and Gilles Villard. Faster inversion and other black box matrix computations using efficient block projections. In Dongming Wang, editor, Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings, pages 143--150. ACM, 2007. [ http ]

BibTeX

@inproceedings{DBLP:conf/issac/EberlyGGSV07,
 author = {Wayne Eberly and
Mark Giesbrecht and
Pascal Giorgi and
Arne Storjohann and
Gilles Villard},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings},
 doi = {10.1145/1277548.1277569},
 editor = {Dongming Wang},
 pages = {143--150},
 publisher = {{ACM}},
 title = {Faster inversion and other black box matrix computations using efficient
block projections},
 url = {https://doi.org/10.1145/1277548.1277569},
 year = {2007}
}

[ 24 ]

Clément Pernet and Arne Storjohann. Faster algorithms for the characteristic polynomial. In Dongming Wang, editor, Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings, pages 307--314. ACM, 2007. [ http ]

BibTeX

@inproceedings{DBLP:conf/issac/PernetS07,
 author = {Cl{\'{e}}ment Pernet and
Arne Storjohann},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings},
 doi = {10.1145/1277548.1277590},
 editor = {Dongming Wang},
 pages = {307--314},
 publisher = {{ACM}},
 title = {Faster algorithms for the characteristic polynomial},
 url = {https://doi.org/10.1145/1277548.1277590},
 year = {2007}
}

[ 2006 ]

[ 23 ]

Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, and Gilles Villard. Solving sparse integer linear systems. CoRR, abs/cs/0603082, 2006. [ http ]

BibTeX

@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}
}

[ 22 ]

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 ]

BibTeX

@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}
}

[ 21 ]

Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, and Gilles Villard. Solving sparse rational linear systems. In Barry M. Trager, editor, Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings, pages 63--70. ACM, 2006. [ http ]

BibTeX

@inproceedings{DBLP:conf/issac/EberlyGGSV06,
 author = {Wayne Eberly and
Mark Giesbrecht and
Pascal Giorgi and
Arne Storjohann and
Gilles Villard},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2006, Genoa, Italy, July 9-12, 2006, Proceedings},
 doi = {10.1145/1145768.1145785},
 editor = {Barry M. Trager},
 pages = {63--70},
 publisher = {{ACM}},
 title = {Solving sparse rational linear systems},
 url = {https://doi.org/10.1145/1145768.1145785},
 year = {2006}
}

[ 2005 ]

[ 20 ]

Arne Storjohann. The shifted number system for fast linear algebra on integer matrices. J. Complex., 21:609--650, 2005. [ http ]

BibTeX

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

[ 19 ]

Zhuliang Chen and Arne Storjohann. A BLAS based C library for exact linear algebra on integer matrices. In Manuel Kauers, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, pages 92--99. ACM, 2005. [ http ]

BibTeX

@inproceedings{DBLP:conf/issac/ChenS05,
 author = {Zhuliang Chen and
Arne Storjohann},
 booktitle = {Symbolic and Algebraic Computation, International Symposium {ISSAC}
2005, Beijing, China, July 24-27, 2005, Proceedings},
 doi = {10.1145/1073884.1073899},
 editor = {Manuel Kauers},
 pages = {92--99},
 publisher = {{ACM}},
 title = {A {BLAS} based {C} library for exact linear algebra on integer matrices},
 url = {https://doi.org/10.1145/1073884.1073899},
 year = {2005}
}

[ 18 ]

Arne Storjohann and Gilles Villard. Computing the rank and a small nullspace basis of a polynomial matrix. In Manuel Kauers, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, pages 309--316. ACM, 2005. [ http ]

BibTeX

@inproceedings{DBLP:conf/issac/StorjohannV05,
 author = {Arne Storjohann and
Gilles Villard},
 booktitle = {Symbolic and Algebraic Computation, International Symposium {ISSAC}
2005, Beijing, China, July 24-27, 2005, Proceedings},
 doi = {10.1145/1073884.1073927},
 editor = {Manuel Kauers},
 pages = {309--316},
 publisher = {{ACM}},
 title = {Computing the rank and a small nullspace basis of a polynomial matrix},
 url = {https://doi.org/10.1145/1073884.1073927},
 year = {2005}
}

[ 2004 ]

[ 17 ]

Thom Mulders and Arne Storjohann. Certified dense linear system solving. J. Symb. Comput., 37:485--510, 2004. [ http ]

BibTeX

@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 = {https://doi.org/10.1016/j.jsc.2003.07.004},
 volume = {37},
 year = {2004}
}

[ 2003 ]

[ 16 ]

Thom Mulders and Arne Storjohann. On lattice reduction for polynomial matrices. J. Symb. Comput., 35:377--401, 2003. [ http ]

BibTeX

@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 = {https://doi.org/10.1016/S0747-7171(02)00139-6},
 volume = {35},
 year = {2003}
}

[ 15 ]

Arne Storjohann. High-order lifting and integrality certification. J. Symb. Comput., 36:613--648, 2003. [ http ]

BibTeX

@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 = {https://doi.org/10.1016/S0747-7171(03)00097-X},
 volume = {36},
 year = {2003}
}

[ 14 ]

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 ]

BibTeX

@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 = {https://doi.org/10.1145/860854.860887},
 year = {2003}
}

[ 2002 ]

[ 13 ]

Mark Giesbrecht and Arne Storjohann. Computing rational forms of integer matrices. J. Symb. Comput., 34:157--172, 2002. [ http ]

BibTeX

@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 = {https://doi.org/10.1006/jsco.2002.0554},
 volume = {34},
 year = {2002}
}

[ 12 ]

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 ]

BibTeX

@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 = {https://doi.org/10.1145/780506.780538},
 year = {2002}
}

[ 2001 ]

[ 11 ]

Mark Giesbrecht, Michael J. Jacobson Jr., and Arne Storjohann. Algorithms for large integer matrix problems. In Serdar Boztas and Igor E. Shparlinski, editors, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 14th International Symposium, AAECC-14, Melbourne, Australia November 26-30, 2001, Proceedings, volume 2227, pages 297--307. Springer, 2001. [ http ]

BibTeX

@inproceedings{DBLP:conf/aaecc/GiesbrechtJS01,
 author = {Mark Giesbrecht and
Michael J. Jacobson Jr. and
Arne Storjohann},
 booktitle = {Applied Algebra, Algebraic Algorithms and Error-Correcting Codes,
14th International Symposium, AAECC-14, Melbourne, Australia November
26-30, 2001, Proceedings},
 doi = {10.1007/3-540-45624-4_31},
 editor = {Serdar Boztas and
Igor E. Shparlinski},
 pages = {297--307},
 publisher = {Springer},
 title = {Algorithms for Large Integer Matrix Problems},
 url = {https://doi.org/10.1007/3-540-45624-4_31},
 volume = {2227},
 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 ]

BibTeX

@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 = {https://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 ]

BibTeX

@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 = {https://doi.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 ]

BibTeX

@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 = {https://doi.org/10.1145/309831.309905},
 year = {1999}
}

[ 1998 ]

[ 7 ]

Arne Storjohann and Thom Mulders. Fast algorithms for for linear algebra modulo N. In Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina, and Geppino Pucci, editors, Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings, volume 1461, pages 139--150. Springer, 1998. [ http ]

BibTeX

@inproceedings{DBLP:conf/esa/StorjohannM98,
 author = {Arne Storjohann and
Thom Mulders},
 booktitle = {Algorithms - {ESA} '98, 6th Annual European Symposium, Venice, Italy,
August 24-26, 1998, Proceedings},
 doi = {10.1007/3-540-68530-8_12},
 editor = {Gianfranco Bilardi and
Giuseppe F. Italiano and
Andrea Pietracaprina and
Geppino Pucci},
 pages = {139--150},
 publisher = {Springer},
 title = {Fast Algorithms for for Linear Algebra Modulo {N}},
 url = {https://doi.org/10.1007/3-540-68530-8_12},
 volume = {1461},
 year = {1998}
}

[ 6 ]

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 ]

BibTeX

@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 = {https://doi.org/10.1145/281508.281586},
 year = {1998}
}

[ 5 ]

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 ]

BibTeX

@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 = {https://doi.org/10.1145/281508.281570},
 year = {1998}
}

[ 1997 ]

[ 4 ]

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.

BibTeX

@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}
}

[ 1996 ]

[ 3 ]

Arne Storjohann. Near optimal algorithms for computing smith normal forms of integer matrices. In Erwin Engeler, B. F. Caviness, and Yagati N. Lakshman, editors, Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, ISSAC '96, Zurich, Switzerland, July 24-26, 1996, pages 267--274. ACM, 1996. [ http ]

BibTeX

@inproceedings{DBLP:conf/issac/Storjohann96,
 author = {Arne Storjohann},
 booktitle = {Proceedings of the 1996 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} '96, Zurich, Switzerland, July 24-26, 1996},
 doi = {10.1145/236869.237084},
 editor = {Erwin Engeler and
B. F. Caviness and
Yagati N. Lakshman},
 pages = {267--274},
 publisher = {{ACM}},
 title = {Near Optimal Algorithms for Computing Smith Normal Forms of Integer
Matrices},
 url = {https://doi.org/10.1145/236869.237084},
 year = {1996}
}

[ 2 ]

Arne Storjohann and George Labahn. Asymptotically fast computation of hermite normal forms of integer matrices. In Erwin Engeler, B. F. Caviness, and Yagati N. Lakshman, editors, Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, ISSAC '96, Zurich, Switzerland, July 24-26, 1996, pages 259--266. ACM, 1996. [ http ]

BibTeX

@inproceedings{DBLP:conf/issac/StorjohannL96,
 author = {Arne Storjohann and
George Labahn},
 booktitle = {Proceedings of the 1996 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} '96, Zurich, Switzerland, July 24-26, 1996},
 doi = {10.1145/236869.237083},
 editor = {Erwin Engeler and
B. F. Caviness and
Yagati N. Lakshman},
 pages = {259--266},
 publisher = {{ACM}},
 title = {Asymptotically Fast Computation of Hermite Normal Forms of Integer
Matrices},
 url = {https://doi.org/10.1145/236869.237083},
 year = {1996}
}

[ 1995 ]

[ 1 ]

Arne Storjohann and George Labahn. Preconditioning of rectangular polynomial matrices for efficient hermite normal form computation. In A. H. M. Levelt, editor, Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, ISSAC '95, Montreal, Canada, July 10-12, 1995, pages 119--125. ACM, 1995. [ http ]

BibTeX

@inproceedings{DBLP:conf/issac/StorjohannL95,
 author = {Arne Storjohann and
George Labahn},
 booktitle = {Proceedings of the 1995 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} '95, Montreal, Canada, July 10-12, 1995},
 doi = {10.1145/220346.220362},
 editor = {A. H. M. Levelt},
 pages = {119--125},
 publisher = {{ACM}},
 title = {Preconditioning of Rectangular Polynomial Matrices for Efficient Hermite
Normal Form Computation},
 url = {https://doi.org/10.1145/220346.220362},
 year = {1995}
}