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 : 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2021, Lisbon, Portugal, September 9-10, 2021, proceedings / / Leszek Ga̜sieniec, Ralf Klasing, Tomasz Radzik (editors)
| Algorithms for sensor systems : 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2021, Lisbon, Portugal, September 9-10, 2021, proceedings / / Leszek Ga̜sieniec, Ralf Klasing, Tomasz Radzik (editors) |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (166 pages) |
| Disciplina | 681 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Wireless sensor networks |
| ISBN | 3-030-89240-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Universally-Optimal Distributed Algorithms, (Congestion+Dilation)-Competitive Oblivious Routing, and Hop-Constrained Network Design (Abstract of Invited Talk) -- Contents -- Distributed Transformations of Hamiltonian Shapes Based on Line Moves -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contribution -- 2 Model -- 3 The Distributed Hamiltonian Transformation -- References -- Stand up Indulgent Gathering -- 1 Introduction -- 2 Model -- 3 The SUIG Algorithm -- 4 Concluding Remarks -- References -- Gathering a Euclidean Closed Chain of Robots in Linear Time -- 1 Introduction -- 2 Model and Notation -- 3 Basics -- 3.1 Isogonal Configurations -- 3.2 Sequential Movement with Run-States -- 4 Closed-Chain-Hopper -- 4.1 Intuition About the Asymmetric Algorithm -- 4.2 Asymmetric Algorithm in Detail -- 4.3 Symmetric Algorithm -- 4.4 Combination of the Algorithms -- 4.5 Analysis Sketch -- 5 Concluding Remarks -- References -- Centralised Connectivity-Preserving Transformations for Programmable Matter: A Minimal Seed Approach -- 1 Introduction -- 2 Contribution -- 3 Model -- 4 Infeasible Transformations and the Time Lower Bound -- 4.1 Time and Seed Lower Bounds for Line Transformations -- 5 Transformation for Nice Shapes -- 5.1 Line to Nice Shape -- 5.2 RaiseNodes -- 5.3 MirrorSeed -- 5.4 DepositNode -- 5.5 Construction of a Subset of Nice Shapes -- 5.6 Construction of Any Nice Shape -- 6 Conclusions -- References -- Distributed Coloring and the Local Structure of Unit-Disk Graphs -- 1 Introduction -- 2 Preliminaries -- 2.1 Distributed Models of Communication -- 2.2 Distributed Coloring -- 2.3 Unit-Disk Graphs -- 3 Location-Aware Coloring -- 4 Coloring Without Coordinates -- 5 Conclusion -- References -- Evacuating from p Unit Disks in the Wireless Model -- 1 Introduction -- 1.1 Related Work.
1.2 High Level of New Contributions and Motivation -- 2 Problem Definition, Notation and Nomenclature -- 3 Algorithms for Evacuating 2 Robots in p Spaces -- 3.1 Worst Case Analysis of Algorithm Wireless-Searchp() -- 4 Visualization of Key Concepts and Results -- 5 Lower Bounds and the Proof of Theorem 1 -- 6 Discussion -- References -- Beep-And-Sleep: Message and Energy Efficient Set Cover -- 1 Introduction -- 1.1 Related Work -- 1.2 Structure of This Paper -- 2 An Efficient SetCover-Algorithm for the Beeping-Model -- 2.1 Proof of Theorem 1 -- 2.2 Extension to DominatingSet -- 3 A Low-Message KT_0 Algorithm -- 3.1 Proof of Theorem 2 -- 3.2 Lower Bound -- 4 Conclusion and Future Work -- References -- Byzantine Fault Tolerant Symmetric-Persistent Circle Evacuation -- 1 Introduction -- 1.1 Model and Preliminaries -- 1.2 Related Work -- 1.3 Results of the Paper -- 2 Evacuation with One Byzantine Fault -- 2.1 Lower Bound for Symmetric-Persistent Algorithms -- 3 Evacuation with Two Byzantine Faults -- 3.1 Algorithm for (n,2) - Evacuation -- 4 Conclusion -- A Appendix - (n) Calculation -- References -- Overflow Management with Self-eliminations -- 1 Introduction -- 2 Model Definition -- 3 Algorithms and Competitive Analysis -- 4 Simulation Results -- 5 Conclusion and Open Questions -- References -- Population Protocols with Unreliable Communication -- 1 Introduction -- 1.1 Main Results (Preview) -- 2 Basic Definitions -- 2.1 Protocols -- 2.2 Fair Executions -- 2.3 Functions Implemented by Protocols -- 3 Expressive Power of Population Protocols and Related Models -- 4 Our Models -- 4.1 Proposed Models -- 4.2 The Main Result -- 5 Proof of the Main Result -- 6 Non-monotonic Impact of Unreliability -- 7 Conclusion and Future Directions -- References -- Author Index. |
| Record Nr. | UNISA-996464432303316 |
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms for sensor systems : 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2021, Lisbon, Portugal, September 9-10, 2021, proceedings / / Leszek Ga̜sieniec, Ralf Klasing, Tomasz Radzik (editors)
| Algorithms for sensor systems : 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2021, Lisbon, Portugal, September 9-10, 2021, proceedings / / Leszek Ga̜sieniec, Ralf Klasing, Tomasz Radzik (editors) |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (166 pages) |
| Disciplina | 681 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Wireless sensor networks |
| ISBN | 3-030-89240-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Universally-Optimal Distributed Algorithms, (Congestion+Dilation)-Competitive Oblivious Routing, and Hop-Constrained Network Design (Abstract of Invited Talk) -- Contents -- Distributed Transformations of Hamiltonian Shapes Based on Line Moves -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contribution -- 2 Model -- 3 The Distributed Hamiltonian Transformation -- References -- Stand up Indulgent Gathering -- 1 Introduction -- 2 Model -- 3 The SUIG Algorithm -- 4 Concluding Remarks -- References -- Gathering a Euclidean Closed Chain of Robots in Linear Time -- 1 Introduction -- 2 Model and Notation -- 3 Basics -- 3.1 Isogonal Configurations -- 3.2 Sequential Movement with Run-States -- 4 Closed-Chain-Hopper -- 4.1 Intuition About the Asymmetric Algorithm -- 4.2 Asymmetric Algorithm in Detail -- 4.3 Symmetric Algorithm -- 4.4 Combination of the Algorithms -- 4.5 Analysis Sketch -- 5 Concluding Remarks -- References -- Centralised Connectivity-Preserving Transformations for Programmable Matter: A Minimal Seed Approach -- 1 Introduction -- 2 Contribution -- 3 Model -- 4 Infeasible Transformations and the Time Lower Bound -- 4.1 Time and Seed Lower Bounds for Line Transformations -- 5 Transformation for Nice Shapes -- 5.1 Line to Nice Shape -- 5.2 RaiseNodes -- 5.3 MirrorSeed -- 5.4 DepositNode -- 5.5 Construction of a Subset of Nice Shapes -- 5.6 Construction of Any Nice Shape -- 6 Conclusions -- References -- Distributed Coloring and the Local Structure of Unit-Disk Graphs -- 1 Introduction -- 2 Preliminaries -- 2.1 Distributed Models of Communication -- 2.2 Distributed Coloring -- 2.3 Unit-Disk Graphs -- 3 Location-Aware Coloring -- 4 Coloring Without Coordinates -- 5 Conclusion -- References -- Evacuating from p Unit Disks in the Wireless Model -- 1 Introduction -- 1.1 Related Work.
1.2 High Level of New Contributions and Motivation -- 2 Problem Definition, Notation and Nomenclature -- 3 Algorithms for Evacuating 2 Robots in p Spaces -- 3.1 Worst Case Analysis of Algorithm Wireless-Searchp() -- 4 Visualization of Key Concepts and Results -- 5 Lower Bounds and the Proof of Theorem 1 -- 6 Discussion -- References -- Beep-And-Sleep: Message and Energy Efficient Set Cover -- 1 Introduction -- 1.1 Related Work -- 1.2 Structure of This Paper -- 2 An Efficient SetCover-Algorithm for the Beeping-Model -- 2.1 Proof of Theorem 1 -- 2.2 Extension to DominatingSet -- 3 A Low-Message KT_0 Algorithm -- 3.1 Proof of Theorem 2 -- 3.2 Lower Bound -- 4 Conclusion and Future Work -- References -- Byzantine Fault Tolerant Symmetric-Persistent Circle Evacuation -- 1 Introduction -- 1.1 Model and Preliminaries -- 1.2 Related Work -- 1.3 Results of the Paper -- 2 Evacuation with One Byzantine Fault -- 2.1 Lower Bound for Symmetric-Persistent Algorithms -- 3 Evacuation with Two Byzantine Faults -- 3.1 Algorithm for (n,2) - Evacuation -- 4 Conclusion -- A Appendix - (n) Calculation -- References -- Overflow Management with Self-eliminations -- 1 Introduction -- 2 Model Definition -- 3 Algorithms and Competitive Analysis -- 4 Simulation Results -- 5 Conclusion and Open Questions -- References -- Population Protocols with Unreliable Communication -- 1 Introduction -- 1.1 Main Results (Preview) -- 2 Basic Definitions -- 2.1 Protocols -- 2.2 Fair Executions -- 2.3 Functions Implemented by Protocols -- 3 Expressive Power of Population Protocols and Related Models -- 4 Our Models -- 4.1 Proposed Models -- 4.2 The Main Result -- 5 Proof of the Main Result -- 6 Non-monotonic Impact of Unreliability -- 7 Conclusion and Future Directions -- References -- Author Index. |
| Record Nr. | UNINA-9910506394903321 |
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms for Sensor Systems [[electronic resource] ] : 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers / / edited by Marek Chrobak, Antonio Fernández Anta, Leszek Gąsieniec, Ralf Klasing
| Algorithms for Sensor Systems [[electronic resource] ] : 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers / / edited by Marek Chrobak, Antonio Fernández Anta, Leszek Gąsieniec, Ralf Klasing |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XI, 141 p. 15 illus.) |
| Disciplina | 004.6 |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Algorithms
Computers Computer communication systems Computer science—Mathematics Artificial intelligence Data structures (Computer science) Algorithm Analysis and Problem Complexity Computation by Abstract Devices Computer Communication Networks Mathematics of Computing Artificial Intelligence Data Structures |
| ISBN | 3-319-53058-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Multi-Message Broadcast in Dynamic Radio Networks -- Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC 16 -- Vertex Coloring with Communication and Local Memory Constraints in Synchronous Broadcast Networks -- A New Kind of Selectors, and Their Applications to Conflict Resolution in Wireless Multi-channels Networks -- The Impact of the Gabriel Sub-graph of the Visibility Graph on the Gathering of Mobile Autonomous Robots -- Search-and-Fetch with One Robot on a Disk -- A 2-Approximation Algorithm for Barrier Coverage by Weighted Non-uniform Sensors on a Line -- Flexible Cell Selection in Cellular Networks -- The Euclidean k-Supplier Problem in IR2. |
| Record Nr. | UNISA-996465751803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms for Sensor Systems : 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers / / edited by Marek Chrobak, Antonio Fernández Anta, Leszek Gąsieniec, Ralf Klasing
| Algorithms for Sensor Systems : 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers / / edited by Marek Chrobak, Antonio Fernández Anta, Leszek Gąsieniec, Ralf Klasing |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XI, 141 p. 15 illus.) |
| Disciplina | 004.6 |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Algorithms
Computers Computer communication systems Computer science—Mathematics Artificial intelligence Data structures (Computer science) Algorithm Analysis and Problem Complexity Computation by Abstract Devices Computer Communication Networks Mathematics of Computing Artificial Intelligence Data Structures |
| ISBN | 3-319-53058-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Multi-Message Broadcast in Dynamic Radio Networks -- Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC 16 -- Vertex Coloring with Communication and Local Memory Constraints in Synchronous Broadcast Networks -- A New Kind of Selectors, and Their Applications to Conflict Resolution in Wireless Multi-channels Networks -- The Impact of the Gabriel Sub-graph of the Visibility Graph on the Gathering of Mobile Autonomous Robots -- Search-and-Fetch with One Robot on a Disk -- A 2-Approximation Algorithm for Barrier Coverage by Weighted Non-uniform Sensors on a Line -- Flexible Cell Selection in Cellular Networks -- The Euclidean k-Supplier Problem in IR2. |
| Record Nr. | UNINA-9910484952103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings / / edited by Leszek Gąsieniec, Ralf Klasing, Tomasz Radzik
| Combinatorial Algorithms [[electronic resource] ] : 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings / / edited by Leszek Gąsieniec, Ralf Klasing, Tomasz Radzik |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (438 pages) : illustrations |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Artificial intelligence—Data processing Application software Computer networks Computer graphics Algorithms Discrete Mathematics in Computer Science Data Science Computer and Information Systems Applications Computer Communication Networks Computer Graphics |
| ISBN | 3-030-48966-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Coordinating swarms of objects at extreme dimensions -- A family of tree-based generators for bubbles in directed graphs -- The micro-world of cographs -- Parameterized Complexity of (A,`)-Path Packing -- On Proper Labellings of Graphs with Minimum Label Sum -- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework -- On the Complexity of Stackelberg Matroid Pricing Problems -- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten -- Edge-Disjoint Branchings in Temporal Graphs -- Optimal In-place Algorithms for Basic Graph Problems -- Further Results on Online Node- and Edge-Deletion Problems with Advice -- Fair packing of independent sets -- Polynomial Time Algorithms for Tracking Path Problems -- The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride -- Iterated Type Partitions -- Two Robots Patrolling on a Line: Integer Version and Approximability -- Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges -- On the Complexity of Singly Connected Vertex Deletion -- Equitable d-degenerate choosability of graphs -- On the complexity of Broadcast Domination and Multipacking in digraphs -- A Parameterized Perspective on Attacking and Defending Elections -- Skyline Computation with Noisy Comparisons -- Strongly Stable and Maximum Weakly Stable Noncrossing Matchings -- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions -- The Steiner problem for count matroids -- Bounded Degree Group Steiner problems -- Between proper and strong edge-colorings of subcubic graphs -- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination -- Algorithms for Constructing Anonymizing Arrays -- Parameterized algorithms for partial vertex covers in bipartite graphs -- Acyclic Matching in Some Subclasses of Graphs. |
| Record Nr. | UNISA-996418315703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Algorithms : 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings / / edited by Leszek Gąsieniec, Ralf Klasing, Tomasz Radzik
| Combinatorial Algorithms : 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings / / edited by Leszek Gąsieniec, Ralf Klasing, Tomasz Radzik |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (438 pages) : illustrations |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Artificial intelligence—Data processing Application software Computer networks Computer graphics Algorithms Discrete Mathematics in Computer Science Data Science Computer and Information Systems Applications Computer Communication Networks Computer Graphics |
| ISBN | 3-030-48966-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Coordinating swarms of objects at extreme dimensions -- A family of tree-based generators for bubbles in directed graphs -- The micro-world of cographs -- Parameterized Complexity of (A,`)-Path Packing -- On Proper Labellings of Graphs with Minimum Label Sum -- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework -- On the Complexity of Stackelberg Matroid Pricing Problems -- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten -- Edge-Disjoint Branchings in Temporal Graphs -- Optimal In-place Algorithms for Basic Graph Problems -- Further Results on Online Node- and Edge-Deletion Problems with Advice -- Fair packing of independent sets -- Polynomial Time Algorithms for Tracking Path Problems -- The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride -- Iterated Type Partitions -- Two Robots Patrolling on a Line: Integer Version and Approximability -- Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges -- On the Complexity of Singly Connected Vertex Deletion -- Equitable d-degenerate choosability of graphs -- On the complexity of Broadcast Domination and Multipacking in digraphs -- A Parameterized Perspective on Attacking and Defending Elections -- Skyline Computation with Noisy Comparisons -- Strongly Stable and Maximum Weakly Stable Noncrossing Matchings -- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions -- The Steiner problem for count matroids -- Bounded Degree Group Steiner problems -- Between proper and strong edge-colorings of subcubic graphs -- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination -- Algorithms for Constructing Anonymizing Arrays -- Parameterized algorithms for partial vertex covers in bipartite graphs -- Acyclic Matching in Some Subclasses of Graphs. |
| Record Nr. | UNINA-9910409665103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Experimental Algorithms [[electronic resource] ] : 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings / / edited by Ralf Klasing
| Experimental Algorithms [[electronic resource] ] : 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings / / edited by Ralf Klasing |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XIII, 406 p. 116 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Artificial intelligence Application software Computer networks Computer programming Artificial Intelligence Computer and Information Systems Applications Computer Communication Networks Programming Techniques |
| ISBN | 3-642-30850-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465323803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Fundamentals of Computation Theory [[electronic resource] ] : 21st International Symposium, FCT 2017, Bordeaux, France, September 11–13, 2017, Proceedings / / edited by Ralf Klasing, Marc Zeitoun
| Fundamentals of Computation Theory [[electronic resource] ] : 21st International Symposium, FCT 2017, Bordeaux, France, September 11–13, 2017, Proceedings / / edited by Ralf Klasing, Marc Zeitoun |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XXI, 432 p. 33 illus.) |
| Disciplina | 511.352 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer networks Computer science—Mathematics Discrete mathematics Software engineering Computer Science Logic and Foundations of Programming Computer Communication Networks Theory of Computation Discrete Mathematics in Computer Science Software Engineering |
| ISBN | 3-662-55751-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Theoretical computer science -- Algorithms -- Complexity -- Formal and logical methods. |
| Record Nr. | UNISA-996465923303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Fundamentals of Computation Theory : 21st International Symposium, FCT 2017, Bordeaux, France, September 11–13, 2017, Proceedings / / edited by Ralf Klasing, Marc Zeitoun
| Fundamentals of Computation Theory : 21st International Symposium, FCT 2017, Bordeaux, France, September 11–13, 2017, Proceedings / / edited by Ralf Klasing, Marc Zeitoun |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XXI, 432 p. 33 illus.) |
| Disciplina | 511.352 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer networks Computer science—Mathematics Discrete mathematics Software engineering Computer Science Logic and Foundations of Programming Computer Communication Networks Theory of Computation Discrete Mathematics in Computer Science Software Engineering |
| ISBN | 3-662-55751-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Theoretical computer science -- Algorithms -- Complexity -- Formal and logical methods. |
| Record Nr. | UNINA-9910483466503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
SOFSEM 2024: Theory and Practice of Computer Science [[electronic resource] ] : 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19–23, 2024, Proceedings / / edited by Henning Fernau, Serge Gaspers, Ralf Klasing
| SOFSEM 2024: Theory and Practice of Computer Science [[electronic resource] ] : 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19–23, 2024, Proceedings / / edited by Henning Fernau, Serge Gaspers, Ralf Klasing |
| Autore | Fernau Henning |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (513 pages) |
| Disciplina | 004 |
| Altri autori (Persone) |
GaspersSerge
KlasingRalf |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Computer science - Mathematics Discrete mathematics Artificial intelligence Computer networks Theory of Computation Mathematics of Computing Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Artificial Intelligence Computer Communication Networks |
| ISBN | 3-031-52113-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Information Extraction Framework of Document Spanners - A Very Informal Survey -- Generalized Distance Polymatrix Games -- Relaxed agreement forests -- On the Computational Complexity of Generalized Common Shape Puzzles -- Fractional Bamboo Trimming and Distributed Windows Scheduling -- New support size bounds and proximity bounds for integer linear programming -- On the Parameterized Complexity of Minus Domination -- Exact and Parameterized Algorithms for Choosability -- Parameterized Algorithms for Covering by Arithmetic Progressions -- Row-column combination of Dyck words -- Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures -- On the parameterized complexity of the Perfect Phylogeny problem -- Data reduction for directed feedback vertex set on graphs without long induced cycles -- Visualization of Bipartite Graphs in Limited Window Size -- Outerplanar and Forest Storyplans -- The Complexity of Cluster Vertex Splitting and Company -- Morphing Graph Drawings in the Presence of Point Obstacles -- Word-Representable Graphs from a Word’s Perspective -- Removable Online Knapsack with Bounded Size Items -- The Complexity of Online Graph Games -- Faster Winner Determination Algorithms for (Colored) Arc Kayles -- Automata Classes Accepting Languages Whose Commutative Closure is Regular -- Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching -- Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages -- Apportionment with Thresholds: Strategic Campaigns Are Easy in the Top-Choice But Hard in the Second-Chance Mode -- Local Certification of Majority Dynamics -- Complexity of Spherical Equations in Finite Groups -- Positive Characteristic Sets for Relational Pattern Languages -- Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs -- The Weighted HOM-Problem over Fields -- Combinatorics of block-parallel automata networks -- On the piecewise complexity of words and periodic words -- Distance Labeling for Families of Cycles -- On the induced problem for fixed-template CSPs. |
| Record Nr. | UNISA-996587862603316 |
Fernau Henning
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
