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.
Algorithms - ESA 2007 [[electronic resource] ] : 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings / / edited by Lars Arge, Michael Hoffmann, Emo Welzl
| Algorithms - ESA 2007 [[electronic resource] ] : 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings / / edited by Lars Arge, Michael Hoffmann, Emo Welzl |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XV, 772 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Algorithms Numerical analysis Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer networks Software Engineering Numerical Analysis Discrete Mathematics in Computer Science Data Science Computer Communication Networks |
| ISBN | 3-540-75520-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Nash Equilibria: Where We Stand -- Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation -- Arrangements in Geometry: Recent Advances and Challenges -- Contributed Papers: Design and Analysis Track -- Nash Equilibria in Voronoi Games on Graphs -- Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation -- Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks -- Finding Frequent Elements in Non-bursty Streams -- Tradeoffs and Average-Case Equilibria in Selfish Routing -- On the Variance of Subset Sum Estimation -- On Minimum Power Connectivity Problems -- On the Cost of Interchange Rearrangement in Strings -- Finding Mobile Data: Efficiency vs. Location Inaccuracy -- A Faster Query Algorithm for the Text Fingerprinting Problem -- Polynomial Time Algorithms for Minimum Energy Scheduling -- k-Mismatch with Don’t Cares -- Finding Branch-Decompositions and Rank-Decompositions -- Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover -- Linear-Time Ranking of Permutations -- Radix Sorting with No Extra Space -- Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation -- Order Statistics in the Farey Sequences in Sublinear Time -- New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks -- Dial a Ride from k-Forest -- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue -- Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication -- Optimal Algorithms for k-Search with Application in Option Pricing -- Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra -- Stackelberg Strategies for Atomic Congestion Games -- Good Quality Virtual Realization of Unit Ball Graphs -- Algorithms for Playing Games with Limited Randomness -- Approximation of Partial Capacitated Vertex Cover -- Optimal Resilient Dynamic Dictionaries -- Determining the Smallest k Such That G Is k-Outerplanar -- On the Size of Succinct Indices -- Compact Oracles for Approximate Distances Around Obstacles in the Plane -- Convex Combinations of Single Source Unsplittable Flows -- Farthest-Polygon Voronoi Diagrams -- Equitable Revisited -- Online Scheduling of Equal-Length Jobs on Parallel Machines -- k-Anonymization with Minimal Loss of Information -- A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs -- Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling -- Bundle Pricing with Comparable Items -- Approximating Interval Scheduling Problems with Bounded Profits -- Pricing Tree Access Networks with Connected Backbones -- Distance Coloring -- An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching -- To Fill or Not to Fill: The Gas Station Problem -- Online Bandwidth Allocation -- Two’s Company, Three’s a Crowd: Stable Family and Threesome Roommates Problems -- On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems -- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs -- Dynamic Plane Transitive Closure -- Contributed Papers: Engineering and Applications Track -- Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments -- Estimating Clustering Indexes in Data Streams -- Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics -- Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step -- Fast and Compact Oracles for Approximate Distances in Planar Graphs -- Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces -- A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks -- Algorithms to Separate -Chvátal-Gomory Cuts -- Fast Lowest Common Ancestor Computations in Dags -- A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem -- Solutions to Real-World Instances of PSPACE-Complete Stacking -- Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough -- An Experimental Study of New and Known Online Packet Buffering Algorithms. |
| Record Nr. | UNISA-996465433303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms-- ESA 2007 : 15th annual European symposium, Eilat, Israel, October 8-10, 2007 : proceedings / / Lars Arge, Michael Hoffmann, Emo Welzl (eds.)
| Algorithms-- ESA 2007 : 15th annual European symposium, Eilat, Israel, October 8-10, 2007 : proceedings / / Lars Arge, Michael Hoffmann, Emo Welzl (eds.) |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2007 |
| Descrizione fisica | 1 online resource (XV, 772 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
ArgeL (Lars)
HoffmannMichael <1970-> WelzlEmo |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico | Computer algorithms |
| ISBN | 3-540-75520-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Nash Equilibria: Where We Stand -- Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation -- Arrangements in Geometry: Recent Advances and Challenges -- Contributed Papers: Design and Analysis Track -- Nash Equilibria in Voronoi Games on Graphs -- Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation -- Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks -- Finding Frequent Elements in Non-bursty Streams -- Tradeoffs and Average-Case Equilibria in Selfish Routing -- On the Variance of Subset Sum Estimation -- On Minimum Power Connectivity Problems -- On the Cost of Interchange Rearrangement in Strings -- Finding Mobile Data: Efficiency vs. Location Inaccuracy -- A Faster Query Algorithm for the Text Fingerprinting Problem -- Polynomial Time Algorithms for Minimum Energy Scheduling -- k-Mismatch with Don’t Cares -- Finding Branch-Decompositions and Rank-Decompositions -- Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover -- Linear-Time Ranking of Permutations -- Radix Sorting with No Extra Space -- Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation -- Order Statistics in the Farey Sequences in Sublinear Time -- New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks -- Dial a Ride from k-Forest -- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue -- Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication -- Optimal Algorithms for k-Search with Application in Option Pricing -- Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra -- Stackelberg Strategies for Atomic Congestion Games -- Good Quality Virtual Realization of Unit Ball Graphs -- Algorithms for Playing Games with Limited Randomness -- Approximation of Partial Capacitated Vertex Cover -- Optimal Resilient Dynamic Dictionaries -- Determining the Smallest k Such That G Is k-Outerplanar -- On the Size of Succinct Indices -- Compact Oracles for Approximate Distances Around Obstacles in the Plane -- Convex Combinations of Single Source Unsplittable Flows -- Farthest-Polygon Voronoi Diagrams -- Equitable Revisited -- Online Scheduling of Equal-Length Jobs on Parallel Machines -- k-Anonymization with Minimal Loss of Information -- A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs -- Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling -- Bundle Pricing with Comparable Items -- Approximating Interval Scheduling Problems with Bounded Profits -- Pricing Tree Access Networks with Connected Backbones -- Distance Coloring -- An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching -- To Fill or Not to Fill: The Gas Station Problem -- Online Bandwidth Allocation -- Two’s Company, Three’s a Crowd: Stable Family and Threesome Roommates Problems -- On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems -- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs -- Dynamic Plane Transitive Closure -- Contributed Papers: Engineering and Applications Track -- Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments -- Estimating Clustering Indexes in Data Streams -- Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics -- Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step -- Fast and Compact Oracles for Approximate Distances in Planar Graphs -- Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces -- A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks -- Algorithms to Separate -Chvátal-Gomory Cuts -- Fast Lowest Common Ancestor Computations in Dags -- A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem -- Solutions to Real-World Instances of PSPACE-Complete Stacking -- Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough -- An Experimental Study of New and Known Online Packet Buffering Algorithms. |
| Altri titoli varianti |
Algorithms
ESA 2007 |
| Record Nr. | UNINA-9910483692003321 |
| Berlin ; ; New York, : Springer, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000 Proceedings / / edited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl
| Automata, Languages and Programming [[electronic resource] ] : 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000 Proceedings / / edited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XVI, 952 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Computer communication systems Special purpose computers Computer science—Mathematics Theory of Computation Software Engineering/Programming and Operating Systems Computer Communication Networks Special Purpose and Application-Based Systems Mathematics of Computing |
| ISBN | 3-540-45022-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- Game Semantics: Achievements and Prospects -- Clique Is Hard to Approximate within n 1-o(1) -- Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time -- Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming -- A Statically Allocated Parallel Functional Language -- An Optimal Minimum Spanning Tree Algorithm -- Improved Shortest Paths on the Word RAM -- Improved Algorithms for Finding Level Ancestors in Dynamic Trees -- Lax Logical Relations -- Reasoning about Idealized ALGOL Using Regular Languages -- The Measurement Process in Domain Theory -- Invited Talk -- Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution -- Monotone Proofs of the Pigeon Hole Principle -- Fully-Abstract Statecharts Semantics via Intuitionistic Kripke Models -- Algebraic Models for Contextual Nets -- Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems -- Measures of Nondeterminism in Finite Automata -- LTL Is Expressively Complete for Mazurkiewicz Traces -- An Automata-Theoretic Completeness Proof for Interval Temporal Logic -- Invited Talk -- Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms? -- Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search -- Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices -- Variable Independence, Quantifier Elimination, and Constraint Representations -- Constraint Satisfaction Problems and Finite Algebras -- An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing -- Resource Augmentation for Online Bounded Space Bin Packing -- Optimal Projective Algorithms for the List Update Problem -- Efficient Verification Algorithms for One-Counter Processes -- On the Complexity of Bisimulation Problems for Basic Parallel Processes -- Decidable First-Order Transition Logics for PA-Processes -- Invited Talk -- Non Interference for the Analysis of Cryptographic Protocols -- Average Bit-Complexity of Euclidean Algorithms -- Planar Maps and Airy Phenomena -- Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type System -- Information Flow vs. Resource Access in the Asynchronous Pi-Calculus (Extended Abstract) -- Award Talk -- The Genomics Revolution and Its Challenges for Algorithmic Research -- Invited Talk -- Alternating the Temporal Picture for Safety -- Necessary and Sufficient Assumptions for Non-interactive Zero-Knowledge Proofs of Knowledge for All NP Relations -- Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP -- A New Unfolding Approach to LTL Model Checking -- Reasoning about Message Passing in Finite State Environments -- Extended Notions of Security for Multicast Public Key Cryptosystems -- One-Round Secure Computation and Secure Autonomous Mobile Agents -- Round-Optimal and Abuse-Free Optimistic Multi-party Contract Signing -- On the Centralizer of a Finite Set -- On the Power of Tree-Walking Automata -- Determinization of Transducers over Infinite Words -- Invited Talk -- Constraint Programming and Graph Algorithms -- Scalable Secure Storage when Half the System Is Faulty -- Generating Partial and Multiple Transversals of a Hypergraph -- Revisiting the Correspondence between Cut Elimination and Normalisation -- Negation Elimination from Simple Equational Formulae -- Hardness of Set Cover with Intersection 1 -- Strong Inapproximability of the Basic k-Spanner Problem -- Infinite Series-Parallel Posets: Logic and Languages -- On Deciding if Deterministic Rabin Language Is in Büchi Class -- On Message Sequence Graphs and Finitely Generated Regular MSC Languages -- Invited Talk -- Pseudorandomness -- A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols -- Deterministic Radio Broadcasting -- An ?-Complete Equational Specification of Interleaving -- A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors -- Tight Size Bounds for Packet Headers in Narrow Meshes -- Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link -- On the Logical Characterisation of Performability Properties -- On the Representation of Timed Polyhedra -- Invited Talk -- Min-wise Independent Permutations: Theory and Practice -- Testing Acyclicity of Directed Graphs in Sublinear Time -- Computing the Girth of a Planar Graph -- Lower Bounds Are Not Easier over the Reals: Inside PH -- Unlearning Helps -- Fast Approximation Schemes for Euclidean Multi-connectivity Problems -- Approximate TSP in Graphs with Forbidden Minors -- Polynomial Time Approximation Schemes for General Multiprocessor Job Shop Scheduling -- The Many Faces of a Translation -- Gales and the Constructive Dimension of Individual Sequences -- The Global Power of Additional Queries to p-Random Oracles -- Homogenization and the Polynomial Calculus. |
| Record Nr. | UNISA-996465376503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming : 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000 Proceedings / / edited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl
| Automata, Languages and Programming : 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000 Proceedings / / edited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XVI, 952 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Computer networks Computers, Special purpose Computer science—Mathematics Theory of Computation Software Engineering/Programming and Operating Systems Computer Communication Networks Special Purpose and Application-Based Systems Mathematics of Computing |
| ISBN | 3-540-45022-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- Game Semantics: Achievements and Prospects -- Clique Is Hard to Approximate within n 1-o(1) -- Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time -- Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming -- A Statically Allocated Parallel Functional Language -- An Optimal Minimum Spanning Tree Algorithm -- Improved Shortest Paths on the Word RAM -- Improved Algorithms for Finding Level Ancestors in Dynamic Trees -- Lax Logical Relations -- Reasoning about Idealized ALGOL Using Regular Languages -- The Measurement Process in Domain Theory -- Invited Talk -- Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution -- Monotone Proofs of the Pigeon Hole Principle -- Fully-Abstract Statecharts Semantics via Intuitionistic Kripke Models -- Algebraic Models for Contextual Nets -- Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems -- Measures of Nondeterminism in Finite Automata -- LTL Is Expressively Complete for Mazurkiewicz Traces -- An Automata-Theoretic Completeness Proof for Interval Temporal Logic -- Invited Talk -- Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms? -- Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search -- Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices -- Variable Independence, Quantifier Elimination, and Constraint Representations -- Constraint Satisfaction Problems and Finite Algebras -- An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing -- Resource Augmentation for Online Bounded Space Bin Packing -- Optimal Projective Algorithms for the List Update Problem -- Efficient Verification Algorithms for One-Counter Processes -- On the Complexity of Bisimulation Problems for Basic Parallel Processes -- Decidable First-Order Transition Logics for PA-Processes -- Invited Talk -- Non Interference for the Analysis of Cryptographic Protocols -- Average Bit-Complexity of Euclidean Algorithms -- Planar Maps and Airy Phenomena -- Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type System -- Information Flow vs. Resource Access in the Asynchronous Pi-Calculus (Extended Abstract) -- Award Talk -- The Genomics Revolution and Its Challenges for Algorithmic Research -- Invited Talk -- Alternating the Temporal Picture for Safety -- Necessary and Sufficient Assumptions for Non-interactive Zero-Knowledge Proofs of Knowledge for All NP Relations -- Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP -- A New Unfolding Approach to LTL Model Checking -- Reasoning about Message Passing in Finite State Environments -- Extended Notions of Security for Multicast Public Key Cryptosystems -- One-Round Secure Computation and Secure Autonomous Mobile Agents -- Round-Optimal and Abuse-Free Optimistic Multi-party Contract Signing -- On the Centralizer of a Finite Set -- On the Power of Tree-Walking Automata -- Determinization of Transducers over Infinite Words -- Invited Talk -- Constraint Programming and Graph Algorithms -- Scalable Secure Storage when Half the System Is Faulty -- Generating Partial and Multiple Transversals of a Hypergraph -- Revisiting the Correspondence between Cut Elimination and Normalisation -- Negation Elimination from Simple Equational Formulae -- Hardness of Set Cover with Intersection 1 -- Strong Inapproximability of the Basic k-Spanner Problem -- Infinite Series-Parallel Posets: Logic and Languages -- On Deciding if Deterministic Rabin Language Is in Büchi Class -- On Message Sequence Graphs and Finitely Generated Regular MSC Languages -- Invited Talk -- Pseudorandomness -- A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols -- Deterministic Radio Broadcasting -- An ?-Complete Equational Specification of Interleaving -- A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors -- Tight Size Bounds for Packet Headers in Narrow Meshes -- Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link -- On the Logical Characterisation of Performability Properties -- On the Representation of Timed Polyhedra -- Invited Talk -- Min-wise Independent Permutations: Theory and Practice -- Testing Acyclicity of Directed Graphs in Sublinear Time -- Computing the Girth of a Planar Graph -- Lower Bounds Are Not Easier over the Reals: Inside PH -- Unlearning Helps -- Fast Approximation Schemes for Euclidean Multi-connectivity Problems -- Approximate TSP in Graphs with Forbidden Minors -- Polynomial Time Approximation Schemes for General Multiprocessor Job Shop Scheduling -- The Many Faces of a Translation -- Gales and the Constructive Dimension of Individual Sequences -- The Global Power of Additional Queries to p-Random Oracles -- Homogenization and the Polynomial Calculus. |
| Record Nr. | UNINA-9910767551103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||