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] ] : 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 | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 16th International Colloquium, Stresa, Italy, July 11-15, 1989. Proceedings / / edited by Giorgio Ausiello, Mariangiola Dezani-Ciancaglini, Simonetta Ronchi Della Rocca
| Automata, Languages and Programming [[electronic resource] ] : 16th International Colloquium, Stresa, Italy, July 11-15, 1989. Proceedings / / edited by Giorgio Ausiello, Mariangiola Dezani-Ciancaglini, Simonetta Ronchi Della Rocca |
| Edizione | [1st ed. 1989.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 |
| Descrizione fisica | 1 online resource (XIV, 790 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer logic Algorithms Mathematical logic Combinatorics Theory of Computation Logics and Meanings of Programs Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Computation by Abstract Devices |
| ISBN | 3-540-46201-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Realizable and unrealizable specifications of reactive systems -- Limitations of the upward separation technique (preliminary version) -- Lower bounds for the low hierarchy -- Efficient text searching of regular expressions -- Factors of words -- Asymptotically optimal distributed consensus -- Time lower bounds for CREW-PRAM computation of monotone functions -- Subduing self-application -- Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds -- Polymorphic rewriting conserves algebraic strong normalization and confluence -- Completion of finite codes with finite deciphering delay -- Relational semantics for recursive types and bounded quantification -- A singly-exponential stratification scheme for real semi-algebraic varieties and its applications -- About primitive recursive algorithms -- The definability of equational graphs in monadic second-order logic -- Dominoes and the regularity of DNA splicing languages -- Causal trees -- Infinite normal forms -- On recent trends in algebraic specification -- Automata with storage on infinite words -- Parallel algorithmic techniques for combinatorial computation -- On dice and coins: models of computation for random generation -- An optimal probabilistic algorithm for synchronous Byzantine agreement -- Finding triconnected components by local replacements -- An improved algorithm for approximate string matching -- A pointer-free data structure for merging heaps and min-max heaps -- Structured operational semantics and bisimulation as a congruence -- Parallel retrieval of scattered information -- Tensor rank is NP-complete -- The complexity of nonlinear separable optimization -- General methods for the analysis of the maximum size of dynamic data structures -- How to share concurrent asynchronous wait-free variables -- A new approach to formal language theory by kolmogorov complexity -- Dynamic algorithms in D.E. Knuth's model: A probabilistic analysis -- Completing the temporal picture -- Lower bounds for computations with the floor operation -- Programming, transforming, and proving with function abstractions and memories -- Automata theory meets circuit complexity -- Two versus one index register and modifiable versus non-modifiable programs -- Shortest paths without a map -- Modular system design applying graph grammars techniques -- Partial communations -- On the synthesis of an asynchronous reactive module -- The complexity of controlled selection -- Memory versus randomization in on-line algorithms -- Syntactic control of interference Part 2 -- Characteristic formulae -- A combinatorial technique for separating counting complexity classes -- Horn programs and semicomputable relations on abstract structures -- A note on model checking the modal v-calculus -- DI-domains as information systems. |
| Record Nr. | UNISA-996465720703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Axiom of choice [e-book] / by Horst Herrlich
| Axiom of choice [e-book] / by Horst Herrlich |
| Autore | Herrlich, Horst |
| Pubbl/distr/stampa | Berlin : Springer, c2006 |
| Descrizione fisica | v.: digital |
| Disciplina | 511.3 |
| Collana | Lecture notes in mathematics, 0075-8434 ; 1876 |
| Soggetto topico |
Algebra
Combinatorics Functional analysis Mathematics Topology |
| ISBN | 9783540342687 |
| Classificazione |
AMS 03E25
AMS 03E60 LC QA248.H47 |
| Formato | Software  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991000565469707536 |
Herrlich, Horst
|
||
| Berlin : Springer, c2006 | ||
| Software | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Axioms and Hulls [[electronic resource] /] / by Donald E. Knuth
| Axioms and Hulls [[electronic resource] /] / by Donald E. Knuth |
| Autore | Knuth Donald E |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (X, 114 p.) |
| Disciplina | 516/.08 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Application software Discrete mathematics Computer graphics Algorithms Combinatorics Theory of Computation Computer Applications Discrete Mathematics Computer Graphics Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-47259-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465760703316 |
|
Knuth Donald E
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Banach spaces and descriptive set theory : selected topics [e-book] / by Pandelis Dodos
| Banach spaces and descriptive set theory : selected topics [e-book] / by Pandelis Dodos |
| Autore | Dodos, Pandelis |
| Pubbl/distr/stampa | Berlin : Springer, 2010 |
| Descrizione fisica | 1 online resource (x, 160 p.) |
| Disciplina | 515.7 |
| Collana | Lecture Notes in Mathematics, 0075-8434 ; 1993 |
| Soggetto topico |
Mathematics
Functional analysis Combinatorics Logic, Symbolic and mathematical |
| ISBN | 9783642121531 |
| Classificazione |
AMS 46B03
AMS 46B15 AMS 46B07 AMS 46B70 AMS 46M40 AMS 03E15 AMS 03E75 AMS 05D10 |
| Formato | Risorse elettroniche  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991002257579707536 |
|
Dodos, Pandelis
|
||
| Berlin : Springer, 2010 | ||
| Risorse elettroniche | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Banach Spaces and Descriptive Set Theory: Selected Topics [[electronic resource] /] / by Pandelis Dodos
| Banach Spaces and Descriptive Set Theory: Selected Topics [[electronic resource] /] / by Pandelis Dodos |
| Autore | Dodos Pandelis |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XII, 168 p.) |
| Disciplina | 515.732 |
| Collana | Lecture Notes in Mathematics |
| Soggetto topico |
Discrete mathematics
Functional analysis Mathematical logic Combinatorics Discrete Mathematics Functional Analysis Mathematical Logic and Foundations |
| ISBN | 3-642-12153-5 |
| Classificazione | 46B0346B1546B0746B7046M4003E1503E7505D10 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Basic Concepts -- The Standard Borel Space of All Separable Banach Spaces -- The ?2 Baire Sum -- Amalgamated Spaces -- Zippin’s Embedding Theorem -- The Bourgain–Pisier Construction -- Strongly Bounded Classes of Banach Spaces. |
| Record Nr. | UNISA-996466484003316 |
|
Dodos Pandelis
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Banach Spaces and Descriptive Set Theory: Selected Topics [[electronic resource] /] / by Pandelis Dodos
| Banach Spaces and Descriptive Set Theory: Selected Topics [[electronic resource] /] / by Pandelis Dodos |
| Autore | Dodos Pandelis |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XII, 168 p.) |
| Disciplina | 515.732 |
| Collana | Lecture Notes in Mathematics |
| Soggetto topico |
Discrete mathematics
Functional analysis Mathematical logic Combinatorics Discrete Mathematics Functional Analysis Mathematical Logic and Foundations |
| ISBN | 3-642-12153-5 |
| Classificazione | 46B0346B1546B0746B7046M4003E1503E7505D10 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Basic Concepts -- The Standard Borel Space of All Separable Banach Spaces -- The ?2 Baire Sum -- Amalgamated Spaces -- Zippin’s Embedding Theorem -- The Bourgain–Pisier Construction -- Strongly Bounded Classes of Banach Spaces. |
| Record Nr. | UNINA-9910484607103321 |
|
Dodos Pandelis
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Basics of Probability and Stochastic Processes [[electronic resource] /] / by Esra Bas
| Basics of Probability and Stochastic Processes [[electronic resource] /] / by Esra Bas |
| Autore | Bas Esra |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (IX, 307 p.) |
| Disciplina | 519.2 |
| Soggetto topico |
Markov processes
Engineering mathematics Combinatorics Quality control Reliability Industrial safety Markov model Engineering Mathematics Quality Control, Reliability, Safety and Risk |
| ISBN | 3-030-32323-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Combinatorial Analysis -- Basic Concepts in Probability -- Conditional Probability, Bayes’s Formula, Independent Events -- Introduction to Random Variables -- Discrete Random Variables -- Continuous Random Variables -- Other Selected Topics in Basic Probability -- A Brief Introduction to Stochastic Processes -- A Brief Introduction to Point Process, Counting Process, Renewal Process, Regenerative Process, Poisson Process -- Poisson Process -- Renewal Process -- An Introduction to Markov Chains -- Special Discrete-Time Markov Chains -- Continuous-Time Markov Chains -- An Introduction to Queueing Models -- Introduction to Brownian Motion -- Basics of Martingales -- Basics of Reliability Theory. |
| Record Nr. | UNINA-9910360854903321 |
|
Bas Esra
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Soggetto topico
-
Combinatorics
(447)
- Algorithms (127)
- Algorithm Analysis and Problem Complexity (105)
- Computers (98)
- Theory of Computation (79)