{"id":"W2079850117","doi":"10.1007/s00453-011-9528-z","title":"Succinct and I/O Efficient Data Structures for Traversal in Trees","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Tree traversal; Combinatorics; Tree (set theory); Path (computing); Constant (computer programming); Mathematics; Binary tree; Binary logarithm; Data structure; Theory of computation; Discrete mathematics; Binary number; Node (physics); Physics; Algorithm; Computer science; Arithmetic","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.001153272,0.0009463045,0.0009284649,0.00184939,0.001050412,0.003203457,0.00206105,0.001275696,0.005980968],"category_scores_gemma":[0.01042089,0.0008056532,0.0009738076,0.005107016,0.001705489,0.00724615,0.002793347,0.00272424,0.001947369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001580245,"about_ca_system_score_gemma":0.002109798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001682954,"about_ca_topic_score_gemma":0.003657682,"domain_scores_codex":[0.9980122,0.0003022883,0.0002733123,0.0002237852,0.0009571969,0.0002312212],"domain_scores_gemma":[0.9932388,0.002554197,0.0005694556,0.002634992,0.0007966627,0.0002059322],"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.001339336,0.0005718854,0.00377946,0.0008993282,0.0000827145,0.0003312486,0.001124435,0.08614676,0.0259399,0.3028793,0.04237443,0.5345312],"study_design_scores_gemma":[0.0002679017,0.0003222699,0.001042493,0.0002850495,0.0001297249,0.0004849682,0.0005020568,0.3631288,0.04252267,0.5664468,0.02477058,0.00009665485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07749564,0.0017405,0.9041713,0.001646284,0.0002830375,0.0002179492,0.002129917,0.003457935,0.008857314],"genre_scores_gemma":[0.3849152,0.001365857,0.5929347,0.0006854663,0.0002545057,0.0004971121,0.006022656,0.001386,0.01193846],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005980968,"threshold_uncertainty_score":0.02000833,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05772345621798793,"score_gpt":0.2688078761154939,"score_spread":0.211084419897506,"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."}}