{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":33,"n_cols":5,"rows_kept":33,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[11,2,11,3],[12,2,12,3],[15,2,15,3],[16,2,16,3],[16,4,16,5],[17,2,17,3],[17,4,17,5],[18,2,18,3],[20,2,20,3],[22,2,22,3],[23,2,23,3],[24,2,24,3],[25,2,25,3],[26,2,26,3],[27,2,27,3],[28,2,28,3],[31,2,31,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466652903316"]
[null,null,"Titolo",null,"Smoothing techniques for curve estimation : proceedings of workshop held in Heidelberg, April 2-4, 1979 / / edited by T. Gasser and M. Rosenblatt"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Germany ; ; New York, New York : , : Springer-Verlag, , [1979]"]
[{"$nulls":4},"©1979"]
[null,null,"ISBN",null,"3-540-38475-8"]
[null,null,"Edizione",null,"[1st ed. 1979.]"]
[null,null,"Descrizione fisica",null,"1 online resource (245 p.)"]
[null,null,"Collana",null,"Lecture Notes in Mathematics, , 0075-8434 ; ; 757"]
[null,null,"Disciplina",null,"519.544"]
[null,null,"Soggetti",null,"Curve fitting - Computer programs"]
[{"$nulls":4},"Estimation theory - Computer programs"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"Nonparametric curve estimation -- A tree-structured approach to nonparametric multiple regression -- Kernel estimation of regression functions -- Total least squares -- Some theoretical results on Tukey’s 3R smoother -- Bias- and efficiency-robustness of general M-estimators for regression with random carriers -- Approximate conditional-mean type smoothers and interpolators -- Optimal convergence properties of kernel estimates of derivatives of a density function -- Density quantile estimation approach to statistical data modelling -- Global measures of deviation for kernel and nearest neighbor density estimates -- Some comments on the asymptotic behavior of robust smoothers -- Cross-validation techniques for smoothing spline functions in one or two dimensions -- Convergence rates of \"thin plate\" smoothing splines wihen the data are noisy."]
[null,"2.","Record Nr.",null,"UNISA996465409103316"]
[null,null,"Titolo",null,"Automata, languages and programming : 2nd Colloquium, University of Saarbrücken, July 29 - August 2, 1974 / / edited by J. Loeckx"]
[null,null,"Pubbl/distr/stampa",null,"Berlin ; ; Heidelberg ; ; New York : , : Springer-Verlag Berlin Heidelberg GmbH, , [1974]"]
[{"$nulls":4},"©1974"]
[null,null,"ISBN",null,"3-540-37778-6"]
[{"$nulls":4},"3-662-21545-4"]
[null,null,"Edizione",null,"[1st ed. 1974.]"]
[null,null,"Descrizione fisica",null,"1 online resource (619 p.)"]
[null,null,"Collana",null,"Lecture notes in computer science ; ; 14"]
[null,null,"Disciplina",null,"511.3"]
[null,null,"Soggetti",null,"Sequential machine theory"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"The generative power of two-level grammars -- A generalisation of Parikh's theorem in formal language theory -- Checking stacks and context-free programmed grammars accept p-complete languages -- Recursion and parameter mechanisms: An axiomatic approach -- Dynamic programming schemata -- Semantic characterization of flow diagrams and their decomposability -- On the most recent property of ALGOL-like programs -- Langages sans etiquettes et transformations de programmes -- Relations between semantics and complexity of recursive programs- -- On the relation between direct and continuation semantics -- Graph representation and computation rules for typeless recursive languages -- Application of Church-Rosser properties to increase the parallelism and efficiency of algorithms -- Combinatorial problems, combinator equations and normal forms -- Algorithmes d'Equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples -- Automatic generation of multiple exit parsing subroutines -- Production prefix parsing -- On eliminating unit productions from LR(k) parsers -- Deterministic techniques for efficient non-deterministic parsers -- File organization, an application of graph theory -- Characterizations of time-bounded computations by limited primitive recursion -- On maximal merging of information in Boolean computations -- On simple Goedel numberings and translations -- The ‘almost all’ theory of subrecursive degrees is decidable -- The computational complexity of program schemata -- Un resultat en theorie des groupes de "]
[{"$nulls":4},"permutations et son application au calcul effectif du groupe d'automorphismes d'un automate fini -- Sur l'Application du theoreme de suschkewitsch a l'etude des codes rationnels complets -- Composition of automata -- Context-free grammar forms -- Une suite decroissante de cônes rationnels -- Komplexitätsmaße for Ausdrocke -- Efficient procedures for using matrix algorithms -- Further schemes for combining matrix algorithms -- On the structure of complexity classes -- On sets having only hard subsets -- Turing machines with associative memory access -- Trade-off between the use of nonterminals, codings and homomorphisms in defining languages for some classes of rewriting systems -- Operators reducing generalized OL-systems -- Parallel rewriting systems on terms -- Transductions of context-free languages into sets of sentential forms -- Parallelism in rewriting systems -- Mehrdeutigkeiten kontextfreier Grammatiken -- Monadic program schemes under restricted classes of free interpretations -- Generalized program schemas -- A decidability result for sequential grammars -- Effectivity problems of algorithmic logic -- Simple and structural redundancy in non-deterministic computation -- Sur une propriete syntactique des relations rationnelles."]