4759 search results - page 812 / 952 » Parallelizing the Phylogeny Problem |
146
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
149
click to vote
ICS
2010
Tsinghua U.
16 years 3 months ago
2010
Tsinghua U.
: We revisit price of anarchy in network routing, in a new model in which routing decisions are made by self-interested components of the network, as opposed to by the flows as in ...
161
click to vote
ICS
2010
Tsinghua U.
16 years 3 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
174
click to vote
ICS
2010
Tsinghua U.
16 years 3 months ago
2010
Tsinghua U.
: Starting with the work of Ishai-Sahai-Wagner and Micali-Reyzin, a new goal has been set within the theory of cryptography community, to design cryptographic primitives that are s...
154
click to vote
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
Cache-oblivious algorithms have the advantage of achieving good sequential cache complexity across all levels of a multi-level cache hierarchy, regardless of the specifics (cache...