{"id":"W2125293312","doi":"10.1007/s00453-014-9893-5","title":"Space–Time Trade-offs for Stack-Based Algorithms","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Monotone polygon; Simple polygon; Algorithm; Polygon covering; Binary logarithm; Polygon (computer graphics); Stack (abstract data type); Amortized analysis; Theory of computation; Computational geometry; Mathematics; Bounded function; Time complexity; Regular polygon; Workspace; Rectilinear polygon; Combinatorics; Computer science; Simple (philosophy); Data structure; Frame (networking); Geometry","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.000424101,0.0001693183,0.0001866762,0.0001494957,0.000200439,0.0001434147,0.0005021621,0.00007650051,0.00002379427],"category_scores_gemma":[0.00008349966,0.0001682039,0.0001215323,0.0004068293,0.00003207866,0.0002731288,0.00005719695,0.00008525459,0.0001142179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003951242,"about_ca_system_score_gemma":0.0001079548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004022007,"about_ca_topic_score_gemma":7.800595e-7,"domain_scores_codex":[0.9986207,0.00007229175,0.0002288497,0.000458676,0.0003000283,0.0003194394],"domain_scores_gemma":[0.998894,0.0003879297,0.00008725482,0.0004007212,0.0000958274,0.0001342325],"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.00001681145,0.0001913336,0.00001060595,0.00002792852,0.00003950042,0.000003314914,0.0001416618,0.01024713,0.003289947,0.06145078,0.02105544,0.9035255],"study_design_scores_gemma":[0.0006413953,0.000204384,0.0001830394,0.000006791128,0.000008199713,0.000005273077,0.000001662585,0.868778,0.01264879,0.007099006,0.1102141,0.0002093727],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007269135,0.00004441128,0.9925156,0.005046772,0.0005213025,0.0002930581,0.00001543195,0.0002203388,0.0006162366],"genre_scores_gemma":[0.102449,0.000001570132,0.893834,0.001641217,0.0008409346,0.00008312511,0.0001052976,0.00002348635,0.00102139],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9033162,"threshold_uncertainty_score":0.6859157,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01165814548503848,"score_gpt":0.2395651226752478,"score_spread":0.2279069771902093,"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."}}