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.
Algorithm Theory - SWAT 2004 [[electronic resource] ] : 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings / / edited by Torben Hagerup, Jyrki Katajainen
| Algorithm Theory - SWAT 2004 [[electronic resource] ] : 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings / / edited by Torben Hagerup, Jyrki Katajainen |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XII, 512 p.) |
| Disciplina | 518/.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Numerical analysis
Mathematical models Algorithms Computer communication systems Data structures (Computer science) Computer science—Mathematics Numerical Analysis Mathematical Modeling and Industrial Mathematics Algorithm Analysis and Problem Complexity Computer Communication Networks Data Structures Discrete Mathematics in Computer Science |
| ISBN | 3-540-27810-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Contributions -- Design and Analysis of Dynamic Multithreaded Algorithms -- Cache-Oblivious Algorithms and Data Structures -- Refereed Contributions -- Getting the Best Response for Your Erg -- Auctions with Budget Constraints -- Tight Approximability Results for Test Set Problems in Bioinformatics -- Robust Subgraphs for Trees and Paths -- Collective Tree Spanners of Graphs -- Optimally Competitive List Batching -- The Relative Worst Order Ratio Applied to Seat Reservation -- Online Maintenance of k-Medians and k-Covers on a Line -- Matching Polyhedral Terrains Using Overlays of Envelopes -- Independent Set of Intersection Graphs of Convex Objects in 2D -- Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion -- Construction of the Nearest Neighbor Embracing Graph of a Point Set -- Connectivity of Graphs Under Edge Flips -- Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity -- A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension -- Railway Delay Management: Exploring Its Algorithmic Complexity -- Layered Heaps -- Melding Priority Queues -- An Algorithm for Cyclic Edge Connectivity of Cubic Graphs -- Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices -- New Algorithms for Enumerating All Maximal Cliques -- The Multi-multiway Cut Problem -- The Bottleneck Problem with Minimum Quantity Commitments -- All-Norm Approximation for Scheduling on Identical Machines -- Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler -- Approximation Schemes for the Crane Scheduling Problem -- Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems -- A ( )–Approximation Algorithm for the Stable Marriage Problem -- Maximizing the Number of Packed Rectangles -- Two Space Saving Tricks for Linear Time LCP Array Computation -- Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles -- Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks -- Online Scheduling of Splittable Tasks in Peer-to-Peer Networks -- The Optimal Online Algorithms for Minimizing Maximum Lateness -- Power Assignment in Radio Networks with Two Power Levels -- Pointed Binary Encompassing Trees -- On Geometric Structure of Global Roundings for Graphs and Range Spaces -- External Connected Components -- Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths -- Simplified External Memory Algorithms for Planar DAGs. |
| Record Nr. | UNISA-996465557703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithm Theory - SWAT 2004 [[electronic resource] ] : 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings / / edited by Torben Hagerup, Jyrki Katajainen
| Algorithm Theory - SWAT 2004 [[electronic resource] ] : 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings / / edited by Torben Hagerup, Jyrki Katajainen |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XII, 512 p.) |
| Disciplina | 518/.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Numerical analysis
Mathematical models Algorithms Computer communication systems Data structures (Computer science) Computer science—Mathematics Numerical Analysis Mathematical Modeling and Industrial Mathematics Algorithm Analysis and Problem Complexity Computer Communication Networks Data Structures Discrete Mathematics in Computer Science |
| ISBN | 3-540-27810-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Contributions -- Design and Analysis of Dynamic Multithreaded Algorithms -- Cache-Oblivious Algorithms and Data Structures -- Refereed Contributions -- Getting the Best Response for Your Erg -- Auctions with Budget Constraints -- Tight Approximability Results for Test Set Problems in Bioinformatics -- Robust Subgraphs for Trees and Paths -- Collective Tree Spanners of Graphs -- Optimally Competitive List Batching -- The Relative Worst Order Ratio Applied to Seat Reservation -- Online Maintenance of k-Medians and k-Covers on a Line -- Matching Polyhedral Terrains Using Overlays of Envelopes -- Independent Set of Intersection Graphs of Convex Objects in 2D -- Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion -- Construction of the Nearest Neighbor Embracing Graph of a Point Set -- Connectivity of Graphs Under Edge Flips -- Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity -- A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension -- Railway Delay Management: Exploring Its Algorithmic Complexity -- Layered Heaps -- Melding Priority Queues -- An Algorithm for Cyclic Edge Connectivity of Cubic Graphs -- Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices -- New Algorithms for Enumerating All Maximal Cliques -- The Multi-multiway Cut Problem -- The Bottleneck Problem with Minimum Quantity Commitments -- All-Norm Approximation for Scheduling on Identical Machines -- Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler -- Approximation Schemes for the Crane Scheduling Problem -- Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems -- A ( )–Approximation Algorithm for the Stable Marriage Problem -- Maximizing the Number of Packed Rectangles -- Two Space Saving Tricks for Linear Time LCP Array Computation -- Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles -- Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks -- Online Scheduling of Splittable Tasks in Peer-to-Peer Networks -- The Optimal Online Algorithms for Minimizing Maximum Lateness -- Power Assignment in Radio Networks with Two Power Levels -- Pointed Binary Encompassing Trees -- On Geometric Structure of Global Roundings for Graphs and Range Spaces -- External Connected Components -- Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths -- Simplified External Memory Algorithms for Planar DAGs. |
| Record Nr. | UNINA-9910767529603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Concentration of measure for the analysis of randomized algorithms / / Devdatt Dubhashi, Alessandro Panconesi [[electronic resource]]
| Concentration of measure for the analysis of randomized algorithms / / Devdatt Dubhashi, Alessandro Panconesi [[electronic resource]] |
| Autore | Dubhashi Devdatt |
| Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2009 |
| Descrizione fisica | 1 online resource (xiv, 196 pages) : digital, PDF file(s) |
| Disciplina | 518/.1 |
| Soggetto topico |
Random variables
Distribution (Probability theory) Limit theorems (Probability theory) Algorithms |
| ISBN |
1-107-20031-8
1-139-63769-X 1-282-30277-9 9786612302770 0-511-58063-0 0-511-58095-9 0-511-57955-1 0-511-57881-4 0-511-58127-0 0-511-58029-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chernoff-Hoeffding bounds -- Applications of the Chernoff-Hoeffding bounds -- Chernoff-Hoeffding bounds in dependent settings -- Interlude : probabilistic recurrences -- Martingales and the method of bounded differences -- The simple method of bounded differences in action -- The method of averaged bounded differences -- The method of bounded variances -- Interlude : the infamous upper tail -- Isoperimetric inequalities and concentration -- Talagrand's isoperimetric inequality -- Isoperimetric inequalities and concentration via transportation cost inequalities -- Quadratic transportation cost and Talagrand's inequality -- Log-Sobolev inequalities and concentration -- Appendix A : summary of the most useful bounds. |
| Record Nr. | UNINA-9910454552903321 |
Dubhashi Devdatt
|
||
| Cambridge : , : Cambridge University Press, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Concentration of measure for the analysis of randomized algorithms / / Devdatt Dubhashi, Alessandro Panconesi [[electronic resource]]
| Concentration of measure for the analysis of randomized algorithms / / Devdatt Dubhashi, Alessandro Panconesi [[electronic resource]] |
| Autore | Dubhashi Devdatt |
| Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2009 |
| Descrizione fisica | 1 online resource (xiv, 196 pages) : digital, PDF file(s) |
| Disciplina | 518/.1 |
| Soggetto topico |
Random variables
Distribution (Probability theory) Limit theorems (Probability theory) Algorithms |
| ISBN |
1-107-20031-8
1-139-63769-X 1-282-30277-9 9786612302770 0-511-58063-0 0-511-58095-9 0-511-57955-1 0-511-57881-4 0-511-58127-0 0-511-58029-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chernoff-Hoeffding bounds -- Applications of the Chernoff-Hoeffding bounds -- Chernoff-Hoeffding bounds in dependent settings -- Interlude : probabilistic recurrences -- Martingales and the method of bounded differences -- The simple method of bounded differences in action -- The method of averaged bounded differences -- The method of bounded variances -- Interlude : the infamous upper tail -- Isoperimetric inequalities and concentration -- Talagrand's isoperimetric inequality -- Isoperimetric inequalities and concentration via transportation cost inequalities -- Quadratic transportation cost and Talagrand's inequality -- Log-Sobolev inequalities and concentration -- Appendix A : summary of the most useful bounds. |
| Record Nr. | UNINA-9910777912603321 |
|
Dubhashi Devdatt
|
||
| Cambridge : , : Cambridge University Press, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Concentration of measure for the analysis of randomized algorithms / / Devdatt Dubhashi, Alessandro Panconesi [[electronic resource]]
| Concentration of measure for the analysis of randomized algorithms / / Devdatt Dubhashi, Alessandro Panconesi [[electronic resource]] |
| Autore | Dubhashi Devdatt |
| Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2009 |
| Descrizione fisica | 1 online resource (xiv, 196 pages) : digital, PDF file(s) |
| Disciplina | 518/.1 |
| Soggetto topico |
Random variables
Distribution (Probability theory) Limit theorems (Probability theory) Algorithms |
| ISBN |
1-107-20031-8
1-139-63769-X 1-282-30277-9 9786612302770 0-511-58063-0 0-511-58095-9 0-511-57955-1 0-511-57881-4 0-511-58127-0 0-511-58029-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chernoff-Hoeffding bounds -- Applications of the Chernoff-Hoeffding bounds -- Chernoff-Hoeffding bounds in dependent settings -- Interlude : probabilistic recurrences -- Martingales and the method of bounded differences -- The simple method of bounded differences in action -- The method of averaged bounded differences -- The method of bounded variances -- Interlude : the infamous upper tail -- Isoperimetric inequalities and concentration -- Talagrand's isoperimetric inequality -- Isoperimetric inequalities and concentration via transportation cost inequalities -- Quadratic transportation cost and Talagrand's inequality -- Log-Sobolev inequalities and concentration -- Appendix A : summary of the most useful bounds. |
| Record Nr. | UNINA-9910819144403321 |
|
Dubhashi Devdatt
|
||
| Cambridge : , : Cambridge University Press, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The constitution of algorithms : ground-truthing, programming, formulating / / Florian Jaton ; foreword by Geoffrey C. Bowker
| The constitution of algorithms : ground-truthing, programming, formulating / / Florian Jaton ; foreword by Geoffrey C. Bowker |
| Autore | Jaton Florian |
| Pubbl/distr/stampa | Cambridge, Massachusetts : , : The MIT Press, , [2020] |
| Descrizione fisica | 1 online resource (294 pages) |
| Disciplina | 518/.1 |
| Collana | Inside technology |
| Soggetto topico |
Algorithms
Computer programming Algorithms - Social aspects Mathematics - Philosophy |
| ISBN |
0-262-36233-3
0-262-36323-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Intro -- Series Page -- Title Page -- Copyright -- Dedication -- Table of Contents -- Foreword -- Acknowledgments -- Introduction -- I: Ground-Truthing -- 1. Studying Computer Scientists -- 2. A First Case Study -- II: Programming -- 3. Von Neumann's Draft, Electronic Brains, and Cognition -- 4. A Second Case Study -- III: Formulating -- 5. Mathematics as a Science -- 6. A Third Case Study -- Conclusion -- Glossary -- References -- Index -- Series List. |
| Record Nr. | UNINA-9910468223803321 |
|
Jaton Florian
|
||
| Cambridge, Massachusetts : , : The MIT Press, , [2020] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The constitution of algorithms : ground-truthing, programming, formulating / / Florian Jaton ; foreword by Geoffrey C. Bowker
| The constitution of algorithms : ground-truthing, programming, formulating / / Florian Jaton ; foreword by Geoffrey C. Bowker |
| Autore | Jaton Florian |
| Pubbl/distr/stampa | Cambridge, Massachusetts : , : The MIT Press, , [2020] |
| Descrizione fisica | 1 online resource (294 pages) |
| Disciplina | 518/.1 |
| Collana | Inside technology |
| Soggetto topico |
Algorithms
Computer programming Algorithms - Social aspects Mathematics - Philosophy |
| ISBN |
0-262-36233-3
0-262-36323-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Intro -- Series Page -- Title Page -- Copyright -- Dedication -- Table of Contents -- Foreword -- Acknowledgments -- Introduction -- I: Ground-Truthing -- 1. Studying Computer Scientists -- 2. A First Case Study -- II: Programming -- 3. Von Neumann's Draft, Electronic Brains, and Cognition -- 4. A Second Case Study -- III: Formulating -- 5. Mathematics as a Science -- 6. A Third Case Study -- Conclusion -- Glossary -- References -- Index -- Series List. |
| Record Nr. | UNISA-996414150303316 |
|
Jaton Florian
|
||
| Cambridge, Massachusetts : , : The MIT Press, , [2020] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Engines of Order : A Mechanology of Algorithmic Techniques / / Bernhard Rieder
| Engines of Order : A Mechanology of Algorithmic Techniques / / Bernhard Rieder |
| Autore | Rieder Bernhard |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Baltimore, Maryland : , : Project Muse, , 2020 |
| Descrizione fisica | 1 online resource (351 pages) : : illustrations |
| Disciplina | 518/.1 |
| Collana | Recursions: theories of media, materiality, and cultural techniques |
| Soggetto topico |
Computer software
Algorithms |
| Soggetto genere / forma | Electronic books. |
| Soggetto non controllato | algorithms, information ordering, media archaeology, software studies |
| ISBN | 90-485-3741-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Engines of order -- Rethinking software -- Software-making and algorithmic techniques -- From universal classification to a postcoordinated universe -- From frequencies to vectors -- Interested learning -- Calculating networks : from sociometry to PageRank -- Conclusion : toward technical culture. |
| Record Nr. | UNISA-996359643403316 |
|
Rieder Bernhard
|
||
| Baltimore, Maryland : , : Project Muse, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Engines of Order : A Mechanology of Algorithmic Techniques / / Bernhard Rieder
| Engines of Order : A Mechanology of Algorithmic Techniques / / Bernhard Rieder |
| Autore | Rieder Bernhard |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Baltimore, Maryland : , : Project Muse, , 2020 |
| Descrizione fisica | 1 online resource (351 pages) : : illustrations |
| Disciplina | 518/.1 |
| Collana | Recursions: theories of media, materiality, and cultural techniques |
| Soggetto topico |
Computer software
Algorithms |
| Soggetto genere / forma | Electronic books. |
| Soggetto non controllato | algorithms, information ordering, media archaeology, software studies |
| ISBN | 90-485-3741-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Engines of order -- Rethinking software -- Software-making and algorithmic techniques -- From universal classification to a postcoordinated universe -- From frequencies to vectors -- Interested learning -- Calculating networks : from sociometry to PageRank -- Conclusion : toward technical culture. |
| Record Nr. | UNINA-9910403770003321 |
|
Rieder Bernhard
|
||
| Baltimore, Maryland : , : Project Muse, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
How to think about algorithms / / Jeff Edmonds [[electronic resource]]
| How to think about algorithms / / Jeff Edmonds [[electronic resource]] |
| Autore | Edmonds Jeff <1963-> |
| Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2008 |
| Descrizione fisica | 1 online resource (xiii, 448 pages) : digital, PDF file(s) |
| Disciplina | 518/.1 |
| Soggetto topico |
Algorithms - Study and teaching
Loops (Group theory) - Study and teaching Invariants - Study and teaching Recursion theory - Study and teaching |
| ISBN |
1-107-17584-4
0-511-64579-1 9786612390289 1-282-39028-7 1-139-63726-6 0-511-80824-0 0-511-64988-6 0-511-41278-9 0-511-56800-2 0-511-41370-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Iterative algorithms: measures of progress and loop invariants -- Examples using more-of-the-input loop invariants -- Abstract data types -- Narrowing the search space: binary search -- Iterative sorting algorithms -- Euclid's GCD algorithm -- The loop invariant for lower bounds -- Abstractions, techniques, and theory -- Some simple examples of recursive algorithms -- Recursion on trees -- Recursive images -- Parsing with context-free grammars -- Definition of optimization problems -- Graph search algorithms -- Network flows and linear programming -- Greedy algorithms -- Recursive backtracking -- Dynamic programming algorithms -- Examples of dynamic programs -- Reductions and NP-completeness -- Randomized algorithms -- Existential and universal quantifiers -- Time complexity -- Logarithms and exponentials -- Asymptotic growth -- Adding-made-easy approximations -- Recurrence relations -- A formal proof of correctness. |
| Record Nr. | UNINA-9910454516203321 |
|
Edmonds Jeff <1963->
|
||
| Cambridge : , : Cambridge University Press, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
