Exploració per autor "Díaz Cort, Josep"Més informacióMés informació

Ara es mostren els items 86-94 de 94

    • The Complexity of deciding stability under FFS in the adversarial model 

      Álvarez Faura, M. del Carme; Blesa Aguilera, Maria Josep; Díaz Cort, Josep; Fernández Anta, Antonio; Serna Iglesias, María José (2003-04)
      Report de recerca
      Accés obert
      In this paper we show the polynomial time decidability of the stability property under FFS in the case that the adversary can solve ties arbitrarily. This results follows from a characterization of the stability property ...

    • The Complexity of restrictive H-coloring 

      Díaz Cort, Josep; Serna Iglesias, María José; Thilikos Touloupas, Dimitrios (2002-03)
      Report de recerca
      Accés obert
      We define a variant of the H-coloring problem where the number of preimages of certain vertices is predetermined as part of the problem input. We consider the decision and the counting version of the problem, namely ...

    • The Hanoi's lectures 

      Díaz Cort, Josep (1985)
      Report de recerca
      Accés obert
      This set of notes are the core of the lectures given at the Department of Systems theory and Optimal Control in the Institute of Computer Science and Cybernetics of Hanoi, in June of 1985. They are incomplete, and form ...

    • The MINSUMCUT problem 

      Díaz Cort, Josep; Gibbons, Alan M.; Paterson, Michael Stewart; Torán Romero, Jacobo (1991-01)
      Report de recerca
      Accés obert
      In this paper we first present a sequential linear algorithm for an linear arrangement problem on trees, the MINSUMCUT, and then a 0(log n) time parallel algorithm for the MINSUMCUT on trees, which uses n [super 2]/(log ...

    • The multicolored graph realization problem 

      Díaz Cort, Josep; Yasar Diner, Oznur; Serna Iglesias, María José; Serra Albó, Oriol (Elsevier, 2022-07-01)
      Article
      Accés obert
      We introduce the multicolored graph realization problem (MGR). The input to this problem is a colored graph (G, φ), i.e., a graph G together with a coloring φ on its vertices. We associate each colored graph (G, φ) with a ...

    • The social cost of congestion games by imposing variable delays 

      Díaz Cort, Josep; Giotis, Ioannis; Kirousis, Lefteris; Mourtos, Ioannis; Serna Iglesias, María José (2017-12-01)
      Article
      Accés obert
      In this study, we describe a new coordination mechanism for non-atomic congestion games that leads to a (selfish) social cost which is arbitrarily close to the non-selfish optimal. This mechanism incurs no additional cost, ...

    • Theoretical aspects of graph models for MANETS 

      Díaz Cort, Josep; Dieter Wilhelm, Mitsche; Santi, Paolo (2010-03-01)
      Report de recerca
      Accés obert
      We survey the main theoretical aspects of models for Mobile Ad Hoc Networks (MANETs). We present theoretical characterizations of mobile network structural properties, di erent dynamic graph models of MANETs, and nally ...

    • Turing's algorithmic lens: from computability to complexity theory 

      Díaz Cort, Josep; Torras, Carme (2013)
      Article
      Accés obert
      The decidability question, i.e., whether any mathematical statement could be computationally proven true or false, was raised by Hilbert and remained open until Turing answered it in the negative. Then, most efforts in ...

    • Uniform characterizations of non-uniform complexity measures 

      Balcázar Navarro, José Luis; Díaz Cort, Josep; Gabarró Vallès, Joaquim (1985)
      Report de recerca
      Accés obert
      The class PSPACE/ply of sets decided within polynomial space by machines with polynomial advices is characterized in several way: we give an algebraic characterization, a parallel model characterization. Finally we define ...