| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465278703316 |
|
|
Titolo |
Distributed Computing [[electronic resource] ] : 18th International Conference, DISC 2004, Amsterdam, The Netherlands, October 4-8, 2004. Proceedings / / edited by Rachid Guerraoui |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2004.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XIV, 470 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 3274 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computers |
Computer communication systems |
Algorithms |
Computer programming |
Operating systems (Computers) |
Theory of Computation |
Computer Communication Networks |
Algorithm Analysis and Problem Complexity |
Programming Techniques |
Computation by Abstract Devices |
Operating Systems |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
The Synchronous Condition-Based Consensus Hierarchy -- Synchronous Condition-Based Consensus Adapting to Input-Vector Legality -- Group-Solvability -- The Notion of Veto Number and the Respective Power of and to Solve One-Shot Agreement Problems -- The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms -- Local-Spin Group Mutual Exclusion Algorithms -- On Quorum Systems for Group Resources with Bounded Capacity -- Bounded Version Vectors -- An Optimistic Approach to Lock-Free FIFO Queues -- A Single-Enqueuer Wait-Free Queue Implementation -- Practical Lock-Free and Wait-Free LL/SC/VL Implementations Using 64-Bit CAS -- Efficient Adaptive Collect Using |
|
|
|
|
|
|
|
|
|
|
|
Randomization -- Nonblocking Concurrent Data Structures with Condition Synchronization -- Dynamic Memory ABP Work-Stealing -- Coupling and Self-stabilization -- Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings -- Virtual Mobile Nodes for Mobile Ad Hoc Networks -- Contention-Free MAC Protocols for Wireless Sensor Networks -- Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems -- A Local Algorithm for Ad Hoc Majority Voting via Charge Fusion -- Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies -- Routing with Improved Communication-Space Trade-Off -- Active and Concurrent Topology Maintenance -- Distributed Weighted Matching -- Exploiting Content Localities for Efficient Search in P2P Systems -- Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs -- Towards a Theory of Consistency Primitives -- Fault-Tolerant Storage in a Dynamic Environment -- Non-skipping Timestamps for Byzantine Data Storage Systems -- Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty -- Optimal Dispersal of Certificate Chains -- On Byzantine Agreement over (2,3)-Uniform Hypergraphs. |
|
|
|
|
|
|
Sommario/riassunto |
|
DISC, the International Symposium on Distributed Computing, is an annual conference for the presentation of research on the theory, design, analysis, implementation, and application of distributed systems and network. DISC 2004 was held on October 4–7, 2004, in Amsterdam, The Netherlands. There were 142 papers submitted to DISC this year. These were read and evaluated by the program committee members, assisted by external reviewers. The quality of submissions was high and we were unable to accept many dese- ing papers. Thirty one papers were selected at the program committee meeting in Lausanne to be included in these proceedings. The proceedings include an extended abstract of the invited talk by Ueli Maurer. In addition, they include a eulogy for Peter Ruzicka by Shmuel Zaks. The Best Student Paper Award was split and given to two papers: the paper “Efficient Adaptive Collect Using Randomization”, co-authored by Hagit Attiya, Fabian Kuhn, Mirjam Wattenhofer and Roger Wattenhofer, and the paper “Coupling and Self-stabilization”,co-authored by Laurent Fribourg, Stephane Messika and Claudine Picaronny. The support of the CWI and EPFL is gratefully acknowledged. The review process and the preparation of this volume were done using CyberChairPRO. I also thank Sebastien Baehni and Sidath Handurukande for their crucial help with these matters. August 2004 Rachid Guerraoui Peter Ruzicka 1947–2003 Peter died on Sunday, October 5, 2003, at the age of 56, after a short disease. He was a Professor of Informatics at the Faculty of Mathematics, Physics and Informatics in Comenius University, Bratislava, Slovakia. Those of us who knew him through DISC and other occasions mourn his death and cherish his memory. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNISA996565868003316 |
|
|
Autore |
Ábrahám Erika |
|
|
Titolo |
Theoretical Aspects of Computing – ICTAC 2023 [[electronic resource] ] : 20th International Colloquium, Lima, Peru, December 4–8, 2023, Proceedings / / edited by Erika Ábrahám, Clemens Dubslaff, Silvia Lizeth Tapia Tarifa |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2023.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (451 pages) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 1611-3349 ; ; 14446 |
|
|
|
|
|
|
Altri autori (Persone) |
|
DubslaffClemens |
TarifaSilvia Lizeth Tapia |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer science |
Computer Science Logic and Foundations of Programming |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di contenuto |
|
Optimal Route Synthesis in Space DTN using Markov Decision Processes -- Modelling and Verifying Robotic Software that use Neural Networks -- A game-theoretic approach to indistinguishability of winning objectives as user privacy -- Learning Attack Trees by Genetic Algorithms -- The Landscape of Computing Symmetric $n$-Variable Functions with $2n$ Cards -- On the complexity of reasoning in Kleene algebras with commutativity conditions -- Towards the Complexity Analysis of Programming Language Proof Methods -- A Dynamic Temporal Logic for Quality of Service in Choreographic Models -- Interactive Matching Logic Proofs in Coq -- An Autonomous Data Language -- Formal Language Semantics for Triggered Enable Statecharts with a Run-to-Completion Scheduling -- Strong Call-by-Value and Multi Types -- Algorithms for Checking Intersection Non-emptiness of Regular Expressions -- Realisability of Global Models of Interaction -- Efficient Reactive Synthesis Using Mode Decomposition -- A Categorical Approach to Synthetic Chemistry -- Closure and Decision Properties for Higher-Dimensional Automata -- Robustness in Metric Spaces over Continuous Quantales and the Hausdorff-Smyth Monad -- Moggi Synchronous Agents, Verification, and Blame – A Deontic View -- Store Locally, Prove Globally -- Denotational Semantics |
|
|
|
|
|
|
|
|
|
|
|
for Symbolic Execution -- TOOL PAPER: Tessla-ROS-Bridge - Runtime Verification of Robotic Systems -- Simplifying process parameters by unfolding algebraic data types -- Modular Soundness Checking of Feature Model Evolution Plans. |
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the proceedings of the 20th International Colloquium on Theoretical Aspects of Computing, ICTAC 2023, which took place in Lima, Peru, during December 4–8, 2023. The 20 full papers presented in this volume together with 3 invited papers and 1 tool paper were carefully reviewed and selected from 40 submissions. They were organised in the topical sections as follows: Bring Together Practitioners; Researchers from Academia; Industry; Government to Present Research Results and Exchange Experience and Ideas. |
|
|
|
|
|
|
|
| |