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

메뉴 건너뛰기

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 545-554

Online conflict-free coloring for intervals

(8) Fiat, Amos a Levy, Meital a Matoušek, Jiří b Pach, Elchanan Mossel János c Sharir, Micha a,d Smorodinsky, Shakhar e Wagner, Uli b Welzl, Emo e

a TEL AVIV UNIVERSITY (Israel)

b CHARLES UNIVERSITY (Czech Republic)

c UNIVERSITY OF CALIFORNIA (United States)

d NEW YORK UNIVERSITY (United States)

e ETH ZURICH (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC ALGORITHMS; ONLINE CONFLICT-FREE COLORING; PLANAR RANGE; RANDOMIZED SOLUTIONS;

ALGORITHMS; COLORING; MATRIX ALGEBRA; NUMBER THEORY; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; THEOREM PROVING;

ONLINE SYSTEMS;

EID: 20744449462 PISSN: None EISSN: None Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper

Times cited : (17)

References (7)

1
- 0003430191
- J. Wiley and Sons, New York, NY
- N. Alon and J. Spencer, The Probabilistic Method, J. Wiley and Sons, New York, NY, 1992.
- (1992) The Probabilistic Method
- Alon, N.¹ Spencer, J.²

2
- 0037600804
- Branching processes
- Springer-Verlag, New York
- K. B. Athreya and P. E. Ney, Branching Processes, Die Grundlehren der mathematischen Wissenschaften, Band 196, Springer-Verlag, New York, 1972.
- (1972) Die Grundlehren der Mathematischen Wissenschaften , vol.196
- Athreya, K.B.¹ Ney, P.E.²

3
- 0004116989
- MIT Press, Cambridge, MA
- T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
- (1990) Introduction to Algorithms
- Cormen, T.H.¹ Leiserson, C.E.² Rivest, R.L.³

4
- 0008491536
- On vertex ranking for permutations and other graphs
- P. Enjalbert, E.W. Mayr, K.W. Wagner, (eds.), Lecture Notes in Computer Science 775, Springer-Verlag, Berlin
- J.S. Deogun, T. Kloks, D. Kratsch, and H. Müller, On vertex ranking for permutations and other graphs, Proc. 11th Annu. Sympos. Theoretical Aspects of Computer Science, P. Enjalbert, E.W. Mayr, K.W. Wagner, (eds.), Lecture Notes in Computer Science 775, Springer-Verlag, Berlin, pp. 747-758, 1994.
- (1994) Proc. 11th Annu. Sympos. Theoretical Aspects of Computer Science , pp. 747-758
- Deogun, J.S.¹ Kloks, T.² Kratsch, D.³ Müller, H.⁴

5
- 1842459431
- Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks
- G. Even, Z. Lotker, D. Ron and S. Smorodinsky, Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks, SIAM J. Comput. 33(1):94-136 (2003).
- (2003) SIAM J. Comput. , vol.33 , Issue.1 , pp. 94-136
- Even, G.¹ Lotker, Z.² Ron, D.³ Smorodinsky, S.⁴

6
- 0038714821
- On conflict-free coloring of points and simple regions in the plane
- to appear. Also in Proc. 19th ACM Sympos. Comput. Geom.
- S. Har-Peled and S. Smorodinsky, On conflict-free coloring of points and simple regions in the plane, Discrete Comput. Geom., to appear. Also in Proc. 19th ACM Sympos. Comput. Geom., 2003, 114-123.
- (2003) Discrete Comput. Geom. , pp. 114-123
- Har-Peled, S.¹ Smorodinsky, S.²

7
- 0037520783
- Ph.D Dissertation, School of Computer Science, Tel-Aviv University
- S. Smorodinsky, Combinatorial Problems in Computational Geometry, Ph.D Dissertation, School of Computer Science, Tel-Aviv University, 2003.
- (2003) Combinatorial Problems in Computational Geometry
- Smorodinsky, S.¹

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