SIAM Journal on Algebraic Discrete Methods

Title Publication Date Language Citations
Counting Matrices by Drazin Index1982/03/01English
Some Constructions for Convolutional and Block Codes1981/06/01English
Ensembles and Largest Sojourns of Random Walks1980/03/01English
Fluctuation Results for Markov-Dependent Trials1981/12/01English
Signs of Terms in a Combinatorial Recursion1983/12/01English
Nonnegative Cholesky Decomposition and Its Application to Association of Random Variables1980/09/01English
Practical Applicatons of Discrete Mathmatical Programming in Exxon1982/12/01English
Hamiltonian Cycles in Striped Graphs: The Two-Stripe Problem1984/12/01English
An Extension of Plackett’s Differential Equation for the Multivariate Normal Density1987/04/01English
Weight Enumerators of Normalized Codes II. The Hermitian Case1983/09/01English
Combinatorial Aspects of the Orrery Model of Syntax1984/09/01English
Optimum Overrelaxation Parameter for the SOR Method for Solving the Eigenvalue Problem1985/04/01English
Distribution of the Minimum Channel Width in VLSI Wiring1987/04/01English
Balloting Labelling and Personnel Assignment1986/01/01English
The Reliability of Standby Systems with a Faulty Switch1981/12/01English
Recursive Best Approximate Solution Algorithms1985/07/01English
Coding Strings by Pairs of Strings1985/07/01English
Instability in Discrete Algorithms and Exact Reversibility1984/12/01English
New Methods for Evaluating Distrebuation Automation and Control (DAC) Sysyem Benefits1982/12/01English
The Case of Equality in Hopf’s Inequality1987/10/01English
M-Matrices whose Inverses are Stochastic1981/09/01English
On the Dimension of Bi-Infinite Systems1984/03/01English
A Counterexample to a Bin Packing Conjecture1981/09/01English
Erratum: Volterra Multipliers II1986/04/01English
Acknowledgment of Priority: On the Order of Random Channel Networks1980/12/01English
The General Minimum Fill-In Problem1987/10/01English
A Point-Symmetric Graph that is Nowhere Reversible1982/09/01English
Relationships Between $l^1 $ Metrics on Rankings: The Case of Ties1986/07/01English
Matrix Products That Can be Evaluated in Closed Form1983/06/01English
Incremental Processing Applied to Munkres’ Algorithm and Its Application in Steinberg’s Placement Procedure1985/04/01English