The SCEAS System
Navigation Menu

Journals in DBLP

Combinatorics, Probability & Computing
1993, volume: 2, number:

  1. Peter J. Cameron, Cleide Martins
    A Theorem on Reconstruction of Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:1-9 [Journal]
  2. John Gates
    Some Dual Problems of Geometric Probability in the Plane. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:11-23 [Journal]
  3. Roland Häggkvist
    Hamilton Cycles in Oriented Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:25-32 [Journal]
  4. Joseph P. S. Kung
    Sign-Coherent Identities for Characteristic Polynomials of Matroids. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:33-51 [Journal]
  5. Boris Pittel
    On a Random Instance of a "Stable Roommates" Problem: Likely Bahavior of the Proposal Algorithm. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:53-92 [Journal]
  6. D. H. Smith
    Optimally Reliable Graphs for Both Vertex and Edge Failures. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:93-100 [Journal]
  7. Martin Aigner, Eberhard Triesch
    Reconstructing a Graph from its Neighborhood Lists. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:103-113 [Journal]
  8. Sven Erick Alm
    Upper Bounds for the Connective Constant of Self-Avoiding Walks. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:115-136 [Journal]
  9. Noga Alon, Raphael Yuster
    Threshold Functions for H-factors. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:137-144 [Journal]
  10. Philippe Flajolet, Zhicheng Gao, Andrew M. Odlyzko, L. Bruce Richmond
    The Distribution of Heights of Binary Trees and Other Simple Trees. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:145-156 [Journal]
  11. William M. Y. Goh, Eric Schmutz
    Random Matrices and Brownian Motion. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:157-180 [Journal]
  12. Gregory F. Lawler
    A Discrete Analogue of a Theorem of Makarov. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:181-199 [Journal]
  13. Nguyen Van Ngoc, Zsolt Tuza
    Linear-Time Algorithms for the Max Cut Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:201-210 [Journal]
  14. Rudolf Ahlswede, Ning Cai
    On Extremal Set Partitions in Cartesian Product Spaces. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:211-220 [Journal]
  15. Vitaly Bergelson, Neil Hindman
    Additive and Multiplicative Ramsey Theorems in N-Some Elementary Results. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:221-241 [Journal]
  16. Norman L. Biggs
    Potential Thory on Distance-Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:243-255 [Journal]
  17. Peter J. Cameron, William M. Kantor
    Random Permutations: Some Group-Theoretic Aspects. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:257-262 [Journal]
  18. Guantao Chen, Richard H. Schelp
    Ramsey Problems With Bounded Degree Spread. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:263-269 [Journal]
  19. Martin E. Dyer, Alan M. Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh V. Vazirani
    A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:271-284 [Journal]
  20. Jennie C. Hansen
    Factorization in Fq(x) and Brownian Motion. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:285-299 [Journal]
  21. Salvatore Ingrassia
    Geometric Approaches to the Estimaton of the Spectral Gap of Reversible Marcov Chains. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:301-323 [Journal]
  22. Bill Jackson
    A Zero-Free Interval for Chromatic Polynomials of Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:325-336 [Journal]
  23. Miro Kraetzl, Charles J. Colbourn
    Threshold Channel Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:337-349 [Journal]
  24. James F. Lynch
    Threshold Functions for Markov Chains: a Graph Theoretic Approach. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:351-362 [Journal]
  25. Colin McDiarmid
    A Random Recolouring Method for Graphs and Hypergrams. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:363-365 [Journal]
  26. Safwan Akkari, James G. Oxley
    Some LOcal Extremal Connectivity Results for Matroids. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:367-384 [Journal]
  27. Martin Anthony, John Shawe-Taylor
    Using the Perceptron Algorithm to Find Consistent Hypotheses. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:385-387 [Journal]
  28. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Ramsey Size Linear Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:389-399 [Journal]
  29. Paul Erdös, Endre Makai, János Pach
    Nearly Equal Distances in the Plane. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:401-408 [Journal]
  30. Paul Erdös, Edward T. Ordman, Yechezkel Zalcstein
    Clique Partitions of Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:409-415 [Journal]
  31. Rudolf Halin
    Minimization Problems for Infinite n-Connected graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:417-436 [Journal]
  32. Neil Hindman, Imre Leader
    Image Partition Regularity of Matrices. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:437-463 [Journal]
  33. Christofh Hundack, Hans Jürgen Prömel, Angelika Steger
    Extremal Graph Problems for Graphs with a Color-Critical Vertex. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:465-477 [Journal]
  34. Guoping Jin
    Triangle-Free Graphs with High Minimal Degrees. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:479-490 [Journal]
  35. Nathan Linial
    Local-Global Phenomena in Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:491-503 [Journal]
  36. Tomasz Luczak, László Pyber
    On Random Generation of the Symmetic Group. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:505-512 [Journal]
  37. Alexander A. Razborov, Endre Szemerédi, Avi Wigderson
    Constructing Small Sets that are Uniform in Arithmetic Progressions. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:513-518 [Journal]
  38. Dirk Vertigan, Geoff Whittle
    Recognizing Polymatroids Associated with Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:519-530 [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