DISC 2013

Category Archives: News

DISC 2013 Program and Local Information Pamphlet

The detailed program and local information is now available in pdf.

Deadline extension by one week

The DISC 2013 organization committee decided together with the steering committee to provide the DISC 2013 proceedings on a USB (Disk on Key) and not on paper**.  As a result Springer gave us extra time on the schedule (no printing and shipping on the schedule critical path).   And we pass this extra time to those of you that plan to submit a paper to DISC. Thus the deadline is postponed by one week, giving you more time to polish the submission and make it more readable and of higher quality.
The new deadlines are thus:
Registration & abstract submission        May 12, 2013
Submission                                                    May 19, 2013
Acceptance notification                             July 14, 2013
Camera ready                                               July 30, 2013

**  Those that still want a paper proceedings will be able to purchase it directly from Springer.  An online version will be available to registered participants a few days before the conference for those interested to bring hard copies of specific papers.

2-Feb-2013 – CFP is out

Check out the Call For Papers here.

Watch some videos on Jerusalem here.

ADGA 2013 Workshop announced

The 2nd Workshop on Advances on Distributed Graph Algorithms – ADGA 2013 – is announced.

ADGA 2013 will be co-located with DISC 2013 (Jerusalem, Israel, October 2013). The workshop is chaired by Jukka Suomela.

The first Doctoral Dissertation Award go to Keren Censor-Hillel

On Wednesday, October 17, 2012, the first Principles of Distributed Computing Doctoral Dissertation Award was given to Dr. Keren Censor-Hillel for her 2010 thesis “Probabilistic Methods in Distributed Computing”, supervised by Professor Hagit Attiya at the Technion, Israel.  The main contribution of her thesis is proving that the total step complexity of asynchronous randomized consensus for n processes is a quadratic function of n, solving a longstanding open problem. This result involved developing and analyzing a new shared coin algorithm that improved the previously best randomized consensus algorithm and creating a randomized valency technique that improved the lower bound. Another very interesting result in her thesis is the implementation of a counter with polylogarithmic individual step complexity, which she uses to derive a randomized consensus algorithm with linear individual step complexity. The thesis also contains a number of other related results, including the first randomized k-set agreement algorithm. As the nomination letter said,  “The thesis has changed the way randomization is applied and analyzed in distributed computing, especially in the context of the consensus problem”. The work in Keren’s thesis has been presented in six conference papers: three at PODC and one at each of SODA, SPAA, and STOC. It has also led to five journal papers, including two in JACM and one in SICOMP. Her thesis is coherent and well organized. It is exceptionally well written, with clear explanations of technically sophisticated proofs.

Seventeen very strong theses were nominated for the award. The award committee consisted of Professor Faith Ellen (chair), Professor Pierre Fraigniaud, Professor Maurice Herlihy, Professor Friedhelm Meyer auf der Heide, Professor David Peleg, and Professor Sergio Rajsbaum.  Dr. Tushar Chandra was a consultant to the committee.


13-Oct-2012 – Site is open

The website is officially open 🙂

Call for paper is initiali out. Dates are set up.

So we are ready to go. We hope to see you all in Jerusalem next year.

Disc 2013 Sponsors