| Representing (q–) hypergeometric products and mixed versions in difference rings ED Ocansey, C Schneider Waterloo Workshop on Computer Algebra, 175-213, 2016 | 15 | 2016 |
| Representation of hypergeometric products of higher nesting depths in difference rings. RISC Report Series 20-19 ED Ocansey, C Schneider Research Institute for Symbolic Computation (RISC), Johannes Kepler …, 0 | 4 | |
| Difference ring algorithms for nested products ED Ocansey PhD Thesis, 2019 | 3 | 2019 |
| The Matrix-Tree Theorem ED Ocansey Tersedia di: https://www. google. co. id/url, 2011 | 3 | 2011 |
| Representation of hypergeometric products of higher nesting depths in difference rings ED Ocansey, C Schneider Journal of Symbolic Computation 120, 1-50, 2024 | 2 | 2024 |
| Representation of hypergeometric products of higher nesting depths in difference rings ED Ocansey, C Schneider arXiv preprint arXiv:2011.08775, 2020 | 1 | 2020 |
| Enumeration problems on lattices ED Ocansey Stellenbosch: Stellenbosch University, 2013 | 1 | 2013 |
| Difference ring algorithms for nested products/submitted by Evans Doe Ocansey ED Ocansey | | 2019 |
| Representation of hypergeometric products in difference rings ED Ocansey, C Schneider | | |
| The Matrix Tree Theorem. A Talk given in the Mathematics Postgraduate Seminar at ED Ocansey | | |
Carsten SchneiderRISC, Johannes Kepler University LinzE-mailová adresa ověřena na: risc.jku.at
