Edizione	[1st ed. 2012.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012
Descrizione fisica	1 online resource (XIII, 340 p. 54 illus.)
Disciplina	005.1
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Algorithms Computer networks Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer Communication Networks Discrete Mathematics in Computer Science Data Science
ISBN	3-642-31104-0
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Record Nr.	UNISA-996465334403316

Edizione	[1st ed. 2011.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011
Descrizione fisica	1 online resource (XI, 317 p. 45 illus., 9 illus. in color.)
Disciplina	005.1
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Algorithms Computer networks Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer Communication Networks Discrete Mathematics in Computer Science Data Science
ISBN	3-642-22212-9
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Record Nr.	UNISA-996465768603316

Edizione	[1st ed. 2010.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Descrizione fisica	1 online resource (273 p. 42 illus.)
Disciplina	004.6
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Computer programming Computer networks Computer science Algorithms Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Programming Techniques Computer Communication Networks Theory of Computation Discrete Mathematics in Computer Science Data Science
ISBN	1-280-38677-0 9786613564696 3-642-13284-7
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Communication Complexity: From Two-Party to Multiparty -- On the Impact of Local Taxes in a Set Cover Game -- Towards Network Games with Social Preferences -- Distributed Weighted Stable Marriage Problem -- Traffic Grooming in Star Networks via Matching Techniques -- Event Extent Estimation -- Asynchronous Deterministic Rendezvous in Bounded Terrains -- Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees -- Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings -- Average Long-Lived Memoryless Consensus: The Three-Value Case -- Algorithms for Extracting Timeliness Graphs -- Distributed Tree Comparison with Nodes of Limited Memory -- Periodic Data Retrieval Problem in Rings Containing a Malicious Host -- A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots -- Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots -- Maximum Interference of Random Sensors on a Line -- Multipath Spanners -- Strong Orientations of Planar Graphs with Bounded Stretch Factor -- A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs -- Fast Algorithms for min independent dominating set.
Record Nr.	UNISA-996465590603316

Edizione	[1st ed. 2008.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008
Descrizione fisica	1 online resource (X, 310 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-69355-6
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Invited Talks -- Mobile Entities Computing: Models and Problems -- Reputation, Trust and Recommendation Systems in Peer-to-Peer Systems -- Regular Papers -- Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses -- Locating and Repairing Faults in a Network with Mobile Agents -- Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots -- Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory -- Distributed Approximation Algorithm for Resource Clustering -- Sharpness: A Tight Condition for Scalability -- Discovery of Network Properties with All-Shortest-Paths Queries -- Recovering the Long-Range Links in Augmented Graphs -- Computing Frequent Elements Using Gossip -- Maintaining Consistent Transactional States without a Global Clock -- Equal-Area Locus-Based Convex Polygon Decomposition -- On the Power of Local Orientations -- Best Effort and Priority Queuing Policies for Buffered Crossbar Switches -- Word of Mouth: Rumor Dissemination in Social Networks -- Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games -- Computing Approximate Nash Equilibria in Network Congestion Games -- On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion -- Self-stabilizing Cuts in Synchronous Networks -- Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs -- Gathering with Minimum Delay in Tree Sensor Networks -- Centralized Communication in Radio Networks with Strong Interference -- Fast Radio Broadcasting with Advice.
Record Nr.	UNISA-996465285403316

Edizione	[1st ed. 2007.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Descrizione fisica	1 online resource (351 p.)
Disciplina	004.36
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-72951-8
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Session 1. Invited Talks -- Fast Distributed Algorithms Via Primal-Dual (Extended Abstract) -- Time Optimal Gathering in Sensor Networks -- Treewidth: Structure and Algorithms -- Session 2. Autonomous Systems: Graph Exploration -- Fast Periodic Graph Exploration with Constant Memory -- Why Robots Need Maps -- Graph Searching with Advice -- Session 3. Distributed Algorithms: Fault Tolerance -- From Renaming to Set Agreement -- A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives -- A New Self-stabilizing Maximal Matching Algorithm -- Session 4. Distributed Algorithms and Data Structures -- Labeling Schemes with Queries -- A Simple Optimistic Skiplist Algorithm -- Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs -- Session 5. Autonomous Systems: Location Problems -- Optimal Moves for Gossiping Among Mobile Agents -- Swing Words to Make Circle Formation Quiescent -- Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots -- Session 6. Wireless Networks -- Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs -- Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers -- Location Oblivious Distributed Unit Disk Graph Coloring -- Session 7. Communication Networks: Fault Tolerance -- Edge Fault-Diameter of Cartesian Product of Graphs -- Rapid Almost-Complete Broadcasting in Faulty Networks -- Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions -- Session 8. Autonomous Systems: Fault Tolerance -- Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots -- Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents -- Session 9. Communication Networks: Parallel Computing and Selfish Routing -- Optimal Conclusive Sets for Comparator Networks -- Selfish Routing with Oblivious Users -- Upper Bounds and Algorithms for Parallel Knock-Out Numbers.
Record Nr.	UNISA-996465645503316