Johannes Bill: Unsupervised learning in spiking neural networks with memristor synapses Friday, March 24, 2017  1:00pm to 2:00pm Abstract: In an increasingly datarich world, braininspired computing concepts operating neuromorphic hardware have shown great promise for processing large datasets within tight volume and power budgets. 

Nicholas Schiefer: Computation and Construction in the Chemical Reaction NetworkControlled Tile Assembly Model Friday, December 9, 2016  1:00pm to 2:30pm Tilebased selfassembly and chemical reaction networks provide two wellstudied models of scalable molecular computation. 

HsinHao Su: Distributed Degree Splitting, Edge Coloring, and Orientations Friday, December 2, 2016  1:00pm to 2:30pm We consider a family of closelyrelated distributed graph problems, which we call degree splitting, where roughly speaking the objective is to partition (or orient) the edges such that each node's degree is split almost unifo 

Fernando Benavides: Introduction to Discrete Morse Theory for Distributed Computing Wednesday, November 16, 2016  11:00am to 12:30pm Explain what is discrete Morse theory and how to use it to analyse distributed read/write waitfree algorithms. 

Nisha Panwar: On the Fly Authentication in Vehicular Networks Tuesday, November 1, 2016  1:00pm to 2:30pm Autonomous vehicles will establish a spontaneous connection over a wireless radio channel while coordinating actions and information. 

Merav Parter and Cameron Musco: Computational Tradeoffs in Biological Neural Networks: SelfStabilizing WinnerTakeAll Networks Friday, October 21, 2016  1:00pm to 2:30pm We initiate a line of investigation into biological neural networks from an algorithmic perspective. 

Alkida Balliu: Local Distribution Verification Monday, October 17, 2016  11:00am to 12:00pm We are considering distributed network computing, in which computing entities are connected by a network modeled as a connected graph. These entities are located at the nodes of the graph, and they exchange information by messagepassing along its edges. 

Sergio Rajsbaum: Specifying Concurrent Problems: Beyond Linearizability and up to Tasks Friday, September 30, 2016  1:00pm to 2:30pm Tasks and objects are two predominant ways of specifying distributed problems. A task specifies for each set of processes (which may run concurrently) the valid outputs of the processes. An object specifies the outputs the object may produce when it is accessed sequentially. 

Gopal Pandurangan: Distributed Computation of Largescale Graph Problems Thursday, June 16, 2016  1:00pm to 2:30pm Abstract: Motivated by the increasing need for fast distributed processing of largescale graphs such as the Web graph, biological networks and various social networks, we study a number of fundamental graph problems 

Cameron Musco and HsinHao Su: AntInspired Density Estimation via Random Walks Friday, April 1, 2016  1:00pm to 2:30pm Abstract: I will discuss our recent PODC submission on AntInspired Density Estimation. The work gives a probabilistic analysis of a very simple antinspired algorithm for population density estimation. 