We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...
Software applications typically have many features that vary in their similarity. We define a measurement of similarity between pairs of features based on their underlying implem...
Jay Kothari, Trip Denton, Spiros Mancoridis, Ali S...
We give a polynomial-time oracle algorithm for Tournament Canonization that accesses oracles for Tournament Isomorphism and Rigid-Tournament Canonization. Extending the Babai-Luks ...