Reports de recerca

Enviaments recents

  • 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)
    Report de recerca
    Accés obert
    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)
    Report de recerca
    Accés obert
    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)
    Report de recerca
    Accés obert
    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 ...

  • New results about the list access problem 

    Roura Ferret, Salvador; Martínez Parra, Conrado (1996-11-27)
    Report de recerca
    Accés obert
    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)
    Report de recerca
    Accés obert
    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)
    Report de recerca
    Accés obert
    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)
    Report de recerca
    Accés obert
    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)
    Report de recerca
    Accés obert
    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 ...

  • Statistics on random trees 

    Cases Muñoz, Rafel; Díaz Cort, Josep; Martínez Parra, Conrado (1991-04-02)
    Report de recerca
    Accés obert
    In this paper we give a survey of the symbolic operator methods to do statistics on random trees. We present some examples and apply the techniques to find their asymptotic behaviour.

  • 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)
    Report de recerca
    Accés obert
    In 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 ...

  • Prettyprint: a simple tool for typesetting algorithms 

    Martínez Parra, Conrado (1994-03-16)
    Report de recerca
    Accés obert

  • Guía y normas de programación de las prácticas de EDA 

    Jiménez Gómez, Rosa María; Martínez Parra, Conrado (2002-04-09)
    Report de recerca
    Accés obert

Mostra'n més