{"doi":"10.1145/571826.571828","title":"Space-optimal multi-writer snapshot objects are slow","abstract":null,"journal":"Proceedings of the twenty-first annual symposium on Principles of distributed computing  - PODC '02","year":2002,"id":18238,"datarank":0.0,"base_score":0.0,"endowment":0.0,"self_citation_contribution":0.0,"citation_network_contribution":0.0,"self_endowment_contribution":0.0,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":0,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"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":127501,"name":"Faith Fich","orcid":null,"position":1,"is_corresponding":false},{"id":127502,"name":"Eric Ruppert","orcid":null,"position":2,"is_corresponding":false},{"id":127500,"name":"Panagiota Fatourou","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":0.0,"endowment":0.0,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"24259432","pmcid":null,"openalex_id":"https://openalex.org/W4245782888","authors":[],"funders":[],"total_grants":0,"fwci":0.0,"citation_percentile":0.35090747,"influential_citations":0,"citation_trend":[],"oa_status":"closed","license":null,"oa_locations":[{"url":"https://dl.acm.org/ft_gateway.cfm?id=571828&ftid=85028&dwn=1","host_type":"publisher"},{"url":"https://doi.org/10.1145/571826.571828","host_type":""}],"fields_of_study":["Parallel Computing and Optimization Techniques","Distributed systems and fault tolerance","Optimization and Search Problems"],"mesh_terms":[],"keywords":["Snapshot (computer storage)","Upper and lower bounds","Computer science","Time complexity","Algorithm","Theoretical computer science","Combinatorics","Parallel computing","Mathematics","Operating system"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-03T19:56:39.315170Z","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":[]}