Our Experts

Sandra Irani

Sandra Irani (PhD, UC Berkeley) principal research interests are in the design and analysis of algorithms. In particular, most of her research has been in the area of on-line algorithms. The term “on-line” refers to a relationship between the input stream and the output stream of an algorithm. Namely, the input is presented to the algorithm incrementally and the algorithm must produce part of the output with limited information about the problem. The question is then what kind of solution quality can one hope to obtain? Many problems that arise in Computer Science are on-line problems. Among these are processor scheduling, data structure management, robot motion planning, and resource allocation. Dr. Irani has worked on problems in on-line data structures, graph coloring, scheduling and paging.