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

메뉴 건너뛰기

Random Structures & Algorithms

Volumn 2, Issue 4, 1991, Pages 367-378

A parallel algorithmic version of the local lemma

(1) Alon, Noga a

a TEL AVIV UNIVERSITY (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84990668575 PISSN: 10429832 EISSN: 10982418 Source Type: Journal
DOI: 10.1002/rsa.3240020403 Document Type: Article

Times cited : (149)

References (21)

1
- 84912985428
- Path factors of a graph
- Wiley, New York
- (1984) Graph Theory and its Applications
- Akiyama, J.¹ Kano, M.²

2
- 38849206199
- The star arboricity of graphs
- (1989) Discrete Math. , vol.75 , pp. 11-22
- Algor, I.¹ Alon, N.²

3
- 0001011699
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- (1986) J. Algorithms , vol.7 , pp. 567-583
- Alon, N.¹ Babai, L.² Itai, A.³

4
- 0024861622
- On the complexity of radio communication
- Seattle, WA, ACM Press
- (1989) Proc. 21th ACM Symp. on the Theory of Computing , pp. 274-285
- Alon, N.¹ Bar‐Noy, A.² Linial, N.³ Peleg, D.⁴

5
- 84990659584
- Single round simulation on radio networks
- J. Algorithms
- Alon, N.¹ Bar‐Noy, A.² Linial, N.³ Peleg, D.⁴

6
- 0025535378
- Simple constructions of almost k‐wise independent random variables, Proc. 31st IEEE FOCS
- (1990) , pp. 544-553
- Alon, N.¹ Goldreich, O.² Hastad, J.³ Peralta, R.⁴

7
- 51249177934
- The linear arboricity of graphs
- (1988) Isr. J. Math. , vol.62 , pp. 311-325
- Alon, N.¹

8
- 84990650267
- The strong chromatic number of a graph
- Random Struct. Alg.
- Alon, N.¹

9
- 38249005816
- Cycles of length 0 modulo k in directed graphs
- (1989) J. Combinat. Theory Ser. B , vol.47 , pp. 114-119
- Alon, N.¹ Linial, N.²

10
- 84990717256
- Acyclic coloring of graphs
- (1991) Random Structures & Algorithms , vol.2 , pp. 277-288
- Alon, N.¹ McDiarmid, C.² Reed, B.³

11
- 84990724799
- Star arboricity, Combinatorica
- Alon, N.¹ McDiarmid, C.² Reed, B.³

12
- 84990637859
- An algorithmic approach to the Lovász Local Lemma I
- (1991) Random Structures & Algorithms , vol.2 , pp. 343-365
- Beck, J.¹

13
- 0024768842
- Simulating logcn‐wise independence in NC, Proc. 30th IEEE FOCS
- (1989) , pp. 2-7
- Berger, B.¹ Rompel, J.²

14
- 0000973460
- Problems and results on 3‐chromatic hypergraphs and some related questions
- in Infinite and Finite Sets, A. Hajnal, et al. (eds.), North Holland, Amsterdam
- (1975) Colloq. Math. Soc. J. Bolyai , vol.11 , pp. 609-627
- Erdōs, P.¹ Lovász, L.²

15
- 38249022231
- Any 7‐regular digraph contains an even cycle
- (1989) J. Combinat. Theory Ser. B , vol.46 , pp. 249-252
- Friedland, S.¹

16
- 0002065879
- A survey of parallel algorithms for shared memory machines
- J. Van Leeuwen, MIT Press, Cambridge, MA, Chap. 17, pp.
- (1990) Handbook of Theoretical Computer Science , pp. 871-941
- Karp, R.M.¹ Ramachandran, V.²

17
- 0009006810
- Addison Wesley, London, (Exercise 11)
- (1969) The Art of Computer Programming , vol.1 , pp. 396
- Knuth, D.¹

18
- 0024766763
- The probabilistic method yields deterministic parallel algorithms, Proc. 30th IEEE FOCS
- (1989) , pp. 8-13
- Motwani, R.¹ Naor, J.² Naor, M.³

19
- 0025152620
- Small‐bias probability spaces: efficient constructions and applications
- ACM Press
- (1990) Proc. 22nd Annual ACM STOC , pp. 213-223
- Naor, J.¹ Naor, M.²

20
- 0003802869
- SIAM, Philadelphia
- (1987) Ten Lectures on the Probabilistic Method
- Spencer, J.¹

21
- 0002529743
- Sign‐nonsingular matrices and even cycles in directed graphs
- (1986) Linear Algebra Appl. , vol.41 , pp. 27-42
- Thomassen, C.¹

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