Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Algebraic Discrete Methods, Volume 1
Volume 1, Number 1, 1980
- Jerrold R. Griggs, Douglas B. West:
Extremal Values of the Interval Number of a Graph. 1-7 - Ronald L. Graham, Shuo-Yen Robert Li, Wen-Ching Winnie Li:
On the Structure of t-Designs. 8-14 - Daniel J. Kleitman, Kenneth J. Winston:
Ensembles and Largest Sojourns of Random Walks. 15-20 - Gerard J. Chang, Frank K. Hwang:
A Group Testing Problem. 21-24 - Amram Meir, John W. Moon, J. R. Pounder:
On the Order of Random Channel Networks. 25-33 - James M. Greenberg, Curtis Greene, Stuart Hastings:
A Combinatorial Problem Arising in the Study of Reaction-Diffusion Equations. 34-42 - Frank Ruskey:
On the Average Shape of Binary Trees. 43-50 - Richard T. Wong:
Worst-Case Analysis of Network Design Problem Heuristics. 51-63 - Kenneth A. Berman:
A Proof of Tuite's Trinity Theorem and a New Determinant Formula. 64-69 - Arthur M. Farley, Stephen T. Hedetniemi, Sandra L. Mitchell:
Rectilinear Steiner Trees in Rectangle Trees. 70-81 - Arnold Barnett, John Mazzarino:
On the Sequential Search for Spatially-Distributed Events. 82-91 - János Demetrovics:
Candidate Keys and Antichains. 92 - Guy Latouche, Marcel F. Neuts:
Efficient Algorithmic Solutions to Exponential Tandem Queues with Blocking. 93-106 - Sharad V. Kanetkar, Meghanad D. Wagh:
On Construction of Matrices with Distinct Submatrices. 107-113 - Gérard Letac, Lajos Takács:
Random Walks on A 600-Cell. 114-120 - Harvey Diamond:
Asymptotic Equilibria in a Class of N-Person Symmetric Games. 121-136
Volume 1, Number 2, 1980
- Charles F. Dunkl:
Orthogonal Polynomials in Two Variables of q-Hahn and q-Jacobi Type. 137-151 - Edgar N. Gilbert:
Random Colorings of a Lattice of Squares in the Plane. 152-159 - Dennis Stanton:
Some Erdös-Ko-Rado Theorems for Chevalley Groups. 160-163 - Nicholas Pippenger:
A New Lower Bound for the Number of Switches in Rearrangeable Networks. 164-167 - Richard P. Stanley:
Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property. 168-184 - Shmuel Friedland, Hans Schneider:
The Growth of Powers of a Nonnegative Matrix. 185-200 - V. Aggarwal, R. Chandrasekaran, K. P. K. Nair:
Discounted Stochastic Ratio Games. 201-210 - Michael E. Saks:
Dilworth Numbers, Incidence Maps and Product Partial Orders. 211-215 - M. R. Garey, David S. Johnson, Gerald L. Miller, Christos H. Papadimitriou:
The Complexity of Coloring Circular Arcs and Chords. 216-227 - Sukhamay Kundu, E. Sampathkumar, James B. Shearer, Dean Sturtevant:
Reconstruction of a Pair of Graphs from their Concatenations. 228-231 - Ed Arthurs, Bart W. Stuck:
Controlling Overload in a Digital System. 232-250
Volume 1, Number 3, 1980
- Ronald L. Graham, Andrew C. Yao, F. Frances Yao:
Some Monotonicity Properties of Partial Orders. 251-258 - J. Aczél, C. Wagner:
A Characterization of Weighted Arithmetic Means. 259-260 - Gérard Cornuéjols, George L. Nemhauser, Laurence A. Wolsey:
A Canonical Representation of Simple Plant Location Problems and Its Applications. 261-272 - Carl D. Meyer Jr.:
The Condition of a Finite Markov Chain and Perturbation Bounds for the Limiting Probabilities. 273-283 - Allan R. Sampson:
Nonnegative Cholesky Decomposition and Its Application to Association of Random Variables. 284-291 - John R. Gilbert:
A Note on the NP-Completeness of Vertex Elimination on Directed Graphs. 292-294 - Lawrence A. Shepp:
The FKG Inequality and Some Monotonicity Properties of Partial Orders. 295-299 - Moshe Friedman, Jeffrey L. Winter:
An Asymptotic Solution of Inventory Lot-Size Models with Homogeneous Time-Dependent Demand Functions. 300-314 - Zvi Drezner, George O. Wesolowsky:
Single Facility lp-Distance Minimax Location. 315-321 - F. R. K. Chung, Frank K. Hwang:
The Connection Patterns of Two Complete Binary Trees. 322-335 - Philippe Delsarte, Yves V. Genin, Yves G. Kamp:
Planar Least-Squares Inverse Polynomials. Part II: Asymptotic Behavior. 336-344 - Ludwig Baringhaus:
Characterization of Distributions by Random Sums. 345-347 - Y. Soun, Klaus Truemper:
Single Commodity Representation of Multicommodity Networks. 348-358 - Kenneth A. Berman:
A Graph Theoretical Approach to Handicap Ranking of Tournaments and Paired Comparisons. 359-361
Volume 1, Number 4, 1980
- James B. Saxe:
Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time. 363-369 - Ramaswamy Chandrasekaran, Arie Tamir:
An O ((nlog p)2) Algorithm for the Continuous p-Center Problem on a Tree. 370-375 - Peter Frankl, Zoltán Füredi:
The Erdös-Ko-Rado Theorem for Integer Sequences. 376-381 - Ronald L. Graham, Neil J. A. Sloane:
On Additive Bases and Harmonious Graphs. 382-404 - F. R. K. Chung, Peter C. Fishburn, Ronald L. Graham:
On Unimodality for Linear Extensions of Partial Orders. 405-410 - Solomon W. Golomb:
Obtaining Specified Irreducible Polynomials over Finite Fields. 411-418 - Mordechai Lewin:
Totally Nonnegative, M-, and Jacobi Matrices. 419-421 - Jan R. Magnus, H. Neudecker:
The Elimination Matrix: Some Lemmas and Applications. 422-449 - Edward A. Bertram, Victor K. Wei:
Decomposing a Permutation into Two Large Cycles: An Enumeration. 450-461 - Amram Meir, John W. Moon, J. R. Pounder:
Acknowledgment of Priority: On the Order of Random Channel Networks. 462
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-17 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
