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.
Combinatorial Algebra: Syntax and Semantics [[electronic resource] /] / by Mark V. Sapir
| Combinatorial Algebra: Syntax and Semantics [[electronic resource] /] / by Mark V. Sapir |
| Autore | Sapir Mark V |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVI, 355 p. 66 illus.) |
| Disciplina | 511.6 |
| Collana | Springer Monographs in Mathematics |
| Soggetto topico |
Group theory
Combinatorics Mathematical logic Group Theory and Generalizations Mathematical Logic and Foundations |
| ISBN | 3-319-08031-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- 1. Main definitions and basic fact -- 2. Words that can be avoided -- 3. Semigroups -- 4. Rings -- 5. Groups -- Bibliography -- Index. |
| Record Nr. | UNINA-9910299980803321 |
Sapir Mark V
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023, Proceedings / / edited by Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee
| Combinatorial Algorithms [[electronic resource] ] : 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023, Proceedings / / edited by Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee |
| Autore | Hsieh Sun-Yuan |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (424 pages) |
| Disciplina | 511.6 |
| Altri autori (Persone) |
HungLing-Ju
LeeChia-Wei |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Computer engineering Computer networks Algorithms Data structures (Computer science) Information theory Computer graphics Numerical analysis Discrete Mathematics in Computer Science Computer Engineering and Networks Design and Analysis of Algorithms Data Structures and Information Theory Computer Graphics Numerical Analysis |
| Soggetto non controllato | Mathematics |
| ISBN | 3-031-34347-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Multi-Priority Graph Sparsification -- Point Enclosure Problem for Homothetic Polygons -- Hardness of Balanced Mobiles -- Burn and Win -- Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness -- Advice Complexity Bounds for Online Delayed F-Node-, H-Node- and H-Edge-Deletion Problems -- Parameterized algorithms for Eccentricity Shortest Path Problem -- A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs -- Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks -- A Polyhedral Perspective on Tropical Convolutions -- Online Knapsack with Removal and Recourse -- Minimum Surgical Probing with Convexity Constraints -- A linear algorithm for radio k-coloring powers of paths having small diameter -- Capacity-Preserving Subgraphs of Directed Flow Networks -- Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms -- Finding Small Complete Subgraphs Efficiently -- Maximal distortion of geodesic diameters in polygonal domains -- On 2-strong connectivity orientations of mixed graphs and related problems -- Make a Graph Singly Connected By Edge Orientations -- Computing the Center of Uncertain Points on Cactus Graphs -- Cosecure Domination: Hardness Results and Algorithms -- Optimal cost-based allocations under two-sided preferences -- Generating cyclic rotation Gray codes for stamp foldings and semi-meanders -- On Computing Large Temporal (Unilateral) Connected Components -- On Integer Linear Programs for Treewidth based on Perfect Elimination Orderings -- Finding Perfect Matching Cuts Faster -- Connected Feedback Vertex Set on AT-Free graphs -- Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries -- Improved Analysis of two Algorithms for Min-Weighted Sum Bin Packing -- Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism -- A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-connected Induced Subgraphs -- Partial-Adaptive Submodular Maximization -- Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing Platform. |
| Record Nr. | UNISA-996538667703316 |
|
Hsieh Sun-Yuan
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023, Proceedings / / edited by Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee
| Combinatorial Algorithms [[electronic resource] ] : 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023, Proceedings / / edited by Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee |
| Autore | Hsieh Sun-Yuan |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (424 pages) |
| Disciplina | 511.6 |
| Altri autori (Persone) |
HungLing-Ju
LeeChia-Wei |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Computer engineering Computer networks Algorithms Data structures (Computer science) Information theory Computer graphics Numerical analysis Discrete Mathematics in Computer Science Computer Engineering and Networks Design and Analysis of Algorithms Data Structures and Information Theory Computer Graphics Numerical Analysis |
| Soggetto non controllato | Mathematics |
| ISBN | 3-031-34347-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Multi-Priority Graph Sparsification -- Point Enclosure Problem for Homothetic Polygons -- Hardness of Balanced Mobiles -- Burn and Win -- Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness -- Advice Complexity Bounds for Online Delayed F-Node-, H-Node- and H-Edge-Deletion Problems -- Parameterized algorithms for Eccentricity Shortest Path Problem -- A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs -- Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks -- A Polyhedral Perspective on Tropical Convolutions -- Online Knapsack with Removal and Recourse -- Minimum Surgical Probing with Convexity Constraints -- A linear algorithm for radio k-coloring powers of paths having small diameter -- Capacity-Preserving Subgraphs of Directed Flow Networks -- Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms -- Finding Small Complete Subgraphs Efficiently -- Maximal distortion of geodesic diameters in polygonal domains -- On 2-strong connectivity orientations of mixed graphs and related problems -- Make a Graph Singly Connected By Edge Orientations -- Computing the Center of Uncertain Points on Cactus Graphs -- Cosecure Domination: Hardness Results and Algorithms -- Optimal cost-based allocations under two-sided preferences -- Generating cyclic rotation Gray codes for stamp foldings and semi-meanders -- On Computing Large Temporal (Unilateral) Connected Components -- On Integer Linear Programs for Treewidth based on Perfect Elimination Orderings -- Finding Perfect Matching Cuts Faster -- Connected Feedback Vertex Set on AT-Free graphs -- Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries -- Improved Analysis of two Algorithms for Min-Weighted Sum Bin Packing -- Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism -- A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-connected Induced Subgraphs -- Partial-Adaptive Submodular Maximization -- Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing Platform. |
| Record Nr. | UNINA-9910728942203321 |
|
Hsieh Sun-Yuan
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial algorithms : generation, enumeration, and search / Donald L. Kreher, Douglas R. Stinson
| Combinatorial algorithms : generation, enumeration, and search / Donald L. Kreher, Douglas R. Stinson |
| Autore | Kreher, Donald L. |
| Pubbl/distr/stampa | Boca Raton : CRC press, ©1999 |
| Descrizione fisica | 329 p. : ill. ; 24 cm |
| Disciplina | 511.6 |
| Altri autori (Persone) | Stinson, Douglas R. |
| Collana | The CRC press series on discrete mathematics and its applications |
| Soggetto non controllato |
Algoritmi
Analisi combinatoria |
| ISBN | 0-8493-3988-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-990001485480403321 |
|
Kreher, Donald L.
|
||
| Boca Raton : CRC press, ©1999 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial algorithms : generation, enumeration, and search / Donald L. Kreher, Douglas R. Stinson
| Combinatorial algorithms : generation, enumeration, and search / Donald L. Kreher, Douglas R. Stinson |
| Autore | KREHER, Donald L. |
| Pubbl/distr/stampa | Boca Raton : CRC Press, c1999 |
| Descrizione fisica | 329 p. : ill. ; 25 cm |
| Disciplina | 511.6 |
| Altri autori (Persone) | STINSON, Douglas R. |
| Collana | CRC Press series on discrete mathamatics and its applications |
| Soggetto non controllato | Analisi combinatoria |
| ISBN | 0-8493-3988-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990000316390203316 |
|
KREHER, Donald L.
|
||
| Boca Raton : CRC Press, c1999 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial algorithms / Albert Nijenhuis and Herbert S. Wilf
| Combinatorial algorithms / Albert Nijenhuis and Herbert S. Wilf |
| Autore | NIJENHUIS, Albert |
| Pubbl/distr/stampa | New York : Academic press, 1975 |
| Descrizione fisica | XIV, 253 p. : ill. ; 23 cm |
| Disciplina | 511.6 |
| Altri autori (Persone) | WILF, Herbert S. |
| Collana | Computer science and applied mathematics |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990000625090203316 |
|
NIJENHUIS, Albert
|
||
| New York : Academic press, 1975 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial algorithms : theory and practice / Edward M. Reingold, Jurg Nievergelt, Narsingh Deo
| Combinatorial algorithms : theory and practice / Edward M. Reingold, Jurg Nievergelt, Narsingh Deo |
| Autore | Reingold, Edward M. |
| Pubbl/distr/stampa | Englewood Cliffs (N.J.) : Prentice-Hall, copyr. 1977 |
| Descrizione fisica | XII, 433 p. : ill. ; 23 cm. |
| Disciplina | 511.6 |
| Soggetto non controllato | analisi combinatoria |
| ISBN | 0-13-152447-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990000143410203316 |
|
Reingold, Edward M.
|
||
| Englewood Cliffs (N.J.) : Prentice-Hall, copyr. 1977 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings / / edited by Charles J. Colbourn, Roberto Grossi, Nadia Pisanti
| Combinatorial Algorithms [[electronic resource] ] : 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings / / edited by Charles J. Colbourn, Roberto Grossi, Nadia Pisanti |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XIX, 456 p. 335 illus., 47 illus. in color.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Artificial intelligence—Data processing Computer arithmetic and logic units Computer graphics Discrete Mathematics in Computer Science Data Science Arithmetic and Logic Structures Computer Graphics |
| ISBN | 3-030-25005-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A note on handicap incomplete tournaments -- Computing the k-Crossing Visibility Region of a Point in a Polygon -- An Improved Scheme in the Two Query Adaptive Bitprobe Model -- On Erdős‒Szekeres-type problems for k-convex point sets -- Algorithms and Hardness results on Liar's Dominating Set and k-tuple Dominating Set -- Fixed-parameter tractability of (n-k) List Coloring -- Finding Periods in Cartesian Tree Matching -- Parameterized Complexity of Min-Power Asymmetric Connectivity -- Solving Group Interval Scheduling Efficiently -- Call Admission on Trees with Advice (Extended Abstract) -- Power Edge Set and Zero Forcing Set remain difficult in cubic graphs -- Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs -- Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs -- Dual Domination -- Reaching 3-Connectivity via Edge-edge Additions -- Cops and robber on some families of oriented graphs -- Disjoint clustering in combinatorial circuits -- The hull number in the convexity of induced paths of order 3 -- Supermagic graphs with many odd degrees -- Incremental algorithm for minimum cut and edge connectivity in Hypergraph -- A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications -- Shortest-Path-Preserving Rounding -- Complexity and Algorithms for Semipaired Domination in Graphs -- Computing the Rooted Triplet Distance between Phylogenetic Networks -- Parameterized Algorithms for Graph Burning Problem -- Extension and its price for the connected vertex cover problem -- An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number -- An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs -- Complexity of fall coloring for restricted graph classes -- Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling under Precedence Constraints -- Maximum clique exhaustive search in circulant k-hypergraphs -- Burrows-Wheeler transform of words defined by morphisms -- Stable Noncrossing Matchings -- On the Average Case of MergeInsertion -- Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings -- A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber. |
| Record Nr. | UNISA-996466364503316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings / / edited by Charles J. Colbourn, Roberto Grossi, Nadia Pisanti
| Combinatorial Algorithms [[electronic resource] ] : 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings / / edited by Charles J. Colbourn, Roberto Grossi, Nadia Pisanti |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XIX, 456 p. 335 illus., 47 illus. in color.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Artificial intelligence—Data processing Computer arithmetic and logic units Computer graphics Discrete Mathematics in Computer Science Data Science Arithmetic and Logic Structures Computer Graphics |
| ISBN | 3-030-25005-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A note on handicap incomplete tournaments -- Computing the k-Crossing Visibility Region of a Point in a Polygon -- An Improved Scheme in the Two Query Adaptive Bitprobe Model -- On Erdős‒Szekeres-type problems for k-convex point sets -- Algorithms and Hardness results on Liar's Dominating Set and k-tuple Dominating Set -- Fixed-parameter tractability of (n-k) List Coloring -- Finding Periods in Cartesian Tree Matching -- Parameterized Complexity of Min-Power Asymmetric Connectivity -- Solving Group Interval Scheduling Efficiently -- Call Admission on Trees with Advice (Extended Abstract) -- Power Edge Set and Zero Forcing Set remain difficult in cubic graphs -- Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs -- Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs -- Dual Domination -- Reaching 3-Connectivity via Edge-edge Additions -- Cops and robber on some families of oriented graphs -- Disjoint clustering in combinatorial circuits -- The hull number in the convexity of induced paths of order 3 -- Supermagic graphs with many odd degrees -- Incremental algorithm for minimum cut and edge connectivity in Hypergraph -- A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications -- Shortest-Path-Preserving Rounding -- Complexity and Algorithms for Semipaired Domination in Graphs -- Computing the Rooted Triplet Distance between Phylogenetic Networks -- Parameterized Algorithms for Graph Burning Problem -- Extension and its price for the connected vertex cover problem -- An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number -- An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs -- Complexity of fall coloring for restricted graph classes -- Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling under Precedence Constraints -- Maximum clique exhaustive search in circulant k-hypergraphs -- Burrows-Wheeler transform of words defined by morphisms -- Stable Noncrossing Matchings -- On the Average Case of MergeInsertion -- Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings -- A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber. |
| Record Nr. | UNINA-9910349314303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018, Proceedings / / edited by Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sung
| Combinatorial Algorithms [[electronic resource] ] : 29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018, Proceedings / / edited by Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sung |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XIX, 388 p. 78 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Data protection Software engineering Image processing—Digital techniques Computer vision Data structures (Computer science) Information theory Discrete Mathematics in Computer Science Data and Information Security Software Engineering Computer Imaging, Vision, Pattern Recognition and Graphics Data Structures and Information Theory |
| ISBN | 3-319-94667-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Some Recent New Directions in Multivariate Algorithmics -- Survey of some recent near polynomial time results for Parity Games -- Range Minimum Queries and Applications -- Collision-free Routing Problem with Restricted L-path -- Linear clique-width of bi-complement reducible graphs -- Linear Ramsey numbers -- Graphs that are Not Pairwise Compatible: A New Proof Technique Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families -- Minimum Polygons for Fixed Visibility VC-Dimension -- Minsum k-Sink Problem on Dynamic Flow Path Networks -- Fully leafed induced subtrees -- Pattern matching for k--track permutations -- Approximation algorithms for the p-hub center routing problem in parameterized metric graphs -- On the Area Requirements of Straight-Line Orthogonal Drawings of A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs -- Covering with Clubs: Complexity and Approximability -- On the Expected Number of Distinct Gapped Palindromic Factors -- Computational Complexity of Robot Arm Simulation Problems -- Evaluation of Tie-breaking and Parameter ordering for the IPO Family of Algorithms used in Covering Array Generation -- Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth -- An Optimal Algorithm for Online Prize-collecting Node-weighted Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem -- Structural Parameterizations for Colorful Components -- Analysis of Information Leakage due to Operative Errors in Card-based Protocols -- Zero-Suppression and Computation Models -- The Crossing Number of Seq-Shellable Drawings of Complete Graphs -- Cryptographic limitations on polynomial-time a posteriori query learning -- Placing Segments On Parallel Arcs -- Branch-and-bound algorithm for Symmetric Travelling Salesman Problem -- LZ-ABT: A Practical Algorithm for nalpha-Balanced Grammar Compression -- Faster Coreset Construction for Projective Clustering via Low-Rank Approximation -- Separating Interaction Effects Using Locating and Detecting Arrays -- An Efficient Representation of Partitions of Integers -- How far from a worst solution a random solution of a k-CSP instance can be?. |
| Record Nr. | UNISA-996465948603316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
