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.
Algorithm Theory — SWAT'96
| Algorithm Theory — SWAT'96 |
| Pubbl/distr/stampa | Springer Berlin Heidelberg |
| Altri autori (Persone) |
KarlssonRolf
LingasAndrzej |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | Algorithm Theory — SWAT'96 |
| Record Nr. | UNISA-996465628703316 |
| Springer Berlin Heidelberg | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 20th International Colloquium, ICALP 93, Lund, Sweden, July 5-9, 1993. Proceedings / / edited by Andrzej Lingas, Rolf Karlsson, Svante Carlsson
| Automata, Languages and Programming [[electronic resource] ] : 20th International Colloquium, ICALP 93, Lund, Sweden, July 5-9, 1993. Proceedings / / edited by Andrzej Lingas, Rolf Karlsson, Svante Carlsson |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (XIII, 703 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer logic Mathematical logic Computer programming Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages Programming Techniques |
| ISBN | 3-540-47826-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Program result checking: A new approach to making programs more reliable -- Dynamic interpolation search in o(log log n) time -- Searching among intervals and compact routing tables -- The approximation of maximum subgraph problems -- Polynomially bounded minimization problems which are hard to approximate -- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover -- The complexity of approximating PSPACE-complete problems for hierarchical specifications -- Problems on pairs of trees and the four colour problem of planar graphs -- Constructing competitive tours from local information -- Treewidth and pathwidth of permutation graphs -- A theory of even functionals and their algorithmic applications -- Exact asymptotics of divide-and-conquer recurrences -- Optimal bounds for the change-making problem -- The complexity of N-body simulation -- A simple method for resolving degeneracies in Delaunay triangulations -- Fault-tolerance and complexity (Extended abstract) -- Reversal-space trade-offs for simultaneous resource-bounded nondeterministic Turing machines -- On the computational power of discrete Hopfield nets -- On randomized versus deterministic computation -- Lower bounds for one-way probabilistic communication complexity -- Maintaining discrete probability distributions optimally -- Secure and efficient off-line digital money (extended abstract) -- Computational depth and reducibility -- Learnability: Admissible, co-finite, and hypersimple languages -- Inclusion is undecidable for pattern languages -- New decidability results concerning two-way counter machines and applications -- Cobham's Theorem seen through Büchi's Theorem -- Logical definability on infinite traces -- Algebras for classifying regular tree languages and an application to frontier testability -- Finite automata as characterizations of minor closed tree families (extended abstract) -- On distributed algorithms in a broadcast domain -- Sparse networks supporting efficient reliable broadcasting -- Strongly adaptive token distribution -- Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic -- Fast parallel constraint satisfaction -- The product of rational languages -- On regular compatibility of semi-commutations -- Algebraic aspects of B-regular series -- Products of finite state machines with full coverage -- An effective version of Stallings' theorem in the case of context-free groups -- On the power of periodic iteration of morphisms -- If a DOL language is k-power free then it is circular -- Deciding true concurrency equivalences on finite safe nets (preliminary report) -- Timed testing of concurrent systems -- The fork calculus -- Extended transition systems for parametric bisimulation -- Temporal logic and categories of Petri nets -- Decidability of a partial order based temporal logic -- Local model checking for context-free processes -- Computing on structures -- A partial solution for D-unification based on a reduction to AC 1-unification -- Efficient analysis of concurrent constraint logic programs -- A confluent reduction for the extensional typed ?-calculus with pairs, sums, recursion and terminal object -- Modularity of termination and confluence in combinations of rewrite systems with ?? -- From domains to automata with concurrency -- What is a universal higher-order programming language?. |
| Record Nr. | UNISA-996466136503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Fundamentals of Computation Theory [[electronic resource] ] : 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings / / edited by Andrzej Lingas, Bengt J. Nilsson
| Fundamentals of Computation Theory [[electronic resource] ] : 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings / / edited by Andrzej Lingas, Bengt J. Nilsson |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (CDLII, 440 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Mathematical logic Computer science—Mathematics Computer graphics Theory of Computation Algorithm Analysis and Problem Complexity Computation by Abstract Devices Mathematical Logic and Formal Languages Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-540-45077-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Approximability 1 -- Proving Integrality Gaps without Knowing the Linear Program -- An Improved Analysis of Goemans and Williamson’s LP-Relaxation for MAX SAT -- Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques -- Approximability 2 -- Inapproximability Results for Bounded Variants of Optimization Problems -- Approximating the Pareto Curve with Local Search for the Bicriteria TSP(1,2) Problem -- Scheduling to Minimize Max Flow Time: Offline and Online Algorithms -- Algorithms 1 -- Linear Time Algorithms for Some NP-Complete Problems on (P 5,Gem)-Free Graphs -- Graph Searching, Elimination Trees, and a Generalization of Bandwidth -- Constructing Sparse t-Spanners with Small Separators -- Composing Equipotent Teams -- Algorithms 2 -- Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers -- An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates -- Periodic Multisorting Comparator Networks -- Fast Periodic Correction Networks -- Networks and Complexity -- Games and Networks -- One-Way Communication Complexity of Symmetric Boolean Functions -- Circuits on Cylinders -- Computational Biology -- Fast Perfect Phylogeny Haplotype Inference -- On Exact and Approximation Algorithms for Distinguishing Substring Selection -- Complexity of Approximating Closest Substring Problems -- Computational Geometry -- On Lawson’s Oriented Walk in Random Delaunay Triangulations -- Competitive Exploration of Rectilinear Polygons -- An Improved Approximation Algorithm for Computing Geometric Shortest Paths -- Adaptive and Compact Discretization for Weighted Region Optimal Path Finding -- On Boundaries of Highly Visible Spaces and Applications -- Computational Models and Complexity -- Membrane Computing -- Classical Simulation Complexity of Quantum Machines -- Using Depth to Capture Average-Case Complexity -- Structural Complexity -- Non-uniform Depth of Polynomial Time and Space Simulations -- Dimension- and Time-Hierarchies for Small Time Bounds -- Baire’s Categories on Small Complexity Classes -- Formal Languages -- Operations Preserving Recognizable Languages -- Languages Defined by Generalized Equality Sets -- Context-Sensitive Equivalences for Non-interference Based Protocol Analysis -- On the Exponentiation of Languages -- Kleene’s Theorem for Weighted Tree-Automata -- Logic -- Weak Cardinality Theorems for First-Order Logic -- Compositionality of Hennessy-Milner Logic through Structural Operational Semantics -- On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems. |
| Record Nr. | UNISA-996465969603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Fundamentals of Computation Theory : 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings / / edited by Andrzej Lingas, Bengt J. Nilsson
| Fundamentals of Computation Theory : 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings / / edited by Andrzej Lingas, Bengt J. Nilsson |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (CDLII, 440 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Logic, Symbolic and mathematical Computer science—Mathematics Computer graphics Theory of Computation Algorithm Analysis and Problem Complexity Computation by Abstract Devices Mathematical Logic and Formal Languages Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-540-45077-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Approximability 1 -- Proving Integrality Gaps without Knowing the Linear Program -- An Improved Analysis of Goemans and Williamson’s LP-Relaxation for MAX SAT -- Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques -- Approximability 2 -- Inapproximability Results for Bounded Variants of Optimization Problems -- Approximating the Pareto Curve with Local Search for the Bicriteria TSP(1,2) Problem -- Scheduling to Minimize Max Flow Time: Offline and Online Algorithms -- Algorithms 1 -- Linear Time Algorithms for Some NP-Complete Problems on (P 5,Gem)-Free Graphs -- Graph Searching, Elimination Trees, and a Generalization of Bandwidth -- Constructing Sparse t-Spanners with Small Separators -- Composing Equipotent Teams -- Algorithms 2 -- Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers -- An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates -- Periodic Multisorting Comparator Networks -- Fast Periodic Correction Networks -- Networks and Complexity -- Games and Networks -- One-Way Communication Complexity of Symmetric Boolean Functions -- Circuits on Cylinders -- Computational Biology -- Fast Perfect Phylogeny Haplotype Inference -- On Exact and Approximation Algorithms for Distinguishing Substring Selection -- Complexity of Approximating Closest Substring Problems -- Computational Geometry -- On Lawson’s Oriented Walk in Random Delaunay Triangulations -- Competitive Exploration of Rectilinear Polygons -- An Improved Approximation Algorithm for Computing Geometric Shortest Paths -- Adaptive and Compact Discretization for Weighted Region Optimal Path Finding -- On Boundaries of Highly Visible Spaces and Applications -- Computational Models and Complexity -- Membrane Computing -- Classical Simulation Complexity of Quantum Machines -- Using Depth to Capture Average-Case Complexity -- Structural Complexity -- Non-uniform Depth of Polynomial Time and Space Simulations -- Dimension- and Time-Hierarchies for Small Time Bounds -- Baire’s Categories on Small Complexity Classes -- Formal Languages -- Operations Preserving Recognizable Languages -- Languages Defined by Generalized Equality Sets -- Context-Sensitive Equivalences for Non-interference Based Protocol Analysis -- On the Exponentiation of Languages -- Kleene’s Theorem for Weighted Tree-Automata -- Logic -- Weak Cardinality Theorems for First-Order Logic -- Compositionality of Hennessy-Milner Logic through Structural Operational Semantics -- On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems. |
| Record Nr. | UNINA-9910144029003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
SWAT '88 [[electronic resource] ] : 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5-8, 1988. Proceedings / / edited by Rolf Karlsson, Andrzej Lingas
| SWAT '88 [[electronic resource] ] : 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5-8, 1988. Proceedings / / edited by Rolf Karlsson, Andrzej Lingas |
| Edizione | [1st ed. 1988.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 |
| Descrizione fisica | 1 online resource (VIII, 264 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Mathematics Algorithms Theory of Computation Mathematics, general Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-39288-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | An implicit binomial queue with constant insertion time -- Implicit selection -- An extrapolation on the interpolation search -- Time parameter and arbitrary deunions in the set union problem -- Two new algorithms for constructing min-max heaps -- Extremal cost tree data structures -- Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques -- Problems of posting sentries: Variations on the art gallery theorem -- A lower bound and two approximative algorithms for the K-partitioning of rectilinear polygons -- On recognizing and characterizing visibility graphs of simple polygons -- Connectability problems -- Two hybrid methods for collision resolution in open addressing hashing -- On an alternative sum useful in the analysis of some data structures -- Bin-packing in 1.5 dimension -- Applications of a symbolic perturbation scheme -- A fast parallel algorithm for computing all maximal cliques in a graph and the related problems -- Parallel solution of sparse linear systems -- A note on determining the 3-dimensional convex hull of a set of points on a mesh of processors -- Probabilistic log-space reductions and problems probabilistically hard for p -- Searching with uncertainty extended abstract -- An optimal expected-time parallel algorithm for Voronoi diagrams -- Generating binary trees by transpositions -- Approximating the complete Euclidean graph -- Upper and lower bounds for the dictionary problem -- Linear algorithms for graph separation problems -- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees -- NC algorithms for computing the number of perfect matchings in K 3,3-free graphs and related problems -- Independent covers in outerplanar graphs -- Tight lower bounds for Shellsort. |
| Record Nr. | UNISA-996465714103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||