Sciweavers

108
Voted
FSTTCS
1995
Springer
15 years 4 months ago
Branch and Bound on the Network Model
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
Sanjay Jain
58
Voted
FSTTCS
1995
Springer
15 years 4 months ago
All-Pairs Min-Cut in Sparse Networks
Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D...
55
Voted
FSTTCS
1995
Springer
15 years 4 months ago
Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy
Eugene Asarin, Oded Maler
Software Engineering
Top of PageReset Settings