1487 search results - page 55 / 298 » The Computational Complexity of Link Building |
134
click to vote
VRST
2009
ACM
15 years 8 months ago
2009
ACM
Simulating crowds in complex environment is fascinating and challenging, however, modeling of the environment is always neglected in the past, which is one of the essential proble...
120
click to vote
ASIACRYPT
2010
Springer
14 years 11 months ago
2010
Springer
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
96
Voted
COCO
2009
Springer
15 years 8 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...