Previous Conferences & Workshops

Property testing considers the following general question: how many queries to some combinatorial object (e.g., a boolean function or a graph) do we need to determine whether the object has some property P or whether it is "far" from having the...

I will survey the development of modern infinite cardinal arithmetic, focusing mainly on S. Shelah's algebraic pcf theory, which was developed in the 1990s to provide upper bounds in infinite cardinal arithmetic and turned out to have applications...

We prove completeness results for certain class of functions which have implications for automatic proving of universally-composable security theorems for ideal and real functionalities composed of if-then-else programs with (uniform) random number...

It is well-known that there are connections between the representation theory of a reductive p-adic group and the topology of the flag variety of the Langlands L-group. We will discuss Whittaker functions in this light. The Casselman-Shalika formula...