Toshihide Ibaraki

According to our database1, Toshihide Ibaraki authored at least 233 papers between 1965 and 2018.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 1999, "For contributions to the theory and algorithms of discrete optimization, graphs and networks, and logical analysis of data with Boolean functions, as well as their applications.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Experimental Evaluation of ACO for Continuous Domains to Solve Function Optimization Problems.
Proceedings of the Swarm Intelligence - 11th International Conference, 2018

Generalized Assignment Problem.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2013
Collision Probability in an In-Line Equipment Model under Erlang Distribution.
IEICE Trans. Inf. Syst., 2013

Recent progress of local search in handling the time window constraints of the vehicle routing problem.
Ann. Oper. Res., 2013

2011
Efficient branch-and-bound algorithms for weighted MAX-2-SAT.
Math. Program., 2011

Logical analysis of data: classification with justification.
Ann. Oper. Res., 2011

2010
A personal perspective on problem solving by general purpose solvers.
Int. Trans. Oper. Res., 2010

Computing Bounds on Risk-neutral Distributions from the Observed Prices of Call Options.
Asia Pac. J. Oper. Res., 2010

2009
Solving the irregular strip packing problem via guided local search for overlap minimization.
Int. Trans. Oper. Res., 2009

Scheduling of corrugated paper production.
Eur. J. Oper. Res., 2009

2008
Hybrid Metaheuristics for Packing Problems.
Proceedings of the Hybrid Metaheuristics, An Emerging Approach to Optimization, 2008

A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns.
IEICE Trans. Inf. Syst., 2008

An iterated local search algorithm for the time-dependent vehicle routing problem with time windows.
Discret. Optim., 2008

An iterated local search algorithm for the vehicle routing problem with convex time penalty functions.
Discret. Appl. Math., 2008

Integer Programming Approaches to the Problem of Network Upgrading.
Proceedings of the 2008 International Symposium on Applications and the Internet, 2008

Algorithmic Aspects of Graph Connectivity
Encyclopedia of Mathematics and its Applications 123, Cambridge University Press, ISBN: 9780511721649, 2008

2007
Generalized Assignment Problem.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Duality in option pricing based on prices of other derivatives.
Oper. Res. Lett., 2007

The complexity of assigning genotypes to people in a pedigree consistently.
Discret. Math., 2007

A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007

A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007

Collision Probability in an Automated Production Line under Erlang Distribution.
Proceedings of the 2007 IEEE International Conference on Research, 2007

2006
One-Dimensional Cutting Stock Problem with a Given Number of Setups: A Hybrid Approach of Metaheuristics and Linear Programming.
J. Math. Model. Algorithms, 2006

Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

A 3-flip neighborhood local search for the set covering problem.
Eur. J. Oper. Res., 2006

A path relinking approach with ejection chains for the generalized assignment problem.
Eur. J. Oper. Res., 2006

Minimum edge ranking spanning trees of split graphs.
Discret. Appl. Math., 2006

The vehicle routing problem with flexible time windows and traveling times.
Discret. Appl. Math., 2006

Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph.
Algorithmica, 2006

Packing Problems with Soft Rectangles.
Proceedings of the Hybrid Metaheuristics, Third International Workshop, 2006

2005
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints.
Transp. Sci., 2005

Lowering eccentricity of a tree by node upgrading.
Networks, 2005

Greedy splitting algorithms for approximating multiway partition problems.
Math. Program., 2005

Dynamic Generalized Assignment Problems with Stochastic Demands and Multiple Agent-Task Relationships.
J. Glob. Optim., 2005

Improved local search algorithms for the rectangle packing problem with general spatial costs.
Eur. J. Oper. Res., 2005

2004
An Ejection Chain Approach for the Generalized Assignment Problem.
INFORMS J. Comput., 2004

An Average Running Time Analysis of a Backtracking Algorithm to Calculate the Size of the Union of Cartesian Products.
Informatica (Slovenia), 2004

A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem.
Discret. Optim., 2004

On generalized greedy splitting algorithms for multiway partition problems.
Discret. Appl. Math., 2004

A decomposability index in logical analysis of data.
Discret. Appl. Math., 2004

Reasoning with ordered binary decision diagrams.
Discret. Appl. Math., 2004

An average running time analysis of a backtracking algorithm to calculate the measure of the union of hyperrectangles in $d$ dimensions.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Local search algorithms for the rectangle packing problem with general spatial costs.
Math. Program., 2003

A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem.
Inf. Process. Lett., 2003

Translation among CNFs, characteristic models and ordered binary decision diagrams.
Inf. Process. Lett., 2003

Variations on extending partially defined Boolean functions with missing bits.
Inf. Comput., 2003

One-dimensional cutting stock problem to minimize the number of different patterns.
Eur. J. Oper. Res., 2003

A primal-dual approximation algorithm for the survivable network design problem in hypergraphs.
Discret. Appl. Math., 2003

Interior and exterior functions of positive Boolean functions.
Discret. Appl. Math., 2003

Inferring Minimal Functional Dependencies in Horn and q-Horn Theories.
Ann. Math. Artif. Intell., 2003

Finding Essential Attributes from Binary Data.
Ann. Math. Artif. Intell., 2003

2002
Logical analysis of data with decomposable structures.
Theor. Comput. Sci., 2002

Decision lists and related Boolean functions.
Theor. Comput. Sci., 2002

Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks.
Networks, 2002

Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem.
J. Algorithms, 2002

Recognition and dualization of disguised bidual Horn functions.
Inf. Process. Lett., 2002

Graph connectivity and its augmentation: applications of MA orderings.
Discret. Appl. Math., 2002

Convex Embeddings and Bisections of 3-Connected Graphs 1.
Comb., 2002

Ordered binary decision diagrams as knowledge-bases.
Artif. Intell., 2002

Minimum Edge Ranking Spanning Trees of Threshold Graphs.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001
Disjunctions of Horn Theories and Their Cores.
SIAM J. Comput., 2001

On metaheuristic algorithms for combinatorial optimization problems.
Systems and Computers in Japan, 2001

Multigraph augmentation under biconnectivity and general edge-connectivity requirements.
Networks, 2001

Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts.
J. Comb. Optim., 2001

Augmenting a Submodular and Posi-modular Set Function by a Multigraph.
J. Comb. Optim., 2001

On Minimum Edge Ranking Spanning Trees.
J. Algorithms, 2001

Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation.
J. Heuristics, 2001

Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products.
Electron. Notes Discret. Math., 2001

Preface.
Ann. Oper. Res., 2001

On functional dependencies in q-Horn theories.
Artif. Intell., 2001

A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph.
Proceedings of the STACS 2001, 2001

A Unified Framework for Approximating Multiway Partition Problems.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

An Index for the Data Size to Extract Decomposable Structures in LAD.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000
An Implementation of Logical Analysis of Data.
IEEE Trans. Knowl. Data Eng., 2000

Boolean Normal Forms, Shellability, and Reliability Computations.
SIAM J. Discret. Math., 2000

A fast algorithm for computing minimum 3-way and 4-way cuts.
Math. Program., 2000

Totally balanced combinatorial optimization games.
Math. Program., 2000

Optimal Scheduling in Parallel and Serial Manufacturing Systems via the Maximum Principle.
J. Glob. Optim., 2000

On the Difference of Horn Theories.
J. Comput. Syst. Sci., 2000

A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs.
J. Comb. Optim., 2000

Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph.
J. Comb. Optim., 2000

Polyhedral structure of submodular and posi-modular systems.
Discret. Appl. Math., 2000

A Simplified <i>Õ</i>(<i>nm</i>) Time Edge-Splitting Algorithm in Undirected Graphs.
Algorithmica, 2000

Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits.
Proceedings of the Theoretical Computer Science, 2000

Finding Essential Attributes in Binary Data.
Proceedings of the Intelligent Data Engineering and Automated Learning, 2000

Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem.
Proceedings of the Algorithms, 2000

1999
Horn Extensions of a Partially Defined Boolean Function.
SIAM J. Comput., 1999

Algorithmic Aspects of the Core of Combinatorial Optimization Games.
Math. Oper. Res., 1999

Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT.
J. Comb. Optim., 1999

Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time.
J. Algorithms, 1999

Inner-core and Outer-core Functions of Partially Defined Boolean Functions.
Discret. Appl. Math., 1999

Bidual Horn Functions and Extensions.
Discret. Appl. Math., 1999

Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions.
Discret. Appl. Math., 1999

Functional Dependencies in Horn Theories.
Artif. Intell., 1999

Computing Intersections of Horn Theories for Reasoning with Models.
Artif. Intell., 1999

Logical Analysis of Binary Data with Missing Bits.
Artif. Intell., 1999

Bisecting Two Subsets in 3-Connected Graphs.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph.
Proceedings of the Algorithms, 1999

An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
Two Arc-Disjoint Paths in Eulerian Digraphs.
SIAM J. Discret. Math., 1998

A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions.
J. Algorithms, 1998

A Note on Minimizing Submodular Functions.
Inf. Process. Lett., 1998

Double Horn Functions.
Inf. Comput., 1998

Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions.
Inf. Comput., 1998

A tabu search approach to the constraint satisfaction problem as a general problem solver.
Eur. J. Oper. Res., 1998

A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations.
Comb., 1998

Preface: Mathematics of Industrial Systems III.
Ann. Oper. Res., 1998

On Disguised Double Horn Functions and Extensions.
Proceedings of the STACS 98, 1998

Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997
Computing All Small Cuts in an Undirected Network.
SIAM J. Discret. Math., 1997

The Maximum Latency and Identification of Positive Boolean Functions.
SIAM J. Comput., 1997

Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle.
SIAM J. Comput., 1997

Logical analysis of numerical data.
Math. Program., 1997

Complexity of the Minimum Base Game on Matroids.
Math. Oper. Res., 1997

Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs.
J. Comb. Optim., 1997

Positive and Horn Decomposability of Partially Defined Boolean Functions.
Discret. Appl. Math., 1997

Vehicle scheduling on a tree with release and handling times.
Ann. Oper. Res., 1997

Hitting or avoiding balls in Euclidean space.
Ann. Oper. Res., 1997

Preface.
Ann. Oper. Res., 1997

Computing Edge-Connectivity Augmentation Function in Õ(nm) Time.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Combinatorial Optimization Games.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Augmenting Edge and Vertex Connectivities Simultaneously.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract).
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Two-Face Horn Extensions.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Multi-frame Isochronous Service for ATM Networks: Stop-and-Go Revisited.
Proceedings of the International Conference On Computer Communications and Networks (ICCCN 1997), 1997

Monotone Extensions of Boolean Data Sets.
Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1996
Interior and Exterior Functions of Boolean Functions.
Discret. Appl. Math., 1996

Boolean Analysis of Incomplete Examples.
Proceedings of the Algorithm Theory, 1996

Deterministic <i>Õ</i>(nm) Time Edge-Splitting in Undirected Graphs.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Metaheuristics as Robust and Simple Optimization Tools.
Proceedings of 1996 IEEE International Conference on Evolutionary Computation, 1996

Data Analysis by Positive Decision Trees.
Proceedings of the International Symposium on Cooperative Database Systems for Advanced Applications, 1996

1995
Generating and Approximating Nondominated Coteries.
IEEE Trans. Parallel Distributed Syst., 1995

Complexity of Identification and Dualization of Positive Boolean Functions.
Inf. Comput., 1995

Decompositions of positive self-dual boolean functions.
Discret. Math., 1995

Optimal Coteries for Rings and Related Networks.
Distributed Comput., 1995

Preface.
Discret. Appl. Math., 1995

Decomposability of Partially Defined Boolean Functions.
Discret. Appl. Math., 1995

Two Arc Disjoint Paths in Eulerian Diagraphs.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994
Logically Instantaneous Message Passing in Asynchronous Distributed Systems.
IEEE Trans. Computers, 1994

Implementing an efficient minimum capacity cut algorithm.
Math. Program., 1994

Computing All Small Cuts in Undirected Networks.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993
A Theory of Coteries: Mutual Exclusion in Distributed Systems.
IEEE Trans. Parallel Distributed Syst., 1993

A globally convergent Newton method for solving strongly monotone variational inequalities.
Math. Program., 1993

On sparse subgraphs preserving connectivity properties.
J. Graph Theory, 1993

1992
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs.
SIAM J. Discret. Math., 1992

On the average optimality of circular assignment policy.
Queueing Syst. Theory Appl., 1992

Optimal strategies for some team games.
Discret. Appl. Math., 1992

A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control.
Discret. Appl. Math., 1992

Primal-dual proximal point algorithm for linearly constrained convex programming problems.
Comput. Optim. Appl., 1992

A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph.
Algorithmica, 1992

Optimal Coteries for Rings and Related Networks.
Proceedings of the 12th International Conference on Distributed Computing Systems, 1992

1991
Weak Three-Linking in Eulerian Digraphs.
SIAM J. Discret. Math., 1991

Maximum flows in probabilistic networks.
Networks, 1991

Chain Packing in Graphs.
Algorithmica, 1991

Boolean theory of coteries.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time.
Proceedings of the ISA '91 Algorithms, 1991

Using Relaxation Techniques to Evaluate Queries in Deductive Databases.
Proceedings of the Proceedings of the International Conference on Database and Expert Systems Applications, 1991

1990
Multiversion Cautious Schedulers for Database Concurrency Control.
IEEE Trans. Software Eng., 1990

Distributed database concurrency control by cautious schedulers with a central clock site.
Systems and Computers in Japan, 1990

Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities.
Networks, 1990

Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices.
Math. Oper. Res., 1990

Multicommodity flows in certain planar directed networks.
Discret. Appl. Math., 1990

Preface.
Discret. Appl. Math., 1990

Searching Minimax Game Trees under Memory Space Constraint.
Ann. Math. Artif. Intell., 1990

Computing Edge-Connectivity in Multiple and Capacitated Graphs.
Proceedings of the Algorithms, 1990

1989
On the Efficiency of Cautious Schedulers for Database Concurrency Control - Why Insist on Two-Phase Locking?
Real Time Syst., 1989

On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks.
Inf. Process. Lett., 1989

1988
Cautious Transaction Schedulers for Database Concurrency Control.
IEEE Trans. Software Eng., 1988

Computational complexity of the file allocation problem in distributed database systems.
Systems and Computers in Japan, 1988

Cautious Transaction Schedulers with k Versions.
Systems and Computers in Japan, 1988

Reconfiguration of a fault-tolerant rectangular systolic array.
Systems and Computers in Japan, 1988

Game Solving Procedure SSSR is Unsurpassed.
Systems and Computers in Japan, 1988

Resource allocation problems - algorithmic approaches.
MIT Press series in the foundations of computing, MIT Press, ISBN: 978-0-262-09027-8, 1988

1987
Shortest Semijoin Schedule for a Local Area Distributed Database System.
IEEE Trans. Software Eng., 1987

Serializability with Constraints.
ACM Trans. Database Syst., 1987

Parallel searches of game trees.
Systems and Computers in Japan, 1987

A class of ambiguous linear term-rewriting systems on which call-by-need is a normalizing reduction strategy.
Systems and Computers in Japan, 1987

Approximation algorithms for combinatorial fractional programming problems.
Math. Program., 1987

A parametric characterization and an ɛ-approximation scheme for the minimization of a quasiconcave program.
Discret. Appl. Math., 1987

Preface.
Discret. Appl. Math., 1987

A Cautious Scheduler for Multistep Transactions.
Algorithmica, 1987

1986
Lower bounds on time complexity for some subgraph detection problems.
Systems and Computers in Japan, 1986

Distances defined by neighborhood sequences.
Pattern Recognit., 1986

Strong unimodularity for matrices and hypergraphs.
Discret. Appl. Math., 1986

Generalization of Alpha-Beta and SSS Search Procedures.
Artif. Intell., 1986

Implementation of Parallel Prolog on Tree Machines.
Proceedings of the Fall Joint Computer Conference, November 2-6, 1986, Dallas, Texas, USA, 1986

1985
Evaluation of the File Redundancy in Distributed Database Systems.
IEEE Trans. Software Eng., 1985

Cautious Transaction Schedulers with Admission Control.
ACM Trans. Database Syst., 1985

An Algorithm for the Equipollent Resource Allocation Problem.
Math. Oper. Res., 1985

An efficient algorithm for the parametric resource allocation problem.
Discret. Appl. Math., 1985

1984
On the Optimal Nesting Order for Computing N-Relational Joins.
ACM Trans. Database Syst., 1984

1983
Design of Minimum-Cost Deadlock-Free Systems
J. ACM, October, 1983

Parametric approaches to fractional programs.
Math. Program., 1983

Using branch-and-bound algorithms to obtain suboptimal solutions.
Z. Oper. Research, 1983

On-Line Computation of Transitive Closures of Graphs.
Inf. Process. Lett., 1983

File Redundancy Issues in Distributed Database Systems.
Proceedings of the 9th International Conference on Very Large Data Bases, October 31, 1983

Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract).
Proceedings of the 9th International Conference on Very Large Data Bases, October 31, 1983

1982
Deadlock-Free Systems for a Bounded Number of Processes.
IEEE Trans. Computers, 1982

An efficient algorithm for K shortest simple paths.
Networks, 1982

1981
On Minimal Test Sets for Locating Single Link Failures in Networks.
IEEE Trans. Computers, 1981

An Algorithm for Finding K Minimum Spanning Trees.
SIAM J. Comput., 1981

An Algorithm for the K Best Solutions of the Resource Allocation Problem.
J. ACM, 1981

1980
The number of additional variables required for the integer programming formulation.
Discret. Appl. Math., 1980

1978
Finite Automata Having Cost Functions: Nondeterministic Models
Inf. Control., April, 1978

Branch-and-Bound Procedure and State-Space Representation of Combinatorial Optimization Problems
Inf. Control., January, 1978

A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times.
Oper. Res., 1978

Depth-<i>m</i> search in branch-and-bound algorithms.
Int. J. Parallel Program., 1978

1977
Fractional knapsack problems.
Math. Program., 1977

The Power of Dominance Relations in Branch-and-Bound Algorithms.
J. ACM, 1977

1976
Finite Automata Having Cost Functions
Inf. Control., June, 1976

Computational Efficiency of Approximate Branch-and-Bound Algorithms.
Math. Oper. Res., 1976

Theoretical comparisons of search strategies in branch-and-bound algorithms.
Int. J. Parallel Program., 1976

1975
Minimal Representations of Some Classes of Dynamic Programming
Inf. Control., April, 1975

1974
Classes of Discrete Optimization Problems and Their Decision Problems.
J. Comput. Syst. Sci., 1974

1973
Fail-Safe Realization of Sequential Machines
Inf. Control., February, 1973

Finite State Representations of Discrete Optimization Problems.
SIAM J. Comput., 1973

Technical Note - The Use of Cuts in Complementary Programming.
Oper. Res., 1973

1972
Representation Theorems for Equivalent Optimization Problems
Inf. Control., December, 1972

N-Fail-Safe Sequential Machines.
IEEE Trans. Computers, 1972

Design of Optimal Switching Networks by Integer Programming.
IEEE Trans. Computers, 1972

An implicit enumeration program for zero-one integer programming.
Int. J. Parallel Program., 1972

1971
Synthesis of Networks with a Minimum Number of Negative Gates.
IEEE Trans. Computers, 1971

Gate-Interconnection Minimization of Switching Networks Using Negative Gates.
IEEE Trans. Computers, 1971

Technical Note - Complementary Programming.
Oper. Res., 1971

Technical Note - Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks.
Oper. Res., 1971

1970
Adaptive Linear Classifier by Linear Programming.
IEEE Trans. Syst. Sci. Cybern., 1970

1968
On Autonomous Logic Nets of Threshold Elements.
IEEE Trans. Computers, 1968

Realization of Arbitrary Logic Functions by Completely Monotonic Functions and Its Applications to Threshold Logic.
IEEE Trans. Computers, 1968

A Theory of Completely Monotonic Functions and its Applications to Threshold Logic.
IEEE Trans. Computers, 1968

1965
A Lower Bound of the Number of Threshold Functions.
IEEE Trans. Electron. Comput., 1965


  Loading...