The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Discrete Math.
1989, volume: 2, number: 3

  1. Miklós Ajtai, D. Karabeg, János Komlós, Endre Szemerédi
    Sorting in Average Time o(log) n. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:3, pp:285-292 [Journal]
  2. Stephen F. Altschul
    Leaf Pairs and Tree Dissections. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:3, pp:293-299 [Journal]
  3. G. M. Constantine
    On the Invertibility of the Discrete Radon Transform. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:3, pp:300-306 [Journal]
  4. Deborah S. Franzblau
    Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:3, pp:307-321 [Journal]
  5. Mark K. Goldberg, Thomas H. Spencer
    Constructing a Maximal Independent Set in Parallel. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:3, pp:322-328 [Journal]
  6. Jeff Kahn, J. C. Lagarias, Hans S. Witsenhausen
    Single-Suit Two-Person Card Play III. The Misère Game. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:3, pp:329-343 [Journal]
  7. Daniel J. Kleitman
    Divisors Without Unit-Congruent Ratios. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:3, pp:344-349 [Journal]
  8. D. A. Lind
    Perturbations of Shifts of Finite Type. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:3, pp:350-365 [Journal]
  9. C. L. Mallows
    Identities Satisfied by Iterated Polynomials and (Q, x)-Binomial Coefficients. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:3, pp:366-370 [Journal]
  10. Rajeev Motwani, Arvind Raghunathan, Huzur Saran
    Perfect Graphs and Orthogonally Convex Covers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:3, pp:371-392 [Journal]
  11. Nicholas Pippenger
    Random Sequential Adsorption on Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:3, pp:393-401 [Journal]
  12. Vojtech Rödl, Peter Winkler
    A Ramsey-Type Theorem for Orderings of a Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:3, pp:402-406 [Journal]
  13. S. K. Tipnis, Leslie E. Trotter Jr.
    Node-Packing Problems with Integer Rounding Properties. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:3, pp:407-412 [Journal]
  14. Stephen A. Vavasis
    Gaussian Elimination with Pivoting is P-Complete. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:3, pp:413-423 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002