Standout Papers
- The Star Graph: An Attractive Alternative to the n-Cube. (1987)
Citation Impact
Citing Papers
Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling
1993
Binary Decision Diagrams
1978
Ultracomputers
1980
VLSI Test Principles and Architectures: Design for Testability
2006
Survey of Test Vector Compression Techniques
2006 Standout
Thinning methodologies-a comprehensive survey
1992 Standout
A survey of dynamic scheduling in manufacturing systems
2008 Standout
Picture Processing by Computer
1969
A concise survey of scheduling with time-dependent processing times
2003 Standout
Symbolic Boolean manipulation with ordered binary-decision diagrams
1992 Standout
Randomized Algorithms
1995 Standout
Analyzing Errors with the Boolean Difference
1968
Deterministic job-shop scheduling: Past, present and future
1999
Basics of cellular logic with some applications in medical image processing
1979
Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation
1997
Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach
1969 Standout
An integer linear‐programming model for machine scheduling
1959
A survey of Hough Transform
2014 Standout
Finding the Most Reliable Routes in Communication Systems
1963
The control of discrete event systems
1989 Standout
Methods of Sequencing in Job Shops—A Review
1959
Deadlock-Free Packet Switching Networks
1981
Computer Processing of Line-Drawing Images
1974 Standout
Virtual time
1985 Standout
Statistical mechanics of cellular automata
1983 Standout
Graph-Based Algorithms for Boolean Function Manipulation
1986 Standout
A Survey of Scheduling Rules
1977 Standout
A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
1970 Standout
The NP-completeness column: An ongoing guide
1986
A bridging model for parallel computation
1990 Standout
Model-checking algorithms for continuous-time markov chains
2003 Standout
Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference
1972 Standout
Works of Sheldon B. Akers being referenced
The Use of Wye-Delta Transformations in Network Simplification
1960
Universal Test Sets for Logic Networks
1973
On a Theory of Boolean Functions
1959
On the Complexity of Estimating the Size of a Test Set
1984
The use of threshold logic in character recognition
1964
The use of linear sums in exhaustive testing
1987
On the Construction of (d, k) Graphs
1965
A Rectangular Logic Array
1972
A Non-Numerical Approach to Production Scheduling Problems
1955