arrhythmias (extended abstract) Elisa Fromont, Ren´e Quiniou, Marie-Odile Cordier We are interested in using parallel universes to learn interpretable models that can be subseque...
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
We introduce the oak property of first order theories, which is a syntactical condition that we show to be sufficient for a theory not to have universal models in cardinality whe...
We consider a finite universe U (more exactly - a family U of them), second order quantifiers QK , where for each U this means quantifying over a family of n(K)-place relations clo...
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...