{"id":"W2033042165","doi":"10.1145/1576702.1576739","title":"Parallel sparse polynomial multiplication using heaps","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heap (data structure); Computer science; Parallel computing; Speedup; Scalability; Cache; Multi-core processor; Multiplication (music); Cache-oblivious algorithm; Cache algorithms; CPU cache; Algorithm; Mathematics; Operating system; Combinatorics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004444189,0.0004839944,0.0007033391,0.0005905677,0.0009168027,0.00088245,0.001364515,0.0004401487,0.00454513],"category_scores_gemma":[0.001302294,0.0003665188,0.0005351739,0.001411782,0.0004843105,0.001877272,0.001401323,0.0005982849,0.001305643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005118794,"about_ca_system_score_gemma":0.0009920506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002688782,"about_ca_topic_score_gemma":0.00513597,"domain_scores_codex":[0.9996288,0.00005937216,0.00002854995,0.00008110029,0.0001322224,0.00006990202],"domain_scores_gemma":[0.9993635,0.0002074935,0.00004756607,0.0001848117,0.0001493745,0.00004729851],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001039367,0.0003582384,0.002646783,0.0004201901,0.0001309282,0.0004640757,0.0004733177,0.1606815,0.06066195,0.08619131,0.01476649,0.6721658],"study_design_scores_gemma":[0.000238601,0.0002766487,0.0007248207,0.00003130743,0.0000604798,0.0003195631,0.0000905262,0.8436475,0.06172305,0.06584537,0.0269887,0.00005350187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07560337,0.0004008646,0.9095307,0.0001551253,0.0001094495,0.0000751377,0.0001394979,0.007228793,0.006757011],"genre_scores_gemma":[0.3035622,0.0002053674,0.6880438,0.00006960525,0.00006316433,0.00009564628,0.0003574277,0.0004558379,0.007147021],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00454513,"threshold_uncertainty_score":0.01520497,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03312976878881403,"score_gpt":0.287731498095359,"score_spread":0.254601729306545,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}