List of Accepted Posters

List of posters with abstracts (PDF)
  • The Stretch Factor of $L_1$- and $L_\infty$-Delaunay Triangulations
    N. Bonichon, C. Gavoille, N. Hanusse and L. Perkovic

  • The NOF Multiparty Communication Complexity of Composed Functions
    Anil Ada, Arkadev Chattopadhyay, Omar Fawzi and Phuong Nguyen

  • Spectral Norm of Symmetric Functions
    Anil Ada, Omar Fawzi and Hamed Hatami

  • A Uniform Min-Max Theorem and Its Applications
    Colin Jia Zheng

  • On the Complexity of Trial and Error
    Xiaohui Bei, Ning Chen and Shengyu Zhang

  • Online Bottleneck Matching
    Barbara Anthony and Christine Chung

  • Testing Lipschitz Functions on Hypergrid Domains
    Pranjal Awasthi, Madhav Jha, Marco Molinaro and Sofya Raskhodnikova

  • Limitations of Local Filters of Lipschitz and Monotone Functions
    Pranjal Awasthi, Madhav Jha, Marco Molinaro and Sofya Raskhodnikova

  • Optimal Mechanisms for Selling Information
    Moshe Babaioff, Robert Kleinberg and Renato Paes Leme

  • Node-weighted Network Design in Planar and Minor-closed Families of Graphs
    Chandra Chekuri, Alina Ene and Ali Vakilian

  • Streaming Balanced Graph Partitioning for Random Graphs
    Isabelle Stanton

  • On Bitcoin and Red Balloons
    Moshe Babaioff, Shahar Dobzinski, Sigal Oren and Aviv Zohar

  • Matrix Lie Algebra Isomorphism
    Joshua A. Grochow

  • Online Mixed Packing and Covering
    Umang Bhaskar and Lisa Fleischer

  • Privacy in Sparse, High-dimensional Learning Problems
    Daniel Kifer, Adam Smith and Abhradeep Guha Thakurta

  • Tight Bounds on Proper Equivalence Query Learning of DNF
    Lisa Hellerstein, Devorah Kletenik, Linda Sellie and Rocco Servedio

  • Approximately Revenue-Maximizing Auctions for Deliberative Agents
    L. Elisa Celis, Anna R. Karlin, Kevin Leyton-Brown, C. Thach Nguyen and David R. M. Thompson

  • Tatonnement in Ongoing Markets of Complementary Goods
    Yun Kuen Cheung, Richard Cole and Ashish Rastogi

  • Finding Fair and Fast Resource Allocations
    Junghwan Shin and Sanjiv Kapoor

  • Bicriteria Approximation for the Reordering Buffer Problem
    Siddharth Barman, Shuchi Chawla and Seeun William Umboh

  • Finding Overlapping Communities in Social Networks: Toward a Rigorous Approach
    Sanjeev Arora, Rong Ge, Sushant Sachdeva and Grant Schoenebeck

  • Feasibility and Completeness of Cryptographic Tasks in the Quantum World
    Jonathan Katz, Fang Song, Hong-Sheng Zhou and Vassilis Zikas

  • Approximating the Exponential, the Lanczos Method and an $\tilde{O}(m)$-Time Spectral Algorithm for Balanced Separator
    Lorenzo Orecchia

  • Testing and learning submodular functions
    Sofya Raskhodnikova and Grigory Yaroslavtsev

  • A Near-Linear Time $\epsilon$-Approximation Algorithm for Geometric Bipartite Matching
    Pankaj Agarwal and R. Sharathkumar

  • Cutting Spending by adding options: Getting out of an Obligation by Providing a Menu of Cheaper Alternatives
    Vincent Conitzer, Janardhan Kulkarni, Kamesh Munagala and Xioming Xu

  • Graph maintenance problems and churn complexity for distributed overlays
    Lucas T. Cook

  • Analyzing Graph Connectivity via Random Linear Projections
    Kook Jin Ahn, Sudipto Guha and Andrew McGregor

  • Structure from Local Optima: Factoring Distributions and Learning Subspace Juntas
    Santosh Vempala and Ying Xiao

  • Limits of Random Oracle in Secure Computation
    Mohammad Mahmoody, Hemanta Maji and Manoj Prabhakaran

  • Minimax Option Pricing Meets Black-Scholes in the Limit
    Jacob Abernethy, Rafael Frongillo and Andre Wibisono