The Asymptotic Complexity of Merging Networks
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/focs/MiltersenPT92
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/focs/MiltersenPT92
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jun_Tarui
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Mike_Paterson
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Peter_Bro_Miltersen
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1992.267768
>
foaf:
homepage
<
https://doi.org/10.1109/SFCS.1992.267768
>
dc:
identifier
DBLP conf/focs/MiltersenPT92
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSFCS.1992.267768
(xsd:string)
dcterms:
issued
1992
(xsd:gYear)
rdfs:
label
The Asymptotic Complexity of Merging Networks
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jun_Tarui
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Mike_Paterson
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Peter_Bro_Miltersen
>
swrc:
pages
236-246
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/focs/FOCS33
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/focs/MiltersenPT92/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/focs/MiltersenPT92
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/focs/focs92.html#MiltersenPT92
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SFCS.1992.267768
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/focs
>
dc:
subject
permutations, asymptotic complexity, merging networks, comparators, comparator network, upper bound, lower bound, monotone Boolean circuits, switching networks
(xsd:string)
dc:
title
The Asymptotic Complexity of Merging Networks
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document