{"doi":"10.1109/arith.1993.378086","title":"A lazy exact arithmetic","abstract":null,"journal":"Proceedings of IEEE 11th Symposium on Computer Arithmetic","year":null,"id":39503,"datarank":0.885748166344777,"base_score":2.639057329615259,"endowment":2.639057329615259,"self_citation_contribution":0.3958585994422889,"citation_network_contribution":0.4898895669024882,"self_endowment_contribution":0.3958585994422889,"citer_contribution":0.4898895669024882,"corpus_percentile":null,"corpus_rank":null,"citation_count":13,"citer_count":8,"citers_with_citation_signal":6,"citers_with_endowment":6,"datacite_reuse_total":1,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":193861,"name":"P. Jaillon","orcid":null,"position":1,"is_corresponding":false},{"id":193862,"name":"D. Michelucci","orcid":null,"position":2,"is_corresponding":false},{"id":193863,"name":"J.-M. Moreau","orcid":null,"position":3,"is_corresponding":false},{"id":193860,"name":"M.O. Benouamer","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":2.639057329615259,"endowment":2.639057329615259,"datacite_reuse_total":1,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"18998881","pmcid":null,"openalex_id":"https://openalex.org/W2156481269","authors":[],"funders":[],"total_grants":0,"fwci":0.9557,"citation_percentile":0.78907721,"influential_citations":0,"citation_trend":[{"year":2017,"count":3}],"oa_status":"closed","license":null,"oa_locations":[{"url":"https://doi.org/10.1109/arith.1993.378086","host_type":""}],"fields_of_study":["Computational Geometry and Mesh Generation","Polynomial and algebraic computation","Advanced Numerical Analysis Techniques","Computer Science","Mathematics"],"mesh_terms":[],"keywords":["Computation","Arithmetic","Computer science","Field (mathematics)","Context (archaeology)","Laziness","Lazy evaluation","Rational number","Theoretical computer science","Algebra over a field","Algorithm","Mathematics","Discrete mathematics","Pure mathematics","Functional programming"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Peace, Justice and strong institutions"}],"linked_datasets":[{"doi":"10.4230/lipics.sea.2018.20","title":"Restructuring Expression Dags for Efficient Parallelization","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"}],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-11T20:34:13.690090Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}