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.
Automata, Languages and Programming [[electronic resource] ] : 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II / / edited by Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas, Wolfgang Thomas
| Automata, Languages and Programming [[electronic resource] ] : 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II / / edited by Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas, Wolfgang Thomas |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (616 p.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Computer programming Computer science Computer science—Mathematics Discrete mathematics Software Engineering Programming Techniques Theory of Computation Discrete Mathematics in Computer Science Mathematics of Computing |
| ISBN |
1-282-33202-3
9786612332029 3-642-02930-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Track B: Invited Lectures -- A Survey of Stochastic Games with Limsup and Liminf Objectives -- Tractable Optimization Problems through Hypergraph-Based Structural Restrictions -- Track B: Contributed Papers -- Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types -- When Are Timed Automata Determinizable? -- Faithful Loops for Aperiodic E-Ordered Monoids -- Boundedness of Monadic Second-Order Formulae over Finite Words -- Semilinear Program Feasibility -- Floats and Ropes: A Case Study for Formal Numerical Program Verification -- Reachability in Stochastic Timed Games -- Equations Defining the Polynomial Closure of a Lattice of Regular Languages -- Approximating Markov Processes by Averaging -- The Theory of Stabilisation Monoids and Regular Cost Functions -- A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata -- On Constructor Rewrite Systems and the Lambda-Calculus -- On Regular Temporal Logics with Past, -- Forward Analysis for WSTS, Part II: Complete WSTS -- Qualitative Concurrent Stochastic Games with Imperfect Information -- Diagrammatic Confluence and Completion -- Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus -- LTL Path Checking Is Efficiently Parallelizable -- An Explicit Formula for the Free Exponential Modality of Linear Logic -- Decidability of the Guarded Fragment with the Transitive Closure -- Weak Alternating Timed Automata -- A Decidable Characterization of Locally Testable Tree Languages -- The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games -- Track C: Invited Lecture -- Google’s Auction for TV Ads -- Track C: Contributed Papers -- Graph Sparsification in the Semi-streaming Model -- Sort Me If You Can: How to Sort Dynamic Data -- Maximum Bipartite Flow in Networks with Adaptive Channel Width -- Mediated Population Protocols -- Rumor Spreading in Social Networks -- MANETS: High Mobility Can Make Up for Low Transmission Power -- Multiple Random Walks and Interacting Particle Systems -- Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies -- On a Network Generalization of the Minmax Theorem -- Rate-Based Transition Systems for Stochastic Process Calculi -- Improved Algorithms for Latency Minimization in Wireless Networks -- Efficient Methods for Selfish Network Design -- Smoothed Analysis of Balancing Networks -- Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures -- Multi-armed Bandits with Metric Switching Costs -- Algorithms for Secretary Problems on Graphs and Hypergraphs -- Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps -- Secure Function Collection with Sublinear Storage -- Worst-Case Efficiency Analysis of Queueing Disciplines -- On Observing Dynamic Prioritised Actions in SOC -- A Distributed and Oblivious Heap -- Proportional Response Dynamics in the Fisher Market. |
| Record Nr. | UNISA-996465839303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II / / edited by Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas, Wolfgang Thomas
| Automata, Languages and Programming [[electronic resource] ] : 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II / / edited by Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas, Wolfgang Thomas |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (616 p.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Computer programming Computer science Computer science—Mathematics Discrete mathematics Software Engineering Programming Techniques Theory of Computation Discrete Mathematics in Computer Science Mathematics of Computing |
| ISBN |
1-282-33202-3
9786612332029 3-642-02930-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Track B: Invited Lectures -- A Survey of Stochastic Games with Limsup and Liminf Objectives -- Tractable Optimization Problems through Hypergraph-Based Structural Restrictions -- Track B: Contributed Papers -- Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types -- When Are Timed Automata Determinizable? -- Faithful Loops for Aperiodic E-Ordered Monoids -- Boundedness of Monadic Second-Order Formulae over Finite Words -- Semilinear Program Feasibility -- Floats and Ropes: A Case Study for Formal Numerical Program Verification -- Reachability in Stochastic Timed Games -- Equations Defining the Polynomial Closure of a Lattice of Regular Languages -- Approximating Markov Processes by Averaging -- The Theory of Stabilisation Monoids and Regular Cost Functions -- A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata -- On Constructor Rewrite Systems and the Lambda-Calculus -- On Regular Temporal Logics with Past, -- Forward Analysis for WSTS, Part II: Complete WSTS -- Qualitative Concurrent Stochastic Games with Imperfect Information -- Diagrammatic Confluence and Completion -- Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus -- LTL Path Checking Is Efficiently Parallelizable -- An Explicit Formula for the Free Exponential Modality of Linear Logic -- Decidability of the Guarded Fragment with the Transitive Closure -- Weak Alternating Timed Automata -- A Decidable Characterization of Locally Testable Tree Languages -- The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games -- Track C: Invited Lecture -- Google’s Auction for TV Ads -- Track C: Contributed Papers -- Graph Sparsification in the Semi-streaming Model -- Sort Me If You Can: How to Sort Dynamic Data -- Maximum Bipartite Flow in Networks with Adaptive Channel Width -- Mediated Population Protocols -- Rumor Spreading in Social Networks -- MANETS: High Mobility Can Make Up for Low Transmission Power -- Multiple Random Walks and Interacting Particle Systems -- Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies -- On a Network Generalization of the Minmax Theorem -- Rate-Based Transition Systems for Stochastic Process Calculi -- Improved Algorithms for Latency Minimization in Wireless Networks -- Efficient Methods for Selfish Network Design -- Smoothed Analysis of Balancing Networks -- Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures -- Multi-armed Bandits with Metric Switching Costs -- Algorithms for Secretary Problems on Graphs and Hypergraphs -- Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps -- Secure Function Collection with Sublinear Storage -- Worst-Case Efficiency Analysis of Queueing Disciplines -- On Observing Dynamic Prioritised Actions in SOC -- A Distributed and Oblivious Heap -- Proportional Response Dynamics in the Fisher Market. |
| Record Nr. | UNINA-9910484940603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I / / edited by Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas, Wolfgang Thomas
| Automata, Languages and Programming [[electronic resource] ] : 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I / / edited by Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas, Wolfgang Thomas |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (807 p.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Computer science Computer science—Mathematics Discrete mathematics Algorithms Software Engineering Theory of Computation Discrete Mathematics in Computer Science Mathematics of Computing |
| ISBN |
1-282-33209-0
9786612332098 3-642-02927-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Assigning Papers to Referees -- Algorithmic Game Theory: A Snapshot -- Contributed Papers -- SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs -- Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems -- Sorting and Selection with Imprecise Comparisons -- Fast FAST -- Bounds on the Size of Small Depth Circuits for Approximating Majority -- Counting Subgraphs via Homomorphisms -- External Sampling -- Functional Monitoring without Monotonicity -- De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results -- Towards a Study of Low-Complexity Graphs -- Decidability of Conjugacy of Tree-Shifts of Finite Type -- Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule -- Competitive Analysis of Aggregate Max in Windowed Streaming -- Faster Regular Expression Matching -- A Fast and Simple Parallel Algorithm for the Monotone Duality Problem -- Unconditional Lower Bounds against Advice -- Approximating Decision Trees with Multiway Branches -- Annotations in Data Streams -- The Tile Complexity of Linear Assemblies -- A Graph Reduction Step Preserving Element-Connectivity and Applications -- Approximating Matches Made in Heaven -- Strong and Pareto Price of Anarchy in Congestion Games -- A Better Algorithm for Random k-SAT -- Exact and Approximate Bandwidth -- Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs -- Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs -- On Cartesian Trees and Range Minimum Queries -- Applications of a Splitting Trick -- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness -- Incompressibility through Colors and IDs -- Partition Arguments in Multiparty Communication Complexity -- High Complexity Tilings with Sparse Errors -- Tight Bounds for the Cover Time of Multiple Random Walks -- Online Computation with Advice -- Dynamic Succinct Ordered Trees -- Universal Succinct Representations of Trees? -- Distortion Is Fixed Parameter Tractable -- Towards Optimal Range Medians -- B-Treaps: A Uniquely Represented Alternative to B-Trees -- Testing Fourier Dimensionality and Sparsity -- Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams -- Wireless Communication Is in APX -- The Ehrenfeucht-Silberger Problem -- Applications of Effective Probability Theory to Martin-Löf Randomness -- An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables -- Popular Mixed Matchings -- Factoring Groups Efficiently -- On Finding Dense Subgraphs -- Learning Halfspaces with Malicious Noise -- General Scheme for Perfect Quantum Network Coding with Free Classical Communication -- Greedy -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost -- Limits and Applications of Group Algebras for Parameterized Problems -- Sleep with Guilt and Work Faster to Minimize Flow Plus Energy -- Improved Bounds for Flow Shop Scheduling -- A 3/2-Approximation Algorithm for General Stable Marriage -- Limiting Negations in Formulas -- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems -- Superhighness and Strong Jump Traceability -- Amortized Communication Complexity of Distributions -- The Number of Symbol Comparisons in QuickSort and QuickSelect -- Computing the Girth of a Planar Graph in O(n logn) Time -- Elimination Graphs. |
| Record Nr. | UNINA-9910483530303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata, languages, and machines / Samuel Eilenberg
| Automata, languages, and machines / Samuel Eilenberg |
| Autore | Eilenberg, Samuel |
| Pubbl/distr/stampa | New York : Academic Press, 1974-76 |
| Descrizione fisica | 2 v. ; 24 cm. |
| Disciplina | 005.131 |
| Collana |
Pure and applied mathematics. A series of monographs & textbooks [Academic Press], 0079-8169 ; 59-A
Pure and applied mathematics. A series of monographs & textbooks [Academic Press], 0079-8169 ; 59-B |
| Soggetto topico |
Automata theory
Formal languages Sequential machine theory |
| ISBN |
0122340019 (v. A)
0122340027 (v. B) |
| Classificazione | AMS 68Q68 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991000708099707536 |
Eilenberg, Samuel
|
||
| New York : Academic Press, 1974-76 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Automated deduction - CADE-19 : 19. International conference on automated deduction : Miami Beach, FL, USA, July 28 - August 2, 2003 : proceedings / Franz Baader (Ed.)
| Automated deduction - CADE-19 : 19. International conference on automated deduction : Miami Beach, FL, USA, July 28 - August 2, 2003 : proceedings / Franz Baader (Ed.) |
| Autore | International conference on automated deduction <19.; 2003 ; Miami Beach, FL, USA> |
| Pubbl/distr/stampa | Berlin [etc.] : Springer, copyr. 20003 |
| Descrizione fisica | XII, 502 p. : ill. ; 24 cm |
| Disciplina | 005.131 |
| Collana | Lecture notes in artificial intelligence |
| Soggetto non controllato |
Intelligenza artificiale - congressi - 2003
Logica matematica - congressi - 2003 |
| ISBN | 3-540-40559-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990001860900203316 |
|
International conference on automated deduction <19.; 2003 ; Miami Beach, FL, USA>
|
||
| Berlin [etc.] : Springer, copyr. 20003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated deduction - CADE-20 : 20th. International conference on automated deduction : Tallin, Estonia, july 22-27, 2005 : proceedings / Robert Nieuwenhuis(Ed.)
| Automated deduction - CADE-20 : 20th. International conference on automated deduction : Tallin, Estonia, july 22-27, 2005 : proceedings / Robert Nieuwenhuis(Ed.) |
| Autore | International conference on automated deduction : <20. ; : 2005 |
| Pubbl/distr/stampa | Berlin [etc.] : Springer, copyr. 2005 |
| Descrizione fisica | XIII, 457 p. : ill. ; 24 cm |
| Disciplina | 005.131 |
| Collana |
Lecture notes in artificial intelligence
Lecture notes in computer science |
| Soggetto topico |
Intelligenza artificiale - Congressi - Tallin - 2005
Logica matematica - Congressi - Tallin - 2005 |
| ISBN | 3-540-28005-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990002966090203316 |
|
International conference on automated deduction : <20. ; : 2005
|
||
| Berlin [etc.] : Springer, copyr. 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated deduction - CADE-21 : 21st International conference on automated deduction : Bremen, Germany, July 17-20, 2007 : proceedings / Frank Pfenning (Ed.)
| Automated deduction - CADE-21 : 21st International conference on automated deduction : Bremen, Germany, July 17-20, 2007 : proceedings / Frank Pfenning (Ed.) |
| Autore | International conference on automated deduction : <21. ; : 2007 |
| Pubbl/distr/stampa | Berlin [etc.] : Springer, copyr. 2007 |
| Descrizione fisica | XII, 522 p. : ill. ; 24 cm |
| Disciplina | 005.131 |
| Collana |
Lecture notes in artificial intelligence
Lecture notes in computer science |
| Soggetto topico |
Intelligenza artificiale - Congressi - Bremen - 2007
Logica matematica - Congressi - Bremen - 2007 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990003092710203316 |
|
International conference on automated deduction : <21. ; : 2007
|
||
| Berlin [etc.] : Springer, copyr. 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated deduction - CADE-22 : 22 nd International conference on automated deduction : Montreal, Canada, august 2-7, 2009 : proceedings / Renate A. Schmidt (Ed.)
| Automated deduction - CADE-22 : 22 nd International conference on automated deduction : Montreal, Canada, august 2-7, 2009 : proceedings / Renate A. Schmidt (Ed.) |
| Autore | International conference on automated deduction : <22. ; : 2009 |
| Pubbl/distr/stampa | Berlin [etc.] : Springer, copyr. 2009 |
| Descrizione fisica | XIV, 504 p. : ill. ; 24 cm |
| Disciplina | 005.131 |
| Collana |
Lecture notes in artificial intelligence
Lecture notes in computer science |
| Soggetto topico |
Intelligenza artificiale - Congressi - Montreal - 2009
Logica matematica - Congressi - Montreal - 2009 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990003326830203316 |
|
International conference on automated deduction : <22. ; : 2009
|
||
| Berlin [etc.] : Springer, copyr. 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automation of Reasoning / edited by Jörg Siekmann and Graham Wrightson
| Automation of Reasoning / edited by Jörg Siekmann and Graham Wrightson |
| Pubbl/distr/stampa | Berlin; Heidelberg ; New York : Springer, 1983 |
| Descrizione fisica | 2 v. : ill. ; 25 cm |
| Disciplina | 005.131 |
| Collana | Symbolic computation |
| Soggetto non controllato | Logica matematica |
| ISBN | 3-540-12044-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Vol. 1.: Classical papers on computational logic 1957-1966 Vol. 2.: Classical papers on computational logic 1967-1970 |
| Record Nr. | UNINA-990000495700403321 |
| Berlin; Heidelberg ; New York : Springer, 1983 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Boolean function complexity / Edited by M. S. Paterson
| Boolean function complexity / Edited by M. S. Paterson |
| Pubbl/distr/stampa | Cambridge (NY) : Cambridge University Press, c1992 |
| Descrizione fisica | ix, 201 p. ; 24 cm |
| Disciplina | 005.131 |
| Collana | London Mathematical Society lecture note series |
| Soggetto non controllato | Computer science - Congressi |
| ISBN | 0-521-40826-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-990001329560403321 |
| Cambridge (NY) : Cambridge University Press, c1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
