skip to main content
Department of Computer Science University of Colorado Boulder
cu: home | engineering | mycuinfo | about | cu a-z | search cu | contact cu cs: about | calendar | directory | catalog | schedules | mobile | contact cs
home · events · colloquia · 2005-2006 · 

Colloquium - Rajopadhye

ECCR 265

Simplifying Reductions
Colorado State University
Sanjay Rajopadhye photo

We present a technique to reduce the computational complexity of the algorithm embodied in a program. Our technique, which can be automated to be used in a compiler, works for a class of programs called affine control loops, or equivalently, equational programs over polyhedral domains. The method is optimal in the sense that the final program has the smallest possible polynomial complexity. We have used it to derive an O(n3) program from an O(n4) formulation of an algorithm that arises in RNA folding. Researchers in the field took over 8 years to discover the improved algorithm. This is joint work with PhD student Gautam Gupta.

The Department holds colloquia throughout the Fall and Spring semesters. These colloquia, open to the public, are typically held on Thursday afternoons, but sometimes occur at other times as well. If you would like to receive email notification of upcoming colloquia, subscribe to our Colloquia Mailing List. If you would like to schedule a colloquium, see Colloquium Scheduling.

Sign language interpreters are available upon request. Please contact Stephanie Morris at least five days prior to the colloquium.

See also:
Department of Computer Science
College of Engineering and Applied Science
University of Colorado Boulder
Boulder, CO 80309-0430 USA
Send email to

Engineering Center Office Tower
ECOT 717
FAX +1-303-492-2844
XHTML 1.0/CSS2 ©2012 Regents of the University of Colorado
Privacy · Legal · Trademarks
May 5, 2012 (13:29)