Subject
Computer Science Applications,General Mathematics,Software
Reference16 articles.
1. J.L. Balcázar, J. Díaz and J. Gabarró,Structural complexity II, Springer Verlag (1995).
2. Probabilistic analysis of a parallel algorithm for finding maximal independent sets
3. An observation on time-storage trade off
4. D. Coppersmith, P. Raghavan and M. Tompa, Parallel graph algorithms that are efficient in average, inProc. of 28th IEEE Symposium on Foundations of Computer Science(1987) 260-269.
5. J. Díaz, M. Serna, P. Spirakis and J. Torán, On the expected depth of Boolean circuits. Technical Report LSI-94-7-R, Universitat Politècnica de Catalunya, Dept. de LSI (1994).