7840 search results - page 368 / 1568 » On generalized Ramsey numbers |
200
click to vote
PODC
2006
ACM
16 years 27 days ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
180
click to vote
SIGCOMM
2006
ACM
16 years 27 days ago
2006
ACM
An understanding of the topological structure of the Internet is needed for quite a number of networking tasks, e.g., making decisions about peering relationships, choice of upstr...
160
click to vote
SIGECOM
2006
ACM
16 years 27 days ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
181
click to vote
STOC
2006
ACM
16 years 27 days ago
2006
ACM
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
187
click to vote
FCCM
2005
IEEE
16 years 16 days ago
2005
IEEE
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best known method for factorization large integers is ...