Automatically Adjusting Concurrency to the Level of Synchrony (English)
- New search for: Fraigniaud, Pierre
- New search for: Gafni, Eli
- New search for: Rajsbaum, Sergio
- New search for: Roy, Matthieu
- New search for: Fraigniaud, Pierre
- New search for: Gafni, Eli
- New search for: Rajsbaum, Sergio
- New search for: Roy, Matthieu
In:
Distributed Computing
1
;
1-15
;
2014
- Article/Chapter (Book) / Electronic Resource
-
Title:Automatically Adjusting Concurrency to the Level of Synchrony
-
Contributors:Fraigniaud, Pierre ( author ) / Gafni, Eli ( author ) / Rajsbaum, Sergio ( author ) / Roy, Matthieu ( author )
-
Published in:Distributed Computing , 1 ; 1-15Lecture Notes in Computer Science ; 8784, 1 ; 1-15
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:2014-01-01
-
Size:15 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Automatically Adjusting Concurrency to the Level of SynchronyFraigniaud, Pierre / Gafni, Eli / Rajsbaum, Sergio / Roy, Matthieu et al. | 2014
- 16
-
Speed Faults in Computation by Chemical Reaction NetworksChen, Ho-Lin / Cummings, Rachel / Doty, David / Soloveichik, David et al. | 2014
- 31
-
Fault-Tolerant ANTSLangner, Tobias / Uitto, Jara / Stolz, David / Wattenhofer, Roger et al. | 2014
- 46
-
Task Allocation in Ant ColoniesCornejo, Alejandro / Dornhaus, Anna / Lynch, Nancy / Nagpal, Radhika et al. | 2014
- 61
-
Communication-Efficient Randomized ConsensusAlistarh, Dan / Aspnes, James / King, Valerie / Saia, Jared et al. | 2014
- 76
-
Tight Bound on Mobile Byzantine AgreementBonnet, François / Défago, Xavier / Nguyen, Thanh Dang / Potop-Butucaru, Maria et al. | 2014
- 91
-
Unbeatable ConsensusCastañeda, Armando / Gonczarowski, Yannai A. / Moses, Yoram et al. | 2014
- 107
-
Reliable Broadcast with Respect to Topology KnowledgePagourtzis, Aris / Panagiotakos, Giorgos / Sakavalas, Dimitris et al. | 2014
- 122
-
Evacuating Robots via Unknown Exit in a DiskCzyzowicz, Jurek / Gąsieniec, Leszek / Gorry, Thomas / Kranakis, Evangelos / Martin, Russell / Pajak, Dominik et al. | 2014
- 137
-
Randomized Pattern Formation Algorithm for Asynchronous Oblivious Mobile RobotsYamauchi, Yukiko / Yamashita, Masafumi et al. | 2014
- 152
-
A Theoretical Foundation for Scheduling and Designing Heterogeneous Processors for Interactive ApplicationsRen, Shaolei / He, Yuxiong / McKinley, Kathryn S. et al. | 2014
- 167
-
Vertex Fault Tolerant Additive SpannersParter, Merav et al. | 2014
- 182
-
Close to Linear Space Routing SchemesRoditty, Liam / Tov, Roei et al. | 2014
- 197
-
Near-Optimal Distributed Tree EmbeddingGhaffari, Mohsen / Lenzen, Christoph et al. | 2014
- 212
-
Deterministic Leader Election in Multi-hop Beeping NetworksFörster, Klaus-Tycho / Seidel, Jochen / Wattenhofer, Roger et al. | 2014
- 227
-
Who Are You? Secure Identities in Ad Hoc NetworksGilbert, Seth / Newport, Calvin / Zheng, Chaodong et al. | 2014
- 243
-
Approximate Local Sums and Their Applications in Radio NetworksLiu, Zhiyu / Herlihy, Maurice et al. | 2014
- 258
-
Radio Network Lower Bounds Made EasyNewport, Calvin et al. | 2014
- 273
-
On Correctness of Data Structures under Reads-Write ConcurrencyLev-Ari, Kfir / Chockler, Gregory / Keidar, Idit et al. | 2014
- 288
-
Solo-Fast Universal Constructions for Deterministic Abortable ObjectsCapdevielle, Claire / Johnen, Colette / Milani, Alessia et al. | 2014
- 303
-
Space Bounds for Adaptive RenamingHelmi, Maryam / Higham, Lisa / Woelfel, Philipp et al. | 2014
- 318
-
Lower Bounds for Structuring Unreliable Radio NetworksNewport, Calvin et al. | 2014
- 333
-
Random Walks on Evolving Graphs with Recurring TopologiesDenysyuk, Oksana / Rodrigues, Luís et al. | 2014
- 346
-
Randomized Rumor Spreading in Poorly Connected Small-World NetworksMehrabian, Abbas / Pourmiri, Ali et al. | 2014
- 361
-
Making Sense of Relativistic Distributed SystemsGilbert, Seth / Golab, Wojciech et al. | 2014
- 376
-
Safety of Live Transactions in Transactional Memory: TMS is Necessary and SufficientAttiya, Hagit / Gotsman, Alexey / Hans, Sandeep / Rinetzky, Noam et al. | 2014
- 391
-
Decomposing OpacityLesani, Mohsen / Palsberg, Jens et al. | 2014
- 406
-
The Adaptive Priority Queue with Elimination and CombiningCalciu, Irina / Mendes, Hammurabi / Herlihy, Maurice et al. | 2014
- 421
-
Improving Average Performance by Relaxing Distributed Data StructuresTalmage, Edward / Welch, Jennifer L. et al. | 2014
- 439
-
Almost-Tight Distributed Minimum Cut AlgorithmsNanongkai, Danupon / Su, Hsin-Hao et al. | 2014
- 454
-
Distributed Algorithms for Coloring Interval GraphsHalldórsson, Magnús M. / Konrad, Christian et al. | 2014
- 469
-
Distributed Symmetry Breaking in HypergraphsKutten, Shay / Nanongkai, Danupon / Pandurangan, Gopal / Robinson, Peter et al. | 2014
- 484
-
On Streaming and Communication Complexity of the Set Cover ProblemDemaine, Erik D. / Indyk, Piotr / Mahabadi, Sepideh / Vakilian, Ali et al. | 2014
- 499
-
On the Communication Complexity of Linear Algebraic Problems in the Message Passing ModelLi, Yi / Sun, Xiaoming / Wang, Chengu / Woodruff, David P. et al. | 2014
- 514
-
Near-Constant-Time Distributed Algorithms on a Congested CliqueHegeman, James W. / Pemmaraju, Sriram V. / Sardeshmukh, Vivek B. et al. | 2014