Postdoc position in TCS at University of Sydney and University of New South Wales (apply by 31 March 2015)

theorycsjobs

We are advertising a 24-month postdoctoral research fellowship in theoretical computer science shared between University of Sydney and University of New South Wales, Australia. The expected start date is September 2015.

The successful applicant will conduct research on algorithms with Serge Gaspers, Joachim Gudmundsson and Julian Mestre in the USYD SACT research group and UNSW Algorithms group.

Webpage: http://sydneyalgorithms.wordpress.com/postdoctoral-fellowship/

Postdoc position in TCS at University of Sydney and University of New South Wales (apply by 31 March 2015)

Postdoctoral Position at University of Waterloo (apply by 30 Apr 2015)

theorycsjobs

Applications are invited for a postdoctoral position at University of Waterloo in algorithms and optimization, hosted by Joseph Cheriyan and Lap Chi Lau. The position is for a year (possibly another year) starting in Fall 2015.

Applicants should email their CV, Research Statement, and names of three references to Joseph Cheriyan (jcheriya@uwaterloo.ca) and Lap Chi Lau by April 30.

Email: lapchi@uwaterloo.ca

Postdoctoral Position at University of Waterloo (apply by 30 Apr 2015)

Postdoc in Algorithms and Complexity at University of Edinburgh (apply by March 19, 2015)

theorycsjobs

The position is under the ERC Consolidator Grant ALUnif (Algorithms and Lower Bounds: A Unified Approach), held by Rahul Santhanam.

The goal of the project is to use recently discovered connections between complexity lower bound techniques and algorithmic design and analysis to design new and improved algorithms for SAT and other NP-complete problems, as well as prove new complexity lower b

Webpage: http://www.vacancies.ed.ac.uk/pls/corehrrecruit/erq_jobspec_version_4.jobspec?p_id=032615

Email: rsanthan@inf.ed.ac.uk

Postdoc in Algorithms and Complexity at University of Edinburgh (apply by March 19, 2015)

Assistant Professor in Computer Security at KTH Royal Institute of Technology (apply by 10 February 2015)

theorycsjobs

The Department of Theoretical Computer Science (TCS) at the School of Computer Science and Communication (CSC) invites applications for a full-time tenure-track assistant professor in Computer Science with specialization in Computer Security, starting in the second half of 2015.

For more information about KTH, CSC, and TCS visit http://www.kth.se, http://www.csc.kth.se, http://www.csc.kth.se/tcs.

Webpage: http://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:46441/where:4/

Email: mfd@kth.se

Assistant Professor in Computer Security at KTH Royal Institute of Technology (apply by 10 February 2015)

Postdoc at North Carolina State University (apply by open until filled)

theorycsjobs

Applications are solicited for a postdoctoral position in theoretical computer science/structural graph algorithms/parameterized complexity at NCState in the Theory in Practice group with Blair D. Sullivan – see csc.ncsu.edu/faculty/bdsullivan. The position is for up to 2 years, and associated with Dr. Sullivan’s recent funding as a Moore Investigator in Data-Driven Discovery. Start date flexi

Webpage: http://www.csc.ncsu.edu/faculty/bdsullivan/docs/postdoc_2015.pdf

Email: blair_sullivan@ncsu.edu

Postdoc at North Carolina State University (apply by open until filled)

Postdoc at Carnegie Mellon University (apply by February 1, 2015)

theorycsjobs

Applications are solicited for a postdoctoral position at Carnegie Mellon University in theoretical computer science (in the topics of complexity/coding/approximability theory, broadly construed), hosted by Venkatesan Guruswami. The position is expected to be for a year starting in Fall 2015.

Webpage: http://www.cs.cmu.edu/~venkatg/cmu-postdoc-venkat.html

Email: guruswami@cmu.edu

Postdoc at Carnegie Mellon University (apply by February 1, 2015)

Postdoc at University of Alberta (apply by April 30, 2015)

theorycsjobs

A one-year appointment starting September 1, 2015 with the possibility of a one year extension. The successful applicant is expected to work closely with the members in the Theory Group in the areas of: approximation algorithms, hardness
of approximation, probabilistic and randomized methods. Applicants must have received their PhD within the past 5 years or are expecting to receive it soon.

Webpage: http://webdocs.cs.ualberta.ca/~zacharyf/docs/pdf_2015.pdf

Email: zacharyf@cs.ualberta.ca

Postdoc at University of Alberta (apply by April 30, 2015)