On the public citation graph
Optimal Binary Identification Procedures
0 signed · 152 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.1016/s0019-9958(61)80002-8openalex-snapshot
On various versions of the defective coin problem
inferredcites →https://doi.org/10.1080/00029890.1959.11989389openalex-snapshot
An Optimal Search Procedure
inferredcites →https://doi.org/10.1109/jrproc.1952.273898openalex-snapshot
A Method for the Construction of Minimum-Redundancy Codes
inferredcites →https://doi.org/10.1137/0121057openalex-snapshot
Optimal Computer Search Trees and Variable-Length Alphabetical Codes
inferredcites →https://doi.org/10.1145/321341.321343openalex-snapshot
Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time
inferredcites →https://doi.org/10.1287/opre.7.4.468openalex-snapshot
An Optimum Policy for Detecting a Fault in a Complex System
inferredcites →https://doi.org/10.1287/opre.8.4.512openalex-snapshot
Optimum Search Routines for Automatic Fault Location
inferredcites →https://doi.org/10.2307/1266636openalex-snapshot
Binomial Group-Testing with an Unknown Proportion of Defectives
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20025openalex-snapshot
Data structures for maintaining set partitions
inferred← citeshttps://doi.org/10.1007/11513988_36openalex-snapshot
Efficient Monitoring of ω-Languages
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_239openalex-snapshot
Point probe decision trees for geometric concept classes
inferred← citeshttps://doi.org/10.1007/3-540-59286-5_57openalex-snapshot
The power of decision tables
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-39031-9_6openalex-snapshot
Diagnosis of Constant Faults in Switching Networks
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-319-01866-9_13openalex-snapshot
Relationships Among Various Parameters for Decision Tree Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-91839-6_4openalex-snapshot
Different Kinds of Decision Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_1openalex-snapshot
Approximating Optimal Binary Decision Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_19openalex-snapshot
Approximating Decision Trees with Multiway Branches
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_45openalex-snapshot
On the Complexity of Searching in Trees: Average-Case Minimization
inferred← citeshttps://doi.org/10.1007/978-3-642-15552-9_14openalex-snapshot
Adaptive and Generic Corner Detection Based on the Accelerated Segment Test
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-22012-8_48openalex-snapshot
Content Search through Comparisons
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-24425-4_26openalex-snapshot
Constructing an Optimal Decision Tree for FAST Corner Point Detection
inferred← citeshttps://doi.org/10.1007/978-3-642-28699-5_2openalex-snapshot
Extensions of Dynamic Programming as a New Tool for Decision Tree Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-30341-8_3openalex-snapshot
Comparison of Greedy Algorithms for Decision Tree Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-51883-6_20openalex-snapshot
A Study of Selection Criteria for Constructing Identification Keys
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_20openalex-snapshot
Trading off Worst and Expected Cost in Decision Tree Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-62798-3_1openalex-snapshot
Decision Trees with at Most 19 Vertices for Knowledge Representation
inferred← citeshttps://doi.org/10.1007/978-94-009-5113-6_12openalex-snapshot
Principles of Group Testing and an Application to the Design and Analysis of Multi-Access Protocols
inferred← citeshttps://doi.org/10.1007/bf00263588openalex-snapshot
Performance bounds on the splitting algorithm for binary testing
inferred← citeshttps://doi.org/10.1007/bf00290148openalex-snapshot
Performance bounds for binary testing with arbitrary weights
inferred← citeshttps://doi.org/10.1007/s00453-011-9510-9openalex-snapshot
Approximating Optimal Binary Decision Trees
inferred← citeshttps://doi.org/10.1007/s00453-012-9715-6openalex-snapshot
Improved Approximation Algorithms for the Average-Case Tree Searching Problem
inferred← citeshttps://doi.org/10.1007/s00453-016-0211-2openalex-snapshot
Trading Off Worst and Expected Cost in Decision Tree Problems
inferred← citeshttps://doi.org/10.1007/s00453-016-0225-9openalex-snapshot
Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost
inferred← citeshttps://doi.org/10.1007/s10618-010-0174-xopenalex-snapshot
Optimal constraint-based decision tree induction from itemset lattices
inferred← citeshttps://doi.org/10.1007/s10618-022-00884-7openalex-snapshot
Regularized impurity reduction: accurate decision trees with complexity guarantees
inferred← citeshttps://doi.org/10.1007/s10994-010-5167-xopenalex-snapshot
Algorithms for optimal dyadic decision trees
inferred← citeshttps://doi.org/10.1007/s11771-013-1876-1openalex-snapshot
Sequential fault diagnosis strategy with imperfect tests considering life cycle cost
inferred← citeshttps://doi.org/10.1016/0020-0190(76)90095-8openalex-snapshot
Constructing optimal binary decision trees is NP-complete
inferred← citeshttps://doi.org/10.1016/0020-0255(91)90039-wopenalex-snapshot
A binary decision algorithm
inferred← citeshttps://doi.org/10.1016/0165-0114(87)90102-3openalex-snapshot
A route-choosing medical diagnostic technique
inferred← citeshttps://doi.org/10.1016/0378-3758(81)90048-3openalex-snapshot
Selection criteria for the construction of efficient diagnostic keys
inferred← citeshttps://doi.org/10.1016/0743-7315(87)90039-6openalex-snapshot
Finding test-and-treatment procedures using parallel computation
inferred← citeshttps://doi.org/10.1016/j.asoc.2019.105802openalex-snapshot
Optimizing sequential diagnostic strategy for large-scale engineering systems using a quantum-inspired genetic algorithm: A comparative study
inferred← citeshttps://doi.org/10.1016/j.cja.2013.04.054openalex-snapshot
Test sequencing problem arising at the design stage for reducing life cycle cost
inferred← citeshttps://doi.org/10.1016/j.dam.2002.08.001openalex-snapshot
Sequential testing of complex systems: a review
inferred← citeshttps://doi.org/10.1016/j.dam.2004.06.002openalex-snapshot
On the hardness of the minimum height decision tree problem
inferred← citeshttps://doi.org/10.1016/j.dam.2013.08.009openalex-snapshot
Diagnosis of constant faults in iteration-free circuits over monotone basis
inferred← citeshttps://doi.org/10.1016/j.dam.2014.10.034openalex-snapshot
Diagnosis of constant faults in read-once contact networks over finite bases
inferred← citeshttps://doi.org/10.1016/j.dam.2015.10.030openalex-snapshot
Decision trees with minimum average depth for sorting eight elements
inferred← citeshttps://doi.org/10.1016/j.dam.2016.07.009openalex-snapshot
Totally optimal decision trees for Boolean functions
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.06.026openalex-snapshot
Multi-stage optimization of decision and inhibitory trees for decision tables with many-valued decisions
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.10.021openalex-snapshot
Bi-criteria optimization of decision trees with applications to data analysis
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.02.006openalex-snapshot
Approximating decision trees with value dependent testing costs
inferred← citeshttps://doi.org/10.1016/j.jda.2006.03.002openalex-snapshot
A note on data structures for maintaining bipartitions
inferred← citeshttps://doi.org/10.1016/j.microrel.2016.12.017openalex-snapshot
Methods of sequential test optimization in dynamic environment
inferred← citeshttps://doi.org/10.1016/j.procs.2014.08.132openalex-snapshot
Total Path Length and Number of Terminal Nodes for Decision Trees
inferred← citeshttps://doi.org/10.1016/j.ress.2018.06.002openalex-snapshot
Novel solution for sequential fault diagnosis based on a growing algorithm
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.2016.03.023openalex-snapshot
Diagnosis of three types of constant faults in read-once contact networks over finite bases
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.034openalex-snapshot
Exact learning from an honest teacher that answers membership queries
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00320-9openalex-snapshot
Optimal binary search trees
inferred← citeshttps://doi.org/10.1016/s0954-1810(00)00004-2openalex-snapshot
Fault diagnosis competitive neural network with prioritized modification rule of connection weights
inferred← citeshttps://doi.org/10.1080/00207168408803398openalex-snapshot
Conversion of limited entry decision tables to computer programs
inferred← citeshttps://doi.org/10.1080/02564602.2015.1103669openalex-snapshot
Speed-up Feature Detector using Adaptive Accelerated Segment Test
inferred← citeshttps://doi.org/10.1080/03081079.2013.798902openalex-snapshot
Optimization and analysis of decision trees and rules: dynamic programming approach
inferred← citeshttps://doi.org/10.1093/biomet/62.3.665openalex-snapshot
A Comparison of Different Criteria for Selecting Binary Tests in Diagnostic Keys
inferred← citeshttps://doi.org/10.1093/biomet/64.3.589openalex-snapshot
Functions for Selecting Tests in Diagnostic Key Construction
inferred← citeshttps://doi.org/10.1109/18.370098openalex-snapshot
Minimum average cost testing for partially ordered components
inferred← citeshttps://doi.org/10.1109/21.105086openalex-snapshot
Application of heuristic search and information theory to sequential fault diagnosis
inferred← citeshttps://doi.org/10.1109/21.148415openalex-snapshot
On a generalized test sequencing problem
inferred← citeshttps://doi.org/10.1109/34.476006openalex-snapshot
An active testing model for tracking roads in satellite images
inferred← citeshttps://doi.org/10.1109/3468.736357openalex-snapshot
Optimal and near-optimal test sequencing algorithms with realistic test models
inferred← citeshttps://doi.org/10.1109/3468.747850openalex-snapshot
Test sequencing problems arising in test planning and design for testability
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/54.84239openalex-snapshot
System complexity and integrated diagnostics
inferred← citeshttps://doi.org/10.1109/62.64988openalex-snapshot
START: System Testability Analysis and Research Tool
inferred← citeshttps://doi.org/10.1109/69.634747openalex-snapshot
Sequential decision models for expert system optimization
inferred← citeshttps://doi.org/10.1109/autest.1990.111540openalex-snapshot
START: System Testability Analysis and Research Tool
inferred← citeshttps://doi.org/10.1109/autest.2002.1047898openalex-snapshot
Rollout strategies for sequential fault diagnosis
inferred← citeshttps://doi.org/10.1109/autest.2003.1243577openalex-snapshot
On multi-mode test sequencing problem
inferred← citeshttps://doi.org/10.1109/icccas.2018.8768976openalex-snapshot
An Novel Testing Sequence Optimization Method under Dynamic Environments
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00091openalex-snapshot
Cost-Effective Algorithms for Average-Case Interactive Graph Search
inferred← citeshttps://doi.org/10.1109/icemi.2007.4350684openalex-snapshot
An Optimized Algorithm Based on Information Entropy for System-Level Fault Isolation Strategy
inferred← citeshttps://doi.org/10.1109/icemi46757.2019.9101550openalex-snapshot
Mixture test strategy optimization based on heuristic programming
inferred← citeshttps://doi.org/10.1109/icisa.2014.6847403openalex-snapshot
Feature Detector Using Adaptive Accelerated Segment Test
inferred← citeshttps://doi.org/10.1109/icmlc.2007.4370575openalex-snapshot
On a Multivalued Test Sequencing Problem
inferred← citeshttps://doi.org/10.1109/icpr48806.2021.9412848openalex-snapshot
Graph Discovery for Visual Test Generation
inferred← citeshttps://doi.org/10.1109/icsmc.1989.71497openalex-snapshot
Test sequencing in modular systems
inferred← citeshttps://doi.org/10.1109/icwsi.1992.171827openalex-snapshot
Optimal group diagnosis procedures for VLSI/WSI array architectures
inferred← citeshttps://doi.org/10.1109/iscid.2009.18openalex-snapshot
A New Method for Sequential Fault Diagnosis Based on Ant Algorithm
inferred← citeshttps://doi.org/10.1109/isic.1988.65446openalex-snapshot
Application of heuristic search and information theory to sequential fault diagnosis
inferred← citeshttps://doi.org/10.1109/isit.2011.6034280openalex-snapshot
Compression with graphical constraints: An interactive browser
inferred← citeshttps://doi.org/10.1109/itnec.2019.8729330openalex-snapshot
A Fast Feature Extraction Process for Visual SLAM
inferred← citeshttps://doi.org/10.1109/ojse.2022.3222731openalex-snapshot
A Mathematical Approach to Design Verification Strategies That Incorporate Corrective Activities as Dedicated Decisions
inferred← citeshttps://doi.org/10.1109/sahcn.2009.5168934openalex-snapshot
Fault Localization Using Passive End-to-End Measurement and Sequential Testing for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/sieds61124.2024.10534737openalex-snapshot
Explaining Tree-Based Regression Model Predictions with Nearest Training Neighbors
inferred← citeshttps://doi.org/10.1109/tc.1972.5009013openalex-snapshot
Simple Binary Identification Problems
inferred← citeshttps://doi.org/10.1109/tc.1977.1674766openalex-snapshot
Diagnosis of Intermittent Faults in Combinational Networks
inferred← citeshttps://doi.org/10.1109/tc.1984.1676411openalex-snapshot
Sequential Fault Diagnosis of Modular Systems
inferred← citeshttps://doi.org/10.1109/tit.1982.1056522openalex-snapshot
Application of information theory to the construction of efficient decision trees
inferred← citeshttps://doi.org/10.1109/tit.2011.2169296openalex-snapshot
Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations
inferred← citeshttps://doi.org/10.1109/tit.2015.2418284openalex-snapshot
From Small-World Networks to Comparison-Based Search
inferred← citeshttps://doi.org/10.1109/tit.2024.3428699openalex-snapshot
Bounds and Algorithms for Alphabetic Codes and Binary Search Trees
inferred← citeshttps://doi.org/10.1109/tmc.2011.98openalex-snapshot
Fault Localization Using Passive End-to-End Measurements and Sequential Testing for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tsmca.2003.809206openalex-snapshot
Rollout strategies for sequential fault diagnosis
inferred← citeshttps://doi.org/10.1109/tsmca.2007.893459openalex-snapshot
Bottom-Up Construction of Minimum-Cost and/ or Trees for Sequential Fault Diagnosis
inferred← citeshttps://doi.org/10.1109/tsmcb.2004.825940openalex-snapshot
On a Multimode Test Sequencing Problem
inferred← citeshttps://doi.org/10.1109/wcse.2009.659openalex-snapshot
An Heuristic Genetic Algorithm Solve Test Point Selecting with Unreliable Test
inferred← citeshttps://doi.org/10.1137/0134030openalex-snapshot
A Note on Hypergeometric Group Testing Procedures
inferred← citeshttps://doi.org/10.1137/0137030openalex-snapshot
Some Realizability Theorems in Group Testing
inferred← citeshttps://doi.org/10.1137/0608062openalex-snapshot
Some Completeness Results on Decision Trees and Group Testing
inferred← citeshttps://doi.org/10.1145/1265530.1265538openalex-snapshot
Decision trees for entity identification
inferred← citeshttps://doi.org/10.1145/1281192.1281250openalex-snapshot
Mining optimal decision trees from itemset lattices
inferred← citeshttps://doi.org/10.1145/160985.161167openalex-snapshot
Decision trees for geometric models
inferred← citeshttps://doi.org/10.1145/170088.170391openalex-snapshot
Speculative query evaluation over databases of plans
inferred← citeshttps://doi.org/10.1145/1921659.1921661openalex-snapshot
Decision trees for entity identification
inferred← citeshttps://doi.org/10.1145/357114.357120openalex-snapshot
The Activity of a Variable and Its Relation to Decision Trees
inferred← citeshttps://doi.org/10.1177/1748006x18770356openalex-snapshot
Fault diagnostic strategy of multivalued attribute system based on growing algorithm
inferred← citeshttps://doi.org/10.1214/009053605000000174openalex-snapshot
Hierarchical testing designs for pattern recognition
inferred← citeshttps://doi.org/10.1287/opre.26.1.111openalex-snapshot
Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.8893openalex-snapshot
Robust Winners and Winner Determination Policies under Candidate Uncertainty
inferred← citeshttps://doi.org/10.21203/rs.3.rs-7337679/v1openalex-snapshot
An AEALSCE-based optimization method of sequential diagnostic strategy generation
inferred← citeshttps://doi.org/10.21236/ada543980openalex-snapshot
Modeling Complex System Testing: Characterizing Test Coverage to Improve Information Return
inferred← citeshttps://doi.org/10.31234/osf.io/bxdf4openalex-snapshot
Towards a theory of heuristic and optimal planning for sequential information search
inferred← citeshttps://doi.org/10.3390/s151025592openalex-snapshot
Optimal Sequential Diagnostic Strategy Generation Considering Test Placement Cost for Multimode Systems
inferred← citeshttps://doi.org/10.3390/s22062138openalex-snapshot
Test Strategy Optimization Based on Soft Sensing and Ensemble Belief Measurement
inferred← citeshttps://doi.org/10.3837/tiis.2020.10.005openalex-snapshot
Knowledge Representation Using Decision Trees Constructed Based on Binary Splits
inferred← citeshttps://doi.org/10.4230/lipics.cp.2026.29openalex-snapshot
Efficient Explanations for Rule Ensembles
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2013.550openalex-snapshot
Constrained Binary Identification Problem
inferred← citeshttps://doi.org/10.48129/kjs.10725openalex-snapshot
A Bi-criteria Optimization Model for Adjusting the Decision Tree Parameters
inferred← citeshttps://doi.org/10.48550/arxiv.1002.4019openalex-snapshot
Query Learning with Exponential Query Costs
inferred← citeshttps://doi.org/10.48550/arxiv.1802.07427openalex-snapshot
Active Learning with Partial Feedback
inferred← citeshttps://doi.org/10.48550/arxiv.2007.12652openalex-snapshot
MurTree: Optimal Classification Trees via Dynamic Programming and Search
inferred← citeshttps://doi.org/10.5900/su_fens_wp.2012.19826openalex-snapshot
Hardness and inapproximability results for minimum verification set and minimum path decision tree problems
inferred← citeshttps://doi.org/10.70675/2f8b632dze5d0z4326zb0adza5c1ced5ccd6openalex-snapshot
Etude de la confusion des descripteurs locaux de points d'intérêt : application à la mise en correspondance d'images de documents
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.