On a solution of a randomized three tracks variant of the gate matrix layout problem. (English summary) Graph theory (Kazimierz Dolny, 1997). Discrete Math. 236 (2001), no. 1-3, 179–189. Summary: “We are concerned with the k-gate matrix layout (k-GML) problem in a very largescale integration design. The problem asks if k tracks are sufficient to lay out a given circuit. The k-GML problem may be stated equivalently in terms of random Boolean matrices. In the paper, we find thresholds for the appearance of matrices which are ‘yes ’ instances for a randomized 3-GML problem.