{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"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":13,"n_cols":5,"rows_kept":13,"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],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[11,2,11,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910872644703321"]
[null,null,"Autore",null,"Burgess Neil"]
[null,null,"Titolo",null,"15th Symposium on Computer Arithmatic, 2001, Vail, CO"]
[null,null,"Pubbl/distr/stampa",null,"[Place of publication not identified], : IEEE Computer Society Press, 2001"]
[null,null,"Descrizione fisica",null,"1 online resource (285 pages)"]
[null,null,"Disciplina",null,"004.0151"]
[null,null,"Soggetti",null,"Computer arithmetic"]
[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,"Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001 -- Leading zero anticipation and detection-a comparison of methods -- Bounds on runs of zeros and ones for algebraic functions -- Binary multiplication radix-32 and radix-256 -- Analysis of column compression multipliers -- Faithful powering computation using table look-up and a fused accumulation tree -- Bit-parallel systolic modular multipliers for a class of GF(2/sup m/) -- Modular multiplication and base extensions in residue number systems -- Efficient computation of multiplicative inverses for cryptographic applications -- Optimised squaring of long integers using precomputed partial products."]
[null,null,null,"Sommario/riassunto","The proceedings from the June 2001 conference in Vail, Colorado, feature 30 papers on binary strings, multiplication and exponentiation, cryptography, division and square root, elementary functions and rounding, number systems, floating high points, addition, logarithmic number systems, and on-line arithmetic. An abstract of the keynote speech offers a processor architect's perspective on computer arithmetic. And a reprint of Knowles's \"A Family of Adders,\" which was mis-printed in the proceedings from the previous conference, is included. Contributors represent 11 countries. Name index only. c. Book News Inc."]