CS Events

Computer Science Department Colloquium Graph Exploration and Applications of Breadth-First Search (BFS)
Export Event Save iCal Send to Google Calendar Send to Yahoo Calendar Send to Outlook Live Send to Microsoft Outlook Save iCal Preserve formatting in description (only supported in some calendar applications) Close Friday, February 16, 2024, 10:30am - 12:00pm

Speaker: Surya Teja Gavva

Bio

Surya Teja Gavva graduated with a Ph.D. in mathematics from Rutgers University in May 2023 and is currently a doctoral lecturer at Queens College, City University of New York. His research interests include analytic problems in theoretical computer science and number theory, specifically Harmonic analysis (Analysis of Boolean functions, L-functions and Automorphic Forms), Discrepancy Theory and Discrete Probability. He is passionate about teaching, mentoring students and community organizing. He has taught a wide variety of courses in mathematics and computer science since 2010.

Location : CoRE 301

: 

Event Type: Computer Science Department Colloquium

Abstract: This lecture will delve into the concept of graph exploration, focusing on one of its most fundamental algorithms, Breadth-First Search (BFS). We will explore the inner workings of BFS, including a queue implementation and its wide range of applications that make it an essential tool in computer science and beyond.

: 

Contact  Professor Richard Martin

Join Zoom Meeting
https://rutgers.zoom.us/j/2014444359?pwd=WW9ybFNCNVFrUWlycHowSHdNZjhzUT09
Meeting ID: 201 444 4359
Password: 550978