Reports de recerca
Recent Submissions
-
Approximating layout problems on geometric random graphs
(1998-10-13)
Research report
Open AccessWe 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
(1997-12)
Research report
Open AccessWe 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
(1995)
Research report
Open AccessIn 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
(1996-11-27)
Research report
Open AccessWe 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
(1992)
Research report
Open AccessThe 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
(1992)
Research report
Open AccessIn this paper we survey the recent results and open questions about some graph layout problems. -
A note on log space optimization
(1992-12-30)
Research report
Open AccessWe 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
(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 ... -
Statistics on random trees
(1991-04-02)
Research report
Open AccessIn 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
(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 ... -
Prettyprint: a simple tool for typesetting algorithms
(1994-03-16)
Research report
Open Access -
Guía y normas de programación de las prácticas de EDA
(2002-04-09)
Research report
Open Access
RSS 1.0