A veteran professor from the School of Computer Science (SCS) is among those recently honored by the University System of ...

Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport costs ...

The factoring algorithm is also very bit-efficient; a number n of p-bits can be used to factor numbers up to 2 n + 2. Errors also provide another potential advantage to p-bits.