The SCEAS System
Navigation Menu

Journals in DBLP

Random Struct. Algorithms
1996, volume: 9, number: 1-2

  1. Laurent Alonso, Philippe Chassaing, René Schott
    The average complexity of a coin-weighing problem. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:1-14 [Journal]
  2. József Beck
    Foundations of positional games. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:15-47 [Journal]
  3. Neil J. Calkin
    Dependent sets of constant weight vectors in GF(q). [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:49-53 [Journal]
  4. Fan R. K. Chung, Ronald L. Graham, S.-T. Yau
    On sampling with Markov chains. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:55-77 [Journal]
  5. Robert P. Dobrow, Robert T. Smythe
    Poisson approximations for functionals of random trees. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:79-92 [Journal]
  6. Wenceslas Fernandez de la Vega
    The largest induced tree in a sparse random graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:93-97 [Journal]
  7. Anna Gál, Avi Wigderson
    Boolean complexity classes vs. their arithmetic analogs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:99-111 [Journal]
  8. Hans Garmo
    Random railways modeled as random 3-regular graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:113-136 [Journal]
  9. Erhard Godehardt, Jerzy Jaworski
    On the connectivity of a random interval graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:137-161 [Journal]
  10. Thomas Hofmeister, Hanno Lefmann
    A combinatorial design approach to MAXCUT. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:163-175 [Journal]
  11. Alexander K. Kelmans
    On graphs with the maximum number of spanning trees. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:177-192 [Journal]
  12. János Komlós, Gábor N. Sárközy, Endre Szemerédi
    On the square of a Hamiltonian cycle in dense graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:193-211 [Journal]
  13. Alexandr V. Kostochka
    An intersection theorem for systems of sets. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:213-221 [Journal]
  14. James Gary Propp, David Bruce Wilson
    Exact sampling with coupled Markov chains and applications to statistical mechanics. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:223-252 [Journal]
  15. Nicholas C. Wormald
    The perturbation method and triangle-free random graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:253-269 [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