Abstract: We consider the problem of computing a large stable matching in a bipartite graph G = (A U B, E) where each vertex ranks its neighbors in an order of preference, perhaps involving ties.The goal is to compute a large stable matching.
Let s be a point source of light inside an n-sided polygon P. A polygonal path from s to some point t inside P is called a diffuse reflection path if the turning points of the path lie on edges of P.
Abstract: In many applications, users strategically choose paths in a network to minimize the congestion they face. Examples of such applications are road traffic, data networks, and machine scheduling.
Abstract: Testing and debugging scientific applications is a difficult task, in particular for large-scale parallel programs and floating-point programs.
Abstract: In this talk, I will describe concolic testing, also known as directed automated random testing (DART) or dynamic symbolic execution, an efficient way to automatically and systematically generate test inputs for prog
Abstract: Extensionality axioms are common when reasoning about data collections, such as arrays and functions in program analysis, or sets in mathematics.
Abstract: The Graph Coloring problem is to efficiently color the vertices of a graph on n vertices using as few colors as possible such that no edge is monochromatic.
