Found: 7

Select item for more details and to access through your institution.

  • Asymptotic packing and the random greedy algorithm.

    Published in:
    Random Structures & Algorithms, 1996, v. 8, n. 3, p. 161, doi. 10.1002/(SICI)1098-2418(199605)8:3<161::AID-RSA1>3.0.CO;2-W
    By:
    • Rödl, Vojtěch;
    • Thoma, Luboš
    Publication type:
    Article

  • On the distribution of search cost for the move-to-front rule.

    Published in:
    Random Structures & Algorithms, 1996, v. 8, n. 3, p. 179, doi. 10.1002/(SICI)1098-2418(199605)8:3<179::AID-RSA2>3.0.CO;2-V
    By:
    • Fill, James Allen;
    • Holst, Lars
    Publication type:
    Article

  • MAX-CUT has a randomized approximation scheme in dense graphs.

    Published in:
    Random Structures & Algorithms, 1996, v. 8, n. 3, p. 187, doi. 10.1002/(SICI)1098-2418(199605)8:3<187::AID-RSA3>3.0.CO;2-U
    By:
    • Fernandez de la Vega, W.
    Publication type:
    Article

  • A new lower bound for the critical probability of site percolation on the square lattice.

    Published in:
    Random Structures & Algorithms, 1996, v. 8, n. 3, p. 199, doi. 10.1002/(SICI)1098-2418(199605)8:3<199::AID-RSA4>3.0.CO;2-T
    By:
    • van den Berg, J.;
    • Ermakov, A.
    Publication type:
    Article

  • An extension of Janson's inequality.

    Published in:
    Random Structures & Algorithms, 1996, v. 8, n. 3, p. 213, doi. 10.1002/(SICI)1098-2418(199605)8:3<213::AID-RSA5>3.0.CO;2-0
    By:
    • Roos, Małgorzata
    Publication type:
    Article

  • Randomness friendly graphs.

    Published in:
    Random Structures & Algorithms, 1996, v. 8, n. 3, p. 229, doi. 10.1002/(SICI)1098-2418(199605)8:3<229::AID-RSA6>3.0.CO;2-#
    By:
    • Sidorenko, Alexander
    Publication type:
    Article

  • Masthead.

    Published in:
    Random Structures & Algorithms, 1996, v. 8, n. 3, p. fmi, doi. 10.1002/1098-2418(199605)8:3<::AID-RSA3240080301>3.0.CO;2-Z
    Publication type:
    Article