In this paper we introduce executions of place/transition Petri nets with weighted inhibitor arcs (PTI-net) as enabled labeled stratified order structures (LSOs) and present a po...
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. W...
Ariel D. Procaccia, Aviv Zohar, Yoni Peleg, Jeffre...
Abstract. Left deteministic linear languages are a subclass of the context free languages that includes all the regular languages. Recently was proposed an algorithm to identify in...
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...