6 search results - page 1 / 2 » Sorting and Counting Networks of Small Depth and Arbitrary W... |
SPAA
1999
ACM
13 years 9 months ago
1999
ACM
MST
2002
13 years 4 months ago
2002
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
We demonstrate that the unbounded fan-out gate is very powerful. Constant-depth polynomial-size quantum circuits with bounded fan-in and unbounded fan-out over a fixed basis (denot...
CAI
2002
Springer
13 years 4 months ago
2002
Springer
In a localized routing algorithm, node A currently holding the message forwards it based on the location of itself, its neighboring nodes and destination. We propose to use depth ...