[ 2022 ]


[ 88 ]
Mark Giesbrecht, Hui Huang, George Labahn, and Eugene Zima. Efficient rational creative telescoping. J. Symb. Comput., 109:57--87, 2022. [ http ]
@article{DBLP:journals/jsc/GiesbrechtHLZ22,
 author = {Mark Giesbrecht and
Hui Huang and
George Labahn and
Eugene Zima},
 doi = {10.1016/j.jsc.2021.07.005},
 journal = {J. Symb. Comput.},
 pages = {57--87},
 title = {Efficient rational creative telescoping},
 url = {https://doi.org/10.1016/j.jsc.2021.07.005},
 volume = {109},
 year = {2022}
}



[ 2021 ]


[ 87 ]
Mark Giesbrecht, Armin Jamshidpey, and Éric Schost. Subquadratic-time algorithms for normal bases. Comput. Complex., 30:5, 2021. [ http ]
@article{DBLP:journals/cc/GiesbrechtJS21,
 author = {Mark Giesbrecht and
Armin Jamshidpey and
{\'{E}}ric Schost},
 doi = {10.1007/s00037-020-00204-9},
 journal = {Comput. Complex.},
 pages = {5},
 title = {Subquadratic-Time Algorithms for Normal Bases},
 url = {https://doi.org/10.1007/s00037-020-00204-9},
 volume = {30},
 year = {2021}
}

[ 86 ]
Joachim von zur Gathen, Mark Giesbrecht, and Konstantin Ziegler. Counting invariant subspaces and decompositions of additive polynomials. J. Symb. Comput., 105:214--233, 2021. [ http ]
@article{DBLP:journals/jsc/GathenGZ21,
 author = {Joachim von zur Gathen and
Mark Giesbrecht and
Konstantin Ziegler},
 doi = {10.1016/j.jsc.2020.06.008},
 journal = {J. Symb. Comput.},
 pages = {214--233},
 title = {Counting invariant subspaces and decompositions of additive polynomials},
 url = {https://doi.org/10.1016/j.jsc.2020.06.008},
 volume = {105},
 year = {2021}
}

[ 85 ]
Mark Giesbrecht, Joseph Haraldson, and George Labahn. Computing nearby non-trivial smith forms. J. Symb. Comput., 102:304--327, 2021. [ http ]
@article{DBLP:journals/jsc/GiesbrechtHL21,
 author = {Mark Giesbrecht and
Joseph Haraldson and
George Labahn},
 doi = {10.1016/j.jsc.2019.10.019},
 journal = {J. Symb. Comput.},
 pages = {304--327},
 title = {Computing nearby non-trivial Smith forms},
 url = {https://doi.org/10.1016/j.jsc.2019.10.019},
 volume = {102},
 year = {2021}
}

[ 84 ]
Mark Giesbrecht, Hui Huang, George Labahn, and Eugene V. Zima. Efficient q-integer linear decomposition of multivariate polynomials. J. Symb. Comput., 107:122--144, 2021. [ http ]
@article{DBLP:journals/jsc/GiesbrechtHLZ21,
 author = {Mark Giesbrecht and
Hui Huang and
George Labahn and
Eugene V. Zima},
 doi = {10.1016/j.jsc.2021.02.001},
 journal = {J. Symb. Comput.},
 pages = {122--144},
 title = {Efficient \emph{q}-integer linear decomposition of multivariate polynomials},
 url = {https://doi.org/10.1016/j.jsc.2021.02.001},
 volume = {107},
 year = {2021}
}

[ 83 ]
Mark Giesbrecht, Qiao-Long Huang, and Éric Schost. Sparse multiplication of multivariate linear differential operators. In Frédéric Chyzak and George Labahn, editors, ISSAC '21: International Symposium on Symbolic and Algebraic Computation, Virtual Event, Russia, July 18-23, 2021, pages 155--162. ACM, 2021. [ http ]
@inproceedings{DBLP:conf/issac/GiesbrechtHS21,
 author = {Mark Giesbrecht and
Qiao{-}Long Huang and
{\'{E}}ric Schost},
 booktitle = {{ISSAC} '21: International Symposium on Symbolic and Algebraic Computation,
Virtual Event, Russia, July 18-23, 2021},
 doi = {10.1145/3452143.3465527},
 editor = {Fr{\'{e}}d{\'{e}}ric Chyzak and
George Labahn},
 pages = {155--162},
 publisher = {{ACM}},
 title = {Sparse Multiplication of Multivariate Linear Differential Operators},
 url = {https://doi.org/10.1145/3452143.3465527},
 year = {2021}
}



[ 2020 ]


[ 82 ]
Mark Giesbrecht, Joseph Haraldson, and Erich Kaltofen. Computing approximate greatest common right divisors of differential polynomials. Found. Comput. Math., 20:331--366, 2020. [ http ]
@article{DBLP:journals/focm/GiesbrechtHK20,
 author = {Mark Giesbrecht and
Joseph Haraldson and
Erich Kaltofen},
 doi = {10.1007/s10208-019-09422-2},
 journal = {Found. Comput. Math.},
 pages = {331--366},
 title = {Computing Approximate Greatest Common Right Divisors of Differential
Polynomials},
 url = {https://doi.org/10.1007/s10208-019-09422-2},
 volume = {20},
 year = {2020}
}

[ 81 ]
Mark Giesbrecht, Joseph Haraldson, and George Labahn. Computing lower rank approximations of matrix polynomials. J. Symb. Comput., 98:225--245, 2020. [ http ]
@article{DBLP:journals/jsc/GiesbrechtHL20,
 author = {Mark Giesbrecht and
Joseph Haraldson and
George Labahn},
 doi = {10.1016/j.jsc.2019.07.012},
 journal = {J. Symb. Comput.},
 pages = {225--245},
 title = {Computing lower rank approximations of matrix polynomials},
 url = {https://doi.org/10.1016/j.jsc.2019.07.012},
 volume = {98},
 year = {2020}
}



[ 2019 ]


[ 80 ]
Mark Giesbrecht, Armin Jamshidpey, and Éric Schost. Quadratic probabilistic algorithms for normal bases. CoRR, abs/1903.03278, 2019. [ http ]
@article{DBLP:journals/corr/abs-1903-03278,
 author = {Mark Giesbrecht and
Armin Jamshidpey and
{\'{E}}ric Schost},
 journal = {CoRR},
 title = {Quadratic Probabilistic Algorithms for Normal Bases},
 url = {http://arxiv.org/abs/1903.03278},
 volume = {abs/1903.03278},
 year = {2019}
}

[ 79 ]
Mark Giesbrecht, Hui Huang, George Labahn, and Eugene V. Zima. Efficient integer-linear decomposition of multivariate polynomials. 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 171--178. ACM, 2019. [ http ]
@inproceedings{DBLP:conf/issac/GiesbrechtHLZ19,
 author = {Mark Giesbrecht and
Hui Huang and
George Labahn and
Eugene V. Zima},
 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.3326261},
 editor = {James H. Davenport and
Dongming Wang and
Manuel Kauers and
Russell J. Bradford},
 pages = {171--178},
 publisher = {{ACM}},
 title = {Efficient Integer-Linear Decomposition of Multivariate Polynomials},
 url = {https://doi.org/10.1145/3326229.3326261},
 year = {2019}
}

[ 78 ]
Mark Giesbrecht, Armin Jamshidpey, and Éric Schost. Quadratic-time algorithms for normal elements. 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 179--186. ACM, 2019. [ http ]
@inproceedings{DBLP:conf/issac/GiesbrechtJS19,
 author = {Mark Giesbrecht and
Armin Jamshidpey and
{\'{E}}ric Schost},
 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.3326260},
 editor = {James H. Davenport and
Dongming Wang and
Manuel Kauers and
Russell J. Bradford},
 pages = {179--186},
 publisher = {{ACM}},
 title = {Quadratic-Time Algorithms for Normal Elements},
 url = {https://doi.org/10.1145/3326229.3326260},
 year = {2019}
}



[ 2018 ]


[ 77 ]
Mark Giesbrecht, Joseph Haraldson, and George Labahn. Computing nearby non-trivial smith forms. In Manuel Kauers, Alexey Ovchinnikov, and Éric Schost, editors, Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2018, New York, NY, USA, July 16-19, 2018, pages 159--166. ACM, 2018. [ http ]
@inproceedings{DBLP:conf/issac/GiesbrechtHL18,
 author = {Mark Giesbrecht and
Joseph Haraldson and
George Labahn},
 booktitle = {Proceedings of the 2018 {ACM} on International Symposium on Symbolic
and Algebraic Computation, {ISSAC} 2018, New York, NY, USA, July 16-19,
2018},
 doi = {10.1145/3208976.3209024},
 editor = {Manuel Kauers and
Alexey Ovchinnikov and
{\'{E}}ric Schost},
 pages = {159--166},
 publisher = {{ACM}},
 title = {Computing Nearby Non-trivial Smith Forms},
 url = {https://doi.org/10.1145/3208976.3209024},
 year = {2018}
}



[ 2017 ]


[ 76 ]
Mark Giesbrecht, Joseph Haraldson, and George Labahn. Computing the nearest rank-deficient matrix polynomial. 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 181--188. ACM, 2017. [ http ]
@inproceedings{DBLP:conf/issac/GiesbrechtHL17,
 author = {Mark Giesbrecht and
Joseph Haraldson and
George Labahn},
 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.3087648},
 editor = {Michael A. Burr and
Chee K. Yap and
Mohab Safey El Din},
 pages = {181--188},
 publisher = {{ACM}},
 title = {Computing the Nearest Rank-Deficient Matrix Polynomial},
 url = {https://doi.org/10.1145/3087604.3087648},
 year = {2017}
}



[ 2016 ]


[ 75 ]
Andrew Arnold, Mark Giesbrecht, and Daniel S. Roche. Faster sparse multivariate polynomial interpolation of straight-line programs. J. Symb. Comput., 75:4--24, 2016. [ http ]
@article{DBLP:journals/jsc/ArnoldGR16,
 author = {Andrew Arnold and
Mark Giesbrecht and
Daniel S. Roche},
 doi = {10.1016/j.jsc.2015.11.005},
 journal = {J. Symb. Comput.},
 pages = {4--24},
 title = {Faster sparse multivariate polynomial interpolation of straight-line
programs},
 url = {https://doi.org/10.1016/j.jsc.2015.11.005},
 volume = {75},
 year = {2016}
}

[ 74 ]
Mark Giesbrecht, Albert Heinle, and Viktor Levandovskyy. Factoring linear partial differential operators in n variables. J. Symb. Comput., 75:127--148, 2016. [ http ]
@article{DBLP:journals/jsc/GiesbrechtHL16,
 author = {Mark Giesbrecht and
Albert Heinle and
Viktor Levandovskyy},
 doi = {10.1016/j.jsc.2015.11.011},
 journal = {J. Symb. Comput.},
 pages = {127--148},
 title = {Factoring linear partial differential operators in n variables},
 url = {https://doi.org/10.1016/j.jsc.2015.11.011},
 volume = {75},
 year = {2016}
}



[ 2015 ]


[ 73 ]
Mark Giesbrecht, Albert Heinle, and Viktor Levandovskyy. On factoring differential and difference operators in n variables. ACM Commun. Comput. Algebra, 49:33, 2015. [ http ]
@article{DBLP:journals/cca/GiesbrechtHL15,
 author = {Mark Giesbrecht and
Albert Heinle and
Viktor Levandovskyy},
 doi = {10.1145/2768577.2768645},
 journal = {{ACM} Commun. Comput. Algebra},
 pages = {33},
 title = {On factoring differential and difference operators in \emph{n} variables},
 url = {https://doi.org/10.1145/2768577.2768645},
 volume = {49},
 year = {2015}
}

[ 72 ]
Bergen, Jeffrey, Giesbrecht, Mark, Shivakumar, Pappur N., and Zhang, Yang. Factorizations for difference operators. Adv. Difference Equ., pages 2015:57, 6, 2015. [ http ]
@article{MR3315296,
 author = {Bergen, Jeffrey and Giesbrecht, Mark and Shivakumar, Pappur N.
and Zhang, Yang},
 doi = {10.1186/s13662-015-0402-1},
 journal = {Adv. Difference Equ.},
 pages = {2015:57, 6},
 title = {Factorizations for difference operators},
 url = {https://doi.org/10.1186/s13662-015-0402-1},
 year = {2015}
}

[ 71 ]
Elsheikh, Mustafa and Giesbrecht, Mark. Relating p-adic eigenvalues and the local Smith normal form. Linear Algebra Appl., 481:330--349, 2015. [ http ]
@article{MR3349660,
 author = {Elsheikh, Mustafa and Giesbrecht, Mark},
 doi = {10.1016/j.laa.2015.05.001},
 journal = {Linear Algebra Appl.},
 pages = {330--349},
 title = {Relating {$p$}-adic eigenvalues and the local {S}mith normal
form},
 url = {https://doi.org/10.1016/j.laa.2015.05.001},
 volume = {481},
 year = {2015}
}



[ 2014 ]


[ 70 ]
Andrew Arnold, Mark Giesbrecht, and Daniel S. Roche. Faster sparse polynomial interpolation of straight-line programs over finite fields. CoRR, abs/1401.4744, 2014. [ http ]
@article{DBLP:journals/corr/ArnoldGR14,
 author = {Andrew Arnold and
Mark Giesbrecht and
Daniel S. Roche},
 journal = {CoRR},
 title = {Faster sparse polynomial interpolation of straight-line programs over
finite fields},
 url = {http://arxiv.org/abs/1401.4744},
 volume = {abs/1401.4744},
 year = {2014}
}

[ 69 ]
Mustafa Elsheikh and Mark Giesbrecht. Relating p-adic eigenvalues and the local smith normal form. CoRR, abs/1401.1773, 2014. [ http ]
@article{DBLP:journals/corr/ElsheikhG14,
 author = {Mustafa Elsheikh and
Mark Giesbrecht},
 journal = {CoRR},
 title = {Relating {\textdollar}p{\textdollar}-Adic eigenvalues and the local
Smith normal form},
 url = {http://arxiv.org/abs/1401.1773},
 volume = {abs/1401.1773},
 year = {2014}
}

[ 68 ]
Mustafa Elsheikh, Andy Novocin, and Mark Giesbrecht. Ranks of quotients, remainders and p-adic digits of matrices. CoRR, abs/1401.6667, 2014. [ http ]
@article{DBLP:journals/corr/ElsheikhNG14,
 author = {Mustafa Elsheikh and
Andy Novocin and
Mark Giesbrecht},
 journal = {CoRR},
 title = {Ranks of Quotients, Remainders and {\textdollar}p{\textdollar}-Adic
Digits of Matrices},
 url = {http://arxiv.org/abs/1401.6667},
 volume = {abs/1401.6667},
 year = {2014}
}

[ 67 ]
Mark Giesbrecht, Albert Heinle, and Viktor Levandovskyy. Factoring differential operators in n variables. CoRR, abs/1404.0002, 2014. [ http ]
@article{DBLP:journals/corr/GiesbrechtHL14,
 author = {Mark Giesbrecht and
Albert Heinle and
Viktor Levandovskyy},
 journal = {CoRR},
 title = {Factoring Differential Operators in n Variables},
 url = {http://arxiv.org/abs/1404.0002},
 volume = {abs/1404.0002},
 year = {2014}
}

[ 66 ]
Andrew Arnold, Mark Giesbrecht, and Daniel S. Roche. Sparse interpolation over finite fields via low-order roots of unity. 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 27--34. ACM, 2014. [ http ]
@inproceedings{DBLP:conf/issac/ArnoldGR14,
 author = {Andrew Arnold and
Mark Giesbrecht and
Daniel S. Roche},
 booktitle = {International Symposium on Symbolic and Algebraic Computation, {ISSAC}
'14, Kobe, Japan, July 23-25, 2014},
 doi = {10.1145/2608628.2608671},
 editor = {Katsusuke Nabeshima and
Kosaku Nagasaka and
Franz Winkler and
{\'{A}}gnes Sz{\'{a}}nt{\'{o}}},
 pages = {27--34},
 publisher = {{ACM}},
 title = {Sparse interpolation over finite fields via low-order roots of unity},
 url = {https://doi.org/10.1145/2608628.2608671},
 year = {2014}
}

[ 65 ]
Mark Giesbrecht, Albert Heinle, and Viktor Levandovskyy. Factoring linear differential operators in n variables. 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 194--201. ACM, 2014. [ http ]
@inproceedings{DBLP:conf/issac/GiesbrechtHL14,
 author = {Mark Giesbrecht and
Albert Heinle and
Viktor Levandovskyy},
 booktitle = {International Symposium on Symbolic and Algebraic Computation, {ISSAC}
'14, Kobe, Japan, July 23-25, 2014},
 doi = {10.1145/2608628.2608667},
 editor = {Katsusuke Nabeshima and
Kosaku Nagasaka and
Franz Winkler and
{\'{A}}gnes Sz{\'{a}}nt{\'{o}}},
 pages = {194--201},
 publisher = {{ACM}},
 title = {Factoring linear differential operators in \emph{n} variables},
 url = {https://doi.org/10.1145/2608628.2608667},
 year = {2014}
}

[ 64 ]
Mark Giesbrecht and Joseph Haraldson. Computing gcrds of approximate differential polynomials. In Lihong Zhi and Stephen M. Watt, editors, Symbolic-Numeric Computation 2014, SNC '14, Shanghai, China, July 28-31, 2014, pages 78--87. ACM, 2014. [ http ]
@inproceedings{DBLP:conf/snc/GiesbrechtH14,
 author = {Mark Giesbrecht and
Joseph Haraldson},
 booktitle = {Symbolic-Numeric Computation 2014, {SNC} '14, Shanghai, China, July
28-31, 2014},
 doi = {10.1145/2631948.2631964},
 editor = {Lihong Zhi and
Stephen M. Watt},
 pages = {78--87},
 publisher = {{ACM}},
 title = {Computing GCRDs of approximate differential polynomials},
 url = {https://doi.org/10.1145/2631948.2631964},
 year = {2014}
}



[ 2013 ]


[ 63 ]
Andrew Arnold, Mark Giesbrecht, and Daniel S. Roche. Recursive sparse interpolation. ACM Commun. Comput. Algebra, 47:104--105, 2013. [ http ]
@article{DBLP:journals/cca/ArnoldGR13,
 author = {Andrew Arnold and
Mark Giesbrecht and
Daniel S. Roche},
 doi = {10.1145/2576802.2576815},
 journal = {{ACM} Commun. Comput. Algebra},
 pages = {104--105},
 title = {Recursive sparse interpolation},
 url = {https://doi.org/10.1145/2576802.2576815},
 volume = {47},
 year = {2013}
}

[ 62 ]
Andrew Arnold, Mark Giesbrecht, and Daniel S. Roche. Faster sparse interpolation of straight-line program. CoRR, abs/1304.3483, 2013. [ http ]
@article{DBLP:journals/corr/abs-1304-3483,
 author = {Andrew Arnold and
Mark Giesbrecht and
Daniel S. Roche},
 journal = {CoRR},
 title = {Faster sparse interpolation of straight-line program},
 url = {http://arxiv.org/abs/1304.3483},
 volume = {abs/1304.3483},
 year = {2013}
}

[ 61 ]
Mark Giesbrecht. Algorithms for irreducibility testing and for constructing irreducible polynomials. In Gary L. Mullen and Daniel Panario, editors, Handbook of Finite Fields, pages 374--379. CRC Press, 2013.
@incollection{DBLP:books/crc/13/Giesbrecht13,
 author = {Mark Giesbrecht},
 booktitle = {Handbook of Finite Fields},
 editor = {Gary L. Mullen and
Daniel Panario},
 pages = {374--379},
 publisher = {{CRC} Press},
 title = {Algorithms for irreducibility testing and for constructing irreducible
polynomials},
 year = {2013}
}

[ 60 ]
Andrew Arnold, Mark Giesbrecht, and Daniel S. Roche. Faster sparse interpolation of straight-line programs. In Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, and Evgenii V. Vorozhtsov, editors, Computer Algebra in Scientific Computing - 15th International Workshop, CASC 2013, Berlin, Germany, September 9-13, 2013. Proceedings, volume 8136, pages 61--74. Springer, 2013. [ http ]
@inproceedings{DBLP:conf/casc/ArnoldGR13,
 author = {Andrew Arnold and
Mark Giesbrecht and
Daniel S. Roche},
 booktitle = {Computer Algebra in Scientific Computing - 15th International Workshop,
{CASC} 2013, Berlin, Germany, September 9-13, 2013. Proceedings},
 doi = {10.1007/978-3-319-02297-0_5},
 editor = {Vladimir P. Gerdt and
Wolfram Koepf and
Ernst W. Mayr and
Evgenii V. Vorozhtsov},
 pages = {61--74},
 publisher = {Springer},
 title = {Faster Sparse Interpolation of Straight-Line Programs},
 url = {https://doi.org/10.1007/978-3-319-02297-0_5},
 volume = {8136},
 year = {2013}
}



[ 2012 ]


[ 59 ]
Mark Giesbrecht, Daniel S. Roche, and Hrushikesh Tilak. Computing sparse multiples of polynomials. Algorithmica, 64:454--480, 2012. [ http ]
@article{DBLP:journals/algorithmica/GiesbrechtRT12,
 author = {Mark Giesbrecht and
Daniel S. Roche and
Hrushikesh Tilak},
 doi = {10.1007/s00453-012-9652-4},
 journal = {Algorithmica},
 pages = {454--480},
 title = {Computing Sparse Multiples of Polynomials},
 url = {https://doi.org/10.1007/s00453-012-9652-4},
 volume = {64},
 year = {2012}
}

[ 58 ]
Mark Giesbrecht and Daniel Panario. In honour of the research and influence of joachim von zur gathen at 60. J. Symb. Comput., 47:355--357, 2012. [ http ]
@article{DBLP:journals/jsc/GiesbrechtP12,
 author = {Mark Giesbrecht and
Daniel Panario},
 doi = {10.1016/j.jsc.2011.09.001},
 journal = {J. Symb. Comput.},
 pages = {355--357},
 title = {In honour of the research and influence of Joachim von zur Gathen
at 60},
 url = {https://doi.org/10.1016/j.jsc.2011.09.001},
 volume = {47},
 year = {2012}
}

[ 57 ]
Mark Giesbrecht and Nam Pham. A symbolic approach to compute a null-space basis in the projection method. In Ruyong Feng, Wen-shin Lee, and Yosuke Sato, editors, Computer Mathematics, 9th Asian Symposium (ASCM 2009), Fukuoka, Japan, December 2009, 10th Asian Symposium (ASCM 2012), Beijing, China, October 2012, Contributed Papers and Invited Talks, pages 243--259. Springer, 2012. [ http ]
@inproceedings{DBLP:conf/ascm/GiesbrechtP12,
 author = {Mark Giesbrecht and
Nam Pham},
 booktitle = {Computer Mathematics, 9th Asian Symposium {(ASCM} 2009), Fukuoka,
Japan, December 2009, 10th Asian Symposium {(ASCM} 2012), Beijing,
China, October 2012, Contributed Papers and Invited Talks},
 doi = {10.1007/978-3-662-43799-5_19},
 editor = {Ruyong Feng and
Wen{-}shin Lee and
Yosuke Sato},
 pages = {243--259},
 publisher = {Springer},
 title = {A Symbolic Approach to Compute a Null-Space Basis in the Projection
Method},
 url = {https://doi.org/10.1007/978-3-662-43799-5_19},
 year = {2012}
}

[ 56 ]
Mark Giesbrecht and Albert Heinle. A polynomial-time algorithm for the jacobson form of a matrix of ore polynomials. In Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, and Evgenii V. Vorozhtsov, editors, Computer Algebra in Scientific Computing - 14th International Workshop, CASC 2012, Maribor, Slovenia, September 3-6, 2012. Proceedings, volume 7442, pages 117--128. Springer, 2012. [ http ]
@inproceedings{DBLP:conf/casc/GiesbrechtH12,
 author = {Mark Giesbrecht and
Albert Heinle},
 booktitle = {Computer Algebra in Scientific Computing - 14th International Workshop,
{CASC} 2012, Maribor, Slovenia, September 3-6, 2012. Proceedings},
 doi = {10.1007/978-3-642-32973-9_10},
 editor = {Vladimir P. Gerdt and
Wolfram Koepf and
Ernst W. Mayr and
Evgenii V. Vorozhtsov},
 pages = {117--128},
 publisher = {Springer},
 title = {A Polynomial-Time Algorithm for the Jacobson Form of a Matrix of Ore
Polynomials},
 url = {https://doi.org/10.1007/978-3-642-32973-9_10},
 volume = {7442},
 year = {2012}
}

[ 55 ]
Mustafa Elsheikh, Mark Giesbrecht, Andy Novocin, and B. David Saunders. Fast computation of smith forms of sparse matrices over local rings. 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 146--153. ACM, 2012. [ http ]
@inproceedings{DBLP:conf/issac/ElsheikhGNS12,
 author = {Mustafa Elsheikh and
Mark Giesbrecht and
Andy Novocin and
B. David Saunders},
 booktitle = {International Symposium on Symbolic and Algebraic Computation, ISSAC'12,
Grenoble, France - July 22 - 25, 2012},
 doi = {10.1145/2442829.2442853},
 editor = {Joris van der Hoeven and
Mark van Hoeij},
 pages = {146--153},
 publisher = {{ACM}},
 title = {Fast computation of Smith forms of sparse matrices over local rings},
 url = {https://doi.org/10.1145/2442829.2442853},
 year = {2012}
}



[ 2011 ]


[ 54 ]
Mark Giesbrecht and Myung Sub Kim. Computing the hermite form of a matrix of ore polynomials. CoRR, abs/1109.3656, 2011. [ http ]
@article{DBLP:journals/corr/abs-1109-3656,
 author = {Mark Giesbrecht and
Myung Sub Kim},
 journal = {CoRR},
 title = {Computing the Hermite Form of a Matrix of Ore Polynomials},
 url = {http://arxiv.org/abs/1109.3656},
 volume = {abs/1109.3656},
 year = {2011}
}

[ 53 ]
Mark Giesbrecht and Daniel S. Roche. Detecting lacunary perfect powers and computing their roots. J. Symb. Comput., 46:1242--1259, 2011. [ http ]
@article{DBLP:journals/jsc/GiesbrechtR11,
 author = {Mark Giesbrecht and
Daniel S. Roche},
 doi = {10.1016/j.jsc.2011.08.006},
 journal = {J. Symb. Comput.},
 pages = {1242--1259},
 title = {Detecting lacunary perfect powers and computing their roots},
 url = {https://doi.org/10.1016/j.jsc.2011.08.006},
 volume = {46},
 year = {2011}
}

[ 52 ]
Mark Giesbrecht and Stephen M. Watt. In honour of keith geddes on his 60th birthday. J. Symb. Comput., 46:735--740, 2011. [ http ]
@article{DBLP:journals/jsc/GiesbrechtW11,
 author = {Mark Giesbrecht and
Stephen M. Watt},
 doi = {10.1016/j.jsc.2010.08.009},
 journal = {J. Symb. Comput.},
 pages = {735--740},
 title = {In honour of Keith Geddes on his 60th birthday},
 url = {https://doi.org/10.1016/j.jsc.2010.08.009},
 volume = {46},
 year = {2011}
}

[ 51 ]
Mark Giesbrecht and Daniel S. Roche. Diversification improves interpolation. 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 123--130. ACM, 2011. [ http ]
@inproceedings{DBLP:conf/issac/GiesbrechtR11,
 author = {Mark Giesbrecht and
Daniel S. Roche},
 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.1993909},
 editor = {{\'{E}}ric Schost and
Ioannis Z. Emiris},
 pages = {123--130},
 publisher = {{ACM}},
 title = {Diversification improves interpolation},
 url = {https://doi.org/10.1145/1993886.1993909},
 year = {2011}
}



[ 2010 ]


[ 50 ]
Mark Giesbrecht, Daniel S. Roche, and Hrushikesh Tilak. Abstract only: Complexity of sparsest multiple computation. ACM Commun. Comput. Algebra, 44:25, 2010. [ http ]
@article{DBLP:journals/cca/GiesbrechtRT10,
 author = {Mark Giesbrecht and
Daniel S. Roche and
Hrushikesh Tilak},
 doi = {10.1145/1838599.1838614},
 journal = {{ACM} Commun. Comput. Algebra},
 pages = {25},
 title = {Abstract only: Complexity of sparsest multiple computation},
 url = {https://doi.org/10.1145/1838599.1838614},
 volume = {44},
 year = {2010}
}

[ 49 ]
Mark Giesbrecht and Daniel S. Roche. Interpolation of shifted-lacunary polynomials. Comput. Complex., 19:333--354, 2010. [ http ]
@article{DBLP:journals/cc/GiesbrechtR10,
 author = {Mark Giesbrecht and
Daniel S. Roche},
 doi = {10.1007/s00037-010-0294-0},
 journal = {Comput. Complex.},
 pages = {333--354},
 title = {Interpolation of Shifted-Lacunary Polynomials},
 url = {https://doi.org/10.1007/s00037-010-0294-0},
 volume = {19},
 year = {2010}
}

[ 48 ]
Joachim von zur Gathen, Mark Giesbrecht, and Konstantin Ziegler. Composition collisions and projective polynomials. CoRR, abs/1005.1087, 2010. [ http ]
@article{DBLP:journals/corr/abs-1005-1087,
 author = {Joachim von zur Gathen and
Mark Giesbrecht and
Konstantin Ziegler},
 journal = {CoRR},
 title = {Composition collisions and projective polynomials},
 url = {http://arxiv.org/abs/1005.1087},
 volume = {abs/1005.1087},
 year = {2010}
}

[ 47 ]
Mark Giesbrecht. Some results on the functional decomposition of polynomials. CoRR, abs/1004.5433, 2010. [ http ]
@article{DBLP:journals/corr/Giesbrecht10,
 author = {Mark Giesbrecht},
 journal = {CoRR},
 title = {Some Results on the Functional Decomposition of Polynomials},
 url = {http://arxiv.org/abs/1004.5433},
 volume = {abs/1004.5433},
 year = {2010}
}

[ 46 ]
Mark Giesbrecht, Daniel S. Roche, and Hrushikesh Tilak. Computing sparse multiples of polynomials. In Otfried Cheong, Kyung-Yong Chwa, and Kunsoo Park, editors, Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I, volume 6506, pages 266--278. Springer, 2010. [ http ]
@inproceedings{DBLP:conf/isaac/GiesbrechtRT10,
 author = {Mark Giesbrecht and
Daniel S. Roche and
Hrushikesh Tilak},
 booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{I}},
 doi = {10.1007/978-3-642-17517-6_25},
 editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
 pages = {266--278},
 publisher = {Springer},
 title = {Computing Sparse Multiples of Polynomials},
 url = {https://doi.org/10.1007/978-3-642-17517-6_25},
 volume = {6506},
 year = {2010}
}

[ 45 ]
Joachim von zur Gathen, Mark Giesbrecht, and Konstantin Ziegler. Composition collisions and projective polynomials: statement of results. In Wolfram Koepf, editor, Symbolic and Algebraic Computation, International Symposium, ISSAC 2010, Munich, Germany, July 25-28, 2010, Proceedings, pages 123--130. ACM, 2010. [ http ]
@inproceedings{DBLP:conf/issac/GathenGZ10,
 author = {Joachim von zur Gathen and
Mark Giesbrecht and
Konstantin Ziegler},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2010, Munich, Germany, July 25-28, 2010, Proceedings},
 doi = {10.1145/1837934.1837962},
 editor = {Wolfram Koepf},
 pages = {123--130},
 publisher = {{ACM}},
 title = {Composition collisions and projective polynomials: statement of results},
 url = {https://doi.org/10.1145/1837934.1837962},
 year = {2010}
}



[ 2009 ]


[ 44 ]
Mark Giesbrecht, George Labahn, and Wen-shin Lee. Symbolic-numeric sparse interpolation of multivariate polynomials. J. Symb. Comput., 44:943--959, 2009. [ http ]
@article{DBLP:journals/jsc/GiesbrechtLL09,
 author = {Mark Giesbrecht and
George Labahn and
Wen{-}shin Lee},
 doi = {10.1016/j.jsc.2008.11.003},
 journal = {J. Symb. Comput.},
 pages = {943--959},
 title = {Symbolic-numeric sparse interpolation of multivariate polynomials},
 url = {https://doi.org/10.1016/j.jsc.2008.11.003},
 volume = {44},
 year = {2009}
}

[ 43 ]
Mark Giesbrecht, George Labahn, and Yang Zhang. Computing popov forms of matrices over PBW extensions. In Ruyong Feng, Wen-shin Lee, and Yosuke Sato, editors, Computer Mathematics, 9th Asian Symposium (ASCM 2009), Fukuoka, Japan, December 2009, 10th Asian Symposium (ASCM 2012), Beijing, China, October 2012, Contributed Papers and Invited Talks, pages 61--65. Springer, 2009. [ http ]
@inproceedings{DBLP:conf/ascm/GiesbrechtLZ09,
 author = {Mark Giesbrecht and
George Labahn and
Yang Zhang},
 booktitle = {Computer Mathematics, 9th Asian Symposium {(ASCM} 2009), Fukuoka,
Japan, December 2009, 10th Asian Symposium {(ASCM} 2012), Beijing,
China, October 2012, Contributed Papers and Invited Talks},
 doi = {10.1007/978-3-662-43799-5_6},
 editor = {Ruyong Feng and
Wen{-}shin Lee and
Yosuke Sato},
 pages = {61--65},
 publisher = {Springer},
 title = {Computing Popov Forms of Matrices Over {PBW} Extensions},
 url = {https://doi.org/10.1007/978-3-662-43799-5_6},
 year = {2009}
}

[ 42 ]
Mark Giesbrecht and Myung Sub Kim. On computing the hermite form of a matrix of differential polynomials. In Vladimir P. Gerdt, Ernst W. Mayr, and Evgenii V. Vorozhtsov, editors, Computer Algebra in Scientific Computing, 11th International Workshop, CASC 2009, Kobe, Japan, September 13-17, 2009. Proceedings, volume 5743, pages 118--129. Springer, 2009. [ http ]
@inproceedings{DBLP:conf/casc/GiesbrechtK09,
 author = {Mark Giesbrecht and
Myung Sub Kim},
 booktitle = {Computer Algebra in Scientific Computing, 11th International Workshop,
{CASC} 2009, Kobe, Japan, September 13-17, 2009. Proceedings},
 doi = {10.1007/978-3-642-04103-7_12},
 editor = {Vladimir P. Gerdt and
Ernst W. Mayr and
Evgenii V. Vorozhtsov},
 pages = {118--129},
 publisher = {Springer},
 title = {On Computing the Hermite Form of a Matrix of Differential Polynomials},
 url = {https://doi.org/10.1007/978-3-642-04103-7_12},
 volume = {5743},
 year = {2009}
}



[ 2008 ]


[ 41 ]
Mark Giesbrecht. ACM 2007 kanellakis award honours bruno buchberger innovator of automated tools for mathematics. ACM Commun. Comput. Algebra, 42:37--38, 2008. [ http ]
@article{DBLP:journals/cca/Giesbrecht08,
 author = {Mark Giesbrecht},
 doi = {10.1145/1394042.1394045},
 journal = {{ACM} Commun. Comput. Algebra},
 pages = {37--38},
 title = {{ACM} 2007 Kanellakis Award Honours Bruno Buchberger Innovator of
Automated Tools for Mathematics},
 url = {https://doi.org/10.1145/1394042.1394045},
 volume = {42},
 year = {2008}
}

[ 40 ]
John P. May, Mark Giesbrecht, Daniel S. Roche, Marc Moreno Maza, and Yuzhen Xie. Automatic variable order selection for polynomial system solving (abstract only). ACM Commun. Comput. Algebra, 42:83, 2008. [ http ]
@article{DBLP:journals/cca/MayGRMX08,
 author = {John P. May and
Mark Giesbrecht and
Daniel S. Roche and
Marc Moreno Maza and
Yuzhen Xie},
 doi = {10.1145/1394042.1394090},
 journal = {{ACM} Commun. Comput. Algebra},
 pages = {83},
 title = {Automatic variable order selection for polynomial system solving (abstract
only)},
 url = {https://doi.org/10.1145/1394042.1394090},
 volume = {42},
 year = {2008}
}

[ 39 ]
Daniel S. Roche and Mark Giesbrecht. Detecting polynomial perfect powers (abstract only). ACM Commun. Comput. Algebra, 42:87, 2008. [ http ]
@article{DBLP:journals/cca/RocheG08,
 author = {Daniel S. Roche and
Mark Giesbrecht},
 doi = {10.1145/1394042.1394096},
 journal = {{ACM} Commun. Comput. Algebra},
 pages = {87},
 title = {Detecting polynomial perfect powers (abstract only)},
 url = {https://doi.org/10.1145/1394042.1394096},
 volume = {42},
 year = {2008}
}

[ 38 ]
Mark Giesbrecht and Daniel S. Roche. On lacunary polynomial perfect powers. In J. Rafael Sendra and Laureano González-Vega, editors, Symbolic and Algebraic Computation, International Symposium, ISSAC 2008, Linz/Hagenberg, Austria, July 20-23, 2008, Proceedings, pages 103--110. ACM, 2008. [ http ]
@inproceedings{DBLP:conf/issac/GiesbrechtR08,
 author = {Mark Giesbrecht and
Daniel S. Roche},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2008, Linz/Hagenberg, Austria, July 20-23, 2008, Proceedings},
 doi = {10.1145/1390768.1390785},
 editor = {J. Rafael Sendra and
Laureano Gonz{\'{a}}lez{-}Vega},
 pages = {103--110},
 publisher = {{ACM}},
 title = {On lacunary polynomial perfect powers},
 url = {https://doi.org/10.1145/1390768.1390785},
 year = {2008}
}



[ 2007 ]


[ 37 ]
Mark Giesbrecht, Ilias S. Kotsireas, and Austin Lobo. ISSAC 2007 poster abstracts. ACM Commun. Comput. Algebra, 41:38--72, 2007. [ http ]
@article{DBLP:journals/cca/GiesbrechtKL07,
 author = {Mark Giesbrecht and
Ilias S. Kotsireas and
Austin Lobo},
 doi = {10.1145/1296772.1296775},
 journal = {{ACM} Commun. Comput. Algebra},
 pages = {38--72},
 title = {{ISSAC} 2007 poster abstracts},
 url = {https://doi.org/10.1145/1296772.1296775},
 volume = {41},
 year = {2007}
}

[ 36 ]
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 ]
@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}
}

[ 35 ]
Jason W. A. Selby, Fraser P. Ruffell, Mark Giesbrecht, and Michael W. Godfrey. Examining the effects of global data usage on software maintainability. In 14th Working Conference on Reverse Engineering (WCRE 2007), 28-31 October 2007, Vancouver, BC, Canada, pages 60--69. IEEE Computer Society, 2007. [ http ]
@inproceedings{DBLP:conf/wcre/SelbyRGG07,
 author = {Jason W. A. Selby and
Fraser P. Ruffell and
Mark Giesbrecht and
Michael W. Godfrey},
 booktitle = {14th Working Conference on Reverse Engineering {(WCRE} 2007), 28-31
October 2007, Vancouver, BC, Canada},
 doi = {10.1109/WCRE.2007.27},
 pages = {60--69},
 publisher = {{IEEE} Computer Society},
 title = {Examining the Effects of Global Data Usage on Software Maintainability},
 url = {https://doi.org/10.1109/WCRE.2007.27},
 year = {2007}
}



[ 2006 ]


[ 34 ]
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}
}

[ 33 ]
Mark Giesbrecht, George Labahn, and Wen-shin Lee. Probabilistically stable numerical sparse polynomial interpolation. 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/GiesbrechtLL06,
 author = {Mark Giesbrecht and
George Labahn and
Wen{-}shin Lee},
 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 = {Probabilistically Stable Numerical Sparse Polynomial Interpolation},
 url = {http://drops.dagstuhl.de/opus/volltexte/2006/775},
 volume = {06271},
 year = {2006}
}

[ 32 ]
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 ]
@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}
}

[ 31 ]
Mark Giesbrecht, George Labahn, and Wen-shin Lee. Symbolic-numeric sparse interpolation of multivariate polynomials. In Barry M. Trager, editor, Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings, pages 116--123. ACM, 2006. [ http ]
@inproceedings{DBLP:conf/issac/GiesbrechtLL06,
 author = {Mark Giesbrecht and
George Labahn and
Wen{-}shin Lee},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2006, Genoa, Italy, July 9-12, 2006, Proceedings},
 doi = {10.1145/1145768.1145792},
 editor = {Barry M. Trager},
 pages = {116--123},
 publisher = {{ACM}},
 title = {Symbolic-numeric sparse interpolation of multivariate polynomials},
 url = {https://doi.org/10.1145/1145768.1145792},
 year = {2006}
}

[ 30 ]
Jason W. A. Selby and Mark Giesbrecht. A fine-grained analysis of the performance and power benefits of compiler optimizations for embedded devices. In Hamid R. Arabnia and Hassan Reza, editors, Proceedings of the International Conference on Software Engineering Research and Practice & Conference on Programming Languages and Compilers, SERP 2006, Las Vegas, Nevada, USA, June 26-29, 2006, Volume 2, pages 821--827. CSREA Press, 2006.
@inproceedings{DBLP:conf/serp/SelbyG06,
 author = {Jason W. A. Selby and
Mark Giesbrecht},
 booktitle = {Proceedings of the International Conference on Software Engineering
Research and Practice {\&} Conference on Programming Languages and
Compilers, {SERP} 2006, Las Vegas, Nevada, USA, June 26-29, 2006,
Volume 2},
 editor = {Hamid R. Arabnia and
Hassan Reza},
 pages = {821--827},
 publisher = {{CSREA} Press},
 title = {A Fine-Grained Analysis of the Performance and Power Benefits of Compiler
Optimizations for Embedded Devices},
 year = {2006}
}



[ 2005 ]


[ 29 ]
Mark Giesbrecht, George Labahn, and Yang Zhang. Computing valuation popov forms. In Vaidy S. Sunderam, G. Dick van Albada, Peter M. A. Sloot, and Jack J. Dongarra, editors, Computational Science - ICCS 2005, 5th International Conference, Atlanta, GA, USA, May 22-25, 2005, Proceedings, Part III, volume 3516, pages 619--626. Springer, 2005. [ http ]
@inproceedings{DBLP:conf/iccS/GiesbrechtLZ05,
 author = {Mark Giesbrecht and
George Labahn and
Yang Zhang},
 booktitle = {Computational Science - {ICCS} 2005, 5th International Conference,
Atlanta, GA, USA, May 22-25, 2005, Proceedings, Part {III}},
 doi = {10.1007/11428862_84},
 editor = {Vaidy S. Sunderam and
G. Dick van Albada and
Peter M. A. Sloot and
Jack J. Dongarra},
 pages = {619--626},
 publisher = {Springer},
 title = {Computing Valuation Popov Forms},
 url = {https://doi.org/10.1007/11428862_84},
 volume = {3516},
 year = {2005}
}

[ 28 ]
Cosmin E. Oancea, Jason W. A. Selby, Mark Giesbrecht, and Stephen M. Watt. Distributed models of thread level speculation. In Hamid R. Arabnia, editor, Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2005, Las Vegas, Nevada, USA, June 27-30, 2005, Volume 3, pages 920--927. CSREA Press, 2005.
@inproceedings{DBLP:conf/pdpta/OanceaSGW05,
 author = {Cosmin E. Oancea and
Jason W. A. Selby and
Mark Giesbrecht and
Stephen M. Watt},
 booktitle = {Proceedings of the International Conference on Parallel and Distributed
Processing Techniques and Applications, {PDPTA} 2005, Las Vegas, Nevada,
USA, June 27-30, 2005, Volume 3},
 editor = {Hamid R. Arabnia},
 pages = {920--927},
 publisher = {{CSREA} Press},
 title = {Distributed Models of Thread Level Speculation},
 year = {2005}
}



[ 2004 ]


[ 27 ]
Wayne Eberly and Mark Giesbrecht. Efficient decomposition of separable algebras. J. Symb. Comput., 37:35--81, 2004. [ http ]
@article{DBLP:journals/jsc/EberlyG04,
 author = {Wayne Eberly and
Mark Giesbrecht},
 doi = {10.1016/S0747-7171(03)00071-3},
 journal = {J. Symb. Comput.},
 pages = {35--81},
 title = {Efficient decomposition of separable algebras},
 url = {https://doi.org/10.1016/S0747-7171(03)00071-3},
 volume = {37},
 year = {2004}
}



[ 2003 ]


[ 26 ]
Mark Giesbrecht, Erich Kaltofen, and Wen-shin Lee. Algorithms for computing sparsest shifts of polynomials in power, chebyshev, and pochhammer bases. J. Symb. Comput., 36:401--424, 2003. [ http ]
@article{DBLP:journals/jsc/GiesbrechtKL03,
 author = {Mark Giesbrecht and
Erich Kaltofen and
Wen{-}shin Lee},
 doi = {10.1016/S0747-7171(03)00087-7},
 journal = {J. Symb. Comput.},
 pages = {401--424},
 title = {Algorithms for computing sparsest shifts of polynomials in power,
Chebyshev, and Pochhammer bases},
 url = {https://doi.org/10.1016/S0747-7171(03)00087-7},
 volume = {36},
 year = {2003}
}

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



[ 2002 ]


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

[ 23 ]
Mark Giesbrecht, Erich Kaltofen, and Wen-shin Lee. Algorithms for computing the sparsest shifts of polynomials via the berlekamp/massey algorithm. In Teo Mora, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2002, Lille, France, July 7-10, 2002, Proceedings, pages 101--108. ACM, 2002. [ http ]
@inproceedings{DBLP:conf/issac/GiesbrechtKL02,
 author = {Mark Giesbrecht and
Erich Kaltofen and
Wen{-}shin Lee},
 booktitle = {Symbolic and Algebraic Computation, International Symposium {ISSAC}
2002, Lille, France, July 7-10, 2002, Proceedings},
 doi = {10.1145/780506.780519},
 editor = {Teo Mora},
 pages = {101--108},
 publisher = {{ACM}},
 title = {Algorithms for computing the sparsest shifts of polynomials via the
Berlekamp/Massey algorithm},
 url = {https://doi.org/10.1145/780506.780519},
 year = {2002}
}



[ 2001 ]


[ 22 ]
Mark Giesbrecht. Fast computation of the smith form of a sparse integer matrix. Comput. Complex., 10:41--69, 2001. [ http ]
@article{DBLP:journals/cc/Giesbrecht01,
 author = {Mark Giesbrecht},
 doi = {10.1007/PL00001611},
 journal = {Comput. Complex.},
 pages = {41--69},
 title = {Fast computation of the Smith form of a sparse integer matrix},
 url = {https://doi.org/10.1007/PL00001611},
 volume = {10},
 year = {2001}
}

[ 21 ]
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 ]
@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}
}

[ 20 ]
Robert M. Corless, Mark Giesbrecht, Mark van Hoeij, Ilias S. Kotsireas, and Stephen M. Watt. Towards factoring bivariate approximate polynomials. In Erich Kaltofen and Gilles Villard, editors, Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ISSAC 2001, ORCCA & University of Western Ontario, London, Ontario, Canada, July 22-25, 2001, pages 85--92. ACM, 2001. [ http ]
@inproceedings{DBLP:conf/issac/CorlessGHKW01,
 author = {Robert M. Corless and
Mark Giesbrecht and
Mark van Hoeij and
Ilias S. Kotsireas and
Stephen M. Watt},
 booktitle = {Proceedings of the 2001 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} 2001, {ORCCA} {\&} University of Western Ontario,
London, Ontario, Canada, July 22-25, 2001},
 doi = {10.1145/384101.384114},
 editor = {Erich Kaltofen and
Gilles Villard},
 pages = {85--92},
 publisher = {{ACM}},
 title = {Towards factoring bivariate approximate polynomials},
 url = {https://doi.org/10.1145/384101.384114},
 year = {2001}
}



[ 2000 ]


[ 19 ]
Mark Giesbrecht. East coast computer algebra day. SIGSAM Bull., 34:21--27, 2000. [ http ]
@article{DBLP:journals/cca/Giesbrecht00,
 author = {Mark Giesbrecht},
 doi = {10.1145/377604.569765},
 journal = {{SIGSAM} Bull.},
 pages = {21--27},
 title = {East Coast Computer Algebra Day},
 url = {https://doi.org/10.1145/377604.569765},
 volume = {34},
 year = {2000}
}

[ 18 ]
Wayne Eberly and Mark Giesbrecht. Efficient decomposition of associative algebras over finite fields. J. Symb. Comput., 29:441--458, 2000. [ http ]
@article{DBLP:journals/jsc/EberlyG00,
 author = {Wayne Eberly and
Mark Giesbrecht},
 doi = {10.1006/jsco.1999.0308},
 journal = {J. Symb. Comput.},
 pages = {441--458},
 title = {Efficient Decomposition of Associative Algebras over Finite Fields},
 url = {https://doi.org/10.1006/jsco.1999.0308},
 volume = {29},
 year = {2000}
}

[ 17 ]
Robert M. Corless, Mark Giesbrecht, Ilias S. Kotsireas, and Stephen M. Watt. Numerical implicitization of parametric hypersurfaces with linear algebra. In John A. Campbell and Eugenio Roanes-Lozano, editors, Artificial Intelligence and Symbolic Computation, International Conference AISC 2000 Madrid, Spain, July 17-19, 2000, Revised Papers, volume 1930, pages 174--183. Springer, 2000. [ http ]
@inproceedings{DBLP:conf/aisc/CorlessGKW00,
 author = {Robert M. Corless and
Mark Giesbrecht and
Ilias S. Kotsireas and
Stephen M. Watt},
 booktitle = {Artificial Intelligence and Symbolic Computation, International Conference
{AISC} 2000 Madrid, Spain, July 17-19, 2000, Revised Papers},
 doi = {10.1007/3-540-44990-6_13},
 editor = {John A. Campbell and
Eugenio Roanes{-}Lozano},
 pages = {174--183},
 publisher = {Springer},
 title = {Numerical Implicitization of Parametric Hypersurfaces with Linear
Algebra},
 url = {https://doi.org/10.1007/3-540-44990-6_13},
 volume = {1930},
 year = {2000}
}

[ 16 ]
Wayne Eberly, Mark Giesbrecht, and Gilles Villard. Computing the determinant and smith form of an integer matrix. In 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pages 675--685. IEEE Computer Society, 2000. [ http ]
@inproceedings{DBLP:conf/focs/EberlyGV00,
 author = {Wayne Eberly and
Mark Giesbrecht and
Gilles Villard},
 booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
12-14 November 2000, Redondo Beach, California, {USA}},
 doi = {10.1109/SFCS.2000.892335},
 pages = {675--685},
 publisher = {{IEEE} Computer Society},
 title = {Computing the Determinant and Smith Form of an Integer Matrix},
 url = {https://doi.org/10.1109/SFCS.2000.892335},
 year = {2000}
}



[ 1999 ]


[ 15 ]
Robert M. Corless, Mark Giesbrecht, David J. Jeffrey, and Stephen M. Watt. Approximate polynomial decomposition. 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 213--219. ACM, 1999. [ http ]
@inproceedings{DBLP:conf/issac/CorlessGJ99,
 author = {Robert M. Corless and
Mark Giesbrecht and
David J. Jeffrey and
Stephen M. Watt},
 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.309939},
 editor = {Keith O. Geddes and
Bruno Salvy and
Samuel S. Dooley},
 pages = {213--219},
 publisher = {{ACM}},
 title = {Approximate polynomial decomposition},
 url = {https://doi.org/10.1145/309831.309939},
 year = {1999}
}



[ 1998 ]


[ 14 ]
Mark Giesbrecht. Factoring in skew-polynomial rings over finite fields. J. Symb. Comput., 26:463--486, 1998. [ http ]
@article{DBLP:journals/jsc/Giesbrecht98,
 author = {Mark Giesbrecht},
 doi = {10.1006/jsco.1998.0224},
 journal = {J. Symb. Comput.},
 pages = {463--486},
 title = {Factoring in Skew-Polynomial Rings over Finite Fields},
 url = {https://doi.org/10.1006/jsco.1998.0224},
 volume = {26},
 year = {1998}
}

[ 13 ]
Mark Giesbrecht, Austin Lobo, and B. David Saunders. Certifying inconsistency of sparse linear systems. 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 113--119. ACM, 1998. [ http ]
@inproceedings{DBLP:conf/issac/GiesbrechtLS98,
 author = {Mark Giesbrecht and
Austin Lobo and
B. David Saunders},
 booktitle = {Proceedings of the 1998 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} '98, Rostock, Germany, August 13-15, 1998},
 doi = {10.1145/281508.281591},
 editor = {Volker Weispfenning and
Barry M. Trager},
 pages = {113--119},
 publisher = {{ACM}},
 title = {Certifying Inconsistency of Sparse Linear Systems},
 url = {https://doi.org/10.1145/281508.281591},
 year = {1998}
}



[ 1997 ]


[ 12 ]
Mark Giesbrecht, Austin Lobo, and B. David Saunders. Certifying inconsistency of sparse linear systems. SIGSAM Bull., 31:40, 1997. [ http ]
@article{DBLP:journals/cca/GiesbrechtLS97,
 author = {Mark Giesbrecht and
Austin Lobo and
B. David Saunders},
 doi = {10.1145/271130.271194},
 journal = {{SIGSAM} Bull.},
 pages = {40},
 title = {Certifying inconsistency of sparse linear systems},
 url = {https://doi.org/10.1145/271130.271194},
 volume = {31},
 year = {1997}
}

[ 11 ]
Mark Giesbrecht and B. David Saunders. Parametric linear systems: the two parameter case. SIGSAM Bull., 31:40, 1997. [ http ]
@article{DBLP:journals/cca/GiesbrechtS97,
 author = {Mark Giesbrecht and
B. David Saunders},
 doi = {10.1145/271130.271195},
 journal = {{SIGSAM} Bull.},
 pages = {40},
 title = {Parametric linear systems: the two parameter case},
 url = {https://doi.org/10.1145/271130.271195},
 volume = {31},
 year = {1997}
}

[ 10 ]
Mark Giesbrecht. Efficient parallel solution of sparse systems of linear diophantine equations. In Hoon Hong, Erich Kaltofen, and Markus A. Hitz, editors, Proceedings of the 2nd International Workshop on Parallel Symbolic Computation, PASCO 1997, July 20-22, 1997, Kihei, Hawaii, USA, pages 1--10. ACM, 1997. [ http ]
@inproceedings{DBLP:conf/cap/Giesbrecht97,
 author = {Mark Giesbrecht},
 booktitle = {Proceedings of the 2nd International Workshop on Parallel Symbolic
Computation, {PASCO} 1997, July 20-22, 1997, Kihei, Hawaii, {USA}},
 doi = {10.1145/266670.266678},
 editor = {Hoon Hong and
Erich Kaltofen and
Markus A. Hitz},
 pages = {1--10},
 publisher = {{ACM}},
 title = {Efficient parallel solution of sparse systems of linear diophantine
equations},
 url = {https://doi.org/10.1145/266670.266678},
 year = {1997}
}



[ 1996 ]


[ 9 ]
Mark Giesbrecht. Probabilistic computation of the smith normal form of a sparse integer matrix. In Henri Cohen, editor, Algorithmic Number Theory, Second International Symposium, ANTS-II, Talence, France, May 18-23, 1996, Proceedings, volume 1122, pages 173--186. Springer, 1996. [ http ]
@inproceedings{DBLP:conf/ants/Giesbrecht96,
 author = {Mark Giesbrecht},
 booktitle = {Algorithmic Number Theory, Second International Symposium, ANTS-II,
Talence, France, May 18-23, 1996, Proceedings},
 doi = {10.1007/3-540-61581-4_53},
 editor = {Henri Cohen},
 pages = {173--186},
 publisher = {Springer},
 title = {Probabilistic Computation of the Smith Normal Form of a Sparse Integer
Matrix},
 url = {https://doi.org/10.1007/3-540-61581-4_53},
 volume = {1122},
 year = {1996}
}

[ 8 ]
Wayne Eberly and Mark Giesbrecht. Efficient decomposition of associative algebras. 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 170--178. ACM, 1996. [ http ]
@inproceedings{DBLP:conf/issac/EberlyG96,
 author = {Wayne Eberly and
Mark Giesbrecht},
 booktitle = {Proceedings of the 1996 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} '96, Zurich, Switzerland, July 24-26, 1996},
 doi = {10.1145/236869.236931},
 editor = {Erwin Engeler and
B. F. Caviness and
Yagati N. Lakshman},
 pages = {170--178},
 publisher = {{ACM}},
 title = {Efficient Decomposition of Associative Algebras},
 url = {https://doi.org/10.1145/236869.236931},
 year = {1996}
}



[ 1995 ]


[ 7 ]
Mark Giesbrecht. Nearly optimal algorithms for canonical matrix forms. SIAM J. Comput., 24:948--969, 1995. [ http ]
@article{DBLP:journals/siamcomp/Giesbrecht95,
 author = {Mark Giesbrecht},
 doi = {10.1137/S0097539793252687},
 journal = {{SIAM} J. Comput.},
 pages = {948--969},
 title = {Nearly Optimal Algorithms for Canonical Matrix Forms},
 url = {https://doi.org/10.1137/S0097539793252687},
 volume = {24},
 year = {1995}
}

[ 6 ]
V. Prasad Krothapalli, Thulasiraman Jeyaraman, and Mark Giesbrecht. Run-time parallelization of irregular DOACROSS loops. In Afonso Ferreira and José D. P. Rolim, editors, Parallel Algorithms for Irregularly Structured Problems, Second International Workshop, IRREGULAR '95, Lyon, France, September 4-6, 1995, Proceedings, volume 980, pages 75--80. Springer, 1995. [ http ]
@inproceedings{DBLP:conf/irregular/KrothapalliJG95,
 author = {V. Prasad Krothapalli and
Thulasiraman Jeyaraman and
Mark Giesbrecht},
 booktitle = {Parallel Algorithms for Irregularly Structured Problems, Second International
Workshop, {IRREGULAR} '95, Lyon, France, September 4-6, 1995, Proceedings},
 doi = {10.1007/3-540-60321-2_5},
 editor = {Afonso Ferreira and
Jos{\'{e}} D. P. Rolim},
 pages = {75--80},
 publisher = {Springer},
 title = {Run-Time Parallelization of Irregular {DOACROSS} Loops},
 url = {https://doi.org/10.1007/3-540-60321-2_5},
 volume = {980},
 year = {1995}
}

[ 5 ]
Mark Giesbrecht. Fast computation of the smith normal form of an integer matrix. 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 110--118. ACM, 1995. [ http ]
@inproceedings{DBLP:conf/issac/Giesbrecht95,
 author = {Mark Giesbrecht},
 booktitle = {Proceedings of the 1995 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} '95, Montreal, Canada, July 10-12, 1995},
 doi = {10.1145/220346.220361},
 editor = {A. H. M. Levelt},
 pages = {110--118},
 publisher = {{ACM}},
 title = {Fast Computation of the Smith Normal Form of an Integer Matrix},
 url = {https://doi.org/10.1145/220346.220361},
 year = {1995}
}



[ 1994 ]


[ 4 ]
Mark Giesbrecht. Fast algorithms for rational forms of integer matrices. In Malcolm A. H. MacCallum, editor, Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC '94, Oxford, UK, July 20-22, 1994, pages 305--311. ACM, 1994. [ http ]
@inproceedings{DBLP:conf/issac/Giesbrecht94,
 author = {Mark Giesbrecht},
 booktitle = {Proceedings of the International Symposium on Symbolic and Algebraic
Computation, {ISSAC} '94, Oxford, UK, July 20-22, 1994},
 doi = {10.1145/190347.190432},
 editor = {Malcolm A. H. MacCallum},
 pages = {305--311},
 publisher = {{ACM}},
 title = {Fast Algorithms for Rational Forms of Integer Matrices},
 url = {https://doi.org/10.1145/190347.190432},
 year = {1994}
}



[ 1993 ]




[ 1992 ]


[ 3 ]
Mark Giesbrecht. Fast algorithms for matrix normal forms. In 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pages 121--130. IEEE Computer Society, 1992. [ http ]
@inproceedings{DBLP:conf/focs/Giesbrecht92,
 author = {Mark Giesbrecht},
 booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
Pennsylvania, USA, 24-27 October 1992},
 doi = {10.1109/SFCS.1992.267812},
 pages = {121--130},
 publisher = {{IEEE} Computer Society},
 title = {Fast Algorithms for Matrix Normal Forms},
 url = {https://doi.org/10.1109/SFCS.1992.267812},
 year = {1992}
}

[ 2 ]
Mark Giesbrecht. Factoring in skew-polynomial rings. In Imre Simon, editor, LATIN '92, 1st Latin American Symposium on Theoretical Informatics, São Paulo, Brazil, April 6-10, 1992, Proceedings, volume 583, pages 191--203. Springer, 1992. [ http ]
@inproceedings{DBLP:conf/latin/Giesbrecht92,
 author = {Mark Giesbrecht},
 booktitle = {{LATIN} '92, 1st Latin American Symposium on Theoretical Informatics,
S{\~{a}}o Paulo, Brazil, April 6-10, 1992, Proceedings},
 doi = {10.1007/BFb0023829},
 editor = {Imre Simon},
 pages = {191--203},
 publisher = {Springer},
 title = {Factoring in Skew-Polynomial Rings},
 url = {https://doi.org/10.1007/BFb0023829},
 volume = {583},
 year = {1992}
}



[ 1991 ]




[ 1990 ]


[ 1 ]
Joachim von zur Gathen and Mark Giesbrecht. Constructing normal bases in finite fields. J. Symb. Comput., 10:547--570, 1990. [ http ]
@article{DBLP:journals/jsc/GathenG90,
 author = {Joachim von zur Gathen and
Mark Giesbrecht},
 doi = {10.1016/S0747-7171(08)80158-7},
 journal = {J. Symb. Comput.},
 pages = {547--570},
 title = {Constructing Normal Bases in Finite Fields},
 url = {https://doi.org/10.1016/S0747-7171(08)80158-7},
 volume = {10},
 year = {1990}
}



[ 1989 ]




[ 1988 ]




[ 1987 ]




[ 1986 ]




[ 1985 ]




[ 1984 ]




[ 1983 ]




[ 1982 ]




[ 1981 ]




[ 1980 ]




[ 1979 ]