740 search results - page 82 / 148 » Lower bounds for Buchsbaum* complexes |
147
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
166
click to vote
WDAG
1999
Springer
15 years 10 months ago
1999
Springer
This short paper establishes lower bounds on the time complexity of algorithms solving the generic broadcast problem. The paper shows that (a) to deliver messages in one round, no...
136
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
181
click to vote
CRYPTO
2001
Springer
15 years 10 months ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
157
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...