[Theory] faculty positions at Guangdong Technion Israel Institute of Technology

[Julia Chuzhoy]

Hello,

I was asked  by Nader Bshouti to forward the ad (below) for faculty positions in Guangdong Technion Israel Institute of Technology.

Best,
Julia



Position: Assistant, Associate, and Full Professorships – Visiting positions are also available.
Institute: Guangdong Technion Israel Institute of Technology (GTIIT)
Area: Mathematics and Theoretical Computer Science.
Location: Shantou, Guangdong Province, China
Submission Email: gtiitrecruit at technion.ac.il <mailto:gtiitrecruit at technion.ac.il> for visiting positions, please send to eliahu.aljadeff at gtiit.edu.cn <mailto:eliahu.aljadeff at gtiit.edu.cn>
Description: Technion – Israel Institute of Technology manages the academics of a new university established in Shantou City,  Guangdong Province, China gtiit.edu.cn/en <http://gtiit.edu.cn/en>.

GTIIT follows the academic model of the Technion campus in Haifa, Israel. It is dedicated to high-quality research and education in science and technology. Courses will be taught in English.
GTIIT has established undergraduate programs in Chemical Engineering, Biotechnology & Food Engineering, and Materials Engineering. The undergraduate program in Mathematics and Computer science (minor) started in October 2020. Tenure-track faculty positions at all ranks are now available for exceptional candidates, who will be appointed members of the Mathematics and Computer science teaching program in all areas of Mathematics and Theoretical Computer Science. Members of the centers are expected to initiate and conduct intensive state-of-the-art research and to be involved in graduate students supervision and teaching of undergraduate courses.

Successful candidates will be offered convenient housing and family care facilities in the beautiful and newly constructed campus.

Please send a CV, list of publications, research plan, and teaching statements to the Search Committee at: gtiitrecruit at technion.ac.il <mailto:gtiitrecruit at technion.ac.il>

Visiting Positions in Guangdong Technion, Israel Institute of Technology (GTIIT) in China
The Math with Computer Science department in Guangdong Technion, Israel Institute of Technology (GTIIT) in China, Shantou, seeks qualified candidates for a one-year or one semester, full-time Visiting Assistant/Associate/Full Professor position who will teach courses (minimum of 4 credit hours of load for each semester) starting on September or February. Preference is given to candidates that can teach one of the courses that are listed below. Candidates should display evidence of their ability to teach those courses.
Candidates nearing completion of the doctorate will be considered but must provide proof that the doctorate is completed before the appointment.
The appointments are for one year (10 months) or one semester, with the possibility for renewal subject to positive teaching evaluations and available funding.
All positions come with free accommodation in the campus housing. For any other needs, the administration at the university will extend their generous hands and help you in every way possible.

Candidates must have a solid commitment to working in a multidisciplinary and collaborative setting. Demonstrated ability in written and oral use of the English language is required.

HOW TO APPLY

To apply, applicants are to provide the following supplemental documents to: eliahu.aljadeff at gtiit.edu.cn <mailto:eliahu.aljadeff at gtiit.edu.cn>
(1) a cover letter providing some detail of the applicant's qualifications and interest in the position;
(2) a current CV;
(3) a statement of teaching philosophy and goals, and research plans.

We are particularly interested in candidates who can teach introductory and advanced undergraduate and graduate Computer Science courses. Areas of interest include the following:

Introduction to Computer Science
THIS COURSE IS FOR COMPUTER SCIENCE STUDENTS. COMPUTER ARCHITECTURE.ALGORITHMIC APPROACH TO PROBLEM-SOLVING. BASIC CONCEPTS IN THE C LANGUAGE. TOP-DOWN DESIGN. STRUCTURED PROGRAMMING. BOTTOM-UP DESIGN. DEBUGGING. PARTIAL AND COMPLETE CORRECTNESS PROOF OF PROGRAMS. MEASURES OF ALGORITHM EFFICIENCY: TIME AND SPACE COMPLEXITY. POLYNOMIAL AND EXPONENTIAL COMPLEXITY. PROBABILISTIC ANALYSIS OF ALGORITHMS. RANDOMIZED ALGORITHMS. INTRACTABLE PROBLEMS. STACK. QUEUE. REPRESENTATIONS OF ARITHMETIC EXPRESSIONS AND IMPLEMENTATION OF THEIR EVALUATION BY STACK. RECURSION AND ITS IMPLEMENTATION. BRANCH AND BOUND SEARCH. EFFICIENT SORTING.

Introduction to systems programming
ADVANCED C: POINTERS, STRUCTURES, DYNAMIC MEMORY MANAGEMENT, LINKED LISTS, TREES. VERSION MANAGEMENT. COMPILATION, LINKING AND USING LIBRARIES. BASIC SHELL COMMANDS. PYTHON AS GLUE LANGUAGE FOR SYSTEM PROGRAMMING. DEBUGGING, SOFTWARE TESTING, AUTOMATIC TESTING. INTRODUCTION TO C++: OBJECT-ORIENTED PROGRAMMING,_ABSTRACT DATA_TYPES, TYPES, STATIC AND DYNAMIC POLYMORPHISM.
Data Structure 1
EMPHASIS ON ABSTRACT DATA STRUCTURES, SELECTION, AND DESIGNING DATA STRUCTURES FOR EFFICIENT SOLUTIONS OF GIVEN PROBLEMS. VARIOUS DATA STRUCTURES, THEIR PROPERTIES, IMPLEMENTATIONS, AND APPLICATIONS: ARRAYS, STACKS, QUEUES, DEQUEUES, VARIOUS TYPES OF LISTS, SEARCH TREES, HEAPS AND PRIORITY QUEUES, HASH-TABLES. OTHER TOPICS: BASIC CONCEPTS OF COMPLEXITY, GARBAGE COLLECTION, MEMORY ALLOCATION, INTERNAL AND EXTERNAL SORTING, AND SEARCHING.

Digital systems and computer architecture
BOOLEAN ALGEBRA, THE DIGITAL MODEL, SWITCHING FUNCTIONS, LOGIC GATES, AND FUNCTIONAL COMPLETENESS. THE TRANSISTOR AS A SWITCH. COMBINATIONAL AND SEQUENTIAL CIRCUITS, THE SYNCHRONOUS METHODOLOGY. STATE MACHINES. FLOATING POINT. ERROR CORRECTION CODES. HARDWARE DESCRIPTION LANGUAGE. THE VON NEUMANN MACHINE, INSTRUCTION SET, ADDRESSING MODES, BRANCHES. THE STACK. ROUTINES. TRAPS. PIPELINED PROCESSOR, LATENCY VS. THROUGHPUT. CONTROL AND DATA HAZARDS.

Combinatorial Algorithms
IN COMPUTER SCIENCE: THIS COURSE DEALS WITH BASIC METHODS FOR THE DESIGN AND ANALYSIS OF ALGORITHMS, INCLUDING SEARCH METHODS, GREEDY ALGORITHMS, DYNAMIC PROGRAMMING, REDUCTIONS, AUGMENTING PATHS, RANDOMIZED ALGORITHMS, AND ALGEBRAIC METHODS. THE COURSE PRESENTS EFFICIENT ALGORITHMS FOR FUNDAMENTAL PROBLEMS IN GRAPH THEORY AND OTHER FIELDS. AMONG THE TOPICS DISCUSSED ARE BREADTH-FIRST SEARCH, DEPTH-FIRST SEARCH, MINIMUM SPANNING TREE, SHORTEST PATHS, NETWORK FLOWS, CUTS, STRING MATCHING, AND GEOMETRIC AND ALGEBRAIC PROBLEMS.
IN ELECTRICAL ENGINEERING:  THE COURSE DEALS WITH FUNDAMENTAL CONCEPTS IN DESIGNING AND ANALYZING COMBINATORIAL ALGORITHMS. TOPICS: SORTING ALGORITHMS, BASIC GRAPH ALGORITHMS: SEARCHING, SHORTEST PATHS, MINIMUM SPANNING TREE, NETWORK FLOW.

Operating Systems
THE COURSE PRESENTS THE CENTRAL ISSUES OF MODERN OPERATING SYSTEMS, INCLUDING PROCESSES AND THREADS, SCHEDULING AND CONTEXT SWITCHING, COOPERATION, CRITICAL SECTION, SEMAPHORES, AND CONDITION VARIABLES, INTERRUPTS, MEMORY MANAGEMENT, PAGING, VIRTUAL MEMORY, FILE SYSTEMS. IN THE TUTORIAL, THE STUDENTS OBTAIN DEEP KNOWLEDGE OF AN ADVANCED OPERATING SYSTEM.

Computer Organization And Programming
ADVANCED SYSTEMS PROGRAMMING: FROM ASSEMBLY LEVEL TO AN ADVANCED PROGRAMMING ENVIRONMENT. COMPUTER ARCHITECTURE: HEAP, STACK. INTRODUCTION TO ASSEMBLY. COMPILATION AND BUILDING OF MULTI-FILE PROJECTS. LINKING AND LOADING. ADVANCED MEMORY MANAGEMENT: SMART POINTERS, MEMORY ALLOCATION SYSTEMS. OBJECT LAYOUT IN MEMORY. ALLOCATION AND DEALLOCATION ORDER. RESOURCE MANAGEMENT. SYNCHRONOUS AND ASYNCHRONOUS OPERATIONS. RENDERING A PAGE IN THE BROWSER.

And other programming and more advanced courses.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.cs.uchicago.edu/pipermail/theory/attachments/20210912/19d9a7a4/attachment.html>