2095 search results - page 104 / 419 » Improved pebbling bounds |
107
Voted
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
133
click to vote
CRYPTO
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of secure identification: user U proves to server S that he knows an agreed (possibly low-entropy) password w, while giving away as little information on w ...
102
click to vote
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
89
Voted
HASE
2007
IEEE
15 years 7 months ago
2007
IEEE
SyncProbe improves the end-to-end predictability of distributed systems by providing applications with a real-time estimate of the maximum expected message delay (upper bound on c...
90
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...