메뉴 건너뛰기
Random Structures and Algorithms
Volumn 29, Issue 3, 2006, Pages 338-350
Existence, uniqueness, and algorithmic computation of general lilypond systems
Author keywords

[No Author keywords available]
Indexed keywords

EID: 33749315513     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20099     Document Type: Article
Times cited : (12)
References (3)
  • 1
    • 27144499336 scopus 로고    scopus 로고
    • Descending chains, the lilypond model, and mutual nearest neighbour matching
    • D. J. Daley and G. Last, Descending chains, the lilypond model, and mutual nearest neighbour matching, Adv Appl Probab 37 (2005), 604-628.
    • (2005) Adv Appl Probab , vol.37 , pp. 604-628
    • Daley, D.J.1    Last, G.2
  • 2
    • 0033184502 scopus 로고    scopus 로고
    • The volume fraction of a Poisson germ model with maximally non-overlapping spherical grains
    • D. J. Daley, D. Stoyan, and H. Stoyan, The volume fraction of a Poisson germ model with maximally non-overlapping spherical grains, Adv Appl Probab 31 (1999), 610-624.
    • (1999) Adv Appl Probab , vol.31 , pp. 610-624
    • Daley, D.J.1    Stoyan, D.2    Stoyan, H.3
  • 3
    • 0039056192 scopus 로고    scopus 로고
    • Nearest neighbour and hard sphere models in continuum percolation
    • O. Häggström and R. Meester, Nearest neighbour and hard sphere models in continuum percolation, Random Struct Algor 9 (1996), 295-315.
    • (1996) Random Struct Algor , vol.9 , pp. 295-315
    • Häggström, O.1    Meester, R.2

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