Bernard Chazelle

BC 60

A workshop in honor of Bernard Chazelle's 60th birthday.

When? June 17, 2016, 14:30–18:00
Where? Boston. Sackler building, 145 Harrison Ave. This at the Tufts downtown campus. Do not go to Medford!
Part of CG week events, and SoCG conference at Tufts University. Event takes place two days before beginning of STOC conference. Both SoCG and STOC goers welcome.

Sponsored by Department of Computer Science of

(Tentative) Schedule

  • 14:30–14:40

    Pankaj Agarwal : Opening remarks

  • 14:40–15:20

    David Dobkin

    Bernard's research in the 70's

    As Bernard's thesis advisor, I introduced him to the field of computational geometry when he was a first year graduate students. In this talk, I survey the situation at that time, his early results and further research they have inspired.
  • 15:20–16:00

    Micha Sharir


    From 60 BC to BC 60: Computational Geometry and Bernard (and me)



    In the talk I will review some significant milestones in Bernard Chazelle's work during the late 1980s and the 1990s, Including his work on cuttings, arrangements, range searching, discrepancy, and some other topics. I will mix the scientific contents with nostalgic anecdotes that highlight lighter aspects of Chazelle's otherwise deep, fundamental, and highly influential contributions to geometry.
  • 16:00–16:30

    Cakes, Coffee, and Tea

  • 16:30–17:10

    Ken Clarkson

    The Thrill Goes On: Bernard Yesterday and Today

    From the excruciatingly difficult to the achingly elegant, Bernard Chazelle's work on algorithms, especially geometric or natural ones, has been profoundly influential. I'll sketch a few examples that have been inspiring to me, including 1-dimensional range queries, low-stabbing spanning trees, high-order Voronoi diagram construction, deterministic constructions, and the s-energy of a system.
  • 17:10–18:00

    Presentation by former students:

    Nir Ailon (IIT Technion)
    My research with Bernard, and its long lasting influence on my current work.
    Wolfgang Mulzer (FU Berlin):
    Entropy, Heredity, and Self-Improvement: my work with Bernard.
  • 18:00–

    Wine, beer and snack reception: Across the street on 160 Harrison Ave. in courtyard.

About Bernard Chazelle

Bernard Chazelle was born in 1955 in Paris, France. He received his PhD under the supervision of David P. Dobkin from Yale university in 1980. He wrote the second PhD thesis on computational geometry and taught the first class on it. Bernard Chazelle has been a fixture of the field since the very beginning, and some of the most well-known algorithms and techniques used by the community are associated with him. He has also worked on sublinear algorithms and more generally with techniques for dealing with large data. More recently, he is working on natural algorithms, bringing insights from theoretical computer science into the study of natural phenomena. Over the years, he has published more than 130 journal papers and been a mentor to more than 10 PhD students.

Registration

There is no official registration and no registration fee. The event is sponsored by Princeton University Computer Science Department.
In case you plan to attend and you are not registering for SoCG, please do let us know by submitting the form at the bottom of this page.

Organizers

Also, special thanks to Pankaj Agarwal, Sariel Har-Peled and SoCG organizers, especially Greg Aloupis .
For questions, please email Nir at nailon [at-sign] cs.technion.ac.il