default search action
Theoretical Computer Science, Volume 811
Volume 811, April 2020
- Shantanu Das, Sébastien Tixeuil:
Special issue on Structural Information and Communication Complexity. 1-2 - Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rózanski, Grzegorz Stachowiak:
Token traversal in ad hoc wireless networks via implicit carrier sensing. 3-20 - Magnús M. Halldórsson, Stephan Holzer, Evangelia Anna Markatou, Nancy A. Lynch:
Leader election in SINR model with arbitrary power control. 21-28 - Magnús M. Halldórsson, Christian Konrad:
Improved distributed algorithms for coloring interval graphs with application to multicoloring trees. 29-41 - Laurent Feuilloley:
How long it takes for an ordinary node with an ordinary id to output? 42-55 - Sebastian Brandt, Klaus-Tycho Foerster, Benjamin Richner, Roger Wattenhofer:
Wireless evacuation on m rays with k searchers. 56-69 - Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger:
A general lower bound for collaborative tree exploration. 70-78 - Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
Gathering in dynamic rings. 79-98 - Lata Narayanan, Kangkang Wu:
How to choose friends strategically. 99-111 - Keren Censor-Hillel, Ami Paz, Mor Perry:
Approximate proof-labeling schemes. 112-124
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.