CICM 2009


LINKS

Ontario Research Centre for Computer Algebra


Ontario Research Centre for Computer Algebra

Second Workshop on

Compact Computer Algebra

CICM 2009

July 10, 2009. Grand Bend, ON, Canada

In the 1970s and 80s the developers of CAS had to know how implement highly efficient systems. To deploy computer algebra in today's personal devices or to make computer algebra available as component in larger software systems we must continue to use and extend this knowledge.
As high end hardware configuration grow, the CA systems can be used to handle ever larger problems. However, as low end configurations become more powerful, we can move to ever smaller devices. In the same way, when CAS is used as a component to a larger systems, it needs to provide only those capabilities that are required by the component.

After the success of the first session on Compact Computer Algebra at ACA 2008, this workshop continues the series of events dedicated to the whole spectrum of issues of compact CA including, but not limited to

  • space-efficient data structures
  • memory-efficient implementations
  • compact kernels
  • math education tools
  • portable and Internet-accessible symbolic calculators
  • CAS for personal digital assistants
  • "spell checkers" for math content in document processing software
  • validators for online and offline mathematical recognizers
  • backend engines to pen-computing interfaces
  • math editing components for 2D expression

Invited Speaker

Submissions

If you are interested in presenting your work at CCA, please visit Call for Papers and Software Demos page for instructions on submission for contributions.

Important Dates

  • Abstracts Due
  • -- June 15
  • CICM Conference
  • -- July 6-12
  • Compact Computer Algebra Workshop  
  • -- July 10

    Programme

    08:55 - 09:00 Elena Smirnova Session opening and welcome
    09:00 - 09:30 Gaston Gonnet 28.5 years of Maple: how many of the design principles of a compact system paid dividends
    09:30 - 10:00 James H. Davenport Small algorithms for small systems
    10:00 - 10:30 Md. Nazrul Islam Optimization techniques for matrix multiplication
    10:30 - 11:00 Coffee break
    11:00 - 11:30 Mahdi Javadi In-place arithmetic for univariate polynomials over an Algebraic Number Field
    11:30 - 12:00 Oleg Golubitsky Compact classification of handwritten mathematical symbols
    Lunch and informal discussions
    3:00 - 4:00 Plenary Talk: John Fitch CAMAL 40 Years on -- is small still beautiful?
    4:00 - 4:20 Coffee break
    4:20 - 4:50 Paul Vrbik Lazy and forgetful polynomial arithmetic and applications
    4:50 - 5:20 Keith O. Geddes Criteria for compactness in the design of Maple
    5:20 - 5:30 Stephen Watt Session closing

    Organizers


    Page maintained by Elena Smirnova