Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Distributed Algorithms [[electronic resource] ] : 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings / / edited by Marios Mavronicolas, Philippas Tsigas
| Distributed Algorithms [[electronic resource] ] : 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings / / edited by Marios Mavronicolas, Philippas Tsigas |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XI, 341 p.) |
| Disciplina | 004/.36 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer communication systems Software engineering Algorithms Computer programming Theory of Computation Computer Communication Networks Software Engineering/Programming and Operating Systems Algorithm Analysis and Problem Complexity Programming Techniques Computation by Abstract Devices |
| ISBN | 3-540-69600-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Towards fault-tolerant and secure agentry -- Workflow management — An exercise in distributed computing -- In memory of Anya Pogosyants -- Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study -- A simple DFS-Based algorithm for linear interval routing -- ATM layouts with bounded hop count and congestion -- Scheduling in synchronous networks and the greedy algorithm -- Rapid convergence of a local load balancing algorithm for asynchronous rings -- Performing tasks on restartable message-passing processors -- Revisiting the Paxos algorithm -- Heartbeat: A timeout-free failure detector for quiescent reliable communication -- Genuine atomic multicast -- Low-overhead time-triggered group membership -- Virtual precedence in asynchronous systems: Concept and applications -- Detecting global predicates in distributed systems with clocks -- Fault tolerance bounds for memory consistency -- Precedence-based memory models -- Strong interaction fairness in a fully distributed system with unbounded speed variability -- Reliable communication over partially authenticated networks -- Self-stabilizing depth-first token passing on rooted networks -- Secure distributed storage and retrieval -- Optimal wait-free clock synchronization protocol on a shared-memory multi-processor system -- Transparent support for wait-free transactions -- On the power of multi-objects. |
| Record Nr. | UNISA-996465521903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed Algorithms [[electronic resource] ] : 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings / / edited by Marios Mavronicolas, Philippas Tsigas
| Distributed Algorithms [[electronic resource] ] : 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings / / edited by Marios Mavronicolas, Philippas Tsigas |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XI, 341 p.) |
| Disciplina | 004/.36 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer networks Software engineering Algorithms Computer programming Theory of Computation Computer Communication Networks Software Engineering/Programming and Operating Systems Algorithm Analysis and Problem Complexity Programming Techniques Computation by Abstract Devices |
| ISBN | 3-540-69600-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Towards fault-tolerant and secure agentry -- Workflow management — An exercise in distributed computing -- In memory of Anya Pogosyants -- Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study -- A simple DFS-Based algorithm for linear interval routing -- ATM layouts with bounded hop count and congestion -- Scheduling in synchronous networks and the greedy algorithm -- Rapid convergence of a local load balancing algorithm for asynchronous rings -- Performing tasks on restartable message-passing processors -- Revisiting the Paxos algorithm -- Heartbeat: A timeout-free failure detector for quiescent reliable communication -- Genuine atomic multicast -- Low-overhead time-triggered group membership -- Virtual precedence in asynchronous systems: Concept and applications -- Detecting global predicates in distributed systems with clocks -- Fault tolerance bounds for memory consistency -- Precedence-based memory models -- Strong interaction fairness in a fully distributed system with unbounded speed variability -- Reliable communication over partially authenticated networks -- Self-stabilizing depth-first token passing on rooted networks -- Secure distributed storage and retrieval -- Optimal wait-free clock synchronization protocol on a shared-memory multi-processor system -- Transparent support for wait-free transactions -- On the power of multi-objects. |
| Record Nr. | UNINA-9910768453303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Principles of Distributed Systems [[electronic resource] ] : 11th International Conference, OPODIS 2007, Guadeloupe, French West Indies, December 17-20, 2007, Proceedings / / edited by Eduardo Tovar, Philippas Tsigas, Hacène Fouchal
| Principles of Distributed Systems [[electronic resource] ] : 11th International Conference, OPODIS 2007, Guadeloupe, French West Indies, December 17-20, 2007, Proceedings / / edited by Eduardo Tovar, Philippas Tsigas, Hacène Fouchal |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XIII, 466 p.) |
| Disciplina | 004.36 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer networks Software engineering Computer programming Operating systems (Computers) Computers, Special purpose Theory of Computation Computer Communication Networks Software Engineering Programming Techniques Operating Systems Special Purpose and Application-Based Systems |
| ISBN | 3-540-77096-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Decentralized, Scalable, and Autonomous Grid Monitoring System -- A Formal Analysis of the Deferred Update Technique -- ASAP: A Camera Sensor Network for Situation Awareness -- Asynchronous Active Recommendation Systems -- Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks -- Byzantine Consensus with Few Synchronous Links -- Clock Synchronization in the Byzantine-Recovery Failure Model -- Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots -- Deterministic Communication in the Weak Sensor Model -- Deterministic Leader Election in Anonymous Sensor Networks Without Common Coordinated System -- Distance Sensitive Snapshots in Wireless Sensor Networks -- Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs -- Does Clock Precision Influence ZigBee’s Energy Consumptions? -- From an Intermittent Rotating Star to a Leader -- Global Deadline-Monotonic Scheduling of Arbitrary-Deadline Sporadic Task Systems -- LFthreads: A Lock-Free Thread Library -- Making Distributed Applications Robust -- Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks -- N-Consensus is the Second Strongest Object for N?+?1 Processes -- Non-Searchability of Random Power-Law Graphs -- O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1 -- On the Self-stabilization of Mobile Robots in Graphs -- Peer to Peer Multidimensional Overlays: Approximating Complex Structures -- Secretive Birds: Privacy in Population Protocols -- Self-stabilizing and Byzantine-Tolerant Overlay Network -- Separability to Help Parallel Simulation of Distributed Computations -- Small-World Networks: From Theoretical Bounds to Practical Systems -- The Anonymous Consensus Hierarchy and Naming Problems -- The Baskets Queue -- The Cost of Monotonicity in Distributed Graph Searching -- Timed Quorum Systems for Large-Scale and Dynamic Environments -- Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?. |
| Record Nr. | UNISA-996465520503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Principles of Distributed Systems : 11th International Conference, OPODIS 2007, Guadeloupe, French West Indies, December 17-20, 2007, Proceedings / / edited by Eduardo Tovar, Philippas Tsigas, Hacène Fouchal
| Principles of Distributed Systems : 11th International Conference, OPODIS 2007, Guadeloupe, French West Indies, December 17-20, 2007, Proceedings / / edited by Eduardo Tovar, Philippas Tsigas, Hacène Fouchal |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XIII, 466 p.) |
| Disciplina | 004.36 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer networks Software engineering Computer programming Operating systems (Computers) Computers, Special purpose Theory of Computation Computer Communication Networks Software Engineering Programming Techniques Operating Systems Special Purpose and Application-Based Systems |
| ISBN | 3-540-77096-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Decentralized, Scalable, and Autonomous Grid Monitoring System -- A Formal Analysis of the Deferred Update Technique -- ASAP: A Camera Sensor Network for Situation Awareness -- Asynchronous Active Recommendation Systems -- Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks -- Byzantine Consensus with Few Synchronous Links -- Clock Synchronization in the Byzantine-Recovery Failure Model -- Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots -- Deterministic Communication in the Weak Sensor Model -- Deterministic Leader Election in Anonymous Sensor Networks Without Common Coordinated System -- Distance Sensitive Snapshots in Wireless Sensor Networks -- Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs -- Does Clock Precision Influence ZigBee’s Energy Consumptions? -- From an Intermittent Rotating Star to a Leader -- Global Deadline-Monotonic Scheduling of Arbitrary-Deadline Sporadic Task Systems -- LFthreads: A Lock-Free Thread Library -- Making Distributed Applications Robust -- Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks -- N-Consensus is the Second Strongest Object for N?+?1 Processes -- Non-Searchability of Random Power-Law Graphs -- O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1 -- On the Self-stabilization of Mobile Robots in Graphs -- Peer to Peer Multidimensional Overlays: Approximating Complex Structures -- Secretive Birds: Privacy in Population Protocols -- Self-stabilizing and Byzantine-Tolerant Overlay Network -- Separability to Help Parallel Simulation of Distributed Computations -- Small-World Networks: From Theoretical Bounds to Practical Systems -- The Anonymous Consensus Hierarchy and Naming Problems -- The Baskets Queue -- The Cost of Monotonicity in Distributed Graph Searching -- Timed Quorum Systems for Large-Scale and Dynamic Environments -- Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?. |
| Record Nr. | UNINA-9910483512703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Stabilization, Safety, and Security of Distributed Systems [[electronic resource] ] : 19th International Symposium, SSS 2017, Boston, MA, USA, November 5–8, 2017, Proceedings / / edited by Paul Spirakis, Philippas Tsigas
| Stabilization, Safety, and Security of Distributed Systems [[electronic resource] ] : 19th International Symposium, SSS 2017, Boston, MA, USA, November 5–8, 2017, Proceedings / / edited by Paul Spirakis, Philippas Tsigas |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XIII, 496 p. 82 illus.) |
| Disciplina | 004.2 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer networks
Computers, Special purpose Computer systems Artificial intelligence Operating systems (Computers) Computer arithmetic and logic units Computer Communication Networks Special Purpose and Application-Based Systems Computer System Implementation Artificial Intelligence Operating Systems Arithmetic and Logic Structures |
| ISBN | 3-319-69084-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Proof-Labeling Schemes: Broadcast, Unicast and in Between -- Self-Stabilizing Rendezvous of Synchronous Mobile Agents in Graphs -- The Dynamics and Stability of Probabilistic Population Processes -- Self-stabilizing Distributed Stable Marriage -- Computing the Fault-Containment Time of Self-Stabilizing Algorithms Using Markov Chains and Lumping -- Self-Tuning Eventually-Consistent Data Stores -- An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm under Distributed Daemon for Arbitrary Networks -- An Improved Approximate Agreement Algorithm in the Presence of Mobile Byzantine Faults -- Fault-Induced Dynamics of Oblivious Robots on a Line -- Relaxed Data Types as Consistency Conditions -- Ant-Inspired Dynamic Task Allocation via Gossiping -- Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited visibility -- Robust Routing Made Easy -- Generalized Paxos Made Byzantine (and Less Complex) -- ASSESS: A Tool for Automated Synthesis of Distributed Self-Stabilizing Algorithms -- How to Simulate Message-passing Algorithms in mobile agent systems with faults -- A Self-Stabilizing General De Bruijn Graph -- Constant-Time Complete Visibility for Asynchronous Robots with Lights -- On Security Analysis of Proof-of-Elapsed-Time (PoET) -- Brief Announcement: Federated Code Auditing and Delivery for MPC -- Brief Announcement: Reduced Space Self-stabilizing Center Finding Algorithms in Chains and Trees -- A Fully Asynchronous and Fault Tolerant Distributed Algorithm to Compute a Minimum Graph Orientation -- Universally Optimal Gathering under Limited Visibility -- Optimum Algorithm for Mutual Visibility among Asynchronous Robots with Lights -- Brief Announcement: ZeroBlock: Timestamp-Free Prevention of Block-Withholding Attack in Bitcoin -- Scalable Funding of Bitcoin Micropayment Channel Networks -- Brief Announcement: A Self-stabilizing Algorithm for the Minimal Generalized Dominating Set Problem -- Space-Optimal Proportion Consensus with Population Protocols -- Brief Announcement: Asynchronous, Distributed Optical Mutual Exclusion -- Brief Announcement: Passive and Active Attacks on Audience Response Systems Using Software Defined Radios -- Cryptocurrency Smart Contracts for Distributed Consensus of Public Randomness -- TorBricks: Blocking-Resistant Tor Bridge Distribution -- Cover Time in Edge-Uniform Stochastically-Evolving Graphs -- Bitcoin a Distributed Shared Register -- Broadcast Encryption with Both Temporary and Permanent Revocation -- Brief Announcement: Optimal Asynchronous Rendezvous for Mobile Robots with Lights -- Brief Announcement: Space-efficient Uniform Deployment of Mobile Agents in Asynchronous Unidirectional Rings. . |
| Record Nr. | UNISA-996465325903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Stabilization, Safety, and Security of Distributed Systems : 19th International Symposium, SSS 2017, Boston, MA, USA, November 5–8, 2017, Proceedings / / edited by Paul Spirakis, Philippas Tsigas
| Stabilization, Safety, and Security of Distributed Systems : 19th International Symposium, SSS 2017, Boston, MA, USA, November 5–8, 2017, Proceedings / / edited by Paul Spirakis, Philippas Tsigas |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XIII, 496 p. 82 illus.) |
| Disciplina | 004.2 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer networks
Computers, Special purpose Computer systems Artificial intelligence Operating systems (Computers) Computer arithmetic and logic units Computer Communication Networks Special Purpose and Application-Based Systems Computer System Implementation Artificial Intelligence Operating Systems Arithmetic and Logic Structures |
| ISBN | 3-319-69084-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Proof-Labeling Schemes: Broadcast, Unicast and in Between -- Self-Stabilizing Rendezvous of Synchronous Mobile Agents in Graphs -- The Dynamics and Stability of Probabilistic Population Processes -- Self-stabilizing Distributed Stable Marriage -- Computing the Fault-Containment Time of Self-Stabilizing Algorithms Using Markov Chains and Lumping -- Self-Tuning Eventually-Consistent Data Stores -- An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm under Distributed Daemon for Arbitrary Networks -- An Improved Approximate Agreement Algorithm in the Presence of Mobile Byzantine Faults -- Fault-Induced Dynamics of Oblivious Robots on a Line -- Relaxed Data Types as Consistency Conditions -- Ant-Inspired Dynamic Task Allocation via Gossiping -- Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited visibility -- Robust Routing Made Easy -- Generalized Paxos Made Byzantine (and Less Complex) -- ASSESS: A Tool for Automated Synthesis of Distributed Self-Stabilizing Algorithms -- How to Simulate Message-passing Algorithms in mobile agent systems with faults -- A Self-Stabilizing General De Bruijn Graph -- Constant-Time Complete Visibility for Asynchronous Robots with Lights -- On Security Analysis of Proof-of-Elapsed-Time (PoET) -- Brief Announcement: Federated Code Auditing and Delivery for MPC -- Brief Announcement: Reduced Space Self-stabilizing Center Finding Algorithms in Chains and Trees -- A Fully Asynchronous and Fault Tolerant Distributed Algorithm to Compute a Minimum Graph Orientation -- Universally Optimal Gathering under Limited Visibility -- Optimum Algorithm for Mutual Visibility among Asynchronous Robots with Lights -- Brief Announcement: ZeroBlock: Timestamp-Free Prevention of Block-Withholding Attack in Bitcoin -- Scalable Funding of Bitcoin Micropayment Channel Networks -- Brief Announcement: A Self-stabilizing Algorithm for the Minimal Generalized Dominating Set Problem -- Space-Optimal Proportion Consensus with Population Protocols -- Brief Announcement: Asynchronous, Distributed Optical Mutual Exclusion -- Brief Announcement: Passive and Active Attacks on Audience Response Systems Using Software Defined Radios -- Cryptocurrency Smart Contracts for Distributed Consensus of Public Randomness -- TorBricks: Blocking-Resistant Tor Bridge Distribution -- Cover Time in Edge-Uniform Stochastically-Evolving Graphs -- Bitcoin a Distributed Shared Register -- Broadcast Encryption with Both Temporary and Permanent Revocation -- Brief Announcement: Optimal Asynchronous Rendezvous for Mobile Robots with Lights -- Brief Announcement: Space-efficient Uniform Deployment of Mobile Agents in Asynchronous Unidirectional Rings. . |
| Record Nr. | UNINA-9910484991403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||