Searching for "Lower Bounds for Merging Networks." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

The Asymptotic Complexity of Merging Networks
by Peter Bro Miltersen, Mike Paterson, Jun Tarui, Coventry Cv Al — 1992 — In Proc. 33rd IEEE-FOCS
… will be called an (m; n)-merging graph. Thus our lower bound for merging networks also holds for the number…
Cited by 5 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB