In order to enable an iCal export link, your account needs to have an API key created. This key enables other applications to access data from within Indico even when you are neither using nor logged into the Indico system yourself with the link provided. Once created, you can manage your key at any time by going to 'My Profile' and looking under the tab entitled 'HTTP API'. Further information about HTTP API keys can be found in the Indico documentation.
Additionally to having an API key associated with your account, exporting private event information requires the usage of a persistent signature. This enables API URLs which do not expire after a few minutes so while the setting is active, anyone in possession of the link provided can access the information. Due to this, it is extremely important that you keep these links private and for your use only. If you think someone else may have acquired access to a link using this key in the future, you must immediately create a new key pair on the 'My Profile' page under the 'HTTP API' and update the iCalendar links afterwards.
Permanent link for public information only:
Permanent link for all public and protected information:
New bounds on thresholds of constraint satisfaction problems from spatial coupling
This work is about a novel technique called spatial coupling and its application in the analysis of random constraint satisfaction problems (CSP). Spatial Coupling was recently invented in the area of error correcting codes thus resulting in efficient capacity achieving codes for a wide range of channels. However, this technique is not limited to problems in communications. It can be applied in the much broader context of graphical models. We describe here a general methodology for applying spatial coupling to constraint satisfaction problems. We argue that spatially coupled CSPs are much easier to solve than standard CSPs, while the satisfiability threshold of coupled and standard CSPs are the same. These features provide a new avenue for obtaining better, provable, algorithmic lower bounds on satisfiability thresholds of the standard CSP models. Some of these lower bounds surpass the current best (rigorous) lower bounds in the literature. (This is joint work with D. Achlioptas, H. Hassani and R. Urbanke)