國立清華大學資訊工程學系

Department of Computer Science

National Tsing Hua University

專題演講

SEMINAR

主講人：Yi-Jun Chang (張以潤)

SPEAKER (   U. Michigan / NCTU / ETH Zurich)

題　目：Introduction to distributed local graph   algorithms

TOPIC   

時  間： 108年6月3日(一)上午10點至12點

DATE　　

地　點： 台逹館107室

PLACE

Abstract:

This is an introductory-level talk on distributed local graph algorithms. I will present some basic algorithms for graph coloring,

maximal independent set, and various useful graph decompositions in the LOCAL model of distributed computing.

Biography:

Yi-Jun Chang received his PhD in Computer Science and Engineering from University of Michigan in May 2019 under the supervision of Seth Pettie.

He is broadly interested in theoretical computer science, with a focus on local distributed graph algorithms.

His dissertation addressed fundamental questions on the LOCAL model of distributed computing, such as "how much does randomness help?"

and "can we solve more problems given more time?". 

聯絡人：韓永楷教授.