{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001419445,0.00009590627,0.00009797183,0.00008827273,0.000121755,0.0001141594,0.0004728451,0.00005178927,0.00000650298],"category_scores_gemma":[0.00001580436,0.00009011097,0.00004214292,0.0002404087,0.00001294162,0.0002989655,0.00006450841,0.00006509822,0.00002457495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003425717,"about_ca_system_score_gemma":0.00003536631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000293122,"about_ca_topic_score_gemma":8.001398e-7,"domain_scores_codex":[0.9992061,0.00003415449,0.0001803375,0.0002694742,0.0001230524,0.000186833],"domain_scores_gemma":[0.9993846,0.00001913243,0.00006606179,0.0004090271,0.00005471643,0.00006644931],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004821423,0.0007060604,0.001352121,0.000009911403,0.00002824672,0.00001797131,0.00133508,0.3803559,0.01851235,0.206096,0.05794675,0.3335914],"study_design_scores_gemma":[0.0001895334,0.00004394512,0.001328025,0.000005532781,0.000001375835,0.0000118513,0.000002371142,0.9924474,0.002774945,0.001528774,0.001523239,0.0001429564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004426032,0.00003525764,0.9882359,0.001152479,0.00007418721,0.000111692,1.646208e-7,0.0008854194,0.005078887],"genre_scores_gemma":[0.418406,0.000005729006,0.5806447,0.0007247941,0.00004444384,0.000001222299,0.000001082253,0.000002337877,0.0001697172],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6120915,"threshold_uncertainty_score":0.3674619,"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."}}