LEADER 01822nlm0 2200337 450 001 000032795 005 20200402215950.0 100 $a20161222d2016----km-y0itay50------ba 101 0 $aeng 102 $aIT 105 $ay-------001yy 200 1 $aSustainable structural composites$ethe threefold strategy of waste reuse-stabilization, clinker reduction in high performance concrete and innovation through alkali activated binders-geopolymers$ftesi di dottorato di: Francesco Messina$gtutor: Francesco Colangelo$gco-tutor: Raffaele Cioffi$brisorsa elettronica 210 $aNapoli$d2016 215 $a1 disco ottico (CD-ROM)$d12 cm 230 $aDati testuali (1 file: 13,1 Mb) 304 $aTit. dell'etichetta 314 $aCoordinatore: 328 $aTesi di Dottorato di ricerca in Civil Engineering. 2015-2016 (28. ciclo) : Università degli studi di Napoli "Parthenope". Department of Engineering 337 $aRequisiti minimi del sistema: Windows 410 0$12001 500 10$aSustainable structural composites : the threefold strategy of waste reuse-stabilization, clinker reduction in high performance concrete and innovation through alkali activated binders-geopolymers$91736297 610 1 $aRifiuti$aRiutilizzo 610 1 $aRifiuti$aTrattamento 676 $a363.728$v22$9Problemi ambientali. Rifiuti 700 1$aMessina,$bFrancesco$036975 712 02$aUniversità degli Studi di Napoli "Parthenope" 801 0$aIT$bUNIPARTHENOPE$c20200402$gRICA$2UNIMARC 912 $a000032795 951 $aTESI Dottorato CD-ROM/289$bmanca inventario$cNAVA1$d2019 996 $aSustainable structural composites : the threefold strategy of waste reuse-stabilization, clinker reduction in high performance concrete and innovation through alkali activated binders-geopolymers$91736297 997 $aUNIPARTHENOPE LEADER 05020nam 22006975 450 001 9910483707003321 005 20251225205404.0 010 $a3-319-58747-1 024 7 $a10.1007/978-3-319-58747-9 035 $a(CKB)4340000000061522 035 $a(DE-He213)978-3-319-58747-9 035 $a(MiAaPQ)EBC5578328 035 $a(PPN)201471302 035 $a(EXLCZ)994340000000061522 100 $a20170505d2017 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aComputer Science ? Theory and Applications $e12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings /$fedited by Pascal Weil 205 $a1st ed. 2017. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2017. 215 $a1 online resource (X, 337 p. 30 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10304 300 $aIncludes index. 311 08$a3-319-58746-3 327 $aType Theory and Formalization of Mathematics -- Advances in Parameterized Verification of Population Protocols -- Verification of Quantum Computation and the Price of Trust -- Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs -- Concatenation Hierarchies: New Bottle, Old Wine -- Can We Locally Compute Sparse Connected Subgraphs -- Palindromic Decompositions with Gaps and Errors -- Cascade Heaps: Towards Time-Optimal Extractions -- Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets -- Parameterized Counting of Trees, Forests and Matroid Bases -- Generalized Dyck Shifts -- Green's Relations in Finite Transformation Semigroups -- Nondeterministic Unitary OBDDs -- Unary Coded PSPACE-Complete Languages in ASPACE(loglog n) -- Turing Degree Spectra of Minimal Subshifts -- Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams -- Dynamic stabbing Queries with Sub-logarithmic Local Updates for Overlapping Intervals -- The Transformation Monoid of a Partially Lossy Queue -- Approximation Algorithms for the Maximum Carpool Matching Problem -- The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC=0 -- On Algorithmic Statistics for Space-bounded Algorithms -- Popularity in the Generalized Hospital Residents Setting -- Edit Distance Neighbourhoods of Input-driven Pushdown Automata -- The (Minimum) Rank of Typical Fooling-set Matrices -- On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition Problem -- Dag-like Communication and Its Applications -- The Descriptive Complexity of Subgraph Isomorphism Without Numerics -- On a Generalization of Horn Constraint Systems. . 330 $aThis book constitutes the proceedings of the 12th International Computer Science Symposium in Russia, CSR 2017, held in Kazan, Russia, in June 2017. The 22 full papers presented in this volume were carefully reviewed and selected from 44 submissions. In addition the book contains 6 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas such as: include, but are not limited to: algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; algorithms for concurrent and distributed systems, networks; applications of logic to computer science, e.g. proof theory, model checking and verification; formal and algorithmic aspects of bio-informatics; current challenges such as quantum computing. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10304 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aComputer science 606 $aMachine theory 606 $aArtificial intelligence$xData processing 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 606 $aData Science 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aComputer science. 615 0$aMachine theory. 615 0$aArtificial intelligence$xData processing. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 615 24$aData Science. 676 $a004 702 $aWeil$b Pascal$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483707003321 996 $aComputer Science - Theory and Applications$92889860 997 $aUNINA