PerchPerchUnofficial course planning
Back to professors

Computer Science

Konstantinos Mamouras

Assistant Professor of Computer Science

Member, Ken Kennedy Institute

Public Rice profile source

Average rating

4.0

3 temporary mock ratings

Difficulty

3.1

course-linked average

Courses

4

in seeded sections

Public profile

Research areas

He is currently working on the design of programming abstractions for processing data streams. Several real-time decision making applications rely on the computation of quantitative summaries of very large streams of data. He has proposed StreamQRE, a declarative query language that combines regular expressions, quantitative aggregation, and relational features. A compilation algorithm translates the high-level query into a streaming algorithm with precise guarantees for resource usage. I am also interested in program semantics and logics for program verification. In particular, this includes equational theories of programs based on the framework of Kleene Algebra with Tests.

Courses taught

COMP 382

Reasoning About Algorithms

Writing algorithms is fun, but how are you sure that the algorithm you wrote is flawless? Are there computing tasks for which it is impossible to produce an efficient algorithm, or, for that matter, any algorithm? To answer these questions, you have to learn to perform mathematical reasoning about algorithmic problems and solutions COMP 382 is an introduction to such reasoning techniques. Topics covered would include elementary logic, analysis of the correctness and efficiency of algorithms, and formal computational models like finite automata and Turning machines. On the way, you are also going to learn some new algorithm design techniques. Cross-list: COMP 382.

Computer ScienceNone4 credits
4.09.1hAliakbarpour, Maryam, Chida, Anjum, Mamouras, Konstantinos

COMP 490

Computer Science Projects

Theoretical and experimental investigation under staff direction. Repeatable for Credit.

Computer ScienceNone1-4 credits
4.06.7hAllen, Genevera, Byrne, Michael, Cox, Alan L., Ferreira Flores, Rodrigo, Goldman, Ron, Hang, Kaiyu, Joyner, Mack, Kyrillidis, Tasos, Mamouras, Konstantinos, Myers, Risa, Patel, Ankit, Schreib, Rebecca, Shrivastava, Anshumali, Tunnell, Chris, Unhelkar, Vaibhav, Wang, Yuke, Xing, Jiarong, Yao, Vicky

COMP 590

Computer Science Projects

Advanced theoretical and experimental investigations under staff direction. The student must have a full-time internship to receive 4 credits for this course. Repeatable for Credit.

Computer ScienceNone1-4 credits
3.45.7hAliakbarpour, Maryam, Baraniuk, Richard G, Chen, Hanjie, Chia, Nai-Hui, Cox, Alan L., Fallah, Alireza, Goldman, Ron, Hang, Kaiyu, Jermaine, Christopher, Joyner, Mack, Kavraki, Lydia, Kyrillidis, Tasos, Lopes da Silva, Arlei, Mamouras, Konstantinos, Mellor-Crummey, John, Myers, Risa, Nakhleh, Luay, Ng, T. S. Eugene, Ordonez Roman, Vicente, Patel, Ankit, Patel, Tirthak, Rixner, Scott, Shrivastava, Anshumali, Simar, Ray, Treangen, Todd, Unhelkar, Vaibhav, Vardi, Moshe, Wang, Yuke, Warren, Joe D., Wei, Chen, Wong, Stephen, Xing, Jiarong, Yao, Vicky

COMP 800

Graduate Research

Repeatable for Credit.

Computer ScienceNone1-15 credits
4.28.5hAliakbarpour, Maryam, Braverman, Vladimir, Chen, Hanjie, Chia, Nai-Hui, Cooper, Keith, Cox, Alan L., Fallah, Alireza, Goldman, Ron, Hang, Kaiyu, Hu, Ben, Jermaine, Christopher, Johnson, Dave, Kavraki, Lydia, Kyrillidis, Tasos, Lopes da Silva, Arlei, Mamouras, Konstantinos, Mellor-Crummey, John, Nakhleh, Luay, Ng, T. S. Eugene, Ordonez Roman, Vicente, Patel, Ankit, Patel, Tirthak, Phillips, George, Rixner, Scott, Shrivastava, Anshumali, Subramanian, Devika, Treangen, Todd, Unhelkar, Vaibhav, Vardi, Moshe, Varman, Peter, Wallach, Dan S., Wang, Yuke, Warren, Joe D., Wei, Chen, Xing, Jiarong, Yao, Vicky

Recent comments