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.
Algorithmische Grundlagen für die Selbstorganisation von Roboterschwärmen / / Friedhelm Meyer auf der Heide; Friedhelm Meyer auf der Heide
| Algorithmische Grundlagen für die Selbstorganisation von Roboterschwärmen / / Friedhelm Meyer auf der Heide; Friedhelm Meyer auf der Heide |
| Autore | der Friedhelm Meyer auf |
| Pubbl/distr/stampa | Paderborn : , : Verlag Ferdinand Schöningh, , 2014 |
| Descrizione fisica | 1 online resource |
| Disciplina | 355.0332094 |
| Collana | Nordrhein Westfälische Akademie der Wissenschafte - Ingenieur- und Wirtschaftswissenschaften |
| Soggetto topico |
Militärischer Einsatz
Ausland |
| Soggetto genere / forma | Electronic books. |
| ISBN | 3-657-76651-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preliminary Material -- Zusammenfassung -- Einleitung -- Modelle für Roboter und Roboterschwärme -- Das Kettenbildungsproblem -- Gathering -- Resümee und Ausblick -- Danksagungen -- Literatur -- Der Autor -- Lieferbare Titel. |
| Record Nr. | UNINA-9910493666903321 |
der Friedhelm Meyer auf
|
||
| Paderborn : , : Verlag Ferdinand Schöningh, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms - ESA 2001 [[electronic resource] ] : 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings / / edited by Friedhelm Meyer auf der Heide
| Algorithms - ESA 2001 [[electronic resource] ] : 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings / / edited by Friedhelm Meyer auf der Heide |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 544 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Computers Algorithms Computer science—Mathematics Computer graphics Programming Techniques Theory of Computation Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computation by Abstract Devices Computer Graphics |
| ISBN | 3-540-44676-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- External Memory Data Structures -- Some Algorithmic Problems in Large Networks -- Exact and Approximate Distances in Graphs — A Survey -- Caching and Prefetching -- Strongly Competitive Algorithms for Caching with Pipelined Prefetching -- Duality between Prefetching and Queued Writing with Parallel Disks -- Online Algorithms -- Online Bin Coloring -- A General Decomposition Theorem for the k-Server Problem -- Buying a Constant Competitive Ratio for Paging -- Data Structures I -- Simple Minimal Perfect Hashing in Less Space -- Cuckoo Hashing -- Optimization and Approximation -- Coupling Variable Fixing Algorithms for the Automatic Recording Problem -- Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints -- On the Approximability of the Minimum Test Collection Problem -- Sequences -- Finding Approximate Repetitions under Hamming Distance -- SNPs Problems, Complexity, and Algorithms -- Scheduling -- A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs -- Grouping Techniques for Scheduling Problems: Simpler and Faster -- A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times -- Shortest Paths -- A Simple Shortest Path Algorithm with Linear Average Time -- A Heuristic for Dijkstra’s Algorithm with Many Targets and Its Use in Weighted Matching Algorithms -- Geometry I -- A Separation Bound for Real Algebraic Expressions -- Property Testing with Geometric Queries -- Smallest Color-Spanning Objects -- Data Structures II -- Explicit Deterministic Constructions for Membership in the Bitprobe Model -- Lossy Dictionaries -- Geometry II -- Splitting a Delaunay Triangulation in Linear Time -- A Fast Algorithm for Approximating the Detour of a Polygonal Chain -- An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee -- Distributed Algorithms -- Distributed O(? log n)-Edge-Coloring Algorithm -- Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation -- Graph Algorithms -- Computing Cycle Covers without Short Cycles -- A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth -- Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows -- Pricing -- Fast Pricing of European Asian Options with Provable Accuracy: Single-Stock and Basket Options -- Competitive Auctions for Multiple Digital Goods -- Broadcasting and Multicasting -- Algorithms for Efficient Filtering in Content-Based Multicast -- Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode -- Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks -- Graph Labeling and Graph Drawing -- Online and Offline Distance Constrained Labeling of Disk Graphs -- Approximate Distance Labeling Schemes -- On the Parameterized Complexity of Layered Graph Drawing -- Graphs -- A General Model of Undirected Web Graphs -- Packing Cycles and Cuts in Undirected Graphs -- Greedy Algorithms for Minimisation Problems in Random Regular Graphs. |
| Record Nr. | UNISA-996465811803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms - ESA 2001 : 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings / / edited by Friedhelm Meyer auf der Heide
| Algorithms - ESA 2001 : 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings / / edited by Friedhelm Meyer auf der Heide |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 544 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Computers Algorithms Computer science—Mathematics Computer graphics Programming Techniques Theory of Computation Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computation by Abstract Devices Computer Graphics |
| ISBN | 3-540-44676-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- External Memory Data Structures -- Some Algorithmic Problems in Large Networks -- Exact and Approximate Distances in Graphs — A Survey -- Caching and Prefetching -- Strongly Competitive Algorithms for Caching with Pipelined Prefetching -- Duality between Prefetching and Queued Writing with Parallel Disks -- Online Algorithms -- Online Bin Coloring -- A General Decomposition Theorem for the k-Server Problem -- Buying a Constant Competitive Ratio for Paging -- Data Structures I -- Simple Minimal Perfect Hashing in Less Space -- Cuckoo Hashing -- Optimization and Approximation -- Coupling Variable Fixing Algorithms for the Automatic Recording Problem -- Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints -- On the Approximability of the Minimum Test Collection Problem -- Sequences -- Finding Approximate Repetitions under Hamming Distance -- SNPs Problems, Complexity, and Algorithms -- Scheduling -- A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs -- Grouping Techniques for Scheduling Problems: Simpler and Faster -- A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times -- Shortest Paths -- A Simple Shortest Path Algorithm with Linear Average Time -- A Heuristic for Dijkstra’s Algorithm with Many Targets and Its Use in Weighted Matching Algorithms -- Geometry I -- A Separation Bound for Real Algebraic Expressions -- Property Testing with Geometric Queries -- Smallest Color-Spanning Objects -- Data Structures II -- Explicit Deterministic Constructions for Membership in the Bitprobe Model -- Lossy Dictionaries -- Geometry II -- Splitting a Delaunay Triangulation in Linear Time -- A Fast Algorithm for Approximating the Detour of a Polygonal Chain -- An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee -- Distributed Algorithms -- Distributed O(? log n)-Edge-Coloring Algorithm -- Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation -- Graph Algorithms -- Computing Cycle Covers without Short Cycles -- A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth -- Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows -- Pricing -- Fast Pricing of European Asian Options with Provable Accuracy: Single-Stock and Basket Options -- Competitive Auctions for Multiple Digital Goods -- Broadcasting and Multicasting -- Algorithms for Efficient Filtering in Content-Based Multicast -- Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode -- Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks -- Graph Labeling and Graph Drawing -- Online and Offline Distance Constrained Labeling of Disk Graphs -- Approximate Distance Labeling Schemes -- On the Parameterized Complexity of Layered Graph Drawing -- Graphs -- A General Model of Undirected Web Graphs -- Packing Cycles and Cuts in Undirected Graphs -- Greedy Algorithms for Minimisation Problems in Random Regular Graphs. |
| Record Nr. | UNINA-9910143626203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms for Sensor Systems : 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers / / edited by Paola Flocchini, Jie Gao, Evangelos Kranakis, Friedhelm Meyer auf der Heide
| Algorithms for Sensor Systems : 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers / / edited by Paola Flocchini, Jie Gao, Evangelos Kranakis, Friedhelm Meyer auf der Heide |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (X, 307 p. 91 illus.) |
| Disciplina | 004.601/5181 |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Algorithms
Computer communication systems Computer science—Mathematics Algorithm Analysis and Problem Complexity Computer Communication Networks Mathematics of Computing |
| ISBN | 3-642-45346-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Modeling Reality Algorithmically: The Case of Wireless Communication -- Autonomous Mobile Robots: A Distributed Computing -- Token Dissemination in Geometric Dynamic Networks -- The Wake Up Dominating Set -- Reconfiguring Massive Particle Swarms with Limited, Global Control -- Polygon-Constrained motion planning problems -- Fast Localized Sensor Self-Deployment for Focused Coverage -- Minimal Solvers for Unsynchronized TDOA Sensor Network Calibration -- Data-Delivery by Energy-Constrained Mobile Robots -- Approximation Bounds for the Minimum k-Storage Problem -- Counting in Anonymous Dynamic Networks: An Experimental Perspective -- Station Assignment with Applications to Sensing -- On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model -- The Effect of Forgetting on the Performance of a Synchronizer -- On the Complexity of Barrier Resilience for Fat Regions -- A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks -- Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes -- On the Complexity of Fixed-Schedule Neighbourhood Learning in Wireless Ad Hoc Radio Networks -- Optimal Nearest Neighbor Queries in Sensor Networks -- Conflict Graphs and the Capacity of the Mean Power Scheme -- Rendezvous of Two Robots with Visible Bits. |
| Record Nr. | UNISA-996198912503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms for Sensor Systems : 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers / / edited by Paola Flocchini, Jie Gao, Evangelos Kranakis, Friedhelm Meyer auf der Heide
| Algorithms for Sensor Systems : 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers / / edited by Paola Flocchini, Jie Gao, Evangelos Kranakis, Friedhelm Meyer auf der Heide |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (X, 307 p. 91 illus.) |
| Disciplina | 004.601/5181 |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Algorithms
Computer communication systems Computer science—Mathematics Algorithm Analysis and Problem Complexity Computer Communication Networks Mathematics of Computing |
| ISBN | 3-642-45346-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Modeling Reality Algorithmically: The Case of Wireless Communication -- Autonomous Mobile Robots: A Distributed Computing -- Token Dissemination in Geometric Dynamic Networks -- The Wake Up Dominating Set -- Reconfiguring Massive Particle Swarms with Limited, Global Control -- Polygon-Constrained motion planning problems -- Fast Localized Sensor Self-Deployment for Focused Coverage -- Minimal Solvers for Unsynchronized TDOA Sensor Network Calibration -- Data-Delivery by Energy-Constrained Mobile Robots -- Approximation Bounds for the Minimum k-Storage Problem -- Counting in Anonymous Dynamic Networks: An Experimental Perspective -- Station Assignment with Applications to Sensing -- On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model -- The Effect of Forgetting on the Performance of a Synchronizer -- On the Complexity of Barrier Resilience for Fat Regions -- A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks -- Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes -- On the Complexity of Fixed-Schedule Neighbourhood Learning in Wireless Ad Hoc Radio Networks -- Optimal Nearest Neighbor Queries in Sensor Networks -- Conflict Graphs and the Capacity of the Mean Power Scheme -- Rendezvous of Two Robots with Visible Bits. |
| Record Nr. | UNINA-9910483762803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II / / edited by Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul Spirakis
| Automata, Languages and Programming [[electronic resource] ] : 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II / / edited by Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul Spirakis |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XXIV, 614 p. 78 illus.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Computer networks Software engineering Algorithms Computer science Programming Techniques Computer Communication Networks Software Engineering Theory of Computation |
| ISBN |
1-280-38771-8
9786613565631 3-642-14162-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Informative Labeling Schemes -- Noetherian Spaces in Verification -- Towards a Theory of Time-Bounded Verification -- Physical Algorithms -- Session 1-Track B. Automata -- Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata -- Pumping and Counting on the Regular Post Embedding Problem -- Alternation Removal in Büchi Automata -- Linear Orders in the Pushdown Hierarchy -- Session 1-Track C. Communication in Networks -- The Serializability of Network Codes -- How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) -- Efficient Information Exchange in the Random Phone-Call Model -- An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines -- Session 2-Track B. Formal Languages -- A Topological Approach to Recognition -- On LR(k)-Parsers of Polynomial Size -- On Erasing Productions in Random Context Grammars -- Session 4-Track B. Semantics -- Game Semantics for Call-by-Value Polymorphism -- What Is a Pure Functional? -- Example-Guided Abstraction Simplification -- Compositional Closure for Bayes Risk in Probabilistic Noninterference -- Session 4-Track C. Fault Tolerance, Ranking -- Asynchronous Throughput-Optimal Routing in Malicious Networks -- Improved Fault Tolerance and Secure Computation on Sparse Networks -- Sparse Reliable Graph Backbones -- Approximation Algorithms for Diversified Search Ranking -- Session 5-Track B. Graphs, Categories and Quantum Information -- Rewriting Measurement-Based Quantum Computations with Generalised Flow -- The Compositional Structure of Multipartite Quantum Entanglement -- Compositionality in Graph Transformation -- Session 6-Track B. Best Paper Award -- On p-Optimal Proof Systems and Logics for PTIME -- Session 6-Track C. Best Paper Award -- Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests -- Session 7-Track B. Logic -- Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals -- B and D Are Enough to Make the Halpern–Shoham Logic Undecidable -- Parameterized Modal Satisfiability -- Automata for Coalgebras: An Approach Using Predicate Liftings -- Session 7-Track C. Privacy, Selfishness -- Resolving the Complexity of Some Data Privacy Problems -- Private and Continual Release of Statistics -- Envy-Free Pricing in Multi-item Markets -- Contention Resolution under Selfishness -- Session 8-Track B. Concurrency -- On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi -- On Bisimilarity and Substitution in Presence of Replication -- The Downward-Closure of Petri Net Languages -- Reachability Games on Extended Vector Addition Systems with States -- Session 8-Track C. Mobile Agents -- Modelling Mobility: A Discrete Revolution -- Tell Me Where I Am So I Can Meet You Sooner -- Rendezvous of Mobile Agents without Agreement on Local Orientation -- Session 9-Track B. Probabilistic Computation -- Probabilistic Automata on Finite Words: Decidable and Undecidable Problems -- Space-Efficient Scheduling of Stochastically Generated Tasks -- Exponential Lower Bounds for Policy Iteration -- Session 10-Track B. Automata -- Regular Temporal Cost Functions -- Model Checking Succinct and Parametric One-Counter Automata -- Pebble Weighted Automata and Transitive Closure Logics -- Energy Parity Games. |
| Record Nr. | UNISA-996465841903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I / / edited by Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul Spirakis
| Automata, Languages and Programming [[electronic resource] ] : 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I / / edited by Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul Spirakis |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XXIII, 754 p. 42 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Computer programming Computer networks Algorithms Artificial intelligence Computer science Software Engineering Programming Techniques Computer Communication Networks Artificial Intelligence Theory of Computation |
| ISBN |
1-280-38772-6
9786613565648 3-642-14165-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Local Search: Simple, Successful, But Sometimes Sluggish -- When Conflicting Constraints Can Be Resolved – The Lovász Local Lemma and Satisfiability -- Session 1-Track A. Combinatorial Optimization -- Plane Spanners of Maximum Degree Six -- The Positive Semidefinite Grothendieck Problem with Rank Constraint -- Cycle Detection and Correction -- Decomposition Width of Matroids -- Session 2-Track A1. Game Theory -- The Cooperative Game Theory Foundations of Network Bargaining Games -- On the Existence of Pure Nash Equilibria in Weighted Congestion Games -- On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions -- Mean-Payoff Games and Propositional Proofs -- Session 2-Track A2. Security -- Online Network Design with Outliers -- Efficient Completely Non-malleable Public Key Encryption -- Polynomial-Space Approximation of No-Signaling Provers -- From Secrecy to Soundness: Efficient Verification via Secure Computation -- Session 3-Track A1. Data Structures -- Mergeable Dictionaries -- Faster Algorithms for Semi-matching Problems (Extended Abstract) -- Clustering with Diversity -- New Data Structures for Subgraph Connectivity -- Session 3-Track A2. Sorting & Hashing -- Tight Thresholds for Cuckoo Hashing via XORSAT -- Resource Oblivious Sorting on Multicores -- Interval Sorting -- Session 4-Track A. Graphs, Nets and Optimization -- Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems -- Thresholded Covering Algorithms for Robust and Max-min Optimization -- Graph Homomorphisms with Complex Values: A Dichotomy Theorem -- Metrical Task Systems and the k-Server Problem on HSTs -- Session 5-Track A1. Scheduling -- Scheduling Periodic Tasks in a Hard Real-Time Environment -- Scalably Scheduling Power-Heterogeneous Processors -- Better Scalable Algorithms for Broadcast Scheduling -- Max-min Online Allocations with a Reordering Buffer -- Session 5-Track A2. Graphs & Hypergraphs -- Orientability of Random Hypergraphs and the Power of Multiple Choices -- On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs -- Dynamic Programming for Graphs on Surfaces -- Interval Graphs: Canonical Representation in Logspace -- Session 6-Track A. Best Paper Award -- Approximating the Partition Function of the Ferromagnetic Potts Model -- Session 7-Track A. Algebraic Problems -- On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors -- On Sums of Roots of Unity -- Exponential Time Complexity of the Permanent and the Tutte Polynomial -- On Approximate Horn Formula Minimization -- Session 8-Track A. Networks & Communication Complexity -- Choosing, Agreeing, and Eliminating in Communication Complexity -- Additive Spanners in Nearly Quadratic Time -- Composition Theorems in Communication Complexity -- Network Design via Core Detouring for Problems without a Core -- Session 9-Track A1. Complexity & Automata -- Weak Completeness Notions for Exponential Time -- Efficient Evaluation of Nondeterministic Automata Using Factorization Forests -- On the Complexity of Searching in Trees: Average-Case Minimization -- Session 9-Track A2. Finding & Testing -- Finding Is as Easy as Detecting for Quantum Walks -- Improved Constructions for Non-adaptive Threshold Group Testing -- Testing Non-uniform k-Wise Independent Distributions over Product Spaces -- Session 10-Track A1. Approximations -- A Sublogarithmic Approximation for Highway and Tollbooth Pricing -- Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm -- Cell Probe Lower Bounds and Approximations for Range Mode -- SDP Gaps for 2-to-1 and Other Label-Cover Variants -- Session 10-Track A2. Streaming & Preprocessing -- Data Stream Algorithms for Codeword Testing -- Streaming Algorithms for Independent Sets -- Preprocessing of Min Ones Problems: A Dichotomy -- Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems -- Session 11-Track A1. Adaptive, Knowledge & Optimality -- Optimal Trade-Offs for Succinct String Indexes -- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems -- Concurrent Knowledge Extraction in the Public-Key Model -- Session 11-Track A2. Covering, Graphs & Independence -- On the k-Independence Required by Linear Probing and Minwise Independence -- Covering and Packing in Linear Space -- Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs. |
| Record Nr. | UNISA-996465839903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings / / edited by Friedhelm Meyer auf der Heide, Burkhard Monien
| Automata, Languages and Programming [[electronic resource] ] : 23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings / / edited by Friedhelm Meyer auf der Heide, Burkhard Monien |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (XII, 684 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Data structures (Computer science) Combinatorics Theory of Computation Software Engineering/Programming and Operating Systems Data Structures |
| ISBN | 3-540-68580-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Saturation-based theorem proving (abstract) -- Bandwidth efficient parallel computation -- Variable-length maximal codes -- Lower bounds for prepositional proofs and independence results in bounded arithmetic -- Algebraic characterizations of decorated trace equivalences over tree-like structures -- Fast asynchronous systems in dense time -- A hierarchy theorem for the ?-calculus -- An effective tableau system for the linear time ?-calculus -- Characterizing fairness implementability for multiparty interaction -- Termination of context-sensitive rewriting by rewriting -- A complete gentzen-style axiomatization for set constraints -- Fatal errors in conditional expressions -- Different types of arrow between logical frameworks -- Effective models of polymorphism, subtyping and recursion (extended abstract) -- Regularity for a large class of context-free processes is decidable -- On infinite transition graphs having a decidable monadic theory -- Semi-groups acting on context-free graphs -- Hard sets method and semilinear reservoir method with applications -- Random polynomials and polynomial factorization -- Optimal gröbner base algorithms for binomial ideals -- Minimum fill-in on circle and circular-arc graphs -- Practical approximation schemes for maximum induced-subgraph problems on K 3,3-free or K 5-free graphs -- Searching a fixed graph -- Improved sampling with applications to dynamic graph algorithms -- The expressive power of existential first order sentences of büchi's sequential calculus -- Fixpoints for rabin tree automata make complementation easy -- New upper bounds to the limitedness of distance automata -- Recognizing regular expressions by means of dataflow networks -- On the power of randomized branching programs -- Hitting sets derandomize BPP -- On type-2 probabilistic quantifiers -- Speeding-up single-tape nondeterministic computations by single alternation, with separation results -- On ?-generators and codes -- On standard Sturmian morphisms -- Constructions and bounds for visual cryptography -- On capital investment -- Lower bounds for static dictionaries on RAMs with bit operations but no multiplication -- Lower bounds for row minima searching -- On the complexity of relational problems for finite state processes -- Deciding finiteness of Petri nets up to bisimulation -- Mobile processes with a distributed environment -- The meaning of negative premises in transition system specifications II -- Average case analyses of list update algorithms, with applications to data compression -- Self-organizing data structures with dependent accesses -- Lopsided trees: Analyses, algorithms, and applications -- Optimal logarithmic time randomized suffix tree construction -- Improved parallel approximation of a class of integer programming problems -- Efficient collective communication in optical networks -- Shared-memory simulations on a faulty-memory DMM -- Fast deterministic backtrack search -- Agent rendezvous: A dynamic symmetry-breaking problem -- Efficient asynchronous consensus with the value-oblivious adversary scheduler -- A formal framework for evaluating heuristic programs -- Improved scheduling algorithms for minsum criteria -- On the complexity of string folding -- A polynomial-time algorithm for near-perfect phylogeny. |
| Record Nr. | UNISA-996465670203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Parallel Architectures and Their Efficient Use [[electronic resource] ] : First Heinz Nixdorf Symposium, Paderborn, Germany, November 11-13, 1992. Proceedings / / edited by Friedhelm Meyer auf der Heide, Burkhard Monien, Arnold L. Rosenberg
| Parallel Architectures and Their Efficient Use [[electronic resource] ] : First Heinz Nixdorf Symposium, Paderborn, Germany, November 11-13, 1992. Proceedings / / edited by Friedhelm Meyer auf der Heide, Burkhard Monien, Arnold L. Rosenberg |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (XII, 236 p.) |
| Disciplina | 004/.35 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Architecture, Computer
Computers Arithmetic and logic units, Computer Logic design Microprocessors Algorithms Computer System Implementation Computation by Abstract Devices Arithmetic and Logic Structures Logic Design Processor Architectures Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-47637-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A combining mechanism for parallel computers -- A case for the PRAM as a standard programmer's model -- Hashing strategies for simulating shared memory on distributed memory machines -- Better parallel architectures via emulations -- Relations between models of parallel abstract machines -- Frontiers of parallel computing -- Cost effectiveness of data flow machines and vector processors -- The networks of the connection machine CM-5 -- Massively parallel computing: Data distribution and communication -- A realizable efficient parallel architecture -- Hardware support for collective communication operations -- Programmable active memories: a performance assessment -- The role of randomness in the design of interconnection networks -- Chaos router: Finally, a practical adaptive router? -- An experimental study of wormhole routing in parallel computers -- Three non conventional paradigms of parallel computation -- Scalable parallel computers and scalable parallel codes: From theory to practice -- A framework for analyzing locality and portability issues in parallel computing -- Optimal implementation of general divide- and-conquer on the hypercube and related networks -- Parallel implementations of graph embeddings -- On sorting by prefix reversals and the diameter of pancake networks. |
| Record Nr. | UNISA-996466084003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||