Postdoc in Theoretical CS: Algorithms & Complexity

West Virginia University; Morgantown (WV); On-site; USD 60,000 - 70,000; Full time

Job summary

West Virginia University invites applications for a Postdoctoral Fellow in theoretical computer science, focusing on algorithm design and computational complexity in mathematical programming. NSF-funded, two years from January 1, 2027, with potential for a one-year extension based on performance and funds.

The role includes research on combinatorial optimization, conference attendance, literature review, and teaching one course in theoretical CS within the Lane Department of CS&E.

Qualifications

• PhD in computer science or operations research is required.
• Expertise in computational complexity.
• Expertise in game theory.

Responsibilities

• Conduct research on combinatorial optimization problems.
• Attend research conferences and read literature to stay current.
• Teach one course in theoretical computer science.

Skills

Computational complexity

Game theory

Education

PhD in Computer Science or Operations Research

Job description

West Virginia University invites applications for a Postdoctoral Fellow in theoretical computer science, focusing on algorithm design and computational complexity in mathematical programming. NSF-funded, two years from January 1, 2027, with potential for a one-year extension based on performance and funds.

The role includes research on combinatorial optimization, conference attendance, literature review, and teaching one course in theoretical CS within the Lane Department of CS&E.