Abstract: Improvisation is often described as "acting without preparation", with an element of randomness. Can an algorithm improvise? What does it mean for an algorithm to improvise?

Abstract: We consider undirected, connected graphs with nonnegative weights on the edges. Additionally, a special subset of vertices called terminals is provided as input.

Abstract: An algorithm for generating interpolants for formulas which are conjunctions of quadratic polynomial inequalities (both strict and nonstrict) is proposed.

Abstract: From the early days of wireless networking research, graphs have commonly been used to model wireless communications and interference. Much theoretical work was done on simple range models, like Unit Disc Graphs.

Abstract: Over the last 3--4 years, there has been a sudden surge of results in arithmetic circuit lower bounds, specifically for shallow circuits (depth 3 or 4).