Abstract is missing.
- Some Sequential Algorithms are Almost Always ParallelGuy E. Blelloch. 1 [doi]
- Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio NetworksArtur Czumaj, Peter Davies. 3-12 [doi]
- The Space Requirement of Local Forwarding on Acyclic NetworksBoaz Patt-Shamir, Will Rosenbaum. 13-22 [doi]
- Communication Primitives in Cognitive Radio NetworksSeth Gilbert, Fabian Kuhn, Chaodong Zheng. 23-32 [doi]
- Broadcasting in Noisy Radio NetworksKeren Censor Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic. 33-42 [doi]
- Gossip in a Smartphone Peer-to-Peer NetworkCalvin C. Newport. 43-52 [doi]
- Analyzing Contention and Backoff in Asynchronous Shared MemoryNaama Ben-David, Guy E. Blelloch. 53-62 [doi]
- A Layered Architecture for Erasure-Coded Consistent Distributed StorageKishori M. Konwar, N. Prakash, Nancy A. Lynch, Muriel Médard. 63-72 [doi]
- Seeing is Believing: A Client-Centric Specification of Database IsolationNatacha Crooks, Youer Pu, Lorenzo Alvisi, Allen Clement. 73-82 [doi]
- Space Complexity of Fault-Tolerant Register EmulationsGregory V. Chockler, Alexander Spiegelman. 83-92 [doi]
- Brief Announcement: Readers of Wait-Free Unbounded Registers Must WriteEric Ruppert. 93-94 [doi]
- Brief Announcement: Fast Shared Counting using (O(n)) Compare-and-Swap RegistersPankaj Khanchandani, Roger Wattenhofer. 95-96 [doi]
- Brief Announcement: Fence Insertion for Straight-line Programs is in PMohsen Lesani. 97-99 [doi]
- LCL Problems on GridsSebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski. 101-110 [doi]
- On the Multiparty Communication Complexity of Testing Triangle-FreenessOrr Fischer, Shay Gershtein, Rotem Oshman. 111-120 [doi]
- What Can be Sampled Locally?Weiming Feng, Yuxin Sun, Yitong Yin. 121-130 [doi]
- Distributed MST and Routing in Almost Mixing TimeMohsen Ghaffari, Fabian Kuhn, Hsin-Hao Su. 131-140 [doi]
- Distributed MIS via All-to-All CommunicationMohsen Ghaffari. 141-149 [doi]
- Brief Announcement: Optimal Address-Oblivious Epidemic DisseminationHugues Mercier, Laurent Hayez, Miguel Matos. 151-153 [doi]
- Blockchains and the Future of Distributed ComputingMaurice Herlihy. 155 [doi]
- A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message ComplexitiesMichael Elkin. 157-163 [doi]
- Distributed Approximation of Maximum Independent Set and Maximum MatchingReuven Bar-Yehuda, Keren Censor Hillel, Mohsen Ghaffari, Gregory Schwartzman. 165-174 [doi]
- Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded DiversityLeonid Barenboim, Michael Elkin, Tzalik Maimon. 175-184 [doi]
- Optimal Distance Labeling Schemes for TreesOfer Freedman, Pawel Gawrychowski, Patrick K. Nicholson, Oren Weimann. 185-194 [doi]
- Brief Announcement: How Large is your Graph?Varun Kanade, Frederik Mallmann-Trenn, Victor Verdugo. 195-197 [doi]
- Brief Announcement: Distributed Approximation for Tree AugmentationKeren Censor Hillel, Michal Dory. 199-201 [doi]
- Brief Announcement: Leader Election in SINR Model with Arbitrary Power ControlMagnús M. Halldórsson, Stephan Holzer, Evangelia Anna Markatou. 203-205 [doi]
- Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling SetsShreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson 0002. 207-209 [doi]
- Recoverable Mutual Exclusion in Sub-logarithmic TimeWojciech M. Golab, Danny Hendler. 211-220 [doi]
- Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC ModelGeorge Giakkoupis, Philipp Woelfel. 221-229 [doi]
- Transactional Lock Elision Meets CombiningAlex Kogan, Yossi Lev. 231-240 [doi]
- On Using Time Without Clocks via Zigzag CausalityAsa Dan, Rajit Manohar, Yoram Moses. 241-250 [doi]
- Brief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data StructuresThomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen. 251-253 [doi]
- Brief Announcement: Gossiping with LatenciesSeth Gilbert, Peter Robinson, Suman Sourav. 255-257 [doi]
- Brief Announcement: A Probabilistic Performance Model and Tuning Framework for Eventually Consistent Distributed Storage SystemsShankha Chatterjee, Wojciech M. Golab. 259-261 [doi]
- Effectiveness of Delaying Timestamp ComputationSandeep S. Kulkarni, Nitin H. Vaidya. 263-272 [doi]
- Symmetry Breaking with Noisy ProcessesSeth Gilbert, Calvin C. Newport. 273-282 [doi]
- The Power of Choice in Priority SchedulingDan Alistarh, Justin Kopinsky, Jerry Li 0001, Giorgi Nadiradze. 283-292 [doi]
- A Template for Implementing Fast Lock-free Trees Using HTMTrevor Brown 0001. 293-302 [doi]
- Adding Concurrency to Smart ContractsThomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen. 303-312 [doi]
- Verifiable Outsourced Computation: A SurveyRosario Gennaro. 313 [doi]
- FruitChains: A Fair BlockchainRafael Pass, Elaine Shi. 315-324 [doi]
- Coordination Without Prior AgreementGadi Taubenfeld. 325-334 [doi]
- Ignore or Comply?: On Breaking Symmetry in ConsensusPetra Berenbrink, Andrea E. F. Clementi, Robert Elsässer, Peter Kling, Frederik Mallmann-Trenn, Emanuele Natale. 335-344 [doi]
- Life Beyond Set AgreementDavid Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg. 345-354 [doi]
- Brief Announcement: Hierarchical ConsensusBenjamin Bengfort, Pete Keleher. 355-357 [doi]
- Brief Announcement: Statement Voting and Liquid DemocracyBingsheng Zhang, Hong-Sheng Zhou. 359-361 [doi]
- Brief Announcement: Rapid Asynchronous Plurality ConsensusRobert Elsässer, Tom Friedetzky, Dominik Kaaser, Frederik Mallmann-Trenn, Horst Trinker. 363-365 [doi]
- Brief Announcement: Object Oriented ConsensusYehuda Afek, James Aspnes, Edo Cohen, Danny Vainstein. 367-369 [doi]
- Greedy Routing and the Algorithmic Small-World PhenomenonKarl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla. 371-380 [doi]
- Triangle Finding and Listing in CONGEST NetworksTaisuke Izumi, François Le Gall. 381-389 [doi]
- Asynchronous Shared ChannelGianluca De Marco, Grzegorz Stachowiak. 391-400 [doi]
- Self-organized Segregation on the GridHamed Omidvar, Massimo Franceschetti. 401-410 [doi]
- Brief Announcement: Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary NetworksMichiko Inoue, Fukuhito Ooshita, Sébastien Tixeuil. 411-413 [doi]
- Brief Announcement: Secure Self-Stabilizing ComputationShlomi Dolev, Karim Eldefrawy, Juan A. Garay, Muni Venkateswarlu Kumaramangalam, Rafail Ostrovsky, Moti Yung. 415-417 [doi]
- Stateless ComputationDanny Dolev, Michael Erdmann, Neil Lutz, Michael Schapira, Adva Zair. 419-421 [doi]
- Towards Efficient Verification of Population ProtocolsMichael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer. 423-430 [doi]
- Clocked Population ProtocolsJames Aspnes. 431-440 [doi]
- A Distributed Learning Dynamics in Social GroupsL. Elisa Celis, Peter M. Krafft, Nisheeth K. Vishnoi. 441-450 [doi]
- n) Convergence TimeAndreas Bilke, Colin Cooper, Robert Elsässer, Tomasz Radzik. 451-453 [doi]
- Brief Announcement: Byzantine-Tolerant Machine LearningPeva Blanchard, El Mahdi El Mhamdi, Rachid Guerraoui, Julien Stainer. 455-457 [doi]
- Brief Announcement: Certified Multiplicative Weights Update: Verified Learning Without RegretAlexander Bagnall, Samuel Merten, Gordon Stewart. 459-461 [doi]