Recent Submissions

  • Bateria de afasias Western. Cuaderno de estímulos en castellano. 

    Zaragoza Cortés, Maite; Diéguez-Vide, Faustino; Gómez Ruiz, María Isabel; Rosell Clarí, Vicent; Catala Roig, Neus; Baixeries i Juvillà, Jaume; Hernández Fernández, Antonio (2022-09)
    Research report
    Restricted access - publisher's policy
    Quadern d'estímuls de la bateria d'afàsies Western adaptat per a la llengua castellana. Pensat per a passar a pacients amb afàsia. Es pot aplicar per a controls monolingües en l'estudi en contextos bilingües.
  • Healthy Twitter discussions? Time will tell 

    Gnatyshak, Dmitry; Garcia Gasulla, Dario; Álvarez Napagao, Sergio; Arjona Martínez, Jamie; Venturini, Tommaso (2022-03-21)
    Research report
    Open Access
    Studying misinformation and how to deal with unhealthy behaviours within online discussions has recently become an important field of research within social studies. With the rapid development of social media, and the ...
  • Classification of a point with respect to a polyhedron vertex 

    Juan, Robert; Vinacua Pla, Álvaro; Brunet Crosa, Pere (1990)
    Research report
    Open Access
  • Approximating layout problems on geometric random graphs 

    Díaz Cort, Josep; Penrose, Mathew D.; Petit Silvestre, Jordi; Serna Iglesias, María José (1998-10-13)
    Research report
    Open Access
    We show two simple algorithms that, with high probability, approximate within a constant several layout problems for geometric random graphs drawn from the Gn(r) model r_cv(log¿¿n/n¿ ) for any constant c = 6. The layout ...
  • Synchronized parallel algorithms on RedBlack trees 

    Messeguer Peypoch, Xavier; Valles Fuente, Borja (1997-12)
    Research report
    Open Access
    We present an approach for designing synchronized parallel algorithms to update RedBlack trees. The resulting algorithms update k keys with k processors on trees of size n in time O(log n + log k) which is very close to ...
  • Approximating convex quadratic programming is P-complete 

    Serna Iglesias, María José; Xhafa Xhafa, Fatos (1995)
    Research report
    Open Access
    In this paper we show that the problem of Approximating Convex Quadratic Programming is P-complete. We also consider two approximation problems related to it, Solution Approximation and Value Approximation and show both ...
  • Strong law for the depth of circuits 

    Tsukiji, Tatsuie; Xhafa Xhafa, Fatos (1996)
    Research report
    Open Access
    This paper studies uniformly distributed size n circuits (labelled acyclic graphs) consisting of binary gates and a constant number of inpurts. We show that their depth is asymptotically 2e ln n in probability. To this ...
  • New results about the list access problem 

    Roura Ferret, Salvador; Martínez Parra, Conrado (1996-11-27)
    Research report
    Open Access
    We consider the list access problem and show that two unrealistic assumptions in the original cost model presented in and subsequent literature allow for several competitiveness resulst of the move-to-front heuristic (MTF). ...
  • Efficient parallel algorithms for some tree layout problems 

    Díaz Cort, Josep; Gibbons, Alan M.; Pantziou, Grammati; Serna Iglesias, María José; Spirakis, Paul George; Torán Romero, Jacobo (1992)
    Research report
    Open Access
    The minimum cut and minimum sum linear arrangement problems usually occur in solving wiring problems and have a lot in common with job sequencing questions. Both problems are NP-complete for general graphs and P for trees. ...
  • Graph layout problems 

    Díaz Cort, Josep (1992)
    Research report
    Open Access
    In this paper we survey the recent results and open questions about some graph layout problems.
  • A note on log space optimization 

    Álvarez Faura, M. del Carme; Jenner, Birgit (1992-12-30)
    Research report
    Open Access
    We show that computing iterated multiplication of word matrices over {0,1}, using the operations maximum and concatenation, is complete for the class optL of log space optimization functions. The same problem for word ...
  • 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 Access
    It 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 ...

View more