Computer Science
- Victor Aladjev, Computer algebra system Maple: A new software library, Proceedings of the International Conference held in Melbourne and St. Petersburg, June 2-4, 2003, Lecture Notes in Computer Science, vol. 2657, Springer-Verlag, Berlin, 2003, pp. lvi+1095.[MR]
- M. D. Atkinson, The complexity of algorithms, Computing Tomorrow, Cambridge Univ. Press, Cambridge, 1996, pp. 1–20.[MR]
- Joseph L. Awange and Erik W. Grafarend, Solving Algebraic Computational Problems in Geodesy and Geoinformatics, Springer-Verlag, Berlin, 2005, pp. xviii+333.[MR]
- László Babai and Robert Beals, A polynomial-time theory of black box groups. I, Groups St. Andrews 1997 in Bath, I, London Math. Soc. Lecture Note Ser., vol. 260, Cambridge Univ. Press, Cambridge, 1999, pp. 30–64.[MR]
- Clemens Ballarin, Computer algebra and thereom proving, PhD Thesis, University of Cambridge, 1999.[link]
- Clemens Ballarin, Jacques Calmet, and Peter Kullmann, Integration of deduction and computation, Preprint (2000), 19 pages.
- Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din, and Eric Schost, On the geometry of polar varieties, Appl. Algebra Engrg. Comm. Comput. 21 (2010), no. 1, 33–83.[MR/doi]
- David C. Banks and Stephen Linton, Counting cases in marching cubes: toward a generic algorithm for producing substitopes, in VIS '03: Proceedings of the 14th IEEE Visualization 2003 (VIS'03), IEEE Computer Society, Washington, DC, USA, 2003, pp. 8.[doi]
- Michael J. Beeson, The mechanization of mathematics, Alan Turing: Life and Legacy of a Great Thinker, Springer, Berlin, 2004, pp. 77–134.[MR]
- J. Borwein and P. Borwein, Challenges in mathematical computing, Computing in Science and Engineering 3 (2001), 48–53.
- Wieb Bosma and John Cannon (eds.), Discovering Mathematics with Magma, Algorithms and Computation in Mathematics, vol. 19, Springer-Verlag, Berlin, 2006, pp. xxiv+374.[MR]
- Wieb Bosma, John Cannon, and Catherine Playoust, The Magma algebra system. I. The user language, J. Symbolic Comput. 24 (1997), no. 3-4, 235–265.[MR]
- Mireille Boutin and Gregor Kemper, On reconstructing n-point configurations from the distribution of distances or areas, Adv. in Appl. Math. 32 (2004), no. 4, 709–735.[MR]
- Mireille Boutin and Gregor Kemper, On reconstructing configurations of points in P2 from a joint distribution of invariants, Appl. Algebra Engrg. Comm. Comput. 15 (2005), no. 6, 361–391.[MR]
- Mireille Boutin and Gregor Kemper, Which point configurations are determined by the distribution of their pairwise distances?, Internat. J. Comput. Geom. Appl. 17 (2007), no. 1, 31–43.[MR]
- Gregory Butler and John J. Cannon, Cayley, Version 4: The user language, in ISSAC '88: Proceedings of the 1988 International Symposium on Symbolic and Algebraic Computation, vol. 358, Springer-Verlag, Berlin, 1988, pp. 456-466.
- John Cannon and Catherine Playoust, Magma: A new computer algebra system, Euromath Bull. 2 (1996), no. 1, 113–144.[MR]
- Olga Caprotti, James H. Davenport, Mike Dewar, and Julian Padget, Mathematics on the (Semantic) NET, The Semantic Web: Research and Applications, Lecture Notes in Comput. Sci., vol. 3053, 2004, pp. 213–224.
- Bonifacio Castano, Joos Heintzb, Juan Llovet, and Raquel Martinez, On the data structure straight-line program and its implementation in symbolic computation, Mathematics and Computers in Simulation 51 (2000), no. 5, 497–528.
- Murat Cenk and Ferruh Özbudak, On multiplication in finite fields, J. Complexity 26 (2010), no. 2, 172–186.[doi]
- Martin Clayton, Computer algebra software, Particle Physics and Astronomy Research Council (1997), no. 47.1, 16 pages.
- Arjeh Cohen, Scott H. Murray, Martin Pollet, and Volker Sorge, Certifying solutions to permutation group problems, Automated Deduction - CADE-19, Lecture Notes in Computer Science, vol. 2741, Springer Berlin/Heidelberg, 2003, pp. 258–273.
- Henri Cohen, A Course in Computational Algebraic Number Theory, Graduate Texts in Mathematics, vol. 138, Springer-Verlag, Berlin, 1993, pp. xii+534.[MR]
- Marston Conder, Semi-automated theorem proving – the impact of computers on research in pure mathematics, in Proceedings of the First Asian Technology Conference in Mathematics. Singapore, December 1995, 1995, pp. 1–8.
- Gene Cooperman, Parallel GAP: Mature interactive parallel computing, Groups and computation, III (Columbus, OH, 1999), Ohio State Univ. Math. Res. Inst. Publ., vol. 8, de Gruyter, Berlin, 2001, pp. 123–138.[MR]
- M. Daberkow, C. Fieker, J. Klüners, M. Pohst, K. Roegner, M. Schörnig, and K. Wildanger, KANT V4, J. Symbolic Comput. 24 (1997), no. 3-4, 267–283.[MR]
- James H. Davenport, A small OpenMath type system, SIGSAM Bull. 34 (2000), no. 2, 16–21.[doi]
- James H. Davenport, Abstract data types in computer algebra, Mathematical Foundations of Computer Science 2000 (Bratislava), Lecture Notes in Comput. Sci., vol. 1893, Springer, Berlin, 2000, pp. 21–35.[MR]
- James H. Davenport, Equality in computer algebra and beyond, J. Symbolic Comput. 34 (2002), no. 4, 259–270.[MR]
- Wolfram Decker, Some introductory remarks on computer algebra, European Congress of Mathematics, Vol. II (Barcelona, 2000), Progr. Math., vol. 202, Birkhäuser, Basel, 2001, pp. 121–142.[MR]
- Michael J. Dinneen, Geoffrey Pritchard, and Mark C. Wilson, Degree- and time-constrained broadcast networks, Networks 39 (2002), no. 3, 121–129.[MR]
- C. Dominquez, J. Rubio, and F. Sergeraert, Modelling inheritance as coercion in the Kenzo system, Journal of Universal Computer Science 12 (2006), 1701–1730.
- Andreas Döring, Kooperation eines theorembeweisers und eines computeralgebrasystems, PhD Thesis, Institut für Algorithmen und Kognitive Systeme, Universität Karlsruhe, 1994.
- Nicholas James Doye, Order sorted computer algebra and coercions, PhD Thesis, University of Bath, 1997.
- Andreas Franke and Michael Kohlhase, System description: mathweb, an agent-based communication layer for distributed automated theorem proving, Automated Deduction - Cade-16: Proceedings of the 16th International Conference on Automated Deduction, Trento, Italy, July 1999, Lecture Notes in Computer Science, vol. 1632, Springer, Berlin, Heidelberg, 1999, pp. 243–258.
- Harald Ganzinger (ed.), Automated deduction—CADE-16, in Proceedings of the 16th International Conference held in Trento, July 7–10, 1999, Lecture Notes in Computer Science, vol. 1632, Springer-Verlag, Berlin, 1999, pp. xiv+429.[MR]
- Willi Geiselmann, Jörn Müller-Quade, and Rainer Steinwandt, Comment on: "A new representation of elements of finite fields GF(2m) yielding small complexity arithmetic circuits" by G. Drolet, IEEE Trans. Comput. 51 (2002), no. 12, 1460–1461.[MR]
- Willi Geiselmann and Rainer Steinwandt, Yet another sieving device, Topics in Cryptology—CT-RSA 2004, Lecture Notes in Comput. Sci., vol. 2964, Springer, Berlin, 2004, pp. 278–291.[MR]
- Willi Geiselmann and Rainer Steinwandt, Non-wafer-scale sieving hardware for the NFS: another attempt to cope with 1024-bit, Advances in cryptology—EUROCRYPT 2007, Lecture Notes in Comput. Sci., vol. 4515, Springer, Berlin, 2007, pp. 466–481.[MR/link]
- Ian P. Gent, Warwick Harvey, Tom Kelsey, and Steve Linton, Generic SBDD using computational group theory, Principles and Practice of Constraint Programming, CP 2003: 9th International Conference, CP 2003, Kinsale, Ireland, September 29-October 3,2003,Proceedings, Lecture Notes in Comput. Sci., vol. 2833, Springer, Berlin, 2003, pp. 333-347.
- Florent Hivert and Nicolas M. Thiéry, MuPAD-Combinat, an open-source package for research in algebraic combinatorics, Sém. Lothar. Combin. 51 (2004/05), Art. B51z, 70 pp. (electronic).[MR]
- Derek F. Holt, Bettina Eick, and Eamonn A. O'Brien, Handbook of Computational Group Theory, Discrete Mathematics and its Applications (Boca Raton), Chapman &Hall/CRC, Boca Raton, FL, 2005, pp. xvi+514.[MR]
- Karsten Homann, Symbolisches lösung mathematischer probleme durch kooperation algorithmischer und logischer systeme, PhD Thesis, Fakultät für Informatik der Universität Karlsruhe, 1996.
- Karsten Homann and Jacques Calmet, Combining theorem proving and symbolic mathematical computing, Selected Papers from the Second International Conference on Integrating Symbolic Mathematical Computation and Artificial Intelligence, Lecture Notes in Comput. Sci., vol. 958, Springer, London, 1994, pp. 18–29.
- Gabriela Jeronimo, Teresa Krick, Juan Sabia, and Martín Sombra, The computational complexity of the Chow form, Found. Comput. Math. 4 (2004), no. 1, 41–117.[MR]
- David Joyner and William Stein, SAGE: System for algebra and geometry experimentation, SIGSAM Bull. 39 (2005), no. 2, 61–64.
- Cezary Kaliszyk and Freek Wiedijk, Certified computer algebra on top of an interactive theorem prover, Towards Mechanized Mathematical Assistants, Lecture Notes in Computer Science, vol. 4573/2007, Springer Berlin / Heidelberg, 2007, pp. 94–105.
- William M. Kantor, Sylow's theorem in polynomial time, J. Comput. System Sci. 30 (1985), no. 3, 359–394.[MR]
- Andrei Kelarev, Graph algebras and automata, Monographs and Textbooks in Pure and Applied Mathematics, vol. 257, Marcel Dekker Inc., New York, 2003, pp. viii+366.[MR]
- Robert H. Lewis and Michael Wester, Comparison of polynomial-oriented computer algebra systems, SIGSAM Bull. 33 (1999), no. 4, 5–13.[doi]
- Xin Li, Marc Moreno Maza, and Éric Schost, On the virtues of generic programming for symbolic computation, Computational Science - ICCS 2007, Lecture Notes in Computer Science, vol. 4488/2007, Springer Berlin / Heidelberg, 2007, pp. 379–596.
- Eugene M. Luks and Pierre McKenzie, Parallel algorithms for solvable permutation groups, J. Comput. System Sci. 37 (1988), no. 1, 39–62.[MR]
- S. Marcugini and F. Pambianco, Minimal 1-saturating sets in PG(2,q), q ≤ 16, Australas. J. Combin. 28 (2003), 161–169.[MR]
- José M. Martín-García, xPerm: Fast index canonicalization for tensor computer algebra, Comput. Phys. Comm. 179 (2008), no. 8, 597–603.[doi/arXiv]
- J. Neubüser, H. Pahlings, and W. Plesken, CAS; design and use of a system for the handling of characters of finite groups, Computational Group Theory (Durham, 1982), Academic Press, London, 1984, pp. 195–247.[MR]
- V. Niculescu and G. S. Moldovan, Building an object oriented computational algebra system based on design patterns, in SYNASC 2005: Symbolic and Numeric Algorithms for Scientific Computing, 2005, 2005, 8 pages.[doi]
- Virginia Niculescu, OOLACA: An object oriented library for abstract and computational algebra, in OOPSLA '04: Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications, ACM Press, New York, NY, USA, 2004, pp. 160–161.[doi]
- David Nister, Richard Hartley, and Henrik Stewenius, Using Galois theory to prove structure from motion algorithms are optimal, in Computer Vision and Pattern Recognition, 2007. CVPR '07, 17-22 June 2007, 8 pages.[doi]
- Masayuki Noro, Modular dynamic evaluation, in ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, ACM Press, New York, NY, USA, 2006, pp. 262–268.[doi]
- S. Petitjean, Algebraic geometry and computer vision: Polynomial systems, real and complex roots, J. Math. Imaging Vision 10 (1999), no. 3, 191–220.[MR]
- Tomaz Pisanski, Marko Boben, and Arjana Zitnik, Interactive conjecturing with VEGA, Fajtlowicz, Siemion (ed.) et al., Graphs and Discovery, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 69, American Mathematical Society (AMS), Providence, RI, 2005, pp. 351–364.
- Cheryl E. Praeger, Computers in algebra: New answers, new questions, J. Korean Math. Soc. 38 (2001), no. 4, 763–780.[MR]
- Virgile Prevosto and Damien Doligez, Algorithms and proofs inheritance in the Foc language, J. Automat. Reason. 29 (2002), no. 3-4, 337–363.[MR]
- I. I. Reznikov and V. I. Sushchanskii, A software system for growth analysis of Mealy automata, Cybernetics and Systems Analysis 42 (2006), no. 2, 265–276.[link]
- Fabrice Rouillier, Mohab Safey El Din, and Éric Schost, Solving the Birkhoff interpolation problem via the critical point method: an experimental study, ADG '00: Revised Papers from the Third International Workshop on Automated Deduction in Geometry (Zurich, 2000), Lecture Notes in Computer Science, vol. 2061, Springer-Verlag, Berlin, 2001, pp. viii+325.[MR]
- Stephen T. Schibell and Richard M. Stafford, Processor interconnection networks from Cayley graphs, Discrete Appl. Math. 40 (1992), no. 3, 333–357.[MR]
- Fritz Schwarz, ALL TYPES: An algebraic language and type system, Artificial Intelligence and Symbolic Computation: International Conference AISC'98, Plattsburgh, New York, USA, September 1998. Proceedings, Lecture Notes in Computer Science, vol. 1476, Springer, Berlin, 1998, pp. 270.
- Lewis Stiller, Exploiting Symmetry on Parallel Architectures, PhD Thesis, John Hopkins University, 1995.
- Lewis Stiller, Multilinear algebra and chess endgames, Games of no Chance (Berkeley, CA, 1994), Math. Sci. Res. Inst. Publ., vol. 29, Cambridge Univ. Press, Cambridge, 1996, pp. 151–192.[MR]
- Katsushi Waki, An introduction to magma (japanese), Noda, Matu-Tarow (ed.). Research on the theory and applications of computer algebra. Proceedings of a symposium held at the Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan, November 16–18, 1994., RIMS Kokyuroku, vol. 920, Kyoto University, Kyoto, 1995, pp. 173–179.
- Stephen M. Watt, Peter A. Broadbery, Samuel S. Dooley, Pietro Iglio, Scott C. Morrison, Jonathan M. Steinbach, and Robert S. Sutor, A first report on the A Sharp compiler, in von zur Gathen, Joachim and Giesbrecht, Mark (ed.), ISSAC '94. Proceedings of the 1994 International Symposium on Symbolic and Algebraic Computation. Oxford, U.K., July 20–22, 1994. New York, NY: ACM Press, 1994, pp. 25–31.
- Oliver Wienand, Markus Wedler, Dominik Stoffel, Wolfgang Kunz, and Gert-Martin Greuel, An algebraic approach for proving data correctness in arithmetic data paths, Computer Aided Verification, Lecture Notes in Computer Science, vol. 5123, Springer Berlin/Heidelberg, 2008, pp. 473–486.
- Jian Xu, MEI - A module system for mechanized mathematics, PhD Thesis, McMasters University, 2008.[link]
- André Yamba Yamba, Krister Ahlander, and Malin Ljungberg, Designing for geometrical symmetry exploitation, Scientific Programming 14 (2006), no. 2, 61–80.[link]
- Jürgen Zimmer and Louise A. Dennis, Inductive theorem proving and computer algebra in the MathWeb Software Bus, Artificial Intelligence, Automated Reasoning, and Symbolic Computation, Lecture Notes in Comput. Sci., vol. 2385, Springer, Berlin, 2002, pp. 319–331.[MR]