644 search results - page 85 / 129 » Decomposition Complexity |
134
Voted
CONCUR
2009
Springer
15 years 9 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
111
Voted
EUROPAR
2009
Springer
15 years 9 months ago
2009
Springer
Optimal network performance is critical to efficient parallel scaling for communication-bound applications on large machines. With wormhole routing, no-load latencies do not increa...
265
click to vote
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
Many modern enterprises are collecting data at the most detailed level possible, creating data repositories ranging from terabytes to petabytes in size. The ability to apply sophi...
150
Voted
TPHOL
1999
IEEE
15 years 7 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
129
Voted
PODC
2010
ACM
15 years 6 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...