We will give new, efficient algorithms and data structures for dynamic graphs. The fun challenge in this field is to find the right partial answers to update as the graph changes, while letting the algorithm for queries do some of the work of putting the answer together. Often, the road to efficient algorithms goes via graph theoretic insights.
Website: https://efzu.fa.em2.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1/job/1402/?keyword=dynamic&mode=job-location
Email: erot@dtu.dk
Applications are solicited for a postdoctoral position at Yale in the broad areas of Theoretical Computer Science, Optimization, or Machine Learning including (but not limited to) applications to Fairness and Privacy. Applicants should have an exceptional math background and a proven record. They should have their CV, research statement, and three letters emailed directly to Nisheeth Vishnoi
Website: http://www.cs.yale.edu/homes/vishnoi/Home.html
Email: nisheeth.vishnoi@gmail.com
The candidate must have a demonstrated ability in research or industry experience and be able to maintain the highest standards of excellence in teaching. While all areas of CS are welcome to apply, extra consideration will be given to those able to teach machine learning courses. The teaching load is five courses per year. This is a two-year, non-tenure track position, beginning July 1, 2023.
Website: https://webapps.cmc.edu/jobs/faculty/faculty_opening_detail.php?PostingID=17006
Email: sarah.cannon@cmc.edu
The Institute of Mathematics of the Czech Academy of Sciences is seeking a researcher for the project “Logic and unsatisfiability”. Applications are invited from candidates who have completed their PhD within the last 5 years (or will have completed it before the time of hiring), and who have a strong background in proof complexity or bounded arithmetic.
Website: http://www.math.cas.cz/recrutements/postes.php
Email: thapen@math.cas.cz
The department of Computer Science at Stony Brook University is looking to hire a postdoc in quantum information science, including but not limited to complexity theory, property testing, algorithms, sensing, and program analysis, with an expected start date in May 2023 and a duration of 1+1 years. The postdocs will work closely with Prof Nengkun Yu and Prof Supartha Podder.
Website: https://stonybrooku.taleo.net/careersection/2/jobdetail.ftl?job=2204491&tz=GMT-05%3A00&tzname=America%2FNew_York
Email: nengkun.yu@cs.stonybrook.edu
Postdoctorial positions at IST Austria are available funded by the ERC Advanced Grant “Modern Dynamic Data Structures, led by Prof. Monika Henzinger
Website: https://ist.ac.at/en/job/postdoc-research-group-monika-henzinger/
Email: monika.henzinger@ista.ac.at
Applications are invited for a postdoctoral position at the Centre for Quantum Computer Science, University of Latvia (https://www.quantum.lu.lv), lead by prof. Andris Ambainis. The Centre is among the strongest European research groups in quantum algorithms and currently consists of 18 researchers (including postdocs and graduate students).
Website: https://quantum.lu.lv/join-us/
Email: andris.ambainis@lu.lv
Ecole polytechnique, leading engineering school in France, member of the
Institut Polytechnique de Paris, welcomes outstanding applications for one assistant Monge Professor in Computer Science, specialty “Foundations of Computer Science”, tenure track teaching/research position.
Website: https://portail.polytechnique.edu/informatique/en/recruitment2023
Email: samuel.mimram@polytechnique.edu
The University of Melbourne is seeking an outstanding academic with expertise in Theoretical Computer Science to join an internationally recognised group of academics within the School of Computing and Information Systems in the Faculty of Engineering and Information Technology. We are seeking to appoint at the Full Professor level. The University is an equal opportunity employer.
Website: https://jobs.unimelb.edu.au/en/job/911413/professor-in-theoretical-computing-science
Email: awirth@unimelb.edu.au
Applications are invited for research associate positions in Algorithms and Complexity, funded by the European Research Council (ERC) starting grant “New Approaches to Counting and Sampling” (NACS), led by Dr. Heng Guo in the School of Informatics, University of Edinburgh.
Website: https://elxw.fa.em3.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1001/job/6411
Email: hguo at inf.ed.ac.uk
