{"id":"W1528425384","doi":"10.1109/spdp.1990.143551","title":"An optimal parallel minimax tree algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Minimax; Computer science; Tree (set theory); Construct (python library); Algorithm; Parallel algorithm; Running time; Theoretical computer science; Mathematics; Combinatorics; Mathematical optimization; Programming language","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.0004388485,0.0004436004,0.0008522604,0.0008204221,0.000805431,0.0009360941,0.001329137,0.0008788962,0.01067389],"category_scores_gemma":[0.001713641,0.0004144927,0.0004984107,0.001084692,0.000461254,0.001755936,0.001308058,0.0009660908,0.002730823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005869916,"about_ca_system_score_gemma":0.001412162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00100685,"about_ca_topic_score_gemma":0.0017187,"domain_scores_codex":[0.9995458,0.0000662235,0.00002292957,0.0001091367,0.0001926278,0.00006326447],"domain_scores_gemma":[0.9997426,0.00008944829,0.00001875181,0.00006436178,0.00006501986,0.00001987824],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000359536,0.0001759372,0.0004157486,0.0002241209,0.0000418251,0.0001533842,0.0001282909,0.1761236,0.01246234,0.1349067,0.03009825,0.6449102],"study_design_scores_gemma":[0.0002281179,0.0001393833,0.0002187531,0.00003547013,0.0000200577,0.0002491456,0.00004860395,0.8402898,0.005336812,0.1337317,0.01967777,0.00002439419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01535215,0.0004838836,0.9690833,0.0005431253,0.0001124633,0.0001090368,0.0001967401,0.001676706,0.01244259],"genre_scores_gemma":[0.1193043,0.0002777555,0.865144,0.0002422915,0.00008797858,0.0002890859,0.000505831,0.0002726199,0.0138761],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01067389,"threshold_uncertainty_score":0.03570771,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02218531080508962,"score_gpt":0.2459469508847347,"score_spread":0.2237616400796451,"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."}}