d abstract) Book section (Refereed) Original citation: Originally published in Gonnet, G; Panario D; Viola, A, LATIN 2000: theoretical informatics. Lecture notes in computer scienc...
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter of the algorithm has its extreme value
Wepropose a schemefor producingLatin hypercube samples that can enhanceany of the existing sampling algorithms in Bayesiannetworks. Wetest this scheme in combinationwith the likel...
We present a very simple algorithm for the Least Common Ancestor problem. We thus dispel the frequently held notion that an optimal LCA computation is unwieldy and unimplementable...
At the 16th British Combinatorial Conference (1997), Cameron introduced a new concept called 2-simultaneous coloring. He used this concept to reformulate a conjecture of Keedwell ...
Mohammad Mahdian, Ebadollah S. Mahmoodian, Amin Sa...