356 search results - page 47 / 72 » Parallelizing time with polynomial circuits |
116
Voted
SPDP
1993
IEEE
15 years 7 months ago
1993
IEEE
In PRAM emulations, universal hashing is a well-known method for distributing the address space among memory modules. However, if the memory access patterns of an application ofte...
131
Voted
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
136
Voted
CONCUR
2000
Springer
15 years 7 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
108
click to vote
COCOON
2009
Springer
15 years 10 months ago
2009
Springer
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
115
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...