This paper describes the design, implementation, and testing of a system for selecting necessary axioms from a large set also containing superfluous axioms, to obtain a proof of a...
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
In this paper we present a practical heuristic attack on the Ko, Lee et al. key exchange protocol introduced at Crypto 2000 [10]. One of the ideas behind our attack is using Dehorn...
Alexei G. Myasnikov, Vladimir Shpilrain, Alexander...
Reducingcommunicationoverheadhas been widely recognized as a requirement for achieving efficient mappings which substantially reduce the execution time of parallel algorithms. Th...