d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Let G = (V, E) be a graph with n vertices and m ≥ 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Ω(m3 /n2 ) pairs of crossing edges; or ...
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
Analyzing metabolic pathways by means of their steady states has proven to be accurate and efficient for practical purposes. The models such as elementary flux modes (EFMs) and ex...
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...