{"id":"W2065457428","doi":"10.5555/365411.365526","title":"Representing dynamic binary trees succinctly","year":2001,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary number; Representation (politics); Amortized analysis; Binary tree; Computer science; Constant (computer programming); Binary search tree; Weight-balanced tree; Contrast (vision); Binary decision diagram; Theoretical computer science; Data structure; Binary expression tree; Discrete mathematics; Combinatorics; Mathematics; Algorithm; Arithmetic; Programming language; Artificial intelligence","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003853008,0.0003970475,0.0003481179,0.0002646864,0.0004566326,0.0004174401,0.001778662,0.0001394564,0.00006448552],"category_scores_gemma":[0.00003178145,0.0003287522,0.0001930721,0.0007368957,0.00008209708,0.001245952,0.000985734,0.0003354245,0.0003039983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008991072,"about_ca_system_score_gemma":0.0000590415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001414187,"about_ca_topic_score_gemma":0.00001348934,"domain_scores_codex":[0.9967613,0.000143461,0.0004694767,0.001154334,0.0007161075,0.0007553714],"domain_scores_gemma":[0.9974396,0.000148686,0.0001947939,0.001856688,0.00008706294,0.0002731265],"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.0004411826,0.002202276,0.008662325,0.0001422557,0.000502488,0.005461508,0.003240625,0.01314551,0.1060305,0.04188257,0.04050666,0.7777821],"study_design_scores_gemma":[0.001013409,0.0005040609,0.008782722,0.0001487559,0.00002021061,0.0001851844,0.00008188678,0.942977,0.002026732,0.002033722,0.04139578,0.0008305701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06855462,0.001254701,0.8618143,0.01500827,0.003866215,0.0009914747,0.00008471026,0.002114367,0.04631139],"genre_scores_gemma":[0.8754609,0.001361155,0.1093397,0.001647513,0.0009435302,0.0001319522,0.0002357891,0.0001437246,0.01073574],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9298314,"threshold_uncertainty_score":0.9999164,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01167444419750935,"score_gpt":0.2667827410708196,"score_spread":0.2551082968733102,"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."}}