Browsing by Author "Díaz Cort, Josep"
Now showing items 1-20 of 94
-
A new distribution to do statistics on k-ary trees
Cases Muñoz, Rafael; Díaz Cort, Josep; Martínez Parra, Conrado (1990-04-02)
Research report
Open AccessIn this paper we study distributions on k-ary trees, which from the point of doing statistics on trees, they behave in a more realistic way than the usual uniform distribution. In particular, we choose a distribution for ... -
A new upper bound for 3-SAT
Díaz Cort, Josep; Lefteris, Kirousis; Mitsche, Dieter; Perez-Gimenez, Xavier (Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2008)
Conference report
Open AccessWe show that a randomly chosen 3-CNF formula over n variables with clauses-tovariables ratio at least 4.4898 is asymptotically almost surely unsatisfiable. The previous best such bound, due to Dubois in 1999, was 4.506. ... -
A note on the query complexity of learning DFA
Balcázar Navarro, José Luis; Díaz Cort, Josep; Gavaldà Mestre, Ricard; Watanabe, Osamu (1992)
Research report
Open AccessIt is known that the class of deterministic finite automata is polynomial time learnable by using membership and equivalence queries. We investigate -- the query complexity -- the number of membership and equivalence queries ... -
A note on the subgraphs of the (2×\infty)-grid
Díaz Cort, Josep; Kaminski, Marcin; Thilikos Touloupas, Dimitrios (2010-02)
Article
Restricted access - publisher's policyWe give a linear-time algorithm checking whether a graph is a subgraph of the (2×k)-grid for some value of k. Our algorithm is based on a detailed characterization of the structure of such graphs. -
A personal account of Turing’s imprint on the development of computer science
Díaz Cort, Josep; Torras, Carme (Elsevier, 2012)
Article
Open AccessThe rst part of the XX century saw the development of the digital computer and the eld of computer science. In the present paper, we sketch our vision of that period and of the role that Alan Turing and some of his ... -
A Random graph model for optical networks of sensors
Díaz Cort, Josep; Petit Silvestre, Jordi; Serna Iglesias, María José (2002-12)
Research report
Open AccessIn this paper we propose a model for Smart Dust Networks and show its applicability when the goal of the network is monitoring an area under the surveillance of a base station. We analyze basic parameters of these nets and ... -
A Survey on graph layout problems
Díaz Cort, Josep; Petit Silvestre, Jordi; Serna Iglesias, María José (2000-10)
Research report
Open AccessIn this paper we survey results on several graph layout problems from an algorithmic point of view. Graph layout problems are a particular class of combinatorial optimization problems whose goal is to find a linear layout ... -
Absorption time of the Moran process
Díaz Cort, Josep; Goldberg, Leslie Ann; Richerby, David; Serna Iglesias, María José (2016-08-01)
Article
Open Access© 2016 Wiley Periodicals, Inc. The Moran process models the spread of mutations in populations on graphs. We investigate the absorption time of the process, which is the time taken for a mutation introduced at a randomly ... -
Adversarial models for priority-based networks
Álvarez Faura, M. del Carme; Díaz Cort, Josep; Blesa Aguilera, Maria Josep; Fernández Anta, Antonio; Serna Iglesias, María José (2003-06)
Research report
Open AccessWe propose several variations of the adversarial queueing model. The priority model takes into account the case in which the packets can have different priorities, assigned by the adversary at injection time. The ... -
Algorithmically efficient syntactic characterization of possibility domains
Díaz Cort, Josep; Kirousis, Lefteris; Kokonezi, Sofia; Livieratos, John (2019-10-10)
Article
Open AccessIn the field of Judgment Aggregation, a domain, that is a subset of a Cartesian power of {0, 1}, is considered to reflect abstract rationality restrictions on vectors of two-valued judgments on a number of issues. We are ... -
Algorithms for learning finite automata from queries: a unified view
Balcázar Navarro, José Luis; Díaz Cort, Josep; Gavaldà Mestre, Ricard; Watanabe, Osamu (1996-09)
Research report
Open AccessIn this survey we compare several known variants of the algorithm for learning deterministic finite automata via membership and equivalence queries. We believe that our presentation makes it easier to understand what ... -
ALGORÍSMICA
Díaz Cort, Josep (Universitat Politècnica de Catalunya, 2012-01-18)
Exam
Restricted access to the UPC academic community -
ALGORÍSMICA (Examen 1r quadrim)
Díaz Cort, Josep (Universitat Politècnica de Catalunya, 2002-01-16)
Exam
Restricted access to the UPC academic community -
ALGORÍSMICA (Examen 1r quadrim)
Díaz Cort, Josep (Universitat Politècnica de Catalunya, 2004-01-09)
Exam
Restricted access to the UPC academic community -
ALGORÍSMICA (Examen 1r quadrim)
Díaz Cort, Josep (Universitat Politècnica de Catalunya, 1999-01-27)
Exam
Restricted access to the UPC academic community -
ALGORÍSMICA (Examen 1r quadrim)
Díaz Cort, Josep (Universitat Politècnica de Catalunya, 2000-01-29)
Exam
Restricted access to the UPC academic community -
ALGORÍSMICA (Examen 1r quadrim)
Díaz Cort, Josep; Pérez, X. (Universitat Politècnica de Catalunya, 2005-01-14)
Exam
Restricted access to the UPC academic community -
ALGORÍSMICA (Examen 1r quadrim)
Díaz Cort, Josep (Universitat Politècnica de Catalunya, 2006-01-12)
Exam
Restricted access to the UPC academic community -
ALGORÍSMICA (Examen 1r quadrim)
Díaz Cort, Josep (Universitat Politècnica de Catalunya, 2000-06-25)
Exam
Restricted access to the UPC academic community -
ALGORÍSMICA (Examen 1r quadrim)
Díaz Cort, Josep (Universitat Politècnica de Catalunya, 2008-01-07)
Exam
Restricted access to the UPC academic community