On the public citation graph
Optimum binary search trees
0 signed · 422 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1959.tb01583.xopenalex-snapshot
Variable-Length Binary Encodings
inferredcites →https://doi.org/10.1016/0020-0271(69)90016-3openalex-snapshot
Direct selection of keywords for the KWIC index
inferredcites →https://doi.org/10.1016/s0019-9958(60)90901-3openalex-snapshot
On the efficiency of a new method of dictionary construction
inferredcites →https://doi.org/10.1093/comjnl/2.1.1openalex-snapshot
Techniques for the Recording of, and Reference to data in a Computer
inferredcites →https://doi.org/10.1145/321105.321108openalex-snapshot
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
inferredcites →https://doi.org/10.1145/357980.358005openalex-snapshot
An efficient context-free parsing algorithm
inferredcites →https://doi.org/10.1145/365696.365702openalex-snapshot
A contribution to the development of ALGOL
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.3230070402openalex-snapshot
Tree decomposition algorithm for large networks
inferred← citeshttps://doi.org/10.1002/spe.2213openalex-snapshot
Drawing non-layered tidy trees in linear time
inferred← citeshttps://doi.org/10.1002/spe.4380200705openalex-snapshot
A node‐positioning algorithm for general trees
inferred← citeshttps://doi.org/10.1006/cviu.1998.0682openalex-snapshot
Symbolic Compression and Processing of Document Images
inferred← citeshttps://doi.org/10.1006/jagm.1996.0004openalex-snapshot
Weighted Binary Trees for Concurrent Searching
inferred← citeshttps://doi.org/10.1006/jmaa.2000.6940openalex-snapshot
N Degrees of Separation: Influences of Dynamic Programming on Computer Science
inferred← citeshttps://doi.org/10.1007/0-387-25036-0_2openalex-snapshot
Problems in Data Structures and Algorithms
inferred← citeshttps://doi.org/10.1007/11427186_49openalex-snapshot
How to Splay for loglogN-Competitiveness
inferred← citeshttps://doi.org/10.1007/11561071_22openalex-snapshot
Optimal Integer Alphabetic Trees in Linear Time
inferred← citeshttps://doi.org/10.1007/3-540-07407-4_4openalex-snapshot
Best possible bounds on the weighted path length of optimum binary search trees
inferred← citeshttps://doi.org/10.1007/3-540-09526-8_10openalex-snapshot
Searching, sorting and information theory
inferred← citeshttps://doi.org/10.1007/3-540-09526-8_25openalex-snapshot
On the weighted path length of binary search trees for unknown access probabilities
inferred← citeshttps://doi.org/10.1007/3-540-10291-4_16openalex-snapshot
The analysis of search trees: A survey
inferred← citeshttps://doi.org/10.1007/3-540-16811-7_194openalex-snapshot
Parallel dynamic programming algorithms
inferred← citeshttps://doi.org/10.1007/3-540-33279-0_1openalex-snapshot
An Algorithmic Framework for Adaptive Web Content
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_31openalex-snapshot
Efficient Expected-Case Algorithms for Planar Point Location
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_2openalex-snapshot
General Splay: A Basic Theory and Calculus
inferred← citeshttps://doi.org/10.1007/3-540-48109-5_13openalex-snapshot
Network-Diffused Media Scaling for Multimedia Content Services
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_17openalex-snapshot
On an Optimal Split Tree Problem
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_21openalex-snapshot
Strategies for Searching with Different Access Costs
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_63openalex-snapshot
Algorithms for rectilinear optimal multicast tree problem
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_74openalex-snapshot
A simple file structure for the weighted dictionary problem
inferred← citeshttps://doi.org/10.1007/3-540-57811-0_13openalex-snapshot
Efficient reorganization of binary search trees
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_5openalex-snapshot
A new algorithm for the construction of optimal B-trees
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_92openalex-snapshot
On a sublinear time parallel construction of optimal binary search trees
inferred← citeshttps://doi.org/10.1007/3-540-61576-8_86openalex-snapshot
Optimum alphabetic binary trees
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_263openalex-snapshot
O(log log n)‐competitive Binary Search Tree
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_28openalex-snapshot
Advanced Techniques for Dynamic Programming
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_5openalex-snapshot
Efficient Algorithms with Applications to Molecular Biology
inferred← citeshttps://doi.org/10.1007/978-1-4615-3422-8_19openalex-snapshot
Mixed-Radix Huffman Codes
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_263openalex-snapshot
O(log log n)-Competitive Binary Search Tree
inferred← citeshttps://doi.org/10.1007/978-3-030-59152-6_2openalex-snapshot
Verified Textbook Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-67731-2_19openalex-snapshot
On the Redundancy of D-Ary Fano Codes
inferred← citeshttps://doi.org/10.1007/978-3-031-30445-3_5openalex-snapshot
NPDP Benchmark Suite for Loop Tiling Effectiveness Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_19openalex-snapshot
Classification via Two-Way Comparisons (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-031-81396-2_8openalex-snapshot
Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-82014-4_7openalex-snapshot
Old and New Results on Alphabetic Codes
inferred← citeshttps://doi.org/10.1007/978-3-031-85700-3_12openalex-snapshot
LLM-Driven Cross-Platform Code Generation for Polyhedral Optimized NPDP Codes
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_15openalex-snapshot
The Power and Limitations of Static Binary Search Trees with Lazy Finger
inferred← citeshttps://doi.org/10.1007/978-3-319-32467-8_57openalex-snapshot
Deriving CGM Based-Parallel Algorithms for the Optimal Binary Search-Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-40253-6_22openalex-snapshot
Towards Efficient Fully Randomized Message-Locked Encryption
inferred← citeshttps://doi.org/10.1007/978-3-319-49046-5_5openalex-snapshot
Sequential Decision Process Supported by a Compositional Model
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_44openalex-snapshot
Offline Drawing of Dynamic Trees: Algorithmics and Document Integration
inferred← citeshttps://doi.org/10.1007/978-3-319-63558-3_47openalex-snapshot
Fast Subsumption Between Rooted Labeled Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-94361-9_15openalex-snapshot
Exploring Trends of Lung Cancer Research Based on Word Representation
inferred← citeshttps://doi.org/10.1007/978-3-322-91855-0_4openalex-snapshot
Dynamische Datenstrukturen
inferred← citeshttps://doi.org/10.1007/978-3-322-96663-6_5openalex-snapshot
Dynamische Datenstrukturen
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_55openalex-snapshot
New Ways to Construct Binary Search Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-87473-7_1openalex-snapshot
Query Responsive Index Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_3openalex-snapshot
Succinct Greedy Graph Drawing in the Hyperbolic Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_21openalex-snapshot
Efficient Construction of Near-Optimal Binary and Multiway Search Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_7openalex-snapshot
Reflections on Optimal and Nearly Optimal Binary Search Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_67openalex-snapshot
Short Labels for Lowest Common Ancestors in Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_79openalex-snapshot
Succinct Greedy Geometric Routing in the Euclidean Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-14192-8_8openalex-snapshot
Binary Priority List for Prioritizing Software Requirements
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_38openalex-snapshot
On the Huffman and Alphabetic Tree Problem with General Cost Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-17226-7_2openalex-snapshot
Efficient Decision Tree Re-alignment for Clustering Time-Changing Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-642-17514-5_18openalex-snapshot
On Greedy Algorithms for Decision Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_12openalex-snapshot
Should Static Search Trees Ever Be Unbalanced?
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_22openalex-snapshot
Binary Identification Problems for Weighted Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-22555-0_49openalex-snapshot
Performance of Routing Lookups
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_263-2openalex-snapshot
O(log logn)-Competitive Binary Search Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_11openalex-snapshot
De-amortizing Binary Search Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_10openalex-snapshot
A History of Distribution-Sensitive Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_65openalex-snapshot
Biased Predecessor Search
inferred← citeshttps://doi.org/10.1007/978-3-642-95289-0_22openalex-snapshot
Binary Search Trees: Average and Worst Case Behavior (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-95388-0_3openalex-snapshot
Realisierung von operationalen Schnittstellen
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_7openalex-snapshot
Optimal Search Trees with 2-Way Comparisons
inferred← citeshttps://doi.org/10.1007/978-94-009-2411-6_11openalex-snapshot
Some Results on VLSI Parallel Algorithms
inferred← citeshttps://doi.org/10.1007/978-94-009-7019-9_3openalex-snapshot
An Analysis of Choice in Program Design
inferred← citeshttps://doi.org/10.1007/978-981-97-2340-9_9openalex-snapshot
A Tight Threshold Bound for Search Trees with 2-Way Comparisons
inferred← citeshttps://doi.org/10.1007/bf00263193openalex-snapshot
On the costs of optimal and near-optimal binary search trees
inferred← citeshttps://doi.org/10.1007/bf00264563openalex-snapshot
Nearly optimal binary search trees
inferred← citeshttps://doi.org/10.1007/bf00269807openalex-snapshot
Binary search trees in secondary memory
inferred← citeshttps://doi.org/10.1007/bf00289093openalex-snapshot
Dynamic weighted binary search trees
inferred← citeshttps://doi.org/10.1007/bf00289139openalex-snapshot
Optimal multiway search trees for variable size keys
inferred← citeshttps://doi.org/10.1007/bf00289510openalex-snapshot
Least upper bound on the cost of optimum binary search trees
inferred← citeshttps://doi.org/10.1007/bf01210592openalex-snapshot
The optimal binary search tree for Andersson's search algorithm
inferred← citeshttps://doi.org/10.1007/bf01840380openalex-snapshot
On heuristics for minimum length rectilinear partitions
inferred← citeshttps://doi.org/10.1007/bf01896963openalex-snapshot
Some remarks on the construction of optimal codes
inferred← citeshttps://doi.org/10.1007/bf01931268openalex-snapshot
Optimal search trees and length restricted codes
inferred← citeshttps://doi.org/10.1007/bf01931282openalex-snapshot
A note on optimal multiway split trees
inferred← citeshttps://doi.org/10.1007/bf02017342openalex-snapshot
On the construction of weighted time-optimal B-trees
inferred← citeshttps://doi.org/10.1007/bf03159564openalex-snapshot
Echtzeit-Suchprozessor-Architekturen
inferred← citeshttps://doi.org/10.1007/bfb0017305openalex-snapshot
Dynamic k-dimensional multiway search under time-varying access frequencies
inferred← citeshttps://doi.org/10.1007/bfb0045096openalex-snapshot
Construction of nearly optimal multiway trees
inferred← citeshttps://doi.org/10.1007/bfb0120912openalex-snapshot
Optimization problems arising from the incorporation of split values in search trees
inferred← citeshttps://doi.org/10.1007/pl00009175openalex-snapshot
Parallel Searching in Generalized Monge Arrays
inferred← citeshttps://doi.org/10.1007/s00037-011-0028-yopenalex-snapshot
Toward a Model for Backtracking and Dynamic Programming
inferred← citeshttps://doi.org/10.1007/s001860050007openalex-snapshot
Isotonicity of minimizers in polychotomous discrete interval search via lattice programming
inferred← citeshttps://doi.org/10.1007/s00224-005-1281-8openalex-snapshot
Compact Labeling Scheme for XML Ancestor Queries
inferred← citeshttps://doi.org/10.1007/s00236-021-00411-zopenalex-snapshot
On Huang and Wong’s algorithm for generalized binary split trees
inferred← citeshttps://doi.org/10.1007/s00453-001-0057-zopenalex-snapshot
Efficient Reorganization of Binary Search Trees
inferred← citeshttps://doi.org/10.1007/s00453-013-9755-6openalex-snapshot
On the Huffman and Alphabetic Tree Problem with General Cost Functions
inferred← citeshttps://doi.org/10.1007/s00453-016-0224-xopenalex-snapshot
The Power and Limitations of Static Binary Search Trees with Lazy Finger
inferred← citeshttps://doi.org/10.1007/s11390-015-1561-yopenalex-snapshot
Zip: An Algorithm Based on Loser Tree for Common Contacts Searching in Large Graphs
inferred← citeshttps://doi.org/10.1007/s41019-019-0093-9openalex-snapshot
An Efficient CGM-Based Parallel Algorithm for Solving the Optimal Binary Search Tree Problem Through One-to-All Shortest Paths in a Dynamic Graph
inferred← citeshttps://doi.org/10.1016/0020-0190(72)90015-4openalex-snapshot
Bounds on the weighted path length of binary trees
inferred← citeshttps://doi.org/10.1016/0020-0190(76)90052-1openalex-snapshot
Optimal alphabetic search trees with restricted maximal height
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90099-0openalex-snapshot
A counter example to a monotonicity property of k-d trees
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90224-lopenalex-snapshot
Construction of a tree from its traversals in optimal time and space
inferred← citeshttps://doi.org/10.1016/0022-2364(87)90278-2openalex-snapshot
Computer analysis of nuclear spin systems based on local symmetry in 2D spectra
inferred← citeshttps://doi.org/10.1016/0022-247x(86)90146-0openalex-snapshot
Richard Bellman's contributions to computer science
inferred← citeshttps://doi.org/10.1016/0031-3203(77)90004-8openalex-snapshot
Efficient decision tree design for discrete variable pattern recognition problems
inferred← citeshttps://doi.org/10.1016/0097-3165(74)90051-xopenalex-snapshot
The cost of a class of optimal binary trees
inferred← citeshttps://doi.org/10.1016/0164-1212(91)90039-9openalex-snapshot
Data compression using hierarchical dictionaries
inferred← citeshttps://doi.org/10.1016/0165-1684(91)90083-uopenalex-snapshot
A new image compression method using dynamic predictor based on current context
inferred← citeshttps://doi.org/10.1016/0166-218x(88)90097-2openalex-snapshot
Least-cost partition algorithms
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90104-vopenalex-snapshot
Monotonicity and efficient computation of optimal dichotomous search
inferred← citeshttps://doi.org/10.1016/0196-6774(84)90041-5openalex-snapshot
Optimal binary split trees
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90036-2openalex-snapshot
The optimal representation of disjoint iso-oriented rectangles in two-dimensional trees
inferred← citeshttps://doi.org/10.1016/0196-6774(87)90034-4openalex-snapshot
Optimal multiway split trees
inferred← citeshttps://doi.org/10.1016/0196-6774(87)90052-6openalex-snapshot
A subquadratic algorithm for constructing approximately optimal binary search trees
inferred← citeshttps://doi.org/10.1016/0196-6774(88)90009-0openalex-snapshot
A new proof of the Garsia-Wachs algorithm
inferred← citeshttps://doi.org/10.1016/0196-6774(89)90003-5openalex-snapshot
On an efficient dynamic programming technique of F. F. Yao
inferred← citeshttps://doi.org/10.1016/0304-3975(76)90064-5openalex-snapshot
Schranken fur balanced trees bei ausgewogenen verteilungen
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90101-1openalex-snapshot
Speeding up dynamic programming with applications to molecular biology
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90135-3openalex-snapshot
Dynamic programming with convexity, concavity and sparsity
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90258-hopenalex-snapshot
A sublinear parallel algorithm for some dynamic programming problems
inferred← citeshttps://doi.org/10.1016/0306-4573(88)90027-1openalex-snapshot
Recent trends in hierarchic document clustering: A critical review
inferred← citeshttps://doi.org/10.1016/0377-2217(85)90285-1openalex-snapshot
The optimality of balancing workloads in certain types of flexible manufacturing systems
inferred← citeshttps://doi.org/10.1016/0377-2217(94)00098-wopenalex-snapshot
Optimal sequential file search: A reduced-state dynamic programming approach
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90369-7openalex-snapshot
Optimal sequential file search
inferred← citeshttps://doi.org/10.1016/0898-1221(94)90123-6openalex-snapshot
Dynamic programming and graph optimization problems
inferred← citeshttps://doi.org/10.1016/b978-0-12-415050-8.50005-7openalex-snapshot
Data Structure Design
inferred← citeshttps://doi.org/10.1016/b978-0-7204-2262-7.50028-4openalex-snapshot
Combinatorial Search Problems
inferred← citeshttps://doi.org/10.1016/j.amc.2007.02.052openalex-snapshot
A new genetic approach to construct near-optimal binary search trees
inferred← citeshttps://doi.org/10.1016/j.anucene.2014.10.039openalex-snapshot
Algorithmic choices in WARP – A framework for continuous energy Monte Carlo neutron transport in general 3D geometries on GPUs
inferred← citeshttps://doi.org/10.1016/j.ascom.2019.100291openalex-snapshot
A processing pipeline for high volume pulsar candidate data streams
inferred← citeshttps://doi.org/10.1016/j.cagd.2013.02.004openalex-snapshot
Practical distribution-sensitive point location in triangulations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.01.005openalex-snapshot
Proximate point searching
inferred← citeshttps://doi.org/10.1016/j.dam.2020.04.016openalex-snapshot
Dynamic programming bi-criteria combinatorial optimization
inferred← citeshttps://doi.org/10.1016/j.ebiom.2016.11.033openalex-snapshot
Low Density Lipoproteins Amplify Cytokine-signaling in Chronic Lymphocytic Leukemia Cells
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.06.017openalex-snapshot
Allocating the fixed cost as a complement of other cost inputs: A DEA approach
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.09.019openalex-snapshot
Using discrete event simulation cellular automata models to determine multi-mode travel times and routes of terrestrial suppression resources to wildland fires
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.07.031openalex-snapshot
Operations research applications of dichotomous search
inferred← citeshttps://doi.org/10.1016/j.fss.2021.01.007openalex-snapshot
Robust aggregation of compositional and interval-valued data: The mode on the unit simplex
inferred← citeshttps://doi.org/10.1016/j.gene.2021.145839openalex-snapshot
Therapeutic perceptions in antisense RNA-mediated gene regulation for COVID-19
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104707openalex-snapshot
On the cost of unsuccessful searches in search trees with two-way comparisons
inferred← citeshttps://doi.org/10.1016/j.infsof.2018.11.009openalex-snapshot
VFL: Variable-based fault localization
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.03.014openalex-snapshot
Restructuring binary search trees revisited
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.10.001openalex-snapshot
Chain-splay trees, or, how to achieve and prove -competitiveness by splaying
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.11.008openalex-snapshot
Alphabetic coding with exponential costs
inferred← citeshttps://doi.org/10.1016/j.ipl.2026.106640openalex-snapshot
Optimal average-case binary search with outcome-dependent costs
inferred← citeshttps://doi.org/10.1016/j.jalgor.2005.06.001openalex-snapshot
Partial alphabetic trees
inferred← citeshttps://doi.org/10.1016/j.jallcom.2022.165173openalex-snapshot
Insights on phase formation from thermodynamic calculations and machine learning of 2436 experimentally measured high entropy alloys
inferred← citeshttps://doi.org/10.1016/j.jocs.2020.101246openalex-snapshot
3D parallel tiled code implementing a modified Knuth's optimal binary search tree algorithm
inferred← citeshttps://doi.org/10.1016/j.parco.2023.103016openalex-snapshot
NPDP benchmark suite for the evaluation of the effectiveness of automatic optimizing compilers
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.03.002openalex-snapshot
A unified access bound on comparison-based dynamic dictionaries
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.023openalex-snapshot
The binary identification problem for weighted trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.04.027openalex-snapshot
Category-based routing in social networks: Membership dimension and the small-world phenomenon
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.08.009openalex-snapshot
Extensions of dynamic programming for multi-stage combinatorial optimization
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.040openalex-snapshot
Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115589openalex-snapshot
A tight threshold bound for search trees with 2-way comparisons
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80013-9openalex-snapshot
Implicit data structures for weighted elements
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00026-xopenalex-snapshot
Optimum extensions of prefix codes
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00262-6openalex-snapshot
A strategy for searching with different access costs
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00084-1openalex-snapshot
Optimal binary search trees with costs depending on the access paths
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00296-4openalex-snapshot
Correctness of constructing optimal alphabetic trees revisited
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00320-9openalex-snapshot
Optimal binary search trees
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80204-xopenalex-snapshot
Chapter 7 Fundamental algorithms and data structures
inferred← citeshttps://doi.org/10.1017/9781316795835openalex-snapshot
Introduction to Parallel Computing
inferred← citeshttps://doi.org/10.1017/s0956796819000194openalex-snapshot
An optimal, purely functional implementation of the Garsia–Wachs algorithm
inferred← citeshttps://doi.org/10.1038/bjc.2015.238openalex-snapshot
Dexamethasone exerts profound immunologic interference on treatment efficacy for recurrent glioblastoma
inferred← citeshttps://doi.org/10.1080/00207168108803225openalex-snapshot
The construction of optimal multiway search trees and the monotonicity principle
inferred← citeshttps://doi.org/10.1080/00207168608803511openalex-snapshot
Optimal binary search trees
inferred← citeshttps://doi.org/10.1080/01621459.1974.10480141openalex-snapshot
On Finding a Single Defective in Binomial Group Testing
inferred← citeshttps://doi.org/10.1080/17445760.2022.2102168openalex-snapshot
Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem
inferred← citeshttps://doi.org/10.1101/2020.04.03.20051995openalex-snapshot
Pooling RT-PCR or NGS samples has the potential to cost-effectively generate estimates of COVID-19 prevalence in resource limited environments
inferred← citeshttps://doi.org/10.1108/02635570910926636openalex-snapshot
A data structure for supply chain management systems
inferred← citeshttps://doi.org/10.1108/eb026764openalex-snapshot
HIERARCHIC AGGLOMERATIVE CLUSTERING METHODS FOR AUTOMATIC DOCUMENT CLASSIFICATION
inferred← citeshttps://doi.org/10.1109/21.97458openalex-snapshot
A survey of decision tree classifier methodology
inferred← citeshttps://doi.org/10.1109/34.88569openalex-snapshot
Optimal partitioning for classification and regression trees
inferred← citeshttps://doi.org/10.1109/43.905675openalex-snapshot
Alphabetic trees-theory and applications in layout-driven logic synthesis
inferred← citeshttps://doi.org/10.1109/90.503764openalex-snapshot
Routing on longest-matching prefixes
inferred← citeshttps://doi.org/10.1109/access.2022.3174101openalex-snapshot
Benchmarking a New Paradigm: Experimental Analysis and Characterization of a Real Processing-in-Memory System
inferred← citeshttps://doi.org/10.1109/cason.2011.6085926openalex-snapshot
Category-based routing in social networks: Membership dimension and the small-world phenomenon
inferred← citeshttps://doi.org/10.1109/ccece.2005.1557298openalex-snapshot
IP address lookup using a dynamic hash function
showing the first 200 of 410 · page through all 410
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.