4 papers
Computing the sequence of -cardinality assignments
Amnon Rosenmann
The -cardinality assignment problem asks for finding a maximal (minimal) weight of a matching of cardinality in a weighted bipartite graph , . The algorit…
On the Distance between Timed Automata
Amnon Rosenmann
The problem of inclusion of the language accepted by timed automaton (e.g., the implementation) in the language accepted by (e.g., the specification) is, in general, undeci…
Circular automata synchronize with high probability
Christoph Aistleitner, Daniele D'Angeli, Abraham Gutierrez +2
In this paper we prove that a uniformly distributed random circular automaton of order synchronizes with high probability (whp). More precisely, we prove that $…
Polynomial convolutions in max-plus algebra
Amnon Rosenmann, Franz Lehner, Aljosa Peperko
Recently, in a work that grew out of their exploration of interlacing polynomials, Marcus, Spielman and Srivastava and then Marcus studied certain combinatorial polynomial convolut…