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] ] : 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 | ||
| ||
ICDT'86 [[electronic resource] ] : International Conference on Database Theory. Rome, Italy, September 8-10, 1986. Proceedings / / edited by Giorgio Ausiello, Paolo Atzeni
| ICDT'86 [[electronic resource] ] : International Conference on Database Theory. Rome, Italy, September 8-10, 1986. Proceedings / / edited by Giorgio Ausiello, Paolo Atzeni |
| Edizione | [1st ed. 1986.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 |
| Descrizione fisica | 1 online resource (VIII, 448 p.) |
| Disciplina | 005.74 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Computers Algorithms Data Structures and Information Theory Models and Principles Data Structures Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-47346-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Logic programming and parallel complexity -- The generalized counting method for recursive logic queries -- Restructuring of complex objects and office forms -- Set containment inference -- A domain theoretic approach to higher-order relations -- On the desirability of ?-acyclic BCNF database schemes -- Update semantics under the domain closure assumption -- Unsolvable problems related to the view integration approach -- Horizontal decompositions based on functional-dependency-setimplications -- Update serializability in locking -- Filtering data flow in deductive databases -- Multidimensional order preserving linear hashing with partial expansions -- Split-freedom and MVD-intersection: A new characterization of multivalued dependencies having conflict-free covers -- Towards online schedulers based on Pre-Analysis Locking -- Query processing in incomplete logical databases -- to the theory of nested transactions -- Entity-relationship consistency for relational schemas -- Modelling large bases of categorical data with acyclic schemes -- Some extensions to the closed world assumption in databases -- Expedient stochastic move-to-front and optimal stochastic move-to-rear list organizing strategies -- The cost of locking -- Theoretical foundation of algebraic optimization utilizing unnormalized relations -- A polynomial-time join dependency implication algorithm for unary multi-valued dependencies -- Interaction-free multivalued dependency sets -- Updating logical databases containing null values -- A new characterization of distributed deadlock in databases. |
| Record Nr. | UNISA-996465685603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
The Power of Algorithms : Inspiration and Examples in Everyday Life / / edited by Giorgio Ausiello, Rossella Petreschi
| The Power of Algorithms : Inspiration and Examples in Everyday Life / / edited by Giorgio Ausiello, Rossella Petreschi |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XIV, 255 p. 86 illus., 72 illus. in color.) |
| Disciplina | 374.26 |
| Soggetto topico |
Education—Data processing
Algorithms Computers History Computers and Education Algorithm Analysis and Problem Complexity History of Computing History of Science |
| ISBN | 3-642-39652-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Part I Finding One’s Way in a World of Algorithms -- Chap. 1 Algorithms: An Historical Perspective -- Chap. 2 How to Design an Algorithm -- Chap. 3 The One Million Dollars Problem -- Part II The Difficult Simplicity of Daily Life -- Chap. 4 The Quest for the Shortest Route -- Chap. 5 Web Search -- Chap. 6 Algorithms for Secure Communication -- Chap. 7 Algorithmics for the Life Sciences -- Chap. 8 The Shortest Walk to Watch TV -- Chap. 9 Algorithms for Auctions and Games -- Chap. 10 Randomness and Complexity. |
| Record Nr. | UNINA-9910437573403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||