QuICS Hartree Postdoctoral Fellowships at University of Maryland (apply by November 15, 2015)

The Joint Center for Quantum Information and Computer Science seeks exceptional candidates for QuICS Hartree Postdoctoral Fellowships in Quantum Information and Computer Science. QuICS postdocs will interact with leading computer scientists and physicists at the University of Maryland and the National Institute of Standards and Technology. The term of appointment is two years.

Webpage: http://quics.umd.edu/postdocs

Email: quics-coordinator@umiacs.umd.edu

QuICS Hartree Postdoctoral Fellowships at University of Maryland (apply by November 15, 2015)

Lecturer in Theoretical Computer Science at Georgia Institute of Technology (apply by June 30, 2015)

The College of Computing at the Georgia Institute of Technology in Atlanta, Georgia invites applications for a short-term, full-time, non-tenure-track faculty position at the rank of Lecturer to start in August of 2015. The lecturer is expected to teach two introductory undergraduate and graduate algorithms and theory courses per semester.

Webpage: http://https://apps.itos.uga.edu/ach/position/29288

Email: venkat@cc.gatech.edu

Lecturer in Theoretical Computer Science at Georgia Institute of Technology (apply by June 30, 2015)

postdoc at Teesside University, UK (apply by April 22)

Applications are invited for a postdoctoral position funded by the EPSRC grant EP/M018113/1 “Incentives without monetary transfers” to work in the research area of algorithmic game theory.

The (negotiable) starting date for the successful candidate is 1 October 2015. The position is for a year; salary is in the range 30k-35k GBP per year.

Webpage: http://recruitment.tees.ac.uk/itrentlive_webrecruitment/wrd/run/etrec107gf.open?VACANCY_ID=8935481LB1&WVID=3395700LFi&LANG=USA

Email: c.ventre@tees.ac.uk

postdoc at Teesside University, UK (apply by April 22)

Postdoc at Northeastern University (apply by April 5)

The theory group at Northeastern University, Boston, is seeking applications for a postdoctoral position in Theoretical Computer Science for the academic year 2015-2016, with a possible extension to a second year.

To apply, send your CV and two recommendation letters to Rajmohan Rajaraman (rraj@ccs.neu.edu).

To know more about our group see:
http://www.ccs.neu.edu/theory/index.html

Webpage: http://http://www.ccs.neu.edu/theory/index.html

Email: rraj@ccs.neu.edu

Postdoc at Northeastern University (apply by April 5)

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

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)

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)

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)