top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
Algorithms -- ESA 2004 [[electronic resource] ] : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings / / edited by Susanne Albers, Tomasz Radzik
Algorithms -- ESA 2004 [[electronic resource] ] : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings / / edited by Susanne Albers, Tomasz Radzik
Edizione [1st ed. 2004.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004
Descrizione fisica 1 online resource (XXXVI, 836 p.)
Disciplina 005.1
Collana Lecture Notes in Computer Science
Soggetto topico Software engineering
Algorithms
Numerical analysis
Computer science—Mathematics
Data structures (Computer science)
Computer communication systems
Software Engineering/Programming and Operating Systems
Algorithm Analysis and Problem Complexity
Numeric Computing
Discrete Mathematics in Computer Science
Data Structures
Computer Communication Networks
ISBN 3-540-30140-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Lectures -- A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing -- Algorithmic Aspects of Web Search Engines -- Design and Analysis Track -- Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects -- Swap and Mismatch Edit Distance -- Path Decomposition Under a New Cost Measure with Applications to Optical Network Design -- Optimal External Memory Planar Point Enclosure -- Maximizing Throughput in Multi-queue Switches -- An Improved Algorithm for CIOQ Switches -- Labeling Smart Dust -- Graph Decomposition Lemmas and Their Role in Metric Embedding Methods -- Modeling Locality: A Probabilistic Analysis of LRU and FWF -- An Algorithm for Computing DNA Walks -- Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems -- Direct Routing: Algorithms and Complexity -- Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families -- A Parameterized Algorithm for Upward Planarity Testing -- Fisher Equilibrium Price with a Class of Concave Utility Functions -- Hardness and Approximation Results for Packing Steiner Trees -- Approximation Hardness of Dominating Set Problems -- Improved Online Algorithms for Buffer Management in QoS Switches -- Time Dependent Multi Scheduling of Multicast -- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems -- The Average Case Analysis of Partition Sorts -- A Fast Distributed Algorithm for Approximating the Maximum Matching -- Extreme Points Under Random Noise -- Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings -- On Variable-Sized Multidimensional Packing -- An Inductive Construction for Plane Laman Graphs via Vertex Splitting -- Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems -- On the Evolution of Selfish Routing -- Competitive Online Approximation of the Optimal Search Ratio -- Incremental Algorithms for Facility Location and k-Median -- Dynamic Shannon Coding -- Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries -- Negotiation-Range Mechanisms: Coalition-Resistant Markets -- Approximation Algorithms for Quickest Spanning Tree Problems -- An Approximation Algorithm for Maximum Triangle Packing -- Approximate Parameterized Matching -- Approximation of Rectangle Stabbing and Interval Stabbing Problems -- Fast 3-Coloring Triangle-Free Planar Graphs -- Approximate Unions of Lines and Minkowski Sums -- Radio Network Clustering from Scratch -- Seeking a Vertex of the Planar Matching Polytope in NC -- Equivalence of Search Capability Among Mobile Guards with Various Visibilities -- Load Balancing in Hypercubic Distributed Hash Tables with Heterogeneous Processors -- On the Stability of Multiple Partner Stable Marriages with Ties -- Flows on Few Paths: Algorithms and Lower Bounds -- Maximum Matchings in Planar Graphs via Gaussian Elimination -- Fast Multipoint Evaluation of Bivariate Polynomials -- On Adaptive Integer Sorting -- Tiling a Polygon with Two Kinds of Rectangles -- On Dynamic Shortest Paths Problems -- Uniform Algorithms for Deterministic Construction of Efficient Dictionaries -- Fast Sparse Matrix Multiplication -- Engineering and Applications Track -- An Experimental Study of Random Knapsack Problems -- Contraction and Treewidth Lower Bounds -- Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks -- Comparing Real Algebraic Numbers of Small Degree -- Code Flexibility and Program Efficiency by Genericity: Improving Cgal ’s Arrangements -- Finding Dominators in Practice -- Data Migration on Parallel Disks -- Classroom Examples of Robustness Problems in Geometric Computations -- Stable Minimum Storage Merging by Symmetric Comparisons -- On Rectangular Cartograms -- Multi-word Atomic Read/Write Registers on Multiprocessor Systems -- Beyond Optimal Play in Two-Person-Zerosum Games -- Solving Geometric Covering Problems by Data Reduction -- Efficient IP Table Lookup via Adaptive Stratified Trees with Selective Reconstructions -- Super Scalar Sample Sort -- Construction of Minimum-Weight Spanners -- A Straight Skeleton Approximating the Medial Axis -- Non-additive Shortest Paths.
Record Nr. UNISA-996465437903316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithms -- ESA 2004 : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings / / edited by Susanne Albers, Tomasz Radzik
Algorithms -- ESA 2004 : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings / / edited by Susanne Albers, Tomasz Radzik
Edizione [1st ed. 2004.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004
Descrizione fisica 1 online resource (XXXVI, 836 p.)
Disciplina 005.1
Collana Lecture Notes in Computer Science
Soggetto topico Software engineering
Algorithms
Numerical analysis
Computer science—Mathematics
Data structures (Computer science)
Computer networks
Software Engineering/Programming and Operating Systems
Algorithm Analysis and Problem Complexity
Numeric Computing
Discrete Mathematics in Computer Science
Data Structures
Computer Communication Networks
ISBN 3-540-30140-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Lectures -- A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing -- Algorithmic Aspects of Web Search Engines -- Design and Analysis Track -- Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects -- Swap and Mismatch Edit Distance -- Path Decomposition Under a New Cost Measure with Applications to Optical Network Design -- Optimal External Memory Planar Point Enclosure -- Maximizing Throughput in Multi-queue Switches -- An Improved Algorithm for CIOQ Switches -- Labeling Smart Dust -- Graph Decomposition Lemmas and Their Role in Metric Embedding Methods -- Modeling Locality: A Probabilistic Analysis of LRU and FWF -- An Algorithm for Computing DNA Walks -- Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems -- Direct Routing: Algorithms and Complexity -- Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families -- A Parameterized Algorithm for Upward Planarity Testing -- Fisher Equilibrium Price with a Class of Concave Utility Functions -- Hardness and Approximation Results for Packing Steiner Trees -- Approximation Hardness of Dominating Set Problems -- Improved Online Algorithms for Buffer Management in QoS Switches -- Time Dependent Multi Scheduling of Multicast -- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems -- The Average Case Analysis of Partition Sorts -- A Fast Distributed Algorithm for Approximating the Maximum Matching -- Extreme Points Under Random Noise -- Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings -- On Variable-Sized Multidimensional Packing -- An Inductive Construction for Plane Laman Graphs via Vertex Splitting -- Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems -- On the Evolution of Selfish Routing -- Competitive Online Approximation of the Optimal Search Ratio -- Incremental Algorithms for Facility Location and k-Median -- Dynamic Shannon Coding -- Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries -- Negotiation-Range Mechanisms: Coalition-Resistant Markets -- Approximation Algorithms for Quickest Spanning Tree Problems -- An Approximation Algorithm for Maximum Triangle Packing -- Approximate Parameterized Matching -- Approximation of Rectangle Stabbing and Interval Stabbing Problems -- Fast 3-Coloring Triangle-Free Planar Graphs -- Approximate Unions of Lines and Minkowski Sums -- Radio Network Clustering from Scratch -- Seeking a Vertex of the Planar Matching Polytope in NC -- Equivalence of Search Capability Among Mobile Guards with Various Visibilities -- Load Balancing in Hypercubic Distributed Hash Tables with Heterogeneous Processors -- On the Stability of Multiple Partner Stable Marriages with Ties -- Flows on Few Paths: Algorithms and Lower Bounds -- Maximum Matchings in Planar Graphs via Gaussian Elimination -- Fast Multipoint Evaluation of Bivariate Polynomials -- On Adaptive Integer Sorting -- Tiling a Polygon with Two Kinds of Rectangles -- On Dynamic Shortest Paths Problems -- Uniform Algorithms for Deterministic Construction of Efficient Dictionaries -- Fast Sparse Matrix Multiplication -- Engineering and Applications Track -- An Experimental Study of Random Knapsack Problems -- Contraction and Treewidth Lower Bounds -- Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks -- Comparing Real Algebraic Numbers of Small Degree -- Code Flexibility and Program Efficiency by Genericity: Improving Cgal ’s Arrangements -- Finding Dominators in Practice -- Data Migration on Parallel Disks -- Classroom Examples of Robustness Problems in Geometric Computations -- Stable Minimum Storage Merging by Symmetric Comparisons -- On Rectangular Cartograms -- Multi-word Atomic Read/Write Registers on Multiprocessor Systems -- Beyond Optimal Play in Two-Person-Zerosum Games -- Solving Geometric Covering Problems by Data Reduction -- Efficient IP Table Lookup via Adaptive Stratified Trees with Selective Reconstructions -- Super Scalar Sample Sort -- Construction of Minimum-Weight Spanners -- A Straight Skeleton Approximating the Medial Axis -- Non-additive Shortest Paths.
Record Nr. UNINA-9910767564503321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
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. UNISA-996465838503316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
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
Opac: Controlla la disponibilità qui
Automata, Languages and Programming : 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 : 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
Opac: Controlla la disponibilità qui
Automata, Languages and Programming : 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 : 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
Opac: Controlla la disponibilità qui
Efficient Algorithms [[electronic resource] ] : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday / / edited by Susanne Albers, Helmut Alt, Stefan Näher
Efficient Algorithms [[electronic resource] ] : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday / / edited by Susanne Albers, Helmut Alt, Stefan Näher
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Descrizione fisica 1 online resource (IX, 439 p.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer programming
Computer science—Mathematics
Discrete mathematics
Algorithms
Numerical analysis
Programming Techniques
Mathematics of Computing
Discrete Mathematics
Mathematical Applications in Computer Science
Numerical Analysis
ISBN 3-642-03456-X
Classificazione DAT 003f
DAT 530f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Models of Computation and Complexity -- Building Mathematics-Based Software Systems to Advance Science and Create Knowledge -- On Negations in Boolean Networks -- The Lovász Local Lemma and Satisfiability -- Kolmogorov-Complexity Based on Infinite Computations -- Pervasive Theory of Memory -- Introducing Quasirandomness to Computer Science -- Sorting and Searching -- Reflections on Optimal and Nearly Optimal Binary Search Trees -- Some Results for Elementary Operations -- Maintaining Ideally Distributed Random Search Trees without Extra Space -- A Pictorial Description of Cole’s Parallel Merge Sort -- Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction -- Combinatorial Optimization with Applications -- Algorithms for Energy Saving -- Minimizing Average Flow-Time -- Integer Linear Programming in Computational Biology -- Via Detours to I/O-Efficient Shortest Paths -- Computational Geometry and Geometric Graphs -- The Computational Geometry of Comparing Shapes -- Finding Nearest Larger Neighbors -- Multi-core Implementations of Geometric Algorithms -- The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension -- On Map Labeling with Leaders -- The Crossing Number of Graphs: Theory and Computation -- Algorithm Engineering, Exactness, and Robustness -- Algorithm Engineering – An Attempt at a Definition -- Of What Use Is Floating-Point Arithmetic in Computational Geometry? -- Car or Public Transport—Two Worlds -- Is the World Linear? -- In Praise of Numerical Computation -- Much Ado about Zero -- Polynomial Precise Interval Analysis Revisited.
Record Nr. UNISA-996465631403316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Efficient algorithms : essays dedicated to Kurt Mehlhorn on the occasion of his 60th birthday / / Susanne Albers, Helmut Alt, Stefan Naher (eds.)
Efficient algorithms : essays dedicated to Kurt Mehlhorn on the occasion of his 60th birthday / / Susanne Albers, Helmut Alt, Stefan Naher (eds.)
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin ; ; New York, : Springer, c2009
Descrizione fisica 1 online resource (IX, 439 p.)
Disciplina 005.1
Altri autori (Persone) AlbersSusanne
AltHelmut
NaherStefan
Collana Lecture notes in computer science
Festschrift
Soggetto topico Algorithms
ISBN 3-642-03456-X
Classificazione DAT 003f
DAT 530f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Models of Computation and Complexity -- Building Mathematics-Based Software Systems to Advance Science and Create Knowledge -- On Negations in Boolean Networks -- The Lovász Local Lemma and Satisfiability -- Kolmogorov-Complexity Based on Infinite Computations -- Pervasive Theory of Memory -- Introducing Quasirandomness to Computer Science -- Sorting and Searching -- Reflections on Optimal and Nearly Optimal Binary Search Trees -- Some Results for Elementary Operations -- Maintaining Ideally Distributed Random Search Trees without Extra Space -- A Pictorial Description of Cole’s Parallel Merge Sort -- Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction -- Combinatorial Optimization with Applications -- Algorithms for Energy Saving -- Minimizing Average Flow-Time -- Integer Linear Programming in Computational Biology -- Via Detours to I/O-Efficient Shortest Paths -- Computational Geometry and Geometric Graphs -- The Computational Geometry of Comparing Shapes -- Finding Nearest Larger Neighbors -- Multi-core Implementations of Geometric Algorithms -- The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension -- On Map Labeling with Leaders -- The Crossing Number of Graphs: Theory and Computation -- Algorithm Engineering, Exactness, and Robustness -- Algorithm Engineering – An Attempt at a Definition -- Of What Use Is Floating-Point Arithmetic in Computational Geometry? -- Car or Public Transport—Two Worlds -- Is the World Linear? -- In Praise of Numerical Computation -- Much Ado about Zero -- Polynomial Precise Interval Analysis Revisited.
Record Nr. UNINA-9910484157203321
Berlin ; ; New York, : Springer, c2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui