Apparently my students like to be tortured with heavy and tedious modules of mine.
I am currently placed on NUS SoC Faculty Teaching Excellence Award (FTEA) honour roll, i.e., "banned from competing within faculty" until AY2020/21.
I have received NUS Annual Teaching Excellence Award (ATEA) three times, for AY2014/15, for AY2017/18, for AY2018/19 (announced on 06 April 2020) and will be placed on the ATEA Honour Roll afterwards, i.e., "banned from competing within University" until AY2025/26.
Dr Steven Halim
National University of Singapore, School of Computing
13 Computing Drive, Singapore 117417
Office address: Computing 2, Level 3, Room 37 (COM2-03-37)
Office phone: (+65) 651 67361
I coordinate a self-titled "Center of Competitive Programming in South East Asia".
My various roles are the head coach of NUS ICPC teams (2008-present; WF coach on year 2010 (Ripple) + 2012 (Eternia) + 2014 (ThanQ+) + 2019 (3body2) + 2020 (TBC, 5x coach award soon)), the team leader for Singapore IOI teams (2009-present; minus 2014), the Regional Contest Director for ICPC Asia Singapore 2015, 2018, and the Deputy Director for the 32nd IOI 2020, Singapore.
NUS ICPC teams have a few recent success in ICPC Asia Regional Contests (total of 10 wins since 2013-2019):
|Asia Regionals Site||#Win(s)||Year(s)|
|Jakarta, Indonesia||5||2013 (ThanQ), 2014 (ThanQ+), 2015 (RRwatameda), 2017 (DomiNUS), 2019 (Send Bobs to Alice)|
|Manila, Philippines||2||2017 (Pandamiao), 2019 (7 Halim)|
|Nakhon Pathom, Thailand||1||2018 (Pandamiao)|
|Yangon, Myanmar||1||2018 (3body2)|
|Kuala Lumpur, Malaysia||1||2019 (3body3)|
NUS ICPC teams top 4 (recent) results in ICPC World Finals are as follows:
|World Finals Site||Year||Rank||# of Teams|
|Rapid City, USA||2017||Joint-20||133||Marrakech, Morocco||2015||Joint-28||128|
The visualization below shows the results of NUS best teams since 2009-present in ICPC Asia Regional Contests and in the ICPC World Finals of the following year.
To help myself in monitoring the current team members of NUS ICPC teams. I put a table that show their past performances in IOI, ICPC, and/or my CS3233 course (if taken), SGP Preliminary 2018 (if any), NTSC 2019 performance, and combined with their recent CodeForces and Kattis online judges performance below.
SH7 rating is currently defined as:
Past performances in IOI, ICPC, and/or my CS3233 course (40%):
Dynamic (real-time) online judges performances: CF and Kattis (30%):
Recent NUS ICPC Selection Contest Result (30%), 2018 (ICPC Asia Singapore 2018 Preliminary Contest) (10%) and NTSC 2019 data (20%).
Singapore IOI teams also train in the same "Center of Competitive Programming in South East Asia", together with various IOI medalists and ICPC team members in NUS.
With such synergy between ICPC and IOI activities in NUS, all 4 members of recent Singapore IOI teams usually bring home 4 medals.
The best recent achievement (in Steven's era) is 2G (Feng Jiahai and Ranald Lam Yun Shao) and 1S (Mark Theng Kwang Hui) in 2014.
The most recent result is 1G (Leong Eu-Shaun), 1S (Jeffrey Lee Chun Hean), and 1B (Benson Lin Zhan Li) in 2019.
The visualization below shows the recent progress of Singapore IOI teams based on the sum of medal quality Q = 3*Gold + 2*Silver + 1*Bronze of SG IOI teams since 1992-present (Steven took over starting 2009).
If you are interested, you can read this article to see the whereabouts of these Singapore IOI medalists today (accurrate as of year 2015 team).
With my brother (Felix Halim), we wrote down our programming contest expertise into a relatively popular book about Competitive Programming (the most up-to-date edition as of Jun 2014 is currently CP3).
You can buy the book via lulu.com or via myself directly if you reside in Singapore.
I use Mooshak Online Judge (gradually phased out) and Kattis for various programming contest activities in SoC NUS.
I also incorporated the spirit of 'competitive programming' (but in a weaker sense) for my other algorithm/programming modules.
Programming competitions have enabled me to visit many (exotic) places of the world in yearly basis.
I am very grateful to God for this opportunity.
I significantly use various visualization and animation techniques that I have learned during PhD days for my current pedagogy research project: VisuAlgo. In this large-scale web-based project which is still actively developed, myself and a number of my students develop visualizations (animations) for a lot of well-known data structures and algorithms typically taught in Computer Science curriculum and beyond. A snapshot of the portal page of VisuAlgo is shown below.
Not just that, our team is ambitious enough to design the Online Quiz component of VisuAlgo: Automated questions generator and answers verifier to aid students when they learn these data structures and algorithms.
We generate data structures and algorithms questions using well-defined grammatical rules, but we randomize the data structure content, the underlying graph, and/or the operations to be performed. This way, the questions are always "fresh".
Students can enter their answer in various input methods: Traditional MCQ style, selecting one vertex/edge, selecting a subset or a sequence of vertices/edges, enter a number in input box, and draw the answer graph. Students' answers are graded instantly and students will be able to get automatic feedback on their wrong answers by verifying the correct answers directly in VisuAlgo visualization.
With this pedagogy tool, I want to provide my students (and also Computer Science students worldwide) with "a copy of myself" that are available 24/7 to guide their learning process.
If you understand Bahasa Indonesia, you may want to read my Facebook note about https://visualgo.net/id, the VisuAlgo front page in Indonesian language.
This work is featured on NUS School of Computing page, titled: Visualising Algorithms with a Click on 02 April 2020.
I have completed my PhD degree but now no longer active in the field that gave me my PhD.
My PhD research was to investigate human-computer collaboration (in form of FLST visualization plus automated black-box tuning) to address Stochastic Local Search `Design and Tuning Problem' (SLS DTP). Between year 2003-2008, I had authored and co-authored several scientific articles on international journals and conferences around this topic. This SLS DTP is a high level problem suffered by the algorithm designer while they try to create a good performing SLS algorithms (a.k.a. metaheuristics) for attacking the underlying NP-Complete Combinatorial (Optimization) Problems. I have designed an SLS engineering suite Viz that incorporates my ideas above to help me address this SLS DTP.
I have received far too many requests to write recommendation letters from past/current students for various reasons (job application, graduate school application, student exchange application, etc).
To maintain my sanity, I will only allow the following groups of students to request for such recommendation letter:
I am sorry in advance that I will simply reject the requests from all other students starting from Tuesday, 17 November 2015 onwards.
Copyright © Steven Halim 2000-2019
A total of 109252 different hosts have accessed this document in the last 2123 days; your host, ec2-3-235-66-217.compute-1.amazonaws.com, has accessed it 2 times.
If you're interested, complete statistics for this document are also available, including breakdowns by top-level domain, host name, and date.