Early-career researchers in theoretical computer science presented novel algorithms, techniques, and data structures at the annual Junior Theorists Workshop, co-hosted by the Northwestern CS Theory ...
Last year, 18 percent of Stanford University seniors graduated with a degree in computer science, more than double the proportion of just a decade earlier. Over the same period at MIT, that rate went ...
Descriptive set theorists study the niche mathematics of infinity. Now, they’ve shown that their problems can be rewritten in the concrete language of algorithms. All of modern mathematics is built on ...
Northwestern Engineering’s Samir Khuller welcomed the presenters and guests of part two of the Undergraduate Research Showcase by discussing the importance of academic curiosity. “Knowledge is not a ...
When computer scientists hang out at cocktail parties, they're apt to chat, among other things, about the single most important unsolved problem in computer science: the question, Does P = NP?
Results that may be inaccessible to you are currently showing.
Hide inaccessible results