148 search results - page 28 / 30 » On data structures and asymmetric communication complexity |
STOC
1993
ACM
13 years 11 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
BMCBI
2010
13 years 7 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
P2P
2005
IEEE
14 years 1 months ago
2005
IEEE
A mobile ad hoc network (MANET) is a multi-hop wireless network having no infrastructure. Thus, the mobile nodes have to perform basic control tasks, such as routing, and higher-l...