Past Events

Abstract: Balls and bins games are a standard technique for analyzing hashing algorithms. Backyards are a technique for making hash tables faster. We give a balls and bins analysis of

The well-exploited theory of SIMPLE continued fractions has produced some dazzling identities and wonderful irrationality proofs. The often-overlooked theory of GENERAL continued fractions is harder to champion, but just as,

Obvious strategyproofness (OSP) has emerged in recent years as a "gold standard" for mechanisms which must interact with agents who are not hyper-rational [Li]. Very briefly, a mechanism is OSP

Today Artificial Intelligence algorithms are used to make multiple decisions affecting human lives, and many such algorithms, such as those used in parole decisions, have been reported to be biased.

In this talk I shall argue that we should recast the foundations of mathematics using the foundational notion of a bit, rather than the much more ambiguous notion of a

I will speak about some recent developments in topology-hiding communication (and computation). A topology-hiding broadcast protocol for class of networks, allows a party to send a message to every other

We say a family of graphs is triangle-intersecting if the intersection of any two graphs in the family contains a triangle. If we consider graphs on n vertices, how large

Sophisticated computation embedded in a variety of sociotechnical systems has become an essential enabler of everyday life As such systems have become more powerful and more present the interdisciplinary research area of computer science and law has begun to take shape This workshop will explore establishing rigorous foundations for this

The paper to be presented is: Title: Two-sided Matching Markets with Correlated Random Preferences Have Few Stable Pairs Authors: Hugo Gimbert, Claire Mathieu, Simon Mauras Paper Abstract: Stable matching in

I will discuss an approach to (generalized) orthogonal polynomials over noncommutative rings by using infinite Hankel matrices. As an example, I will consider properties of Hankel matrices consisting of noncommutative

Abstract: I will discuss a sublinear-time algorithm for approximately counting the number of k-cliques in bounded arboricity graphs. Counting cliques (and triangles in particular) is a fundamental task in graph

We describe how combinatorial enumeration and listing problem in connection with structural properties of hypermatrices determine critical aspect of the complexity of Boolean function. The talk will not assume familiarity

We consider the problem of preprocessing a weighted planar graph in order to answer exact distance and shortest path queries. As in the recent algorithms of Cohen-Addad et al. (2017),

I will talk about partition identities and q-series identities (and especially identities in the intersection of those two sets), and the use of computer algebra systems in experimentally discovering them.

Aid policy has the potential to alleviate global poverty by targeting areas of concentrated need. A critical question remains, however, over whether aid is reaching the areas of most need.

This week will cover two papers: Title 1: An Experimental Investigation of Preference Misrepresentation in the Residency Match Authors: Alex Rees-Jones and Samuel Skowronek Paper Abstract: The development and deployment

Computer systems have become the primary mediator of social and economic interactions. A defining aspect of such systems is that the participants have preferences over system outcomes and will manipulate

Diagonals of rational functions naturally occur in many applications, such as lattice statistical mechanics and enumerative combinatorics. In the mid 1980's Gilles Christol famously conjectured that any globally bounded D-finite

Expanders enable us to make exciting progress in several areas of graph algorithms in the last few years. As examples, we show (1) the first deterministic almost-linear time algorithms for

The paper to be presented is: Title: Two-Sided Random Matching Markets: Ex-Ante Equivalence of the Deferred Acceptance Procedures Author: Simon Mauras Paper Abstract: Stable matching in a community consisting of