Thursday 

Room 1 

11:40 - 12:40 

(UTC+02

Talk (60 min)

Rethinking Binary Search: Improving on a Classic with AI Assistance

Binary search, with its roots extending back millennia to the method of dichotomy and bisection, is a cornerstone of algorithmic logic. Its elegant and straightforward nature, taught during our formative years in computer science, has long been considered optimal. But is it?

In this talk, we will embark on a journey that challenges conventional wisdom. By leveraging mathematical analysis, statistics, and empirical measurements—with the aid of ChatGPT as our trusty digital companion—we will discuss a modified binary search algorithm that performs fewer comparisons on average and offers greater room for optimization..

If you're drawn to the beauty of algorithms, the craft of code optimization, and the underlying mathematics that weave the fabric of our digital universe, this talk is an invitation to see an old problem with new eyes and to embrace AI as a new ally. Come prepared to deepen your understanding and sharpen your skills with a fresh perspective on a classic algorithm, and learn how the fusion of human intuition and artificial intelligence can unlock uncharted territories in problem-solving.

Andrei Alexandrescu

Andrei Alexandrescu is a researcher, software engineer, and author. He wrote three best-selling books on programming (Modern C++ Design, C++ Coding Standards, and The D Programming Language) and numerous articles, papers, and book chapters on wide-ranging topics from programming to language design to Machine Learning to Natural Language Processing. Andrei holds a PhD in Computer Science from the University of Washington and a BSc in Electrical Engineering from University "Politehnica" Bucharest. He currently works as a Principal Research Scientist at NVIDIA.