@article{Sandford26,abbr={ISSAC},bibtex_show={true},author={Sandford, Ryan},title={Complexity Bounds for the Generalization of Fulton's Intersection Multiplicity Algorithm},journal={ACM Commun. Comput. Algebra},year={2026},volume={59},number={4},pages={112--115},publisher={Association for Computing Machinery},issn={1932-2232},doi={10.1145/3832046.3832057},url={https://doi.org/10.1145/3832046.3832057},pdf={https://dl.acm.org/doi/epdf/10.1145/3832046.3832057}}
2022
MT
Computing Intersection Multiplicities with Regular Chains
Gerhard, Jürgen,
Moreno-Maza, Marc,
and Sandford, Ryan
@inproceedings{conf/mt/Gerhard22,abbr={MT},bibtex_show={true},author={Gerhard, Jürgen and Moreno-Maza, Marc and Sandford, Ryan},editor={Corless, Robert M.},title={Computing Intersection Multiplicities with Regular Chains},booktitle={Maple Transactions},volume={2},issue={1},year={2022},month=sep,pdf={https://mapletransactions.org/index.php/maple/article/view/14463/11897},slides={MT2021_slides.pdf},url={https://doi.org/10.5206/mt.v2i1.14463},doi={10.5206/mt.v2i1.14463}}
THESIS
Towards a Generalization of Fulton’s Intersection Multiplicity Algorithm
@mastersthesis{sandford_2022,abbr={THESIS},bibtex_show={true},author={Sandford, Ryan},title={Towards a Generalization of Fulton's Intersection Multiplicity Algorithm},school={The University of Western Ontario},year={2022},month=apr,url={https://hdl.handle.net/20.500.14721/32012},pdf={https://uwo.scholaris.ca/server/api/core/bitstreams/03fbb6e8-ae68-45b5-b942-330cb3f800fd/content},slides={thesis_slides.pdf}}
2021
CASC
Towards Extending Fulton’s Algorithm for Computing Intersection Multiplicities
Beyond the Bivariate Case
Moreno-Maza, Marc,
and Sandford, Ryan
In Computer Algebra in Scientific Computing - 23rd International Workshop,
CASC 2021, Sochi, Russia, September 13-17, 2021, Proceedings
2021
@inproceedings{conf/casc/MazaS21,abbr={CASC},bibtex_show={true},author={Moreno-Maza, Marc and Sandford, Ryan},editor={Boulier, Fran{\c{c}}ois and England, Matthew and Sadykov, Timur M. and Vorozhtsov, Evgenii V.},title={Towards Extending Fulton's Algorithm for Computing Intersection Multiplicities
Beyond the Bivariate Case},booktitle={Computer Algebra in Scientific Computing - 23rd International Workshop,
{CASC} 2021, Sochi, Russia, September 13-17, 2021, Proceedings},series={Lecture Notes in Computer Science},volume={12865},pages={232--251},publisher={Springer},year={2021},auth={casc2021-author-manuscript.pdf},slides={im_casc_slides.pdf},url={https://doi.org/10.1007/978-3-030-85165-1_14},doi={10.1007/978-3-030-85165-1_14},timestamp={Fri, 20 Aug 2021 08:50:11 +0200}}
LMCS
2-adjoint equivalences in homotopy type theory
Carranza, Daniel,
Chang, Jonathan,
Kapulkin, Chris,
and Sandford, Ryan
@article{journals/lmcs/CarranzaCKS21,abbr={LMCS},bibtex_show={true},author={Carranza, Daniel and Chang, Jonathan and Kapulkin, Chris and Sandford, Ryan},title={2-adjoint equivalences in homotopy type theory},journal={Logical Methods in Computer Science},volume={17},number={1},year={2021},pdf={https://lmcs.episciences.org/7124/pdf},slides={2adj_slides.pdf},url={https://doi.org/10.23638/LMCS-17(1:3)2021},doi={10.23638/LMCS-17(1:3)2021},timestamp={Tue, 26 Jan 2021 15:58:27 +0100}}