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] ] : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias
| Automata, Languages, and Programming [[electronic resource] ] : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXX, 624 p. 49 illus.) |
| Disciplina | 005.13 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Computer networks Information storage and retrieval systems Application software Computer science—Mathematics Discrete mathematics Theory of Computation Computer Communication Networks Information Storage and Retrieval Computer and Information Systems Applications Discrete Mathematics in Computer Science |
| ISBN | 3-662-43951-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Track B: Logic, Semantics, Automata, and Theory of Programming -- Symmetric Groups and Quotient Complexity of Boolean Operations -- Handling Infinitely Branching WSTS -- Transducers with Origin Information -- Weak MSO+U with Path Quantifiers over Infinite Trees -- On the Decidability of MSO+U on Infinite Trees -- A Coalgebraic Foundation for Coinductive Union Types -- Turing Degrees of Limit Sets of Cellular Automata -- On the Complexity of Temporal-Logic Path Checking -- Parameterised Linearisability -- Games with a Weak Adversary -- The Complexity of Ergodic Mean-payoff Games -- Toward a Structure Theory of Regular Infinitary Trace Languages -- Unary Pushdown Automata and Straight-Line Programs -- Robustness against Power is PSpace-complete -- A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic -- Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs -- Coalgebraic Weak Bisimulation from Recursive Equations over Monads -- Piecewise Boolean Algebras and Their Domains -- Between Linearizability and Quiescent Consistency: Quantitative Quiescent Consistency -- Bisimulation Equivalence of First-Order Grammars -- Context Unification is in PSPACE -- Monodic Fragments of Probabilistic First-Order Logic -- Stability and Complexity of Minimising Probabilistic Automata -- Kleene Algebra with Equations -- All–Instances Termination of Chase is Undecidable -- Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus -- On the Positivity Problem for Simple Linear Recurrence Sequences -- Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences -- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words -- Hardness Results for Intersection Non-Emptiness -- Branching Bisimilarity Checking for PRS -- Track C: Foundations of Networked Computing Labeling Schemes for Bounded Degree Graphs -- Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints -- Distributed Computing on Core-Periphery Networks: Axiom-Based Design 399 -- Fault-Tolerant Rendezvous in Networks -- Data Delivery by Energy-Constrained Mobile Agents on a Line -- The Power of Two Choices in Distributed Voting -- Jamming-Resistant Learning in Wireless Networks -- Facility Location in Evolving Metrics -- Solving the ANTS Problem with Asynchronous Finite State Machines -- Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set -- Randomized Rumor Spreading in Dynamic Graphs -- Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods -- Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems -- Orienting Fully Dynamic Graphs with Worst-Case Time Bounds -- Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router -- The Melbourne Shuffle: Improving Oblivious Storage in the Cloud -- Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems -- Bypassing Erdos’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners. |
| Record Nr. | UNISA-996200139403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages, and Programming [[electronic resource] ] : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias
| Automata, Languages, and Programming [[electronic resource] ] : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXXIV, 1090 p. 74 illus.) |
| Disciplina | 001.642 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Computer networks Information storage and retrieval systems Application software Computer science—Mathematics Discrete mathematics Theory of Computation Computer Communication Networks Information Storage and Retrieval Computer and Information Systems Applications Discrete Mathematics in Computer Science |
| ISBN | 3-662-43948-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Sporadic Solutions to Zero-One Exclusion Tasks -- Verifying and Synthesizing Software with Recursive Functions (Invited Contribution) -- Track A: Algorithms, Complexity, and Games Weak Parity -- Consequences of Faster Alignment of Sequences -- Distance Labels with Optimal Local Stretch -- Time-Expanded Packings -- Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM -- The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average -- Tighter Relations between Sensitivity and Other Complexity Measures -- On Hardness of Jumbled Indexing -- Morphing Planar Graph Drawings Optimally -- Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs -- On the Role of Shared Randomness in Simultaneous Communication -- Short PCPs with Projection Queries -- Star Partitions of Perfect Graphs -- Coordination Mechanisms for Selfish Routing over Time on a Tree -- On Area-Optimal Planar Graph Drawings -- Shortest Two Disjoint Paths in Polynomial Time -- Listing Triangles -- On DNF Approximators for Monotone Boolean Functions -- Internal DLA: Efficient Simulation of a Physical Growth Model [Extended Abstract]. Lower Bounds for Approximate LDCs -- Holographic Algorithms Beyond Matchgates -- Testing Probability Distributions Underlying Aggregated Data -- Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost -- The Bose-Hubbard Model is QMA-complete -- Characterization of Binary Constraint System Games -- Fast Algorithms for Constructing Maximum Entropy Summary Trees -- Thorp Shuffling, Butterflies, and Non-Markovian Couplings.-Dynamic Complexity of Directed Reachability and Other Problems -- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile -- Canadians Should Travel Randomly -- Efficiency Guarantees in Auctions with Budgets -- Parameterized Complexity of Bandwidth on Trees -- Testing Equivalence of Polynomials under Shifts -- Optimal Analysis of Best Fit Bin Packing -- Light Spanners.-Semi-Streaming Set Cover (Extended Abstract) -- Online Stochastic Reordering Buffer Scheduling -- Demand Queries with Preprocessing -- Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs -- Public vs Private Coin in Bounded-Round Information -- En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations -- Improved Submatrix Maximum Queries in Monge Matrices -- For-All Sparse Recovery in Near-Optimal Time -- Families with Infants: A General Approach to Solve Hard Partition Problems -- Changing Bases: Multistage Optimization for Matroids and Matchings -- Problems -- Nearly Linear-Time Model-Based Compressive Sensing -- Breaking the PPSZ Barrier for Unique 3-SAT -- Privately Solving Linear Programs -- How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions -- Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not -- Partial Garbling Schemes and Their Applications -- On the Complexity of Trial and Error for Constraint Satisfaction Problems -- Information Theoretical Cryptogenography -- The Complexity of Somewhat Approximation Resistant Predicates -- Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound -- Distance Oracles for Time-Dependent Networks -- Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields -- Coloring Relatives of Interval Overlap Graphs via On-line Games -- Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits.-Testing Forest-Isomorphism in the Adjacency List Model -- Parameterized Approximation Schemes Using Graph Widths -- FPTAS for Weighted Fibonacci Gates and Its Applications -- Parameterized Algorithms to Preserve Connectivity -- Nonuniform Graph Partitioning with Unrelated Weights -- Precedence-Constrained Scheduling of Malleable Jobs with Preemption -- Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability -- QCSP on Semicomplete Digraphs -- Fast Pseudorandomness for Independence and Load Balancing [Extended Abstract] -- Determining Majority in Networks with Local Interactions and Very Small Local Memory -- Lower Bounds for Oblivious Subspace Embedding -- Secure Computation Using Leaky Tokens -- An Improved Interactive Streaming Algorithm for the Distinct Elements Problem -- A Faster Parameterized Algorithm for Treedepth -- Pseudorandom Graphs in Data Structures -- Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications -- The Mondshein Sequence -- Balanced Allocations: A Simple Proof for the Heavily Loaded Case -- Close to Uniform Prime Number Generation with Fewer Random Bits -- Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs -- Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem (Extended Abstract) -- On Learning, Lower Bounds and (un)Keeping Promises -- Certificates in Data Structures -- Optimal Query Complexity for Estimating the Trace of a Matrix -- Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles -- Spatial Mixing of Coloring Random Graphs. |
| Record Nr. | UNISA-996200139803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages, and Programming : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias
| Automata, Languages, and Programming : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXXIV, 1090 p. 74 illus.) |
| Disciplina | 001.642 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Computer networks Information storage and retrieval systems Application software Computer science—Mathematics Discrete mathematics Theory of Computation Computer Communication Networks Information Storage and Retrieval Computer and Information Systems Applications Discrete Mathematics in Computer Science |
| ISBN | 3-662-43948-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Sporadic Solutions to Zero-One Exclusion Tasks -- Verifying and Synthesizing Software with Recursive Functions (Invited Contribution) -- Track A: Algorithms, Complexity, and Games Weak Parity -- Consequences of Faster Alignment of Sequences -- Distance Labels with Optimal Local Stretch -- Time-Expanded Packings -- Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM -- The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average -- Tighter Relations between Sensitivity and Other Complexity Measures -- On Hardness of Jumbled Indexing -- Morphing Planar Graph Drawings Optimally -- Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs -- On the Role of Shared Randomness in Simultaneous Communication -- Short PCPs with Projection Queries -- Star Partitions of Perfect Graphs -- Coordination Mechanisms for Selfish Routing over Time on a Tree -- On Area-Optimal Planar Graph Drawings -- Shortest Two Disjoint Paths in Polynomial Time -- Listing Triangles -- On DNF Approximators for Monotone Boolean Functions -- Internal DLA: Efficient Simulation of a Physical Growth Model [Extended Abstract]. Lower Bounds for Approximate LDCs -- Holographic Algorithms Beyond Matchgates -- Testing Probability Distributions Underlying Aggregated Data -- Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost -- The Bose-Hubbard Model is QMA-complete -- Characterization of Binary Constraint System Games -- Fast Algorithms for Constructing Maximum Entropy Summary Trees -- Thorp Shuffling, Butterflies, and Non-Markovian Couplings.-Dynamic Complexity of Directed Reachability and Other Problems -- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile -- Canadians Should Travel Randomly -- Efficiency Guarantees in Auctions with Budgets -- Parameterized Complexity of Bandwidth on Trees -- Testing Equivalence of Polynomials under Shifts -- Optimal Analysis of Best Fit Bin Packing -- Light Spanners.-Semi-Streaming Set Cover (Extended Abstract) -- Online Stochastic Reordering Buffer Scheduling -- Demand Queries with Preprocessing -- Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs -- Public vs Private Coin in Bounded-Round Information -- En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations -- Improved Submatrix Maximum Queries in Monge Matrices -- For-All Sparse Recovery in Near-Optimal Time -- Families with Infants: A General Approach to Solve Hard Partition Problems -- Changing Bases: Multistage Optimization for Matroids and Matchings -- Problems -- Nearly Linear-Time Model-Based Compressive Sensing -- Breaking the PPSZ Barrier for Unique 3-SAT -- Privately Solving Linear Programs -- How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions -- Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not -- Partial Garbling Schemes and Their Applications -- On the Complexity of Trial and Error for Constraint Satisfaction Problems -- Information Theoretical Cryptogenography -- The Complexity of Somewhat Approximation Resistant Predicates -- Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound -- Distance Oracles for Time-Dependent Networks -- Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields -- Coloring Relatives of Interval Overlap Graphs via On-line Games -- Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits.-Testing Forest-Isomorphism in the Adjacency List Model -- Parameterized Approximation Schemes Using Graph Widths -- FPTAS for Weighted Fibonacci Gates and Its Applications -- Parameterized Algorithms to Preserve Connectivity -- Nonuniform Graph Partitioning with Unrelated Weights -- Precedence-Constrained Scheduling of Malleable Jobs with Preemption -- Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability -- QCSP on Semicomplete Digraphs -- Fast Pseudorandomness for Independence and Load Balancing [Extended Abstract] -- Determining Majority in Networks with Local Interactions and Very Small Local Memory -- Lower Bounds for Oblivious Subspace Embedding -- Secure Computation Using Leaky Tokens -- An Improved Interactive Streaming Algorithm for the Distinct Elements Problem -- A Faster Parameterized Algorithm for Treedepth -- Pseudorandom Graphs in Data Structures -- Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications -- The Mondshein Sequence -- Balanced Allocations: A Simple Proof for the Heavily Loaded Case -- Close to Uniform Prime Number Generation with Fewer Random Bits -- Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs -- Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem (Extended Abstract) -- On Learning, Lower Bounds and (un)Keeping Promises -- Certificates in Data Structures -- Optimal Query Complexity for Estimating the Trace of a Matrix -- Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles -- Spatial Mixing of Coloring Random Graphs. |
| Record Nr. | UNINA-9910484091103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata, Languages, and Programming : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias
| Automata, Languages, and Programming : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXX, 624 p. 49 illus.) |
| Disciplina | 005.13 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Computer networks Information storage and retrieval systems Application software Computer science—Mathematics Discrete mathematics Theory of Computation Computer Communication Networks Information Storage and Retrieval Computer and Information Systems Applications Discrete Mathematics in Computer Science |
| ISBN | 3-662-43951-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Track B: Logic, Semantics, Automata, and Theory of Programming -- Symmetric Groups and Quotient Complexity of Boolean Operations -- Handling Infinitely Branching WSTS -- Transducers with Origin Information -- Weak MSO+U with Path Quantifiers over Infinite Trees -- On the Decidability of MSO+U on Infinite Trees -- A Coalgebraic Foundation for Coinductive Union Types -- Turing Degrees of Limit Sets of Cellular Automata -- On the Complexity of Temporal-Logic Path Checking -- Parameterised Linearisability -- Games with a Weak Adversary -- The Complexity of Ergodic Mean-payoff Games -- Toward a Structure Theory of Regular Infinitary Trace Languages -- Unary Pushdown Automata and Straight-Line Programs -- Robustness against Power is PSpace-complete -- A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic -- Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs -- Coalgebraic Weak Bisimulation from Recursive Equations over Monads -- Piecewise Boolean Algebras and Their Domains -- Between Linearizability and Quiescent Consistency: Quantitative Quiescent Consistency -- Bisimulation Equivalence of First-Order Grammars -- Context Unification is in PSPACE -- Monodic Fragments of Probabilistic First-Order Logic -- Stability and Complexity of Minimising Probabilistic Automata -- Kleene Algebra with Equations -- All–Instances Termination of Chase is Undecidable -- Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus -- On the Positivity Problem for Simple Linear Recurrence Sequences -- Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences -- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words -- Hardness Results for Intersection Non-Emptiness -- Branching Bisimilarity Checking for PRS -- Track C: Foundations of Networked Computing Labeling Schemes for Bounded Degree Graphs -- Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints -- Distributed Computing on Core-Periphery Networks: Axiom-Based Design 399 -- Fault-Tolerant Rendezvous in Networks -- Data Delivery by Energy-Constrained Mobile Agents on a Line -- The Power of Two Choices in Distributed Voting -- Jamming-Resistant Learning in Wireless Networks -- Facility Location in Evolving Metrics -- Solving the ANTS Problem with Asynchronous Finite State Machines -- Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set -- Randomized Rumor Spreading in Dynamic Graphs -- Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods -- Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems -- Orienting Fully Dynamic Graphs with Worst-Case Time Bounds -- Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router -- The Melbourne Shuffle: Improving Oblivious Storage in the Cloud -- Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems -- Bypassing Erdos’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners. |
| Record Nr. | UNINA-9910484021803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Distributed Computing [[electronic resource] ] : 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, Proceedings / / edited by Pierre Fraigniaud
| Distributed Computing [[electronic resource] ] : 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, Proceedings / / edited by Pierre Fraigniaud |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XIV, 522 p.) |
| Disciplina | 004.36 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer networks Algorithms Computer programming Operating systems (Computers) Theory of Computation Computer Communication Networks Programming Techniques Operating Systems |
| ISBN | 9783540320753 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks -- Securing the Net: Challenges, Failures and Directions -- Regular Papers -- Coterie Availability in Sites -- Keeping Denial-of-Service Attackers in the Dark -- On Conspiracies and Hyperfairness in Distributed Computing -- On the Availability of Non-strict Quorum Systems -- Musical Benches -- Obstruction-Free Algorithms Can Be Practically Wait-Free -- Efficient Reduction for Wait-Free Termination Detection in a Crash-Prone Distributed System -- Non-blocking Hashtables with Open Addressing -- Computing with Reads and Writes in the Absence of Step Contention -- Restricted Stack Implementations -- Proving Atomicity: An Assertional Approach -- Time and Space Lower Bounds for Implementations Using k-CAS -- (Almost) All Objects Are Universal in Message Passing Systems -- ? Meets Paxos: Leader Election and Stability Without Eventual Timely Links -- Plausible Clocks with Bounded Inaccuracy -- Causing Communication Closure: Safe Program Composition with Non-FIFO Channels -- What Can Be Implemented Anonymously? -- Waking Up Anonymous Ad Hoc Radio Networks -- Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs -- Distributed Computing with Imperfect Randomness -- Polymorphic Contention Management -- Distributed Transactional Memory for Metric-Space Networks -- Concise Version Vectors in WinFS -- Adaptive Software Transactional Memory -- Optimistic Generic Broadcast -- Space and Step Complexity Efficient Adaptive Collect -- Observing Locally Self-stabilization in a Probabilistic Way -- Asymptotically Optimal Solutions for Small World Graphs -- Deciding Stability in Packet-Switched FIFO Networks Under the Adversarial Queuing Model in Polynomial Time, -- Compact Routing for Graphs Excluding a Fixed Minor -- General Compact Labeling Schemes for Dynamic Trees -- The Dynamic And-Or Quorum System -- Brief Announcements -- Byzantine Clients Rendered Harmless -- Reliably Executing Tasks in the Presence of Malicious Processors -- Obstruction-Free Step Complexity: Lock-Free DCAS as an Example -- Communication-Efficient Implementation of Failure Detector Classes and -- Optimal Resilience for Erasure-Coded Byzantine Distributed Storage -- Agreement Among Unacquainted Byzantine Generals -- Subscription Propagation and Content-Based Routing with Delivery Guarantees -- Asynchronous Verifiable Information Dispersal -- Towards a Theory of Self-organization -- Timing Games and Shared Memory -- A Lightweight Group Mutual k-Exclusion Algorithm Using Bi-k-Arbiters -- Could any Graph be Turned into a Small-World? -- Papillon: Greedy Routing in Rings -- An Efficient Long-Lived Adaptive Collect Algorithm. |
| Record Nr. | UNISA-996465849603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed Computing : 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, Proceedings / / edited by Pierre Fraigniaud
| Distributed Computing : 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, Proceedings / / edited by Pierre Fraigniaud |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XIV, 522 p.) |
| Disciplina | 004.36 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer networks Algorithms Computer programming Operating systems (Computers) Theory of Computation Computer Communication Networks Programming Techniques Operating Systems |
| ISBN | 9783540320753 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks -- Securing the Net: Challenges, Failures and Directions -- Regular Papers -- Coterie Availability in Sites -- Keeping Denial-of-Service Attackers in the Dark -- On Conspiracies and Hyperfairness in Distributed Computing -- On the Availability of Non-strict Quorum Systems -- Musical Benches -- Obstruction-Free Algorithms Can Be Practically Wait-Free -- Efficient Reduction for Wait-Free Termination Detection in a Crash-Prone Distributed System -- Non-blocking Hashtables with Open Addressing -- Computing with Reads and Writes in the Absence of Step Contention -- Restricted Stack Implementations -- Proving Atomicity: An Assertional Approach -- Time and Space Lower Bounds for Implementations Using k-CAS -- (Almost) All Objects Are Universal in Message Passing Systems -- ? Meets Paxos: Leader Election and Stability Without Eventual Timely Links -- Plausible Clocks with Bounded Inaccuracy -- Causing Communication Closure: Safe Program Composition with Non-FIFO Channels -- What Can Be Implemented Anonymously? -- Waking Up Anonymous Ad Hoc Radio Networks -- Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs -- Distributed Computing with Imperfect Randomness -- Polymorphic Contention Management -- Distributed Transactional Memory for Metric-Space Networks -- Concise Version Vectors in WinFS -- Adaptive Software Transactional Memory -- Optimistic Generic Broadcast -- Space and Step Complexity Efficient Adaptive Collect -- Observing Locally Self-stabilization in a Probabilistic Way -- Asymptotically Optimal Solutions for Small World Graphs -- Deciding Stability in Packet-Switched FIFO Networks Under the Adversarial Queuing Model in Polynomial Time, -- Compact Routing for Graphs Excluding a Fixed Minor -- General Compact Labeling Schemes for Dynamic Trees -- The Dynamic And-Or Quorum System -- Brief Announcements -- Byzantine Clients Rendered Harmless -- Reliably Executing Tasks in the Presence of Malicious Processors -- Obstruction-Free Step Complexity: Lock-Free DCAS as an Example -- Communication-Efficient Implementation of Failure Detector Classes and -- Optimal Resilience for Erasure-Coded Byzantine Distributed Storage -- Agreement Among Unacquainted Byzantine Generals -- Subscription Propagation and Content-Based Routing with Delivery Guarantees -- Asynchronous Verifiable Information Dispersal -- Towards a Theory of Self-organization -- Timing Games and Shared Memory -- A Lightweight Group Mutual k-Exclusion Algorithm Using Bi-k-Arbiters -- Could any Graph be Turned into a Small-World? -- Papillon: Greedy Routing in Rings -- An Efficient Long-Lived Adaptive Collect Algorithm. |
| Record Nr. | UNINA-9910483878503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Euro-Par '96 - Parallel Processing [[electronic resource] ] : Second International Euro-Par Conference, Lyon, France, August 26 - 29, 1996, Proceedings, Volume I / / edited by Luc Bouge, Pierre Fraigniaud, Anne Mignotte, Yves Robert
| Euro-Par '96 - Parallel Processing [[electronic resource] ] : Second International Euro-Par Conference, Lyon, France, August 26 - 29, 1996, Proceedings, Volume I / / edited by Luc Bouge, Pierre Fraigniaud, Anne Mignotte, Yves Robert |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (LXVI, 846 p.) |
| Disciplina | 003.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Architecture, Computer
Computer organization Software engineering Computers Database management Computer mathematics Computer System Implementation Computer Systems Organization and Communication Networks Software Engineering/Programming and Operating Systems Theory of Computation Database Management Computational Mathematics and Numerical Analysis |
| ISBN | 3-540-70633-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | High-performance distributed computing: The I-WAY experiment and beyond -- Design and implementation of a parallel architecture for biological sequence comparison -- Universal computing -- Dynamic load balancing in parallel database systems -- Distributed Array Query and Visualization for High Performance Fortran -- Annai scalable run-time support for interactive debugging and performance analysis of large-scale parallel programs -- On the implementation of a replay mechanism -- Concepts and functionalities of the DOSMOS-trace monitoring tool -- An open monitoring system for parallel and distributed programs -- Millipede: Easy parallel programming in available distributed environments -- An adaptive cost system for parallel program instrumentation -- SVMview: A performance tuning tool for DSM-based parallel computers -- Cautious, machine-independent performance tuning for shared-memory multiprocessors -- Dealing with heterogeneity in Stardust: An environment for parallel programming on networks of heterogeneous workstations -- An integrated environment to design parallel object-oriented applications -- MPI-2: Extending the message-passing interface -- Optimizing Sisal programs: A formal approach -- A refinement methodology for developing data-parallel applications -- Task parallelism: What a tool can provide and what should be left to the user -- Efficient block cyclic data redistribution -- Optimal grain size computation for pipelined algorithms -- Dynamic redistribution on heterogeneous parallel computers -- Supporting distributed sparse matrix objects -- Low-latency communication over Fast Ethernet -- A comparison of input and output driven routers -- Optimal topology for distributed shared-memory multiprocessors: Hypercubes again? -- A pattern-associative router for interconnection network adaptive algorithms -- On stack-graph OPS-based lightwave networks -- A general method for efficient embeddings of graphs into optimal hypercubes -- The size complexity of strictly non-blocking fixed ratio concentrators with constant depth -- Bandwidth and cutwidth of the mesh of d-ary trees -- Variable-dilation embeddings of hypercubes into star graphs: Performance metrics, mapping functions, and routing -- Overlapping communication and computation in hypercubes -- Efficient delay routing -- Multipacket hot-potato routing on processor arrays -- A necessary and sufficient condition for proper routing in omega-omega network -- Rubik routing permutations on graphs -- The effect of flow control and routing adaptivity on priority-driven traffic in multiprocessor networks -- Routing on networks of optical crossbars -- Latency and bandwidth requirements of massively parallel programs: FFT as a case study -- Induced broadcasting algorithms in iterated line digraphs -- Lower bounds on broadcasting time of de Bruijn networks -- Gossip in trees under line-communication mode -- Total exchange in Cayley networks -- Leaf communications in complete trees -- A gossip algorithm for bus networks with buses of limited length -- Worm-hole gossiping on meshes -- Circuit-switched gossiping in 3-dimensional torus networks -- Automatic parallelization and high performance compilers -- On the optimality of Allen and Kennedy's algorithm for parallelism extraction in nested loops -- Memory reuse analysis in the polyhedral model -- Cycle shrinking by dependence reduction -- A unified transformation technique for multilevel blocking -- Array dataflow analysis for explicitly parallel programs -- Semantic foundations of commutativity analysis -- Applications of Fuzzy Array Dataflow Analysis -- Simplifying communication induced by operations on block-distributed arrays -- Compiler reduction of invalidation traffic in virtual shared memory systems -- Partial dead code elimination for parallel programs -- Solving the constant-degree parallelism alignment problem -- Topographic data mapping by balanced hypersphere tessellation -- Implementing pipelined computation and communication in an HPF compiler -- Efficient mapping of interdependent scans -- Classifying loops for space-time mapping -- PACA: A cooperative file system cache for parallel machines -- A system for fault-tolerant execution of data and compute intensive programs over a network of workstations -- A framework for viewing atomic events in distributed computations -- Worker-based parallel computing on PVM -- An efficient distributed tuple space implementation for networks of workstations -- A highly available partition-processing protocol for distributed shared memory systems -- I/O data mapping in ParFiSys: Support for high-performance I/O in parallel and distributed systems -- Correctness proof for a distributed memory system -- Distributed Shared Memory based on Group Large Causality -- A framework for integrated communication and I/O placement -- Formal derivation of parallel program for 2-dimensional maximum segment sum problem -- The migrating tasks: An execution model for irregular codes -- Discussing HPF design issues -- Parallelizing conditional recurrences -- Adaptive data parallel computation in the parallel object-oriented language OCore -- The use of interpreted languages for implementing parallel algorithms on distributed systems -- Co-ordinating heterogeneous parallel computation -- Correctness of a distributed-memory model for scheme -- Partial evaluation scheme for concurrent languages and its correctness -- Support for implementation of evolutionary concurrent systems in concurrent programming languages -- Structured dagger: A coordination language for Message-Driven Programming -- TPascal — A language for task parallel programming -- OB(PN)2: An Object Based Petri Net Programming Notation (extended abstract) -- Reusable coordinator modules for massively concurrent applications -- Introducing dynamicity in the data-parallel language 8 1/2 -- Astro-Gofer: Parallel functional programming with co-ordinating processes -- Multiple OR-parallel resolution: Meta-level control of parallel logic programs -- High level parallel programming based on automatic coordination -- Eden — The paradise of functional concurrent programming -- A straightforward translation of D0L systems in the declarative data-parallel language 8 1/2 -- Efficient parallel programming with algorithmic skeletons -- A loosely synchronized execution model for a simple data-parallel language (extended abstract) -- A nonannotative approach to distributed data-parallel computing -- Petri net modelling of PARSE designs -- Synchronization expressed in types of communication channels -- Laws of data parallel assignment -- Proving progress properties of non terminating programs under fairness assumptions -- A simple parallel dictionary matching algorithm -- Scalability and granularity issues of the hierarchical radiosity method -- List ranking on interconnection networks -- Parallel algorithm for computing the fragment vector in steiner triple systems -- Representation of the gabow algorithm for finding smallest spanning trees with a degree constraint on associative parallel processors -- Runtime support for replicated parallel simulators of an ATM network on workstation clusters -- Shared-memory implementation of an irregular particle simulation method -- A parallel algorithm for the technology mapping of LUT-based FPGAs -- Distributed string matching algorithm on the N-cube. . |
| Record Nr. | UNISA-996465646803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Euro-Par'96 - Parallel Processing [[electronic resource] ] : Second International Euro-Par Conference, Lyon, France, August 26-29, 1996. Proceedings. Volume II / / edited by Luc Bouge, Pierre Fraigniaud, Anne Mignotte, Yves Robert
| Euro-Par'96 - Parallel Processing [[electronic resource] ] : Second International Euro-Par Conference, Lyon, France, August 26-29, 1996. Proceedings. Volume II / / edited by Luc Bouge, Pierre Fraigniaud, Anne Mignotte, Yves Robert |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (LXVI, 931 p.) |
| Disciplina | 003.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Architecture, Computer
Computer organization Software engineering Computers Database management Computer mathematics Computer System Implementation Computer Systems Organization and Communication Networks Software Engineering/Programming and Operating Systems Theory of Computation Database Management Computational Mathematics and Numerical Analysis |
| ISBN | 3-540-70636-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Optimization of the ScaLAPACK LU factorization routine using communication/computation overlap -- On experiments with a parallel direct solver for diagonally dominant banded linear systems -- The computation of partial eigensolutions on a distributed memory machine using a modified lanczos method -- The parallel computation of partial eigensolutions of large matrices on a massively parallel processor -- Preprocessing of sparse unassembled linear systems for efficient solution using element-by-element preconditioners -- Implementing the parallel quasi-Laguerre's algorithm for symmetric tridiagonal eigenproblems -- Comparing task and data parallel execution schemes for the DIIRK method -- Numerical turbulence simulation on different parallel computers using the sparse grid combination method -- Parallel Fourier-Motzkin elimination -- Comparison of three Monte Carlo methods for Matrix Inversion -- Parallel solution of the volume integral equation of electromagnetic scattering -- Optimization of parallel multilevel-Newton algorithms on workstation clusters -- A time and space parallel algorithm for the heat equation: The implicit collocation method -- Parallel image/video processing and computer arithmetic -- A high performance image database system for remotely sensed imagery -- An asynchronous parallel algorithm for symbolic grouping operations in vision -- A parallel pipelined Hough Transform -- High-performance SAR image formation and post-processing -- A parallel implementation of image coding using linear prediction and iterated function systems -- Parallel algorithms for using non-stationary MRA in image compression -- High radix cordic rotation based on selection by rounding -- On-line algorithms for computing exponentials and logarithms -- Parallel and on-line addition in negative base and some complex number systems -- A variable latency pipelined floating-point adder -- Basic linear algebra operations in SLI arithmetic -- CAM2: A highly-parallel 2D cellular automata architecture for real-time and palm-top pixel-level image processing -- A self-optimising coprocessor model for portable parallel image processing -- System-level memory management for weakly parallel image processing -- Multidimensional periodic scheduling model and complexity -- Global approach for compiled bit-true simulation of DSP systems -- Parallel implementation of RBF neural networks -- Selected results from the ParkBench Benchmark -- Exploiting symmetry in parallel computations for structural biology -- An object-oriented and parallel simulation of a power-plant -- A Planning System for Aircraft Production with parallel constraint logic programming -- Modelling and optimising flows using parallel spatial interaction models -- The queue-read queue-write asynchronous PRAM model -- ERCW PRAMs and optical communication -- Goodness of time-processor optimal PRAM simulations -- Simulations of PRAM on complete optical networks -- Adaptive parallelism in the Bulk-synchronous Parallel model -- Implementation issues relating to the WPRAM model for scalable computing -- The bulk-synchronous parallel random access machine -- The E-BSP model: Incorporating general locality and unbalanced communication into the BSP model -- Communication efficient data structures on the BSP model with applications in computational geometry -- Submachine locality in the bulk synchronous setting -- Algebraic laws for BSP programming -- Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model -- Multilayer perceptron learning control -- Evaluating the hyperbolic model on a variety of architectures -- SPC: A model of parallel computation -- Systematic efficient parallelization of scan and other list homomorphisms -- Array structures and data-parallel algorithms -- Compile-time cost analysis for parallel programming -- HPP: A high performance PRAM -- Relaxing the inclusion property in cache only memory architecture -- Using proxies to reduce controller contention in large shared-memory multiprocessors -- A RISC approach to weak cache coherence -- 3D optoelectronic computer architectures for the conjugate gradient and multigrid benchmark algorithms -- MSparc: A multithreaded sparc -- A new concept for parallel neurocomputer architectures -- Transformation of a 2-D VLSI systolic adder circuit in 3-D circuits using optical interconnections -- Scalable software latency hiding schemes: Evaluation of the poststore and prefetch options -- Reducing coherence overhead in shared-bus multiprocessors -- An asymptotically optimal affine schedule on bounded convex polyhedric domains -- List scheduling in the presence of branches: A theoretical evaluation -- Iterative approach for the clustering problem -- Compile-time task scheduling for multi-phase programming -- Scheduling with unit processing and communication times on a ring network: Approximation results -- Efficient parallel algorithms for scheduling with tree precedence constraints -- Bulk synchronous parallel scheduling of uniform dags -- Generalized multiprocessor scheduling -- A static scheduling heuristic for heterogeneous processors -- On the cyclic scheduling problem with small communication delays -- A new scheduling method for parallel discrete-event simulation -- Minimum length scheduling of precedence constrained messages in distributed systems -- Optimization of parallel programs on machines with expensive communication -- Eager scheduling with lazy retry for dynamic task scheduling -- Load management for load balancing on heterogeneous platforms: A comparison of traditional and neural network based approaches -- Application-assisted dynamic scheduling on large-scale multi-computer systems -- Economic-based dynamic load distribution in large workstation networks -- Flexible scheduling for non-deterministic, and-parallel execution of logic programs -- A load balancing task allocation scheme in a hard real time system -- A library implementation of the nano-threads programming model -- Speedup and efficiency of large size applications on heterogeneous networks -- Dip: A parallel program development environment -- Accurate performance prediction for massively parallel systems and its applications -- Contention in the Cray T3D communication network -- Theory, practice, and a tool for BSP performance prediction -- Applying the Semi-markov Memory and Cache coherence Interference model to an updating based cache coherence protocol -- Analytical models of multithreading with data prefetching -- IDRA (ideal resource allocation): Computing ideal speedups in parallel logic programming -- Estimation of the throughput for some stochastic resources sharing systems -- Some closed form results for circuit switching in a hypercube network -- to ILP workshop -- Instruction fetching mechanisms for superscalar microprocessors -- Designing dynamic two-level branch predictors based on pattern locality -- Streaming prefetch -- Functionality distribution on a superscalar architecture -- Investigating the limits of fine-grained parallelism in a statically scheduled superscalar architecture -- On-chip multiprocessing -- Identifying bottlenecks in a multithreaded superscalar microprocessor -- Aggregate operation movement: A min-cut approach to global code motion -- Global instruction scheduling — a practical approach -- Génération de micro-code parallèle pour la carte coprocesseur Rapid-2 -- RESIS: A new methodology for register optimization in software pipelining -- Optimal software pipelining through enumeration of schedules -- Triangular grid protocol: An efficient scheme for replica control with uniform access quorums -- Mapping a parallel complex-object DBMS to operating system processes -- A transaction model for multidatabase systems -- Multi-dimensional declustering methods for parallel database systems -- Modelling resource utilization in pipelined query execution -- On transforming a sequential SQL-DBMS into a parallel one: First results and experiences of the MIDAS project -- DPL graphs — A powerful representation of parallel relational query execution plans -- Blocker: A variable & multiattribute declustering for parallel database machines -- The PALLAS portable parallel programming environment -- An optimal parallel algorithm for Gaussian elimination -- Synthesis of massively pipelined algorithms for list manipulation. |
| Record Nr. | UNISA-996465648203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||