메뉴 건너뛰기




Volumn , Issue , 2007, Pages 201-211

Boltzmann sampling of unlabelled structures

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOLTZMANN EQUATION; COMPUTATIONAL COMPLEXITY; RANDOM PROCESSES; SAMPLING;

EID: 34547947764     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972979.5     Document Type: Conference Paper
Times cited : (60)

References (23)
  • 3
    • 34547955006 scopus 로고    scopus 로고
    • Random sampling of plane partitions
    • and, editors, Dijon, France, LE2I
    • Olivier Bodini, Eric Fusy, and Carine Pivoteau. Random sampling of plane partitions. In Renzo Pinzani and Vincent Vajnovszki, editors, Gascom 2006, pages 124-135, Dijon, France, 2006. LE2I.
    • (2006) Gascom 2006 , pp. 124-135
    • Bodini, O.1    Fusy, E.2    Pivoteau, C.3
  • 6
    • 0012011619 scopus 로고    scopus 로고
    • Uniform random generation of decomposable structures using floating-point arithmetic
    • Alain Denise and Paul Zimmermann. Uniform random generation of decomposable structures using floating-point arithmetic. Theoretical Computer Science, 218(2) :233-248, 1999.
    • (1999) Theoretical Computer Science , vol.218 , Issue.2 , pp. 233-248
    • Denise, A.1    Zimmermann, P.2
  • 8
    • 6344263491 scopus 로고    scopus 로고
    • Philippe Duchon, Philippe Flajolet, Guy Louchard, and Gilles Schaeffer. Boltzmann samplers for the random generation of combinatorial structures. Combinatorics, Probability and Computing, 13(4-5):577-625, 2004. Special issue on Analysis of Algorithms.
    • Philippe Duchon, Philippe Flajolet, Guy Louchard, and Gilles Schaeffer. Boltzmann samplers for the random generation of combinatorial structures. Combinatorics, Probability and Computing, 13(4-5):577-625, 2004. Special issue on Analysis of Algorithms.
  • 9
    • 34547936378 scopus 로고    scopus 로고
    • Philippe Flajolet and Robert Sedgewick. Analytic Combinatorics. October 2005. Chapters I-IX of a book to be published, 688p.+x, available electronically from P. Flajolet's home page.
    • Philippe Flajolet and Robert Sedgewick. Analytic Combinatorics. October 2005. Chapters I-IX of a book to be published, 688p.+x, available electronically from P. Flajolet's home page.
  • 10
    • 0028498498 scopus 로고
    • A calculus for the random generation of labelled combinatorial structures
    • Philippe Flajolet, Paul Zimmerman, and Bernard Van Cutsem. A calculus for the random generation of labelled combinatorial structures. Theoretical Computer Science, 132(1-2):1-35, 1994.
    • (1994) Theoretical Computer Science , vol.132 , Issue.1-2 , pp. 1-35
    • Flajolet, P.1    Zimmerman, P.2    Van Cutsem, B.3
  • 11
    • 34547958810 scopus 로고    scopus 로고
    • Éric Fusy. Quadratic exact-size and linear approximate-size random sampling of planar graphs. Discrete Mathematics and Theoretical Computer Science, AD.125-138, 2005. Proceedings of 2005 International Conference on Analysis of Algorithms.
    • Éric Fusy. Quadratic exact-size and linear approximate-size random sampling of planar graphs. Discrete Mathematics and Theoretical Computer Science, AD.125-138, 2005. Proceedings of 2005 International Conference on Analysis of Algorithms.
  • 13
    • 0005730544 scopus 로고    scopus 로고
    • A quasipolynomial-time algorithm for sampling words from a context-free language
    • Vivek Gore, Mark Jerrum, Sampath Kannan, Z. Sweedyk, and Stephen R. Mahaney. A quasipolynomial-time algorithm for sampling words from a context-free language. Information and Computation, 134(1) :59-74, 1997.
    • (1997) Information and Computation , vol.134 , Issue.1 , pp. 59-74
    • Gore, V.1    Jerrum, M.2    Sampath Kannan, Z.S.3    Mahaney, S.R.4
  • 16
    • 3442886334 scopus 로고    scopus 로고
    • Counting horizontally convex polyominoes
    • Electronic
    • Dean Hickerson. Counting horizontally convex polyominoes. Journal of Integer Sequences, 2, 1999. Electronic.
    • (1999) Journal of Integer Sequences , vol.2
    • Hickerson, D.1
  • 17
    • 34547929129 scopus 로고
    • Uniform sampling modulo a group of symmetries using markov chain simulation. Technical Report ECS-LFCS-94-288, University of Edinburgh
    • Mark Jerrum. Uniform sampling modulo a group of symmetries using markov chain simulation. Technical Report ECS-LFCS-94-288, University of Edinburgh, 1994.
    • (1994)
    • Jerrum, M.1
  • 18
    • 0003657593 scopus 로고    scopus 로고
    • Seminumerical Algorithms. Addison-Wesley, 3rd edition
    • Donald E. Knuth. The Art of Computer Programming, volume 2; Seminumerical Algorithms. Addison-Wesley, 3rd edition, 1998.
    • (1998) The Art of Computer Programming , vol.2
    • Knuth, D.E.1
  • 20
    • 51249186256 scopus 로고
    • On random mapping patterns
    • A. Meir and J. W. Moon. On random mapping patterns. Combinatorica, 4(1):61-70, 1984.
    • (1984) Combinatorica , vol.4 , Issue.1 , pp. 61-70
    • Meir, A.1    Moon, J.W.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.