Distributed Algorithms for Coloring Interval Graphs (English)
- New search for: Halldorsson, M.M.
- New search for: Konrad, C.
- New search for: Halldorsson, M.M.
- New search for: Konrad, C.
- New search for: Kuhn, Fabian
In:
Distributed computing: 28th International Symposium, DISC 2014
8784
;
454-468
;
2014
-
ISBN:
-
ISSN:
- Conference paper / Print
-
Title:Distributed Algorithms for Coloring Interval Graphs
-
Contributors:
-
Conference:International symposium; 28th, Distributed computing: 28th International Symposium, DISC 2014 ; 2014 ; Austin, TX
-
Published in:Distributed computing: 28th International Symposium, DISC 2014 , 8784 ; 454-468LECTURE NOTES IN COMPUTER SCIENCE , 8784 ; 454-468
-
Publisher:
- New search for: Springer
-
Place of publication:Heidelberg
-
Publication date:2014-01-01
-
Size:15 pages
-
Remarks:"e-ISSN 1611-3349" --Title page verso. Includes bibliographical references and index. Also issued online.
-
ISBN:
-
ISSN:
-
Type of media:Conference paper
-
Type of material:Print
-
Language:English
-
Keywords:
-
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents conference proceedings
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, P. / Gafni, E. / Rajsbaum, S. / Roy, M. et al. | 2014
- 16
-
Speed Faults in Computation by Chemical Reaction NetworksChen, H.-L. / Cummings, R. / Doty, D. / Soloveichik, D. et al. | 2014
- 31
-
Fault-Tolerant ANTSLangner, T. / Uitto, J. / Stolz, D. / Wattenhofer, R. et al. | 2014
- 46
-
Task Allocation in Ant ColoniesCornejo, A. / Dornhaus, A. / Lynch, N. / Nagpal, R. et al. | 2014
- 61
-
Communication-Efficient Randomized ConsensusAlistarh, D. / Aspnes, J. / King, V. / Saia, J. et al. | 2014
- 76
-
Tight Bound on Mobile Byzantine AgreementBonnet, F. / Defago, X. / Nguyen, T.D. / Potop-Butucaru, M. et al. | 2014
- 91
-
Unbeatable ConsensusCastaneda, A. / Gonczarowski, Y.A. / Moses, Y. et al. | 2014
- 107
-
Reliable Broadcast with Respect to Topology KnowledgePagourtzis, A. / Panagiotakos, G. / Sakavalas, D. et al. | 2014
- 122
-
Evacuating Robots via Unknown Exit in a DiskCzyzowicz, J. / Gasieniec, L. / Gorry, T. / Kranakis, E. / Martin, R. / Pajak, D. et al. | 2014
- 137
-
Randomized Pattern Formation Algorithm for Asynchronous Oblivious Mobile RobotsYamauchi, Y. / Yamashita, M. et al. | 2014
- 152
-
A Theoretical Foundation for Scheduling and Designing Heterogeneous Processors for Interactive ApplicationsRen, S. / He, Y. / McKinley, K.S. et al. | 2014
- 167
-
Vertex Fault Tolerant Additive SpannersParter, M. et al. | 2014
- 182
-
Close to Linear Space Routing SchemesRoditty, L. / Tov, R. et al. | 2014
- 197
-
Near-Optimal Distributed Tree EmbeddingGhaffari, M. / Lenzen, C. et al. | 2014
- 212
-
Deterministic Leader Election in Multi-hop Beeping Networks (Extended Abstract)Forster, K.-T. / Seidel, J. / Wattenhofer, R. et al. | 2014
- 227
-
Who Are You? Secure Identities in Ad Hoc NetworksGilbert, S. / Newport, C. / Zheng, C. et al. | 2014
- 243
-
Approximate Local Sums and Their Applications in Radio NetworksLiu, Z. / Herlihy, M. et al. | 2014
- 258
-
Radio Network Lower Bounds Made EasyNewport, C. et al. | 2014
- 273
-
On Correctness of Data Structures under Reads-Write ConcurrencyLev-Ari, K. / Chockler, G. / Keidar, I. et al. | 2014
- 288
-
Solo-Fast Universal Constructions for Deterministic Abortable ObjectsCapdevielle, C. / Johnen, C. / Milani, A. et al. | 2014
- 303
-
Space Bounds for Adaptive RenamingHelmi, M. / Higham, L. / Woelfel, P. et al. | 2014
- 318
-
Lower Bounds for Structuring Unreliable Radio NetworksNewport, C. et al. | 2014
- 333
-
Random Walks on Evolving Graphs with Recurring TopologiesDenysyuk, O. / Rodrigues, L. et al. | 2014
- 346
-
Randomized Rumor Spreading in Poorly Connected Small-World NetworksMehrabian, A. / Pourmiri, A. et al. | 2014
- 361
-
Making Sense of Relativistic Distributed SystemsGilbert, S. / Golab, W. et al. | 2014
- 376
-
Safety of Live Transactions in Transactional Memory: TMS is Necessary and SufficientAttiya, H. / Gotsman, A. / Hans, S. / Rinetzky, N. et al. | 2014
- 391
-
Decomposing OpacityLesani, M. / Palsberg, J. et al. | 2014
- 406
-
The Adaptive Priority Queue with Elimination and CombiningCalciu, I. / Mendes, H. / Herlihy, M. et al. | 2014
- 421
-
Improving Average Performance by Relaxing Distributed Data StructuresTalmage, E. / Welch, J.L. et al. | 2014
- 439
-
Almost-Tight Distributed Minimum Cut AlgorithmsNanongkai, D. / Su, H.-H. et al. | 2014
- 454
-
Distributed Algorithms for Coloring Interval GraphsHalldorsson, M.M. / Konrad, C. et al. | 2014
- 469
-
Distributed Symmetry Breaking in HypergraphsKutten, S. / Nanongkai, D. / Pandurangan, G. / Robinson, P. et al. | 2014
- 484
-
On Streaming and Communication Complexity of the Set Cover ProblemDemaine, E.D. / Indyk, P. / Mahabadi, S. / Vakilian, A. et al. | 2014
- 499
-
On the Communication Complexity of Linear Algebraic Problems in the Message Passing ModelLi, Y. / Sun, X. / Wang, C. / Woodruff, D.P. et al. | 2014
- 514
-
Near-Constant-Time Distributed Algorithms on a Congested CliqueHegeman, J.W. / Pemmaraju, S.V. / Sardeshmukh, V.B. et al. | 2014
- 531
-
Brief Announcement: Replacement - Handling Failures in a Replicated State MachineJehl, L. / Lea, T.E. / Meling, H. et al. | 2014
- 533
-
Brief Announcement: The Power of Scheduling-Aware SynchronizationFatourou, P. / Kallimanis, N.D. et al. | 2014
- 536
-
Brief Announcement: Assignment of Different-Sized Inputs in MapReduceAfrati, F. / Dolev, S. / Korach, E. / Sharma, S. / Ullman, J.D. et al. | 2014
- 538
-
Brief Announcement: Scheduling Multiple Objects in Distributed Transactional MemoryBusch, C. / Herlihy, M. / Popovic, M. / Sharma, G. et al. | 2014
- 540
-
Brief Announcement: Relaxing Opacity in Pessimistic Transactional MemorySiek, K. / Wojciechowski, P.T. et al. | 2014
- 542
-
Brief Announcement: A Practical Transactional Memory InterfaceTimnat, S. / Herlihy, M. / Petrank, E. et al. | 2014
- 544
-
Brief Announcement: On Dynamic and Multi-functional Labeling SchemesDahlgaard, S. / Knudsen, M.B.T. / Rotbart, N. et al. | 2014
- 546
-
Brief Announcement: Update Consistency in Partitionable SystemsPerrin, M. / Mostefaoui, A. / Jard, C. et al. | 2014
- 548
-
Brief Announcement: Breaching the Wall of Impossibility Results on Disjoint-Access Parallel TMPeluso, S. / Palmieri, R. / Romano, P. / Ravindran, B. / Quaglia, F. et al. | 2014
- 550
-
Brief Announcement: COP Composition Using Transaction Suspension in the CompilerAvni, H. / Suissa-Peleg, A. et al. | 2014
- 553
-
Brief Announcement: Non-blocking Monitor Executions for Increased ParallelismHung, W.-L. / Chauhan, H. / Garg, V.K. et al. | 2014
- 555
-
Brief Announcement: Agreement in Partitioned Dynamic NetworksSealfon, A. / Sotiraki, A. et al. | 2014
- 557
-
Brief Announcement: The 1-2-3-Toolkit for Building Your Own Balls-into-Bins AlgorithmBertrand, P. / Lenzen, C. et al. | 2014
- 559
-
Brief Announcement: k-Selection and Sorting in the SINR ModelHolzer, S. / Kohler, S. / Wattenhofer, R. et al. | 2014
- 562
-
Brief Announcement: Distributed 3/2-Approximation of the DiameterHolzer, S. / Peleg, D. / Roditty, L. / Wattenhofer, R. et al. | 2014
- 565
-
Brief Announcement: Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling SchemesBlin, L. / Fraigniaud, P. et al. | 2014
- 567
-
Brief Announcement: Secure Anonymous BroadcastMovahedi, M. / Saia, J. / Zamani, M. et al. | 2014
- 569
-
Brief Announcement: Privacy-Preserving Location-Based ServicesMovahedi, M. / Zamani, M. et al. | 2014