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 Computing [[electronic resource] ] : 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings / / edited by Andrzej Pelc
| Distributed Computing [[electronic resource] ] : 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings / / edited by Andrzej Pelc |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XVI, 512 p.) |
| Disciplina | 004/.36 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer networks Algorithms Computer programming Operating systems (Computers) Theory of Computation Computer Communication Networks Programming Techniques Operating Systems |
| ISBN | 3-540-75142-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Routing and Scheduling with Incomplete Information -- Time-Efficient Broadcasting in Radio Networks -- A Subjective Visit to Selected Topics in Distributed Computing -- Regular Papers -- Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions -- A Simple Population Protocol for Fast Robust Approximate Majority -- A Denial-of-Service Resistant DHT -- Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks -- Self-stabilizing Counting in Mobile Sensor Networks with a Base Station -- Scalable Load-Distance Balancing -- Time Optimal Asynchronous Self-stabilizing Spanning Tree -- Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links -- Weakening Failure Detectors for k-Set Agreement Via the Partition Approach -- Amnesic Distributed Storage -- Distributed Approximations for Packing in Unit-Disk Graphs -- From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors -- Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time -- On Self-stabilizing Synchronous Actions Despite Byzantine Attacks -- Gossiping in a Multi-channel Radio Network -- The Space Complexity of Unbounded Timestamps -- Approximating Wardrop Equilibria with Finitely Many Agents -- Energy and Time Efficient Broadcasting in Known Topology Radio Networks -- A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree -- On the Message Complexity of Indulgent Consensus -- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result -- Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes -- On the Communication Surplus Incurred by Faulty Processors -- Output Stability Versus Time Till Output -- A Distributed Maximal Scheduler for Strong Fairness -- Cost-Aware Caching Algorithms for Distributed Storage Servers -- Push-to-Pull Peer-to-Peer Live Streaming -- Probabilistic Opaque Quorum Systems -- Detecting Temporal Logic Predicates on Distributed Computations -- Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks -- Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms -- Automatic Classification of Eventual Failure Detectors -- Brief Announcements -- When 3f?+?1 Is Not Enough: Tradeoffs for Decentralized Asynchronous Byzantine Consensus -- On the Complexity of Distributed Greedy Coloring -- Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks -- Transaction Safe Nonblocking Data Structures -- Long Live Continuous Consensus -- Fully Distributed Algorithms for Convex Optimization Problems -- On the Power of Impersonation Attacks -- Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary -- A Formal Analysis of the Deferred Update Technique -- DISC 20th Anniversary -- DISC at Its 20th Anniversary (Stockholm, 2006) -- DISC 20th Anniversary: Invited Talk Time, Clocks, and the Ordering of My Ideas About Distributed Systems -- DISC 20th Anniversary: Invited Talk My Early Days in Distributed Computing Theory: 1979-1982 -- DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems. |
| Record Nr. | UNISA-996466123503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed Computing : 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings / / edited by Andrzej Pelc
| Distributed Computing : 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings / / edited by Andrzej Pelc |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XVI, 512 p.) |
| Disciplina | 004/.36 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer networks Algorithms Computer programming Operating systems (Computers) Theory of Computation Computer Communication Networks Programming Techniques Operating Systems |
| ISBN | 3-540-75142-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Routing and Scheduling with Incomplete Information -- Time-Efficient Broadcasting in Radio Networks -- A Subjective Visit to Selected Topics in Distributed Computing -- Regular Papers -- Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions -- A Simple Population Protocol for Fast Robust Approximate Majority -- A Denial-of-Service Resistant DHT -- Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks -- Self-stabilizing Counting in Mobile Sensor Networks with a Base Station -- Scalable Load-Distance Balancing -- Time Optimal Asynchronous Self-stabilizing Spanning Tree -- Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links -- Weakening Failure Detectors for k-Set Agreement Via the Partition Approach -- Amnesic Distributed Storage -- Distributed Approximations for Packing in Unit-Disk Graphs -- From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors -- Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time -- On Self-stabilizing Synchronous Actions Despite Byzantine Attacks -- Gossiping in a Multi-channel Radio Network -- The Space Complexity of Unbounded Timestamps -- Approximating Wardrop Equilibria with Finitely Many Agents -- Energy and Time Efficient Broadcasting in Known Topology Radio Networks -- A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree -- On the Message Complexity of Indulgent Consensus -- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result -- Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes -- On the Communication Surplus Incurred by Faulty Processors -- Output Stability Versus Time Till Output -- A Distributed Maximal Scheduler for Strong Fairness -- Cost-Aware Caching Algorithms for Distributed Storage Servers -- Push-to-Pull Peer-to-Peer Live Streaming -- Probabilistic Opaque Quorum Systems -- Detecting Temporal Logic Predicates on Distributed Computations -- Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks -- Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms -- Automatic Classification of Eventual Failure Detectors -- Brief Announcements -- When 3f?+?1 Is Not Enough: Tradeoffs for Decentralized Asynchronous Byzantine Consensus -- On the Complexity of Distributed Greedy Coloring -- Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks -- Transaction Safe Nonblocking Data Structures -- Long Live Continuous Consensus -- Fully Distributed Algorithms for Convex Optimization Problems -- On the Power of Impersonation Attacks -- Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary -- A Formal Analysis of the Deferred Update Technique -- DISC 20th Anniversary -- DISC at Its 20th Anniversary (Stockholm, 2006) -- DISC 20th Anniversary: Invited Talk Time, Clocks, and the Ordering of My Ideas About Distributed Systems -- DISC 20th Anniversary: Invited Talk My Early Days in Distributed Computing Theory: 1979-1982 -- DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems. |
| Record Nr. | UNINA-9910483280103321 |
| 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] ] : 17th International Symposium, SSS 2015, Edmonton, AB, Canada, August 18-21, 2015, Proceedings / / edited by Andrzej Pelc, Alexander A. Schwarzmann
| Stabilization, Safety, and Security of Distributed Systems [[electronic resource] ] : 17th International Symposium, SSS 2015, Edmonton, AB, Canada, August 18-21, 2015, Proceedings / / edited by Andrzej Pelc, Alexander A. Schwarzmann |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XXI, 288 p. 47 illus.) |
| Disciplina | 004.36 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer networks
Software engineering Application software Electronic data processing—Management Computer science Data protection Computer Communication Networks Software Engineering Computer and Information Systems Applications IT Operations Computer Science Logic and Foundations of Programming Data and Information Security |
| ISBN | 3-319-21741-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Self-stabilization -- Fault-tolerance and dependability -- Ad-hoc and sensor Networks -- Mobile agents -- System security in distributed computing -- Formal methods and distributed algorithms. |
| Record Nr. | UNISA-996199740903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Stabilization, Safety, and Security of Distributed Systems : 17th International Symposium, SSS 2015, Edmonton, AB, Canada, August 18-21, 2015, Proceedings / / edited by Andrzej Pelc, Alexander A. Schwarzmann
| Stabilization, Safety, and Security of Distributed Systems : 17th International Symposium, SSS 2015, Edmonton, AB, Canada, August 18-21, 2015, Proceedings / / edited by Andrzej Pelc, Alexander A. Schwarzmann |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XXI, 288 p. 47 illus.) |
| Disciplina | 004.36 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer networks
Software engineering Application software Electronic data processing - Management Computer science Data protection Computer Communication Networks Software Engineering Computer and Information Systems Applications IT Operations Computer Science Logic and Foundations of Programming Data and Information Security |
| ISBN | 3-319-21741-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Self-stabilization -- Fault-tolerance and dependability -- Ad-hoc and sensor Networks -- Mobile agents -- System security in distributed computing -- Formal methods and distributed algorithms. |
| Record Nr. | UNINA-9910484796603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Structural Information and Communication Complexity [[electronic resource] ] : 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings / / edited by Andrzej Pelc, Michel Raynal
| Structural Information and Communication Complexity [[electronic resource] ] : 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings / / edited by Andrzej Pelc, Michel Raynal |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (X, 323 p.) |
| Disciplina | 004.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer networks
Algorithms Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer Communication Networks Discrete Mathematics in Computer Science Data Science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Cellular Networks: Where Are the Mobile Users? -- Distributed Data Structures: A Survey -- On Designing Truthful Mechanisms for Online Scheduling -- On Private Computation in Incomplete Networks -- Traffic Grooming on the Path -- Range Augmentation Problems in Static Ad-Hoc Wireless Networks -- On the Approximability of the L(h,k)-Labelling Problem on Bipartite Graphs (Extended Abstract) -- A Tight Bound for Online Coloring of Disk Graphs -- Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances -- Distributed Exploration of an Unknown Graph -- Two Absolute Bounds for Distributed Bit Complexity -- Finding Short Right-Hand-on-the-Wall Walks in Graphs -- Space Lower Bounds for Graph Exploration via Reduced Automata -- Communications in Unknown Networks: Preserving the Secret of Topology -- An Improved Algorithm for Adaptive Condition-Based Consensus -- Biangular Circle Formation by Asynchronous Mobile Robots -- Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs -- On Semi-perfect 1-Factorizations -- Free-Riders in Steiner Tree Cost-Sharing Games -- On the Feasibility of Gathering by Autonomous Mobile Robots -- Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults -- Minimizing the Number of ADMs in SONET Rings with Maximum Throughput -- Optimal Gossiping in Square Meshes in All-Port Mode and with Short Packets -- Geometric Routing Without Geometry. |
| Record Nr. | UNISA-996465718703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Structural information and communication complexity : 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005 : proceedings / / Andrzej Pelc, Michel Raynal (eds.)
| Structural information and communication complexity : 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005 : proceedings / / Andrzej Pelc, Michel Raynal (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, : Springer, c2005 |
| Descrizione fisica | 1 online resource (X, 323 p.) |
| Disciplina | 004.6 |
| Altri autori (Persone) |
PelcAndrzej
RaynalM (Michel) |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Electronic data processing - Distributed processing
Computer networks |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Cellular Networks: Where Are the Mobile Users? -- Distributed Data Structures: A Survey -- On Designing Truthful Mechanisms for Online Scheduling -- On Private Computation in Incomplete Networks -- Traffic Grooming on the Path -- Range Augmentation Problems in Static Ad-Hoc Wireless Networks -- On the Approximability of the L(h,k)-Labelling Problem on Bipartite Graphs (Extended Abstract) -- A Tight Bound for Online Coloring of Disk Graphs -- Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances -- Distributed Exploration of an Unknown Graph -- Two Absolute Bounds for Distributed Bit Complexity -- Finding Short Right-Hand-on-the-Wall Walks in Graphs -- Space Lower Bounds for Graph Exploration via Reduced Automata -- Communications in Unknown Networks: Preserving the Secret of Topology -- An Improved Algorithm for Adaptive Condition-Based Consensus -- Biangular Circle Formation by Asynchronous Mobile Robots -- Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs -- On Semi-perfect 1-Factorizations -- Free-Riders in Steiner Tree Cost-Sharing Games -- On the Feasibility of Gathering by Autonomous Mobile Robots -- Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults -- Minimizing the Number of ADMs in SONET Rings with Maximum Throughput -- Optimal Gossiping in Square Meshes in All-Port Mode and with Short Packets -- Geometric Routing Without Geometry. |
| Altri titoli varianti | SIROCCO 2005 |
| Record Nr. | UNINA-9910767510003321 |
| Berlin, : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||