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 mathematics VIII [e-book] : proceedings of the eighth Australian conference on combinatorial mathematics held at Deakin university, Geelong, Australia, August 25–29, 1980 / edited by Kevin L. McAvaney
| Combinatorial mathematics VIII [e-book] : proceedings of the eighth Australian conference on combinatorial mathematics held at Deakin university, Geelong, Australia, August 25–29, 1980 / edited by Kevin L. McAvaney |
| Pubbl/distr/stampa | Berlin : Springer, 1981 |
| Descrizione fisica | 1 online resource (xvi, 360 p.) |
| Disciplina | 511.6 |
| Altri autori (Persone) | McAvaney, Kevin L. |
| Collana | Lecture Notes in Mathematics, 0075-8434 ; 884 |
| Soggetto topico |
Mathematics
Combinatorics |
| ISBN | 9783540387923 |
| Formato | Risorse elettroniche  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991002197859707536 |
| Berlin : Springer, 1981 | ||
| Risorse elettroniche | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Combinatorial mathematics X [e-book] : proceedings of the conference held in Adelaide, Australia, August 23–27, 1982 / edited by Louis Reynolds Antoine Casse
| Combinatorial mathematics X [e-book] : proceedings of the conference held in Adelaide, Australia, August 23–27, 1982 / edited by Louis Reynolds Antoine Casse |
| Pubbl/distr/stampa | Berlin : Springer, 1983 |
| Descrizione fisica | 1 online resource (cdxxxvi, 422 p.) |
| Disciplina | 511.6 |
| Altri autori (Persone) | Casse, Louis Reynolds Antoine |
| Collana | Lecture Notes in Mathematics, 0075-8434 ; 1036 |
| Soggetto topico |
Mathematics
Combinatorics |
| ISBN | 9783540386940 |
| Formato | Risorse elettroniche |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991002195079707536 |
| Berlin : Springer, 1983 | ||
| Risorse elettroniche | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Combinatorial Matrix Theory [[electronic resource] /] / by Richard A. Brualdi, Ángeles Carmona, P. van den Driessche, Stephen Kirkland, Dragan Stevanović ; edited by Andrés M. Encinas, Margarida Mitjana
| Combinatorial Matrix Theory [[electronic resource] /] / by Richard A. Brualdi, Ángeles Carmona, P. van den Driessche, Stephen Kirkland, Dragan Stevanović ; edited by Andrés M. Encinas, Margarida Mitjana |
| Autore | Brualdi Richard A |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Birkhäuser, , 2018 |
| Descrizione fisica | 1 online resource (XI, 219 p.) |
| Disciplina | 512.9434 |
| Collana | Advanced Courses in Mathematics - CRM Barcelona |
| Soggetto topico |
Combinatorics
Matrix theory Algebra Potential theory (Mathematics) Differential equations Probabilities Linear and Multilinear Algebras, Matrix Theory Potential Theory Ordinary Differential Equations Probability Theory and Stochastic Processes |
| ISBN | 3-319-70953-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Some combinatorially defined matrix class -- Sign pattern matrices -- The spectral radius of a graph -- The group inverse of the Laplacian matrix of a graph -- Boundary value problems on finite networks. |
| Record Nr. | UNINA-9910300107003321 |
Brualdi Richard A
|
||
| Cham : , : Springer International Publishing : , : Imprint : Birkhäuser, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Methods and Models [[electronic resource] ] : Rudolf Ahlswede’s Lectures on Information Theory 4 / / by Rudolf Ahlswede ; edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm
| Combinatorial Methods and Models [[electronic resource] ] : Rudolf Ahlswede’s Lectures on Information Theory 4 / / by Rudolf Ahlswede ; edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm |
| Autore | Ahlswede Rudolf |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (385 pages) : illustrations |
| Disciplina | 519.3 |
| Collana | Foundations in Signal Processing, Communications and Networking |
| Soggetto topico |
Combinatorics
Information theory Information and Communication, Circuits |
| ISBN | 3-319-53139-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- I Combinatorial Methods for Information Theory. - II Combinatorial Models in Information Theory. - III Supplement -- Gedenkworte für Rudolf Ahlswede -- Commemorating Rudolf Ahlswede -- Comments by Alon Orlitzky -- Index. |
| Record Nr. | UNINA-9910299919603321 |
|
Ahlswede Rudolf
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial number theory and additive group theory [e-book] / by Manuel Castellet, Alfred Geroldinger, Imre Z. Ruzsa
| Combinatorial number theory and additive group theory [e-book] / by Manuel Castellet, Alfred Geroldinger, Imre Z. Ruzsa |
| Autore | Castellet, Manuel |
| Pubbl/distr/stampa | Basel : Birkhäuser, 2009 |
| Descrizione fisica | v.: digital |
| Altri autori (Persone) |
Geroldinger, Alfredauthor
Ruzsa, Imre Z. |
| Collana | Advanced Courses in Mathematics |
| Soggetto topico | Combinatorics |
| ISBN | 9783764389628 |
| Formato | Software  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991000531889707536 |
|
Castellet, Manuel
|
||
| Basel : Birkhäuser, 2009 | ||
| Software | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Combinatorial Optimization [[electronic resource] ] : Theory and Algorithms / / by Bernhard Korte, Jens Vygen
| Combinatorial Optimization [[electronic resource] ] : Theory and Algorithms / / by Bernhard Korte, Jens Vygen |
| Autore | Korte Bernhard |
| Edizione | [6th ed. 2018.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XXI, 698 p. 78 illus.) |
| Disciplina | 519.64 |
| Collana | Algorithms and Combinatorics |
| Soggetto topico |
Combinatorics
Calculus of variations Computer science—Mathematics Operations research Decision making Calculus of Variations and Optimal Control; Optimization Mathematics of Computing Operations Research/Decision Theory |
| ISBN | 3-662-56039-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1 Introduction -- 2 Graphs -- 3 Linear Programming -- 4 Linear Programming Algorithms -- 5 Integer Programming -- 6 Spanning Trees and Arborescences -- 7 Shortest Paths -- 8 Network Flows -- 9 Minimum Cost Flows -- 10 Maximum Matchings -- 11 Weighted Matching -- 12 b-Matchings and T -Joins -- 13 Matroids -- 14 Generalizations of Matroids -- 15 NP-Completeness -- 16 Approximation Algorithms -- 17 The Knapsack Problem -- 18 Bin-Packing -- 19 Multicommodity Flows and Edge-Disjoint Paths -- 20 Network Design Problems -- 21 The Traveling Salesman Problem -- 22 Facility Location -- Indices. |
| Record Nr. | UNINA-9910300110103321 |
|
Korte Bernhard
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings / / edited by Amihood Amir, Gad M. Landau
| Combinatorial Pattern Matching [[electronic resource] ] : 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings / / edited by Amihood Amir, Gad M. Landau |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (VIII, 280 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Pattern recognition
Algorithms Information storage and retrieval Coding theory Information theory Combinatorics Pattern Recognition Algorithm Analysis and Problem Complexity Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-48194-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Regular Expression Searching over Ziv-Lempel Compressed Text -- Parallel Lempel Ziv Coding (Extended Abstract) -- Approximate Matching of Run-Length Compressed Strings -- What to Do with All this Hardware? (Invited Lecture) -- Efficient Experimental String Matching by Weak Factor Recognition* -- Better Filtering with Gapped q-Grams -- Fuzzy Hamming Distance: A New Dissimilarity Measure (Extended Abstract) -- An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture) -- A Very Elementary Presentation of the Hannenhalli-Pevzner Theory -- Tandem Cyclic Alignment -- An Output-Sensitive Flexible Pattern Discovery Algorithm -- Episode Matching* -- String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music -- Efficient Discovery of Proximity Patterns with Suffix Arrays (Extended Abstract) -- Computing the Equation Automaton of a Regular Expression in O(s 2 ) Space and Time -- On-Line Construction of Compact Directed Acyclic Word Graphs* -- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications -- Multiple Pattern Matching Algorithms on Collage System -- Finding All Common Intervals of k Permutations -- Generalized Pattern Matching and the Complexity of Unavoidability Testing -- Balanced Suffix Trees (Invited Lecture) -- A Fast Algorithm for Optimal Alignment between Similar Ordered Trees -- Minimum Quartet Inconsistency Is Fixed Parameter Tractable -- Optimally Compact Finite Sphere Packings — Hydrophobic Cores in the FCC. |
| Record Nr. | UNISA-996465794503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings / / edited by Amihood Amir, Gad M. Landau
| Combinatorial Pattern Matching [[electronic resource] ] : 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings / / edited by Amihood Amir, Gad M. Landau |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (VIII, 280 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Pattern recognition
Algorithms Information storage and retrieval Coding theory Information theory Combinatorics Pattern Recognition Algorithm Analysis and Problem Complexity Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-48194-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Regular Expression Searching over Ziv-Lempel Compressed Text -- Parallel Lempel Ziv Coding (Extended Abstract) -- Approximate Matching of Run-Length Compressed Strings -- What to Do with All this Hardware? (Invited Lecture) -- Efficient Experimental String Matching by Weak Factor Recognition* -- Better Filtering with Gapped q-Grams -- Fuzzy Hamming Distance: A New Dissimilarity Measure (Extended Abstract) -- An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture) -- A Very Elementary Presentation of the Hannenhalli-Pevzner Theory -- Tandem Cyclic Alignment -- An Output-Sensitive Flexible Pattern Discovery Algorithm -- Episode Matching* -- String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music -- Efficient Discovery of Proximity Patterns with Suffix Arrays (Extended Abstract) -- Computing the Equation Automaton of a Regular Expression in O(s 2 ) Space and Time -- On-Line Construction of Compact Directed Acyclic Word Graphs* -- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications -- Multiple Pattern Matching Algorithms on Collage System -- Finding All Common Intervals of k Permutations -- Generalized Pattern Matching and the Complexity of Unavoidability Testing -- Balanced Suffix Trees (Invited Lecture) -- A Fast Algorithm for Optimal Alignment between Similar Ordered Trees -- Minimum Quartet Inconsistency Is Fixed Parameter Tractable -- Optimally Compact Finite Sphere Packings — Hydrophobic Cores in the FCC. |
| Record Nr. | UNINA-9910143595703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 11th Annual Symposium. CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings / / edited by Raffaele Giancarlo, David Sankoff
| Combinatorial Pattern Matching [[electronic resource] ] : 11th Annual Symposium. CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings / / edited by Raffaele Giancarlo, David Sankoff |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XI, 426 p.) |
| Disciplina | 006.4 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Pattern recognition
Computers Algorithms Natural language processing (Computer science) Information storage and retrieval Combinatorics Pattern Recognition Theory of Computation Algorithm Analysis and Problem Complexity Natural Language Processing (NLP) Information Storage and Retrieval |
| ISBN | 3-540-45123-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Identifying and Filtering Near-Duplicate Documents -- Machine Learning for Efficient Natural-Language Processing -- Browsing around a Digital Library: Today and Tomorrow -- Summer School Lectures -- Algorithmic Aspects of Speech Recognition: A Synopsis -- Some Results on Flexible-Pattern Discovery -- Contributed Papers -- Explaining and Controlling Ambiguity in Dynamic Programming -- A Dynamic Edit Distance Table -- Parametric Multiple Sequence Alignment and Phylogeny Construction -- Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment -- A Polynomial Time Approximation Scheme for the Closest Substring Problem -- Approximation Algorithms for Hamming Clustering Problems -- Approximating the Maximum Isomorphic Agreement Subtree Is Hard -- A Faster and Unifying Algorithm for Comparing Trees -- Incomplete Directed Perfect Phylogeny -- The Longest Common Subsequence Problem for Arc-Annotated Sequences -- Boyer—Moore String Matching over Ziv-Lempel Compressed Text -- A Boyer—Moore Type Algorithm for Compressed Pattern Matching -- Approximate String Matching over Ziv—Lempel Compressed Text -- Improving Static Compression Schemes by Alphabet Extension -- Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments -- A Lower Bound for the Breakpoint Phylogeny Problem -- Structural Properties and Tractability Results for Linear Synteny -- Shift Error Detection in Standardized Exams -- An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC) -- The Combinatorial Partitioning Method -- Compact Suffix Array -- Linear Bidirectional On-Line Construction of Affix Trees -- Using Suffix Trees for Gapped Motif Discovery -- Indexing Text with Approximate q-Grams -- Simple Optimal String Matching Algorithm -- Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts -- Periods and Quasiperiods Characterization -- Finding Maximal Quasiperiodicities in Strings -- On the Complexity of Determining the Period of a String. |
| Record Nr. | UNINA-9910143628703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 11th Annual Symposium. CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings / / edited by Raffaele Giancarlo, David Sankoff
| Combinatorial Pattern Matching [[electronic resource] ] : 11th Annual Symposium. CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings / / edited by Raffaele Giancarlo, David Sankoff |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XI, 426 p.) |
| Disciplina | 006.4 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Pattern recognition
Computers Algorithms Natural language processing (Computer science) Information storage and retrieval Combinatorics Pattern Recognition Theory of Computation Algorithm Analysis and Problem Complexity Natural Language Processing (NLP) Information Storage and Retrieval |
| ISBN | 3-540-45123-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Identifying and Filtering Near-Duplicate Documents -- Machine Learning for Efficient Natural-Language Processing -- Browsing around a Digital Library: Today and Tomorrow -- Summer School Lectures -- Algorithmic Aspects of Speech Recognition: A Synopsis -- Some Results on Flexible-Pattern Discovery -- Contributed Papers -- Explaining and Controlling Ambiguity in Dynamic Programming -- A Dynamic Edit Distance Table -- Parametric Multiple Sequence Alignment and Phylogeny Construction -- Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment -- A Polynomial Time Approximation Scheme for the Closest Substring Problem -- Approximation Algorithms for Hamming Clustering Problems -- Approximating the Maximum Isomorphic Agreement Subtree Is Hard -- A Faster and Unifying Algorithm for Comparing Trees -- Incomplete Directed Perfect Phylogeny -- The Longest Common Subsequence Problem for Arc-Annotated Sequences -- Boyer—Moore String Matching over Ziv-Lempel Compressed Text -- A Boyer—Moore Type Algorithm for Compressed Pattern Matching -- Approximate String Matching over Ziv—Lempel Compressed Text -- Improving Static Compression Schemes by Alphabet Extension -- Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments -- A Lower Bound for the Breakpoint Phylogeny Problem -- Structural Properties and Tractability Results for Linear Synteny -- Shift Error Detection in Standardized Exams -- An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC) -- The Combinatorial Partitioning Method -- Compact Suffix Array -- Linear Bidirectional On-Line Construction of Affix Trees -- Using Suffix Trees for Gapped Motif Discovery -- Indexing Text with Approximate q-Grams -- Simple Optimal String Matching Algorithm -- Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts -- Periods and Quasiperiods Characterization -- Finding Maximal Quasiperiodicities in Strings -- On the Complexity of Determining the Period of a String. |
| Record Nr. | UNISA-996465871703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Soggetto topico
-
Combinatorics
(447)
- Algorithms (127)
- Algorithm Analysis and Problem Complexity (105)
- Computers (98)
- Theory of Computation (79)