Past Events

Color each vertex of an infinite graph blue with probability p and red with probability 1-p, independently among vertices. For which values of p is there an infinite connected component

A finite group of order $n$ can be represented by its Cayley table. In the word-RAM model the Cayley table of a group of order $n$ can be stored using

Due to the increasing size and complexity of today's graphs, there is a need for new algorithms that meet their demands. One central area in this endeavor is computing and

Starting from one of the well-known reformulations of the 4-color theorem, I'll show some experiments I did concerning proper 4-colorings of the sphere triangulations in which the maximum number of

We consider sorting networks that are constructed from comparators of arity k>2. That is, in our setting the arity of the comparators — or, in other words, the number of

The 18th Conference on Web and Internet Economics will take place December 12 16 2022 in Troy NY It will be associated with the DIMACS Special Focus on Mechanisms and Algorithms to Augment Human Decision Making and hosted by Rensselaer Polytechnic Institute RPI Over the past decade research in theoretical

In this talk we will consider the sorting with priced information problem, where different comparisons have different costs and the goal is to develop a cheap sorting algorithm. I will

On days without meaning, without direction -- all of them? -- I sometimes ask myself, "which way should my chakras be aligned?" We all do, right? Right? Well, we aren't

HMC22 is the second workshop in the Algorithmic Futures Policy Lab series and will focus on identifying challenges and opportunities presented by collaborations between humans and algorithmic systems including artificial intelligence powered systems in an uncertain world with a particular focus on aspects of relevance to the EU and Australia

In this talk we will consider a unified generating functions for 9 different kinds of set partitions including cyclically ordered set partitions. Such generating function depends on 4 parameters. We

Understanding the behavior of multi-player (multi-prover) games under parallel repetition is an important problem in theoretical computer science. In a k-player game G, a referee chooses questions (x^1, ..., x^k)

Differentially private mechanisms protect privacy by introducing additional randomness into the data. When the data analyst has access only to the privatized data, it is a challenge to perform valid

During the Mars Day of Scarlet Knight High School (refer to the Pizza Seminar play on Oct 7), the board game club leader (performed by Sriram) was playing with chess

Expander graphs are fundamental objects in theoretical computer science and mathematics. They have numerous applications in diverse fields such as algorithm design, complexity theory, coding theory, pseudorandomness, group theory, etc.

Finding the smallest integer N=ES_d(n) such that in every configuration of N points in R^d in general position there exist n points in convex position is one of the most

I will discuss two different topics. The first describing joint work with Noga Alon and the second with John W. Moon. For a detailed abstract see here . Link to

Change - point analysis is concerned with detecting and locating structure breaks in the underlying model of a data sequence. It finds an abundance of applications in a wide variety

Persistent homology is commonly encoded by vector space-valued functors indexed by posets. These functors are called tame, or persistence modules, and capture the life-span of homological features in a dataset.

As machine learning black boxes are increasingly being deployed in critical domains such as healthcare and criminal justice, there has been a growing emphasis on developing techniques for explaining these