The ACM Federated Computing Research Conference — which brings together 13 academic conferences in computer science, and which will feature a lecture by Geoffrey Hinton and Yann LeCun (joint winners of the Turing Award, along with Yoshua Bengio) — will have strong representation from Penn this year!

Starting with the conferences: In STOC, one of the top venues in computer science theory, CIS has three papers:

  1. A New Algorithm for Decremental Single-Source Shortest Paths with Applications to Vertex-Capacitated Flow and Cut Problems Julia Chuzhoy, Sanjeev Khanna
  2. Polynomial Pass Lower bounds for Graph Streaming Algorithms Sepehr Assadi, Yu Chen, Sanjeev Khanna
  3. Capacity lower bound for the Ising perceptron Jian Ding, Nike Sun

At PLDI, one of the top venues in programming language design and implementation, we have three additional papers:

  1. Continuously Reasoning about Programs using Differential Bayesian Inference Kihong Heo, Mukund Raghothaman, Xujie Si, Mayur Naik
  2. Data-Trace Types for Distributed Stream Processing Systems Konstantinos Mamouras, Caleb Stanford, Rajeev Alur, Zachary G. Ives, Val Tannen
  3. Ignis: Scaling Distribution-Oblivious Systems with Light-Touch Distribution Nikos Vasilakis, Ben Karel, Yash Palkhiwala, John Sonchack, André DeHon, Jonathan M. Smith

In the COLT conference on computational learning theory, Penn is also represented well!

  1. Is your function low dimensional? Anindya De, Elchanan Mossel, Joe Neeman

Finally, Penn faculty and postdocs are giving keynote or invited talks at three FCRC-related workshops:

  1. [Workshop Talk] Overview of the DeepSpec Expedition and its Capstone Application, Benjamin C. Pierce, DeepSpec 2019
  2. [Keynote Talk] Learning to Reason about Programs, Mayur Naik, MAPL 2019
  3. [Invited Talk] Precise Program Reasoning using Probabilistic Methods, Mukund Raghothaman, DPA 2019

Congratulations to all involved!

(Thanks to Mayur Naik for the details!)

Categories: Stories