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.
Fundamentals of Computation Theory [[electronic resource] ] : 10th International Conference, FCT '95, Dresden, Germany, August 22 - 25, 1995. Proceedings / / edited by Horst Reichel
| Fundamentals of Computation Theory [[electronic resource] ] : 10th International Conference, FCT '95, Dresden, Germany, August 22 - 25, 1995. Proceedings / / edited by Horst Reichel |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (XI, 441 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer logic Mathematical logic Combinatorics Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-44770-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Discrete time process algebra with abstraction -- A duration calculus with infinite intervals -- A delegation-based object calculus with subtyping -- Model-checking for real-time systems -- On polynomial ideals, their complexity, and applications -- From a concurrent ?-calculus to the ?-calculus -- Rewriting regular inequalities -- A simple abstract semantics for equational theories -- Processes with multiple entries and exits -- Efficient rewriting in cograph trace monoids -- Effective category and measure in abstract complexity theory -- About planar cayley graphs -- On condorcet and median points of simple rectilinear polygons -- Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs -- r-Domination problems on homogeneously orderable graphs -- Growing patterns in 1D cellular automata -- Petri nets, commutative context-free grammars, and basic parallel processes -- Implementation of a UU-algorithm for primitive recursive tree functions -- Dummy elimination: Making termination easier -- Computing Petri net languages by reductions -- Categorial graphs -- Effective systolic algorithms for gossiping in cycles and two-dimensional grids -- Restarting automata -- Optimal contiguous expression DAG evaluations -- Communication as unification in the Petri Box Calculus -- Distributed catenation and chomsky hierarchy -- The power of frequency computation -- Randomized incremental construction of simple abstract Voronoi diagrams in 3-space -- Properties of probabilistic pushdown automata -- Formal parametric equations -- PRAM's towards realistic parallelism: BRAM's -- Some results concerning two-dimensional turing machines and finite automata -- How hard is to compute the edit distance -- On the synchronization of semi-traces -- Tiling with bars and satisfaction of boolean formulas -- Axiomatizing Petri net concatenable processes -- Functional sorts in data type specifications. |
| Record Nr. | UNISA-996466156003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Recent Trends in Data Type Specification [[electronic resource] ] : 7th Workshop on Specification of Abstract Data Types, Wusterhausen/Dosse, Germany, April 17-20, 1990. Proceedings / / edited by Hartmut Ehrig, Klaus P. Jantke, Fernando Orejas, Horst Reichel
| Recent Trends in Data Type Specification [[electronic resource] ] : 7th Workshop on Specification of Abstract Data Types, Wusterhausen/Dosse, Germany, April 17-20, 1990. Proceedings / / edited by Hartmut Ehrig, Klaus P. Jantke, Fernando Orejas, Horst Reichel |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (VIII, 384 p.) |
| Disciplina | 005.7/3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Programming languages (Electronic computers) Computer logic Software engineering Programming Techniques Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Software Engineering |
| ISBN | 3-540-38416-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | ADT implementation and completion by induction from examples -- An association of Algebraic term nets and abstract data types for specifying real communication protocols -- The specification language GSBL -- Composition of algebraic high-level nets -- A match operation for rule-based modular system design -- Towards object-oriented algebraic specifications -- Inductive completion for transformation of equational specifications -- A notion of implementation for the specification language OBSCURE -- Model-theoretic specifications and back-and-forth equivalences -- Universal algebra in higher types -- Clausal rewriting: Applications and implementation -- Constraints for behavioural specifications -- Entities: An institution for dynamic systems -- A 2-category approach to critical pair completion -- A kernel specification formalism with higher-order parameterisation -- Extended ML: Past, present and future -- Dependent types considered necessary for specification languages -- Generic types in a language for data directed design -- Design of a compiler for lazy pattern driven narrowing. |
| Record Nr. | UNISA-996465662403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
STACS 2000 : 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 17-19, 2000 : proceedings / / Horst Reichel, Sophie Tison, [eds]
| STACS 2000 : 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 17-19, 2000 : proceedings / / Horst Reichel, Sophie Tison, [eds] |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [2000] |
| Descrizione fisica | 1 online resource (675 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Computer science |
| ISBN |
1-280-96973-3
9786610969739 3-540-46541-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Codes and Graphs -- A Classification of Symbolic Transition Systems -- Circuits versus Trees in Algebraic Complexity -- On the Many Faces of Block Codes -- A New Algorithm for MAX-2-SAT -- Bias Invariance of Small Upper Spans -- The Complexity of Planarity Testing -- About Cube-Free Morphisms -- Linear Cellular Automata with Multiple State Variables -- Two-Variable Word Equations -- Average-Case Quantum Query Complexity -- Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs -- The Boolean Hierarchy of NP-Partitions -- Binary Exponential Backoff Is Stable for High Arrival Rates -- The Data Broadcast Problem with Preemption -- An Approximate L p-Difference Algorithm for Massive Data Streams -- Succinct Representations of Model Based Belief Revision -- Logics Capturing Local Properties -- The Complexity of Poor Man’s Logic -- Fast Integer Sorting in Linear Space -- On the Performance of WEAK-HEAPSORT -- On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers -- Real-Time Automata and the Kleene Algebra of Sets of Real Numbers -- Small Progress Measures for Solving Parity Games -- Multi-linearity Self-Testing with Relative Error -- Nondeterministic Instance Complexity and Hard-to-Prove Tautologies -- Hard Instances of Hard Problems -- Simulation and Bisimulation over One-Counter Processes -- Decidability of Reachability Problems for Classes of Two Counters Automata -- Hereditary History Preserving Bisimilarity Is Undecidable -- The Hardness of Approximating Spanner Problems -- An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality -- ?-Coloring of Graphs -- Optimal Proof Systems and Sparse Sets -- Almost Complete Sets -- Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results -- An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications -- Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem -- Controlled Conspiracy-2 Search -- The Stability of Saturated Linear Dynamical Systems Is Undecidable -- Tilings: Recursivity and Regularity -- Listing All Potential Maximal Cliques of a Graph -- Distance Labeling Schemes for Well-Separated Graph Classes -- Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs -- Characterizing and Deciding MSO-Definability of Macro Tree Transductions -- Languages of Dot-Depth 3/2 -- Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures -- The CNN Problem and Other k-Server Variants -- The Weighted 2-Server Problem -- On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem -- Spectral Bounds on General Hard Core Predicates -- Randomness in Visual Cryptography -- Online Dial-a-Ride Problems: Minimizing the Completion Time -- The Power Range Assignment Problem in Radio Networks on the Plane. |
| Record Nr. | UNINA-9910143637303321 |
| Berlin, Germany ; ; New York, New York : , : Springer, , [2000] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
STACS 2000 : 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 17-19, 2000 : proceedings / / Horst Reichel, Sophie Tison, [eds]
| STACS 2000 : 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 17-19, 2000 : proceedings / / Horst Reichel, Sophie Tison, [eds] |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [2000] |
| Descrizione fisica | 1 online resource (675 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Computer science |
| ISBN |
1-280-96973-3
9786610969739 3-540-46541-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Codes and Graphs -- A Classification of Symbolic Transition Systems -- Circuits versus Trees in Algebraic Complexity -- On the Many Faces of Block Codes -- A New Algorithm for MAX-2-SAT -- Bias Invariance of Small Upper Spans -- The Complexity of Planarity Testing -- About Cube-Free Morphisms -- Linear Cellular Automata with Multiple State Variables -- Two-Variable Word Equations -- Average-Case Quantum Query Complexity -- Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs -- The Boolean Hierarchy of NP-Partitions -- Binary Exponential Backoff Is Stable for High Arrival Rates -- The Data Broadcast Problem with Preemption -- An Approximate L p-Difference Algorithm for Massive Data Streams -- Succinct Representations of Model Based Belief Revision -- Logics Capturing Local Properties -- The Complexity of Poor Man’s Logic -- Fast Integer Sorting in Linear Space -- On the Performance of WEAK-HEAPSORT -- On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers -- Real-Time Automata and the Kleene Algebra of Sets of Real Numbers -- Small Progress Measures for Solving Parity Games -- Multi-linearity Self-Testing with Relative Error -- Nondeterministic Instance Complexity and Hard-to-Prove Tautologies -- Hard Instances of Hard Problems -- Simulation and Bisimulation over One-Counter Processes -- Decidability of Reachability Problems for Classes of Two Counters Automata -- Hereditary History Preserving Bisimilarity Is Undecidable -- The Hardness of Approximating Spanner Problems -- An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality -- ?-Coloring of Graphs -- Optimal Proof Systems and Sparse Sets -- Almost Complete Sets -- Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results -- An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications -- Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem -- Controlled Conspiracy-2 Search -- The Stability of Saturated Linear Dynamical Systems Is Undecidable -- Tilings: Recursivity and Regularity -- Listing All Potential Maximal Cliques of a Graph -- Distance Labeling Schemes for Well-Separated Graph Classes -- Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs -- Characterizing and Deciding MSO-Definability of Macro Tree Transductions -- Languages of Dot-Depth 3/2 -- Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures -- The CNN Problem and Other k-Server Variants -- The Weighted 2-Server Problem -- On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem -- Spectral Bounds on General Hard Core Predicates -- Randomness in Visual Cryptography -- Online Dial-a-Ride Problems: Minimizing the Completion Time -- The Power Range Assignment Problem in Radio Networks on the Plane. |
| Record Nr. | UNISA-996465621803316 |
| Berlin, Germany ; ; New York, New York : , : Springer, , [2000] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
STACS 2001 [[electronic resource] ] : 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001. Proceedings / / edited by Afonso Ferreira, Horst Reichel
| STACS 2001 [[electronic resource] ] : 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001. Proceedings / / edited by Afonso Ferreira, Horst Reichel |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XVI, 580 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Data structures (Computer science) Optical data processing Computer science—Mathematics Theory of Computation Data Structures and Information Theory Image Processing and Computer Vision Data Structures Mathematics of Computing |
| ISBN | 3-540-44693-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Presentations -- Recurrence in Infinite Words -- Generalized Model-Checking Problems for First-Order Logic -- Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra -- Contributions -- 2-Nested Simulation Is Not Finitely Equationally Axiomatizable -- On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems -- Matching Polygonal Curves with Respect to the Fréchet Distance -- On the Class of Languages Recognizable by 1-Way Quantum Finite Automata -- Star-Free Open Languages and Aperiodic Loops -- A 5/2n 2-Lower Bound for the Multiplicative Complexity of n × n-Matrix Multiplication -- Evasiveness of Subgraph Containment and Related Properties -- On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs -- On Presburger Liveness of Discrete Timed Automata -- Residual Finite State Automata -- Deterministic Radio Broadcasting at Low Cost -- The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE—Complete -- Recursive Randomized Coloring Beats Fair Dice Random Colorings -- Randomness, Computability, and Density -- On Multipartition Communication Complexity -- Scalable Sparse Topologies with Small Spectrum -- Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios -- The UPS Problem -- Gathering of Asynchronous Oblivious Robots with Limited Visibility -- Generalized Langton’s Ant: Dynamical Behavior and Complexity -- Optimal and Approximate Station Placement in Networks -- Learning Expressions over Monoids -- Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods -- On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages -- Efficient Minimal Perfect Hashing in Nearly Minimal Space -- Small PCPs with Low Query Complexity -- Space Efficient Algorithms for Series-Parallel Graphs -- A Toolkit for First Order Extensions of Monadic Games -- Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs -- Refining the Hierarchy of Blind Multicounter Languages -- A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab*c -- New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata -- The Complexity of Minimal Satisfiability Problems -- On the Minimal Hardware Complexity of Pseudorandom Function Generators -- Approximation Algorithms for Minimum Size 2-Connectivity Problems -- A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets -- An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases -- A New Logical Characterization of Büchi Automata -- A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph -- The Complexity of Copy Constant Detection in Parallel Programs -- Approximation Algorithms for the Bottleneck Stretch Factor Problem -- Semantical Principles in the Modal Logic of Coalgebras -- The #a = #b Pictures Are Recognizable -- A Logical Approach to Decidability of Hierarchies of Regular Star—Free Languages -- Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables -- New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing. |
| Record Nr. | UNISA-996465683603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
STACS 2001 : 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001. Proceedings / / edited by Afonso Ferreira, Horst Reichel
| STACS 2001 : 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001. Proceedings / / edited by Afonso Ferreira, Horst Reichel |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XVI, 580 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Data structures (Computer science) Optical data processing Computer science—Mathematics Theory of Computation Data Structures and Information Theory Image Processing and Computer Vision Data Structures Mathematics of Computing |
| ISBN | 3-540-44693-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Presentations -- Recurrence in Infinite Words -- Generalized Model-Checking Problems for First-Order Logic -- Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra -- Contributions -- 2-Nested Simulation Is Not Finitely Equationally Axiomatizable -- On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems -- Matching Polygonal Curves with Respect to the Fréchet Distance -- On the Class of Languages Recognizable by 1-Way Quantum Finite Automata -- Star-Free Open Languages and Aperiodic Loops -- A 5/2n 2-Lower Bound for the Multiplicative Complexity of n × n-Matrix Multiplication -- Evasiveness of Subgraph Containment and Related Properties -- On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs -- On Presburger Liveness of Discrete Timed Automata -- Residual Finite State Automata -- Deterministic Radio Broadcasting at Low Cost -- The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE—Complete -- Recursive Randomized Coloring Beats Fair Dice Random Colorings -- Randomness, Computability, and Density -- On Multipartition Communication Complexity -- Scalable Sparse Topologies with Small Spectrum -- Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios -- The UPS Problem -- Gathering of Asynchronous Oblivious Robots with Limited Visibility -- Generalized Langton’s Ant: Dynamical Behavior and Complexity -- Optimal and Approximate Station Placement in Networks -- Learning Expressions over Monoids -- Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods -- On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages -- Efficient Minimal Perfect Hashing in Nearly Minimal Space -- Small PCPs with Low Query Complexity -- Space Efficient Algorithms for Series-Parallel Graphs -- A Toolkit for First Order Extensions of Monadic Games -- Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs -- Refining the Hierarchy of Blind Multicounter Languages -- A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab*c -- New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata -- The Complexity of Minimal Satisfiability Problems -- On the Minimal Hardware Complexity of Pseudorandom Function Generators -- Approximation Algorithms for Minimum Size 2-Connectivity Problems -- A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets -- An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases -- A New Logical Characterization of Büchi Automata -- A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph -- The Complexity of Copy Constant Detection in Parallel Programs -- Approximation Algorithms for the Bottleneck Stretch Factor Problem -- Semantical Principles in the Modal Logic of Coalgebras -- The #a = #b Pictures Are Recognizable -- A Logical Approach to Decidability of Hierarchies of Regular Star—Free Languages -- Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables -- New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing. |
| Record Nr. | UNINA-9910143604903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||