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] ] : 25th International Colloquium, ICALP'98, Aalborg, Denmark July 13-17, 1998, Proceedings / / edited by Kim G. Larsen, Sven Skyum, Glynn Winskel
| Automata, Languages and Programming [[electronic resource] ] : 25th International Colloquium, ICALP'98, Aalborg, Denmark July 13-17, 1998, Proceedings / / edited by Kim G. Larsen, Sven Skyum, Glynn Winskel |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (XXXII, 936 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computers Data structures (Computer science) Computer graphics Computer communication systems Artificial intelligence Software Engineering/Programming and Operating Systems Theory of Computation Data Structures Computer Graphics Computer Communication Networks Artificial Intelligence |
| ISBN | 3-540-68681-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithmic verification of linear temporal logic specifications -- On existentially first-order definable languages and their relation to NP -- An algebraic approach to communication complexity -- Deciding global partial-order properties -- Simple linear-time algorithms for minimal fixed points -- Hardness results for dynamic problems by extensions of Fredman and Saks' chronogram method -- Simpler and faster dictionaries on the AC0 RAM -- Partial-congruence factorization of bisimilarity induced by open maps -- Reset nets between decidability and undecidability -- Geometric algorithms for robotic manipulation -- Compact encodings of planar graphs via canonical orderings and multiple parentheses -- Reducing simple polygons to triangles - A proof for an improved conjecture - -- Difficult configurations — on the complexity of LTrL -- On the expressiveness of real and integer arithmetic automata -- Distributed matroid basis completion via elimination upcast and distributed correction of minimum-weight spanning trees -- Independent sets with domination constraints -- Robust asynchronous protocols are finite-state -- Deciding bisimulation-like equivalences with finite-state processes -- Do probabilistic algorithms outperform deterministic ones? -- A degree-decreasing Lemma for (MOD q, MOD p) circuits -- Improved pseudorandom generators for combinatorial rectangles -- Translation validation for synchronous languages -- An efficient and unified approach to the decidability of equivalence of propositional programs -- On branching programs with bounded uncertainty -- CONS-free programs with tree input -- Concatenable graph processes: Relating processes and derivation traces -- Axioms for contextual net processes -- Existential types: Logical relations and operational equivalence -- Optimal sampling strategies in quicksort -- A genuinely polynomial-time algorithm for sampling two-rowed contingency tables -- A modular approach to denotational semantics -- Generalised flowcharts and games -- Efficient minimization of numerical summation errors -- Efficient approximation algorithms for the subset-sums equality problem -- Structural recursive definitions in type theory -- A good class of tree automata. Application to inductive theorem proving -- Locally periodic infinite words and a chaotic behaviour -- Bridges for concatenation hierarchies -- Complete proof systems for observation congruences in finite-control ?-calculus -- Concurrent constraints in the fusion calculus -- On computing the entropy of cellular automata -- On the determinization of weighted finite automata -- Bulk-synchronous parallel multiplication of boolean matrices -- A complex example of a simplifying rewrite system -- On a duality between Kruskal and Dershowitz theorems -- A total AC-compatible reduction ordering on higher-order terms -- Model checking game properties of multi-agent systems -- Limited wavelength conversion in all-optical tree networks -- Computing mimicking networks -- Metric semantics for true concurrent real time -- The regular real-time languages -- Static and dynamic low-congested interval routing schemes -- Low-bandwidth routing and electrical power networks -- Constraint automata and the complexity of recursive subtype entailment -- Reasoning about the past with two-way automata -- A neuroidal architecture for cognitive computation -- Deterministic polylog approximation for minimum communication spanning trees -- A polynomial time approximation scheme for euclidean minimum cost k-connectivity -- Global/local subtyping and capability inference for a distributed ?-calculus -- Checking strong/Weak bisimulation equivalences and observation congruence for the ?-calculus -- Inversion of circulant matrices over Zm -- Application of Lempel-Ziv encodings to the solution of word equations -- Explicit substitutitions for constructive necessity -- The relevance of proof-irrelevance -- New horizons in quantum information processing -- Sequential iteration of interactive arguments and an efficient zero-knowledge argument for NP -- Image density is complete for non-interactive-SZK -- Randomness spaces -- Totality, definability and boolean circuits -- Quantum counting -- On the complexity of deriving score functions from examples for problems in molecular biology -- A hierarchy of equivalences for asynchronous calculi -- On asynchrony in name-passing calculi -- Protection in programming-language translations -- Efficient simulations by queue machines -- Power of cooperation and multihead finite systems -- A simple solution to type specialization -- Multi-stage programming: axiomatization and type safety. |
| Record Nr. | UNISA-996466103603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 25th International Colloquium, ICALP'98, Aalborg, Denmark July 13-17, 1998, Proceedings / / edited by Kim G. Larsen, Sven Skyum, Glynn Winskel
| Automata, Languages and Programming [[electronic resource] ] : 25th International Colloquium, ICALP'98, Aalborg, Denmark July 13-17, 1998, Proceedings / / edited by Kim G. Larsen, Sven Skyum, Glynn Winskel |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (XXXII, 936 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computers Data structures (Computer science) Computer graphics Computer communication systems Artificial intelligence Software Engineering/Programming and Operating Systems Theory of Computation Data Structures Computer Graphics Computer Communication Networks Artificial Intelligence |
| ISBN | 3-540-68681-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithmic verification of linear temporal logic specifications -- On existentially first-order definable languages and their relation to NP -- An algebraic approach to communication complexity -- Deciding global partial-order properties -- Simple linear-time algorithms for minimal fixed points -- Hardness results for dynamic problems by extensions of Fredman and Saks' chronogram method -- Simpler and faster dictionaries on the AC0 RAM -- Partial-congruence factorization of bisimilarity induced by open maps -- Reset nets between decidability and undecidability -- Geometric algorithms for robotic manipulation -- Compact encodings of planar graphs via canonical orderings and multiple parentheses -- Reducing simple polygons to triangles - A proof for an improved conjecture - -- Difficult configurations — on the complexity of LTrL -- On the expressiveness of real and integer arithmetic automata -- Distributed matroid basis completion via elimination upcast and distributed correction of minimum-weight spanning trees -- Independent sets with domination constraints -- Robust asynchronous protocols are finite-state -- Deciding bisimulation-like equivalences with finite-state processes -- Do probabilistic algorithms outperform deterministic ones? -- A degree-decreasing Lemma for (MOD q, MOD p) circuits -- Improved pseudorandom generators for combinatorial rectangles -- Translation validation for synchronous languages -- An efficient and unified approach to the decidability of equivalence of propositional programs -- On branching programs with bounded uncertainty -- CONS-free programs with tree input -- Concatenable graph processes: Relating processes and derivation traces -- Axioms for contextual net processes -- Existential types: Logical relations and operational equivalence -- Optimal sampling strategies in quicksort -- A genuinely polynomial-time algorithm for sampling two-rowed contingency tables -- A modular approach to denotational semantics -- Generalised flowcharts and games -- Efficient minimization of numerical summation errors -- Efficient approximation algorithms for the subset-sums equality problem -- Structural recursive definitions in type theory -- A good class of tree automata. Application to inductive theorem proving -- Locally periodic infinite words and a chaotic behaviour -- Bridges for concatenation hierarchies -- Complete proof systems for observation congruences in finite-control ?-calculus -- Concurrent constraints in the fusion calculus -- On computing the entropy of cellular automata -- On the determinization of weighted finite automata -- Bulk-synchronous parallel multiplication of boolean matrices -- A complex example of a simplifying rewrite system -- On a duality between Kruskal and Dershowitz theorems -- A total AC-compatible reduction ordering on higher-order terms -- Model checking game properties of multi-agent systems -- Limited wavelength conversion in all-optical tree networks -- Computing mimicking networks -- Metric semantics for true concurrent real time -- The regular real-time languages -- Static and dynamic low-congested interval routing schemes -- Low-bandwidth routing and electrical power networks -- Constraint automata and the complexity of recursive subtype entailment -- Reasoning about the past with two-way automata -- A neuroidal architecture for cognitive computation -- Deterministic polylog approximation for minimum communication spanning trees -- A polynomial time approximation scheme for euclidean minimum cost k-connectivity -- Global/local subtyping and capability inference for a distributed ?-calculus -- Checking strong/Weak bisimulation equivalences and observation congruence for the ?-calculus -- Inversion of circulant matrices over Zm -- Application of Lempel-Ziv encodings to the solution of word equations -- Explicit substitutitions for constructive necessity -- The relevance of proof-irrelevance -- New horizons in quantum information processing -- Sequential iteration of interactive arguments and an efficient zero-knowledge argument for NP -- Image density is complete for non-interactive-SZK -- Randomness spaces -- Totality, definability and boolean circuits -- Quantum counting -- On the complexity of deriving score functions from examples for problems in molecular biology -- A hierarchy of equivalences for asynchronous calculi -- On asynchrony in name-passing calculi -- Protection in programming-language translations -- Efficient simulations by queue machines -- Power of cooperation and multihead finite systems -- A simple solution to type specialization -- Multi-stage programming: axiomatization and type safety. |
| Record Nr. | UNINA-9910767582603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
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 | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 22nd International Colloquium, ICALP 95, Szeged, Hungary, July 10 - 14, 1995. Proceedings / / edited by Zoltan Fülöp, Ferenc Gecseg
| Automata, Languages and Programming [[electronic resource] ] : 22nd International Colloquium, ICALP 95, Szeged, Hungary, July 10 - 14, 1995. Proceedings / / edited by Zoltan Fülöp, Ferenc Gecseg |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (XVI, 692 p.) |
| Disciplina | 629.892 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Robotics
Automation Programming languages (Electronic computers) Computers Computer programming Data structures (Computer science) Data encryption (Computer science) Robotics and Automation Programming Languages, Compilers, Interpreters Theory of Computation Programming Techniques Data Structures Cryptology |
| ISBN | 3-540-49425-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Theory of 2-structures -- A domain for concurrent termination a generalization of Mazurkiewicz traces -- Nonfinite axiomatizability of the equational theory of shuffle -- The algebraic equivalent of AFL theory -- Finite state transformations of images -- Post correspondence problem: Words possible as primitive solutions -- Computing the closure of sets of words under partial commutations -- Intervalizing k-colored graphs -- NC algorithms for finding a maximal set of paths with application to compressing strings -- On the construction of classes of suffix trees for square matrices: Algorithms and applications -- How to use the minimal separators of a graph for its chordal triangulation -- Fast gossiping by short messages -- Break Finite Automata Public Key Cryptosystem -- Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time -- On the number of random bits in totally private computation -- Lower time bounds for randomized computation -- New collapse consequences of NP having small circuits -- The complexity of searching succinctly represented graphs -- Optimal shooting: Characterizations and applications -- Placing resources in a tree: Dynamic and static algorithms -- Shortest path queries in digraphs of small treewidth -- A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs -- Parallel algorithms with optimal speedup for bounded treewidth -- Approximating minimum cuts under insertions -- Linear time algorithms for dominating pairs in asteroidal triple-free graphs -- On-line resource management with applications to routing and scheduling -- Alternation in simple devices -- Hybrid automata with finite bisimulations -- Generalized Sturmian languages -- Polynomial closure and unambiguous product -- Lower bounds on algebraic random access machines -- Improved deterministic PRAM simulation on the mesh -- On optimal polynomial time approximations: P-levelability vs. ?-levelability -- Weakly useful sequences -- Graph Connectivity, Monadic NP and built-in relations of moderate degree -- The expressive power of clocks -- Grammar systems: A grammatical approach to distribution and cooperation -- Compactness of systems of equations in semigroups -- Sensing versus nonsensing automata -- New upper bounds for generalized intersection searching problems -- OKFDDs versus OBDDs and OFDDs -- Bicriteria network design problems -- On determining optimal strategies in pursuit games in the plane -- Extension orderings -- The pushdown method to optimize chain logic programs -- Automatic synthesis of real time systems -- Self-correcting for function fields of finite transcendental degree -- Measure, category and learning theory -- A characterization of the existence of energies for neural networks -- Variable-length codes for error correction -- Graphbots: Mobility in discrete spaces -- Solving recursive net equations -- Implicit definability and infinitary logic in finite model theory -- The limit of splitn-language equivalence -- Divergence and fair testing -- Causality for mobile processes -- Internal mobility and agent-passing calculi. |
| Record Nr. | UNISA-996466161303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 19th International Colloquium, Wien, Austria, July 13-17, 1992. Proceedings / / edited by Werner Kuich
| Automata, Languages and Programming [[electronic resource] ] : 19th International Colloquium, Wien, Austria, July 13-17, 1992. Proceedings / / edited by Werner Kuich |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (XII, 724 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer logic Algorithms Mathematical logic Data structures (Computer science) Combinatorics Theory of Computation Logics and Meanings of Programs Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Data Structures |
| ISBN | 3-540-47278-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Philosophical issues in Kolmogorov complexity -- Circuit complexity and the expressive power of generalized first-order formulas -- One-message statistical Zero-Knowledge Proofs and space-bounded verifier -- Abelian squares are avoidable on 4 letters -- Polynomial size test sets for context-free languages -- Quasi-deterministic 0L systems -- On growing context-sensitive languages -- Numeration systems, linear recurrences, and regular sets -- The equality problem for rational series with multiplicities in the tropical semiring is undecidable -- Semi-commutations and rational expressions -- New results concerning synchronized finite automata -- A Greibach normal form for context-free graph grammars -- On reverse and general definite tree languages -- Reductions to sets of low information content -- UP and the low and high hierarchies: A relativized separation -- Analytic analysis of algorithms -- How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems -- The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects -- Polynomial hash functions are reliable -- Adaptive pattern matching -- Randomized interpolation and approximation of sparse polynomials stPreliminary version -- Two strikes against perfect phylogeny -- Disjunctive systems and L-Domains -- Optimal parallel algorithms for periods, palindromes and squares -- Near-perfect token distribution -- Fast integer merging on the EREW PRAM -- Approximation algorithms for graph augmentation -- Fast incremental planarity testing -- Maintenance of triconnected components of graphs -- Suboptimal cuts: Their enumeration, weight and number -- Gröbner bases: An introduction -- Buchberger's algorithm: The term rewriter's point of view -- Completion of rewrite systems with membership constraints -- A new metric between polygons, and how to compute it -- On nearest-neighbor graphs -- A tail estimate for Mulmuley's segment intersection algorithm -- Lower bounds on the complexity of simplex range reporting on a pointer machine -- Infinitary logic for computer science -- Characterization of temporal property classes -- Lazy Lambda calculus: Theories, models and local structure characterization -- Logic programming semantics made easy -- On the complexity of dataflow analysis of logic programs -- Comparison of abstract interpretations -- A proposed categorical semantics for Pure ML -- What good are digital clocks? -- Behavioural abstraction in TCCS -- Timing Petri Nets categorically -- Asynchronous cellular automata for infinite traces -- A trace semantics for Petri Nets -- Asynchronous communication of Petri Nets and the refinement of transitions -- A parametric approach to localities -- Proved trees -- Interfaces between languages for communicating systems -- Toward formal development of programs from algebraic specifications: Model-theoretic foundations -- Program composition via unification -- Barbed bisimulation -- Checking equivalences between concurrent systems of finite agents (Extended abstract) -- Testing preorders for probabilistic processes. |
| Record Nr. | UNISA-996465477203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 18th International Colloquium, Madrid, Spain, July 8-12, 1991. Proceedings / / edited by Javier Leach Albert, Burkhard Monien, Mario Rodriguez Artalejo
| Automata, Languages and Programming [[electronic resource] ] : 18th International Colloquium, Madrid, Spain, July 8-12, 1991. Proceedings / / edited by Javier Leach Albert, Burkhard Monien, Mario Rodriguez Artalejo |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (XII, 768 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Mathematical logic Data structures (Computer science) Combinatorics Algorithms Artificial intelligence Theory of Computation Mathematical Logic and Formal Languages Data Structures Algorithm Analysis and Problem Complexity Artificial Intelligence |
| ISBN | 3-540-47516-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On the semantics of logic programs -- Logic programming with recurrence domains -- Extensional embedding of a strongly stable model of PCF -- Uniform ideals and strictness analysis -- Logical and computational aspects of programming with sets/bags/lists -- Safety for branching time semantics -- Program composition and modular verification -- Model-checking for probabilistic real-time systems -- Computing behavioural relations, logically -- The power of reconfiguration -- General resolution of tseitin formulas is hard -- Program checkers for probability generation -- Running time to recognize nonregular languages by 2-way probabilistic automata -- Statistics on random trees -- The expressive power of implicit specifications -- CCS + time = an interleaving model for real time systems -- On confluent semi-commutations — Decidability and complexity results -- Lazard's factorizations of free partially commutative monoids -- A Kleene theorem for infinite trace languages -- Canonical sets of horn clauses -- A specialized completion procedure for monadic string-rewriting systems presenting groups -- A confluent reduction for the ?-calculus with surjective pairing and terminal object -- Provably recursive programs and program extraction -- Efficient algorithms for path problems with general cost criteria -- Computing shortest paths and distances in planar graphs -- Maintaining biconnected components of dynamic planar graphs -- Efficient maximal cubic graph cuts -- Structural parallel algorithmics -- Improving known solutions is hard -- Collapsing degrees via strong computation -- Fast parallel generation of random permutations -- A parallel algorithm for two processors precedence constraint scheduling -- An efficient NC algorithm for finding Hamiltonian cycles in dense directed graphs -- On logics, tilings, and automata -- Satisfiability of systems of ordinal notations with the subterm property is decidable -- Complete axiomatizations of some quotient term algebras -- The meaning of negative premises in transition system specifications -- Deciding history preserving bisimilarity -- Adding action refinement to a finite process algebra -- Improved parallel computations with matrices and polynomials -- Finding minimal forbidden minors using a finite congruence -- Better algorithms for the pathwidth and treewidth of graphs -- Two P-complete problems in the theory of the reals -- L morphisms: Bounded delay and regularity of ambiguity -- Degree and decomposability of variable-length codes -- An EILENBERG theorem for ?-languages -- Balancing order and chaos in image generation -- Average case complexity -- Minimal NFA problems are hard -- Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language -- Computing shortest transversals -- Ray shooting in polygons using geodesic triangulations -- The expected extremes in a delaunay triangulation -- Computational geometry for the gourmet old fare and new dishes -- On the power of multiple reads in a chip -- On linear decision trees computing Boolean functions -- An almost linear-time algorithm for the dense subset-sum problem -- On-line algorithms for weighted bipartite matching and stable marriages -- String matching with preprocessing of text and pattern -- Ordering problems approximated: single-processor scheduling and interval graph completion. |
| Record Nr. | UNISA-996465546103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 17th International Colloquium, Warwick University, England, July 16-20, 1990, Proceedings / / edited by Michael S. Paterson
| Automata, Languages and Programming [[electronic resource] ] : 17th International Colloquium, Warwick University, England, July 16-20, 1990, Proceedings / / edited by Michael S. Paterson |
| Edizione | [1st ed. 1990.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
| Descrizione fisica | 1 online resource (XII, 788 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Mathematical logic Data structures (Computer science) Combinatorics Algorithms Artificial intelligence Theory of Computation Mathematical Logic and Formal Languages Data Structures Algorithm Analysis and Problem Complexity Artificial Intelligence |
| ISBN | 3-540-47159-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | LEDA: A library of efficient data types and algorithms -- A new universal class of hash functions and dynamic hashing in real time -- A complete and decidable proof system for call-by-value equalities -- Static correctness of hierarchical procedures -- Generic terms having no polymorphic types -- A complete system of B-rational identities -- On non-counting regular classes -- Two-way automata with multiplicity -- ?-Continuous semirings, algebraic systems and pushdown automata -- Nondeterministic computations in sublogarithmic space and space constructibility -- Normalizing and accelerating RAM computations and the problem of reasonable space measures -- A formal study of learning via queries -- Language learning by a “team” -- Functions as processes -- A domain-theoretic model for a higher-order process calculus -- Concurrency, automata and domains -- A theory of communicating processes with value-passing -- Analytic variations on the common subexpression problem -- Can a maximum flow be computed in o(nm) time? -- On the distributional complexity of disjointness -- Computing boolean functions on anonymous networks -- On the composition of zero-knowledge proof systems -- Additional queries to random and pseudorandom oracles -- Communication among relations -- Stability and sequentiality in dataflow networks -- Automata for modeling real-time systems -- Markov decision processes and regular events -- Term rewriting systems from Church-Rosser to Knuth-Bendix and beyond -- Nonoblivious normalization algorithms for nonlinear rewrite systems -- Algebraic properties of idempotent substitutions -- Determining the separation of preprocessed polyhedra — A unified approach -- Randomized incremental construction of delaunay and Voronoi diagrams -- Merging free trees in parallel for efficient voronoi diagram construction -- Local optimization and the Traveling Salesman Problem -- Polynomial-time approximation algorithms for the ising model -- On parallelizing graph-partitioning heuristics -- Iterated substitutions and locally catenative systems: a decidability result in the binary case -- Decomposition of partial commutations -- Boolean closure and unambiguity of rational sets -- Compositionality through an operational semantics of contexts -- Structural and behavioural equivalences of networks -- Proving partial order liveness properties -- A proof system for the parallel object-oriented language POOL -- A new approach to maximum matching in general graphs -- On-line graph algorithms with SPQR-trees -- On the bit-complexity of discrete solutions of PDEs: Compact multigrid -- An efficient algorithm for branching bisimulation and stuttering equivalence -- Partial evaluation, self-application and types -- Provable computable functions on abstract data types -- Equational formulas in order-sorted algebras -- An input-size/output-size trade-off in the time-complexity of rectilinear hidden surface removal -- Approximation of convex polygons -- On the rectilinear art gallery problem -- On parallel hashing and integer sorting -- The parallel simplicity of compaction and chaining -- The importance of the left merge operator in process algebras -- Operational and algebraic semantics for facile: A symmetric integration of concurrent and functional programming. |
| Record Nr. | UNISA-996465857803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Becoming a data-driven Organisation [[electronic resource] ] : Unlock the value of data / / by Martin Treder
| Becoming a data-driven Organisation [[electronic resource] ] : Unlock the value of data / / by Martin Treder |
| Autore | Treder Martin |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer Vieweg, , 2019 |
| Descrizione fisica | 1 online resource (148 pages) |
| Disciplina | 006.8 |
| Soggetto topico |
Input-output equipment (Computers)
Data structures (Computer science) Application software Management information systems Computer science Big data Input/Output and Data Communications Data Structures Computer Appl. in Administrative Data Processing Management of Computing and Information Systems Big Data |
| ISBN | 3-662-60304-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | How to define Data? -- Isn't Data a job of the IT department? -- Isn't Data and Information the same? -- Isn’t Data Management about Analytics? -- What else does Data Management deal with? -- Data in the overall context of our business -- The Value of Data -- Opportunities through managing Data -- The cost of NOT doing it right -- Why now -- Designing your Data Office -- What are the preconditions to succeed? -- What does a Data Office deal with? -- Shaping Data Office -- The Chief Data Officer (CDO) -- Data Governance: Review and Decision -- How can a Data Office influence the company? -- Implementing the Data Office -- Stakeholder Management. |
| Record Nr. | UNINA-9910349297303321 |
Treder Martin
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer Vieweg, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Beginning SQL Queries [[electronic resource] ] : From Novice to Professional / / by Clare Churcher
| Beginning SQL Queries [[electronic resource] ] : From Novice to Professional / / by Clare Churcher |
| Autore | Churcher Clare |
| Edizione | [2nd ed. 2016.] |
| Pubbl/distr/stampa | Berkeley, CA : , : Apress : , : Imprint : Apress, , 2016 |
| Descrizione fisica | 1 online resource (XXII, 234 p. 161 illus., 142 illus. in color.) |
| Disciplina | 005.74 |
| Collana | Expert's voice in SQL |
| Soggetto topico |
Database management
Programming languages (Electronic computers) Data mining Computer programming Data structures (Computer science) Database Management Programming Languages, Compilers, Interpreters Data Mining and Knowledge Discovery Programming Techniques Data Structures |
| ISBN | 1-4842-1955-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Relational Database Overview -- 2. Simple Queries on One Table -- 3. A First Look at Joins -- 4. Nested Queries -- 5. Self Joins -- 6. Multiple Relationships Between Tables -- 7. Set Operations -- 8. Aggregate Operations -- 9. Window Function -- 10. Efficiency Considerations -- 11. Approaching A Query -- 12. Common Problems -- Chapter 13: Appendix 1: Sample Database -- Chapter 14: Appendix 2: Relational Notation. |
| Record Nr. | UNINA-9910254758603321 |
|
Churcher Clare
|
||
| Berkeley, CA : , : Apress : , : Imprint : Apress, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Big Data [[electronic resource] ] : 29th British National Conference on databases, BNCOD 2013, Oxford, UK, July 8-10, 2013. Proceedings / / edited by Dan Olteanu, Georg Gottlob, Christian Schallhart
| Big Data [[electronic resource] ] : 29th British National Conference on databases, BNCOD 2013, Oxford, UK, July 8-10, 2013. Proceedings / / edited by Dan Olteanu, Georg Gottlob, Christian Schallhart |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 303 p. 89 illus.) |
| Disciplina | 005.74 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Database management
Information storage and retrieval Application software Data structures (Computer science) Software engineering Database Management Information Storage and Retrieval Information Systems Applications (incl. Internet) Data Structures Data Storage Representation Software Engineering |
| ISBN | 3-642-39467-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Query and update processing -- Relational storage -- Benchmarking -- XML query processing -- Big data -- Spatial data and indexing -- Data extraction and social networks. |
| Record Nr. | UNISA-996465406503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
