16666 search results - page 102 / 3334 » Descriptive and Computational Complexity |
163
click to vote
FOCS
2010
IEEE
15 years 1 months ago
2010
IEEE
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
144
click to vote
TCS
2010
14 years 10 months ago
2010
We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defin...
135
click to vote
COCOON
2008
Springer
15 years 5 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
150
Voted
FCT
1991
Springer
15 years 7 months ago
1991
Springer
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
117
click to vote
SP
2008
IEEE
15 years 3 months ago
2008
IEEE
f abstraction (hardware) to the highest (people). This issue's theme encompasses this entire spectrum. The lead author of each article resides in the Scalable Computing Resear...