skip to main content
review-article

SIROCCO 2015 Review

Published: 01 December 2015 Publication History
First page of PDF

References

[1]
Leonid Barenboim and David Peleg. Nearly optimal local broadcasting in the SINR model with feedback. In Christian Scheideler, editor, Structural Information and Communication Complexity, volume 9439 of Lecture Notes in Computer Science, pages 164--178. Springer International Publishing, 2015.
[2]
Marcin Bienkowski, Artur Kraska, and Pawel Schmidt. A randomized algorithm for online scheduling with interval conicts. In Christian Scheideler, editor, Structural Information and Communication Complexity, volume 9439 of Lecture Notes in Computer Science, pages 91--103. Springer International Publishing, 2015.
[3]
Marc Bury. Randomized OBDD-based graph algorithms. In Christian Scheideler, editor, Structural Information and Communication Complexity, volume 9439 of Lecture Notes in Computer Science, pages 254--269. Springer International Publishing, 2015.
[4]
Keren Censor-Hillel and Tariq Toukan. On fast and robust information spreading in the vertex-congest model. In Christian Scheideler, editor, Structural Information and Communication Complexity, volume 9439 of Lecture Notes in Computer Science, pages 270--284. Springer International Publishing, 2015.
[5]
Gennaro Cordasco, Luisa Gargano, AdeleA. Rescigno, and Ugo Vaccaro. Optimizing spread of influence in social networks via partial incentives. In Christian Scheideler, editor, Structural Information and Communication Complexity, volume 9439 of Lecture Notes in Computer Science, pages 119--134. Springer International Publishing, 2015.
[6]
Pierre Fraigniaud, Juho Hirvonen, and Jukka Suomela. Node labels in local decision. In Christian Scheideler, editor, Structural Information and Communication Complexity, volume 9439 of Lecture Notes in Computer Science, pages 31--45. Springer International Publishing, 2015.
[7]
Mohsen Ghaffari and Bernhard Haeupler. Distributed algorithms for planar networks II: Lowcongestion shortcuts, MST, and min-cut. In SODA, 2016. to appear.
[8]
Lukasz Jez, Yishay Mansour, and Boaz Patt-Shamir. Scheduling multipacket frames with frame deadlines. In Christian Scheideler, editor, Structural Information and Communication Complexity, volume 9439 of Lecture Notes in Computer Science, pages 76--90. Springer International Publishing, 2015.
[9]
Dennis Komm, Rastislav Kralovic, Richard Kralovic, and Jasmin Smula. Treasure hunt with advice. In Christian Scheideler, editor, Structural Information and Communication Complexity, volume 9439 of Lecture Notes in Computer Science, pages 328--341. Springer International Publishing, 2015.
[10]
Yoram Moses and Katia Patkin. Under the hood of the bakery algorithm: Mutual exclusion as a matter of priority. In Christian Scheideler, editor, Structural Information and Communication Complexity, volume 9439 of Lecture Notes in Computer Science, pages 399--413. Springer International Publishing, 2015.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGACT News
ACM SIGACT News  Volume 46, Issue 4
December 2015
103 pages
ISSN:0163-5700
DOI:10.1145/2852040
Issue’s Table of Contents
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 2015
Published in SIGACT Volume 46, Issue 4

Check for updates

Qualifiers

  • Review-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 53
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media