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.
Algorithms for Sensor Systems : 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers / / edited by Paola Flocchini, Jie Gao, Evangelos Kranakis, Friedhelm Meyer auf der Heide
| Algorithms for Sensor Systems : 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers / / edited by Paola Flocchini, Jie Gao, Evangelos Kranakis, Friedhelm Meyer auf der Heide |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (X, 307 p. 91 illus.) |
| Disciplina | 004.601/5181 |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Algorithms
Computer communication systems Computer science—Mathematics Algorithm Analysis and Problem Complexity Computer Communication Networks Mathematics of Computing |
| ISBN | 3-642-45346-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Modeling Reality Algorithmically: The Case of Wireless Communication -- Autonomous Mobile Robots: A Distributed Computing -- Token Dissemination in Geometric Dynamic Networks -- The Wake Up Dominating Set -- Reconfiguring Massive Particle Swarms with Limited, Global Control -- Polygon-Constrained motion planning problems -- Fast Localized Sensor Self-Deployment for Focused Coverage -- Minimal Solvers for Unsynchronized TDOA Sensor Network Calibration -- Data-Delivery by Energy-Constrained Mobile Robots -- Approximation Bounds for the Minimum k-Storage Problem -- Counting in Anonymous Dynamic Networks: An Experimental Perspective -- Station Assignment with Applications to Sensing -- On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model -- The Effect of Forgetting on the Performance of a Synchronizer -- On the Complexity of Barrier Resilience for Fat Regions -- A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks -- Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes -- On the Complexity of Fixed-Schedule Neighbourhood Learning in Wireless Ad Hoc Radio Networks -- Optimal Nearest Neighbor Queries in Sensor Networks -- Conflict Graphs and the Capacity of the Mean Power Scheme -- Rendezvous of Two Robots with Visible Bits. |
| Record Nr. | UNISA-996198912503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms for Sensor Systems : 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers / / edited by Paola Flocchini, Jie Gao, Evangelos Kranakis, Friedhelm Meyer auf der Heide
| Algorithms for Sensor Systems : 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers / / edited by Paola Flocchini, Jie Gao, Evangelos Kranakis, Friedhelm Meyer auf der Heide |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (X, 307 p. 91 illus.) |
| Disciplina | 004.601/5181 |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Algorithms
Computer communication systems Computer science—Mathematics Algorithm Analysis and Problem Complexity Computer Communication Networks Mathematics of Computing |
| ISBN | 3-642-45346-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Modeling Reality Algorithmically: The Case of Wireless Communication -- Autonomous Mobile Robots: A Distributed Computing -- Token Dissemination in Geometric Dynamic Networks -- The Wake Up Dominating Set -- Reconfiguring Massive Particle Swarms with Limited, Global Control -- Polygon-Constrained motion planning problems -- Fast Localized Sensor Self-Deployment for Focused Coverage -- Minimal Solvers for Unsynchronized TDOA Sensor Network Calibration -- Data-Delivery by Energy-Constrained Mobile Robots -- Approximation Bounds for the Minimum k-Storage Problem -- Counting in Anonymous Dynamic Networks: An Experimental Perspective -- Station Assignment with Applications to Sensing -- On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model -- The Effect of Forgetting on the Performance of a Synchronizer -- On the Complexity of Barrier Resilience for Fat Regions -- A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks -- Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes -- On the Complexity of Fixed-Schedule Neighbourhood Learning in Wireless Ad Hoc Radio Networks -- Optimal Nearest Neighbor Queries in Sensor Networks -- Conflict Graphs and the Capacity of the Mean Power Scheme -- Rendezvous of Two Robots with Visible Bits. |
| Record Nr. | UNINA-9910483762803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021, Proceedings / / edited by Paola Flocchini, Lucia Moura
| Combinatorial Algorithms [[electronic resource] ] : 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021, Proceedings / / edited by Paola Flocchini, Lucia Moura |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (605 pages) |
| Disciplina | 511.8 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science - Mathematics
Discrete mathematics Algorithms Data structures (Computer science) Information theory Computer graphics Discrete Mathematics in Computer Science Design and Analysis of Algorithms Data Structures and Information Theory Computer Graphics |
| ISBN | 3-030-79987-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Relaxed and Approximate Graph Realizations -- Search for combinatorial objects using lattice algorithms – revisited -- Contributed Papers -- Linear Algorithms for Red Blue Domination in Convex Bipartite Graphs -- Combinatorics and algorithms for quasi-chain graphs -- Composed Degree-Distance Realizations of Graphs -- All Subgraphs of a Wheel are 5-Coupled-Choosable -- Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs -- Edge exploration of temporal graphs -- Optimal monomial quadratization for ODE systems -- A Hamilton Cycle in the k-Sided Pancake Network -- Algorithms and Complexity of s-Club Cluster Vertex Deletion -- Covering Convex Polygons by Two Congruent Disks -- The Tandem Duplication Distance Problem is hard over bounded alphabets -- On the oriented coloring of the disjoint union of graphs -- The Pony Express Communication Problem -- Skyline Groups are Ideals. An efficient algorithm for enumerating skyline groups -- Vertex Cover at Distance on H-free Graphs -- On an Ordering Problem in Weighted Hypergraphs -- An Efficient Noisy Binary Search in Graphs via Median Approximation -- A study on the existence of null labelling for 3-hypergraphs -- Piercing All Translates of a Set of Axis-Parallel Rectangles -- A triangle process on regular graphs -- Complexity and Algorithms for MUL-Tree Pruning -- Makespan Trade-offs for Visiting Triangle Edges -- Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k -- Approximation algorithms for hitting subgraphs -- Isomorphic unordered labeled trees up to substitution ciphering -- Intersecting Disks using Two Congruent Disks -- Disjoint Paths and Connected Subgraphs for H-Free Graphs -- Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property -- Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters -- Non-preemptive tree packing -- Card-based Cryptographic Protocols for Three-input Functions Using Private Operations -- Königsberg Sightseeing: Eulerian Walks in Temporal Graphs -- Reconfiguring Simple s; t Hamiltonian Paths in Rectangular Grid Graphs -- New Approximations and Hardness Results for Submodular Partitioning Problems -- An FPT Algorithm for Matching Cut and d-Cut -- Backtrack search for parallelisms of projective spaces -- Approximating Multistage Matching Problems -- Heuristically enhanced IPO Algorithms for Covering Array Generation. |
| Record Nr. | UNISA-996464511003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Algorithms : 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021, Proceedings / / edited by Paola Flocchini, Lucia Moura
| Combinatorial Algorithms : 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021, Proceedings / / edited by Paola Flocchini, Lucia Moura |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (605 pages) |
| Disciplina | 511.8 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science - Mathematics
Discrete mathematics Algorithms Data structures (Computer science) Information theory Computer graphics Discrete Mathematics in Computer Science Design and Analysis of Algorithms Data Structures and Information Theory Computer Graphics |
| ISBN | 3-030-79987-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Relaxed and Approximate Graph Realizations -- Search for combinatorial objects using lattice algorithms – revisited -- Contributed Papers -- Linear Algorithms for Red Blue Domination in Convex Bipartite Graphs -- Combinatorics and algorithms for quasi-chain graphs -- Composed Degree-Distance Realizations of Graphs -- All Subgraphs of a Wheel are 5-Coupled-Choosable -- Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs -- Edge exploration of temporal graphs -- Optimal monomial quadratization for ODE systems -- A Hamilton Cycle in the k-Sided Pancake Network -- Algorithms and Complexity of s-Club Cluster Vertex Deletion -- Covering Convex Polygons by Two Congruent Disks -- The Tandem Duplication Distance Problem is hard over bounded alphabets -- On the oriented coloring of the disjoint union of graphs -- The Pony Express Communication Problem -- Skyline Groups are Ideals. An efficient algorithm for enumerating skyline groups -- Vertex Cover at Distance on H-free Graphs -- On an Ordering Problem in Weighted Hypergraphs -- An Efficient Noisy Binary Search in Graphs via Median Approximation -- A study on the existence of null labelling for 3-hypergraphs -- Piercing All Translates of a Set of Axis-Parallel Rectangles -- A triangle process on regular graphs -- Complexity and Algorithms for MUL-Tree Pruning -- Makespan Trade-offs for Visiting Triangle Edges -- Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k -- Approximation algorithms for hitting subgraphs -- Isomorphic unordered labeled trees up to substitution ciphering -- Intersecting Disks using Two Congruent Disks -- Disjoint Paths and Connected Subgraphs for H-Free Graphs -- Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property -- Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters -- Non-preemptive tree packing -- Card-based Cryptographic Protocols for Three-input Functions Using Private Operations -- Königsberg Sightseeing: Eulerian Walks in Temporal Graphs -- Reconfiguring Simple s; t Hamiltonian Paths in Rectangular Grid Graphs -- New Approximations and Hardness Results for Submodular Partitioning Problems -- An FPT Algorithm for Matching Cut and d-Cut -- Backtrack search for parallelisms of projective spaces -- Approximating Multistage Matching Problems -- Heuristically enhanced IPO Algorithms for Covering Array Generation. |
| Record Nr. | UNINA-9910488714003321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Distributed Computing by Mobile Entities [[electronic resource] ] : Current Research in Moving and Computing / / edited by Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
| Distributed Computing by Mobile Entities [[electronic resource] ] : Current Research in Moving and Computing / / edited by Paola Flocchini, Giuseppe Prencipe, Nicola Santoro |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (X, 683 p. 405 illus., 66 illus. in color.) |
| Disciplina | 004.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer input-output equipment
Computers, Special purpose Computer systems Computer networks Robotics Operating systems (Computers) Input/Output and Data Communications Special Purpose and Application-Based Systems Computer System Implementation Computer Communication Networks Operating Systems |
| ISBN | 3-030-11072-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Models -- Robots in LOOK-COMPUTE-MOVE -- Continuous Time Robots -- Agents -- Other Computational Settings. |
| Record Nr. | UNISA-996466462203316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed Computing by Mobile Entities : Current Research in Moving and Computing / / edited by Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
| Distributed Computing by Mobile Entities : Current Research in Moving and Computing / / edited by Paola Flocchini, Giuseppe Prencipe, Nicola Santoro |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (X, 683 p. 405 illus., 66 illus. in color.) |
| Disciplina | 004.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer input-output equipment
Computers, Special purpose Computer systems Computer networks Robotics Operating systems (Computers) Input/Output and Data Communications Special Purpose and Application-Based Systems Computer System Implementation Computer Communication Networks Operating Systems |
| ISBN | 3-030-11072-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Models -- Robots in LOOK-COMPUTE-MOVE -- Continuous Time Robots -- Agents -- Other Computational Settings. |
| Record Nr. | UNINA-9910337583503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Principles of Distributed Systems [[electronic resource] ] : 16th International Conference, OPODIS 2012, Rome, Italy, December 18-20, 2012, Proceedings / / edited by Roberto Baldoni, Paola Flocchini, Ravindran Binoy
| Principles of Distributed Systems [[electronic resource] ] : 16th International Conference, OPODIS 2012, Rome, Italy, December 18-20, 2012, Proceedings / / edited by Roberto Baldoni, Paola Flocchini, Ravindran Binoy |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XIV, 361 p. 60 illus.) |
| Disciplina | 004/.36 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer networks
Algorithms Computer science—Mathematics Discrete mathematics Software engineering Artificial intelligence Computer Communication Networks Discrete Mathematics in Computer Science Software Engineering Artificial Intelligence Symbolic and Algebraic Manipulation |
| ISBN | 3-642-35476-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | FixMe: A Self-organizing Isolated Anomaly Detection Architecture for Large Scale Distributed Systems -- Analyzing Global-EDF for Multiprocessor Scheduling of Parallel Tasks -- Range Queries in Non-blocking k-ary Search Trees -- On the Polling Problem for Social Networks -- Non-deterministic Population Protocols -- Stochastic Modeling of Dynamic Distributed Systems with Crash Recovery and Its Application to Atomic Registers -- When and How Process Groups Can Be Used to Reduce the Renaming Space -- Electing a Leader in Multi-hop Radio Networks -- Tree Exploration by a Swarm of Mobile Agents -- Crash Resilient and Pseudo-Stabilizing Atomic Registers -- Directed Graph Exploration -- Lattice Completion Algorithms for Distributed Computations -- Optimal Broadcast in Shared Spectrum Radio Networks -- Attack-Resilient Multitree Data Distribution Topologies -- On the Complexity of Distributed Broadcasting and MDS Construction in Radio Networks -- On the Impact of Identifiers on Local Decision -- Black Hole Search and Exploration in Unoriented Tori with Synchronous Scattered Finite Automata -- Algorithms for Partial Gathering of Mobile Agents in Asynchronous Rings -- Causality, Influence, and Computation in Possibly Disconnected Synchronous Dynamic Networks -- Wait-Free Stabilizing Dining Using Regular Registers -- Node Sampling Using Random Centrifugal Walks -- Physarum-Inspired Self-biased Walkers for Distributed Clustering -- Wait-Free Linked-Lists -- Replication. |
| Record Nr. | UNISA-996465947303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Structural Information and Communication Complexity [[electronic resource] ] : 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings / / edited by Paola Flocchini, Leszek Gasieniec
| Structural Information and Communication Complexity [[electronic resource] ] : 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings / / edited by Paola Flocchini, Leszek Gasieniec |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (X, 362 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 |
| ISBN | 3-540-35475-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Mobile Agent Rendezvous: A Survey -- Adapting to Point Contention with Long-Lived Safe Agreement -- Sensor Networks: Distributed Algorithms Reloaded – or Revolutions? -- Local Algorithms for Autonomous Robot Systems -- How to Meet in Anonymous Network -- Setting Port Numbers for Fast Graph Exploration -- Distributed Chasing of Network Intruders -- Election in the Qualitative World -- Fast Deterministic Distributed Algorithms for Sparse Spanners -- Efficient Distributed Weighted Matchings on Trees -- Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs -- Short Labels by Traversal and Jumping -- An Optimal Rebuilding Strategy for a Decremental Tree Problem -- Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering -- Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures -- On Fractional Dynamic Faults with Threshold -- Discovering Network Topology in the Presence of Byzantine Faults -- Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks -- 3-D Minimum Energy Broadcasting -- Average-Time Complexity of Gossiping in Radio Networks -- L(h,1,1)-Labeling of Outerplanar Graphs -- Combinatorial Algorithms for Compressed Sensing -- On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem -- Dynamic Asymmetric Communication -- Approximate Top-k Queries in Sensor Networks -- Self-stabilizing Space Optimal Synchronization Algorithms on Trees -- Distance-k Information in Self-stabilizing Algorithms. |
| Record Nr. | UNISA-996465936003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Structural information and communication complexity : 13th international colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006 : proceedings / / Paola Flocchini, Leszek Gasieniec (eds.)
| Structural information and communication complexity : 13th international colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006 : proceedings / / Paola Flocchini, Leszek Gasieniec (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2006 |
| Descrizione fisica | 1 online resource (X, 362 p.) |
| Disciplina | 004.6 |
| Altri autori (Persone) |
FlocchiniPaola
GasieniecLeszek |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Electronic data processing - Distributed processing
Computer networks |
| ISBN | 3-540-35475-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Mobile Agent Rendezvous: A Survey -- Adapting to Point Contention with Long-Lived Safe Agreement -- Sensor Networks: Distributed Algorithms Reloaded – or Revolutions? -- Local Algorithms for Autonomous Robot Systems -- How to Meet in Anonymous Network -- Setting Port Numbers for Fast Graph Exploration -- Distributed Chasing of Network Intruders -- Election in the Qualitative World -- Fast Deterministic Distributed Algorithms for Sparse Spanners -- Efficient Distributed Weighted Matchings on Trees -- Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs -- Short Labels by Traversal and Jumping -- An Optimal Rebuilding Strategy for a Decremental Tree Problem -- Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering -- Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures -- On Fractional Dynamic Faults with Threshold -- Discovering Network Topology in the Presence of Byzantine Faults -- Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks -- 3-D Minimum Energy Broadcasting -- Average-Time Complexity of Gossiping in Radio Networks -- L(h,1,1)-Labeling of Outerplanar Graphs -- Combinatorial Algorithms for Compressed Sensing -- On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem -- Dynamic Asymmetric Communication -- Approximate Top-k Queries in Sensor Networks -- Self-stabilizing Space Optimal Synchronization Algorithms on Trees -- Distance-k Information in Self-stabilizing Algorithms. |
| Altri titoli varianti | SIROCCO 2006 |
| Record Nr. | UNINA-9910484785603321 |
| Berlin, : Springer, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||