SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete Mathematics and Theoretical Computer Science

Volumn 2, Issue , 1998, Pages 49-63

Object grammars and random generation

(2) Dutour, I a Fedou J M b

a UNIVERSITÉ BORDEAUX 1 (France)

b UNIVERSITY OF NICE SOPHIA ANTIPOLIS (France)

Author keywords

Object grammars; Q equations; Uniform random generation

Indexed keywords

EID: 0038284437 PISSN: 13658050 EISSN: 13658050 Source Type: Journal
DOI: None Document Type: Article

Times cited : (12)

References (16)

1
- 0242291023
- Convex n-ominoes
- Bender, E. A. (1974). Convex n-ominoes. Discrete Math. 8: 219-226.
- (1974) Discrete Math. , vol.8 , pp. 219-226
- Bender, E.A.¹

2
- 54249109320
- Langages algébriques: À la frontière entre la Combinatoire et l'Informatique
- DIMACS, Rutgers University, USA
- ème Colloque Séries Formelles et Combinatoire Algébrique, 69-78. DIMACS, Rutgers University, USA.
- (1994) ème Colloque Séries Formelles et Combinatoire Algébrique , pp. 69-78
- Delest, M.¹

3
- 0026867784
- Attribute grammars are useful for combinatorics
- Delest, M. and Fédou, J. M. (1992). Attribute grammars are useful for combinatorics. Theoretical Computer Science 98: 65-76.
- (1992) Theoretical Computer Science , vol.98 , pp. 65-76
- Delest, M.¹ Fédou, J.M.²

4
- 54249134308
- Springer-Verlag
- Delest, M., Fédou, J. M., Melançon, G. and Rouillon, N. (1998). Computation and images in Combinatorics. Springer-Verlag.
- (1998) Computation and Images in Combinatorics
- Delest, M.¹ Fédou, J.M.² Melançon, G.³ Rouillon, N.⁴

5
- 0020847953
- Algebraic languages and polyominoes enumeration
- Delest, M. and Viennot, X. G. (1984). Algebraic languages and polyominoes enumeration. Theoretical Computer Science 34: 169-206.
- (1984) Theoretical Computer Science , vol.34 , pp. 169-206
- Delest, M.¹ Viennot, X.G.²

6
- 0007976956
- Université Bordeaux I
- Dutour, I. (1996). Grammaires d'objets: énumération, bijections et génération aléatoire. Université Bordeaux I.
- (1996) Grammaires d'Objets: Énumération, Bijections et Génération Aléatoire
- Dutour, I.¹

7
- 54249111335
- LaBRI, Université Bordeaux I, (Submitted to Theoretical Computer Science)
- Dutour, I. and Fédou, J. M. (1997). Object grammars and bijections. LaBRI, Université Bordeaux I, 1164-97. (Submitted to Theoretical Computer Science).
- (1997) Object Grammars and Bijections , pp. 1164-1197
- Dutour, I.¹ Fédou, J.M.²

8
- 0028498498
- A Calculus for the Random Generation of Combinatorial Structures
- Flajolet, P., Zimmermann, P. and Van Cutsem, B. (1994). A Calculus for the Random Generation of Combinatorial Structures. Theoretical Computer Science 132: 1-35.
- (1994) Theoretical Computer Science , vol.132 , pp. 1-35
- Flajolet, P.¹ Zimmermann, P.² Van Cutsem, B.³

9
- 0003435950
- Stanford University
- Greene, D. H. (1983). Labelled formal languages and their uses. Stanford University.
- (1983) Labelled Formal Languages and Their Uses
- Greene, D.H.¹

10
- 0005758347
- Uniform Random Generation of Strings in a Context-Free Language
- Hickey, T. and Cohen, J. (1983). Uniform Random Generation of Strings in a Context-Free Language. SIAM. J. Comput. 12(4): 645-655
- (1983) SIAM. J. Comput. , vol.12 , Issue.4 , pp. 645-655
- Hickey, T.¹ Cohen, J.²

11
- 0004181263
- Academic Press
- Nijenhuis, A. and Wilf, H. S. (1975). Combinatorial Algorithms, 2nd ed. Academic Press.
- (1975) Combinatorial Algorithms, 2nd Ed.
- Nijenhuis, A.¹ Wilf, H.S.²

12
- 54249145561
- Université Bordeaux I
- Rouillon, N. (1994). Calcul et Image en Combinatoire. Université Bordeaux I.
- (1994) Calcul et Image en Combinatoire
- Rouillon, N.¹

13
- 22244492452
- Enumerative combinatorics and algebraic languages
- Proceedings FCT'85, Springer-Verlag
- Viennot, X. G. (1985). Enumerative combinatorics and algebraic languages. Proceedings FCT'85, 450-464. Lecture Notes in Computer Science 199. Springer-Verlag.
- (1985) Lecture Notes in Computer Science 199 , pp. 450-464
- Viennot, X.G.¹

14
- 49449125013
- A unified setting, ranking, and selection algorithms for combinatorial objects
- Wilf, H. S. (1977). A unified setting, ranking, and selection algorithms for combinatorial objects. Advances in Mathematics, 24: 281-291.
- (1977) Advances in Mathematics , vol.24 , pp. 281-291
- Wilf, H.S.¹

15
- 0039839286
- A unified setting for selection algorithms (II)
- Wilf, H. S. (1978). A unified setting for selection algorithms (II). Ann. Discrete Math. 2: 135-148.
- (1978) Ann. Discrete Math. , vol.2 , pp. 135-148
- Wilf, H.S.¹

16
- 23544461050
- Ecole Polytechnique de Palaiseau
- Zimmermann, P. (1991). Séries génèratrices et analyse automatique d'algorithmes. Ecole Polytechnique de Palaiseau.
- (1991) Séries Génèratrices et Analyse Automatique d'Algorithmes
- Zimmermann, P.¹

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