Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Selection Networks

From MaRDI portal
Publication:3982712
Jump to:navigation, search

DOI10.1137/0220054zbMath0743.68051OpenAlexW2914951704MaRDI QIDQ3982712

Nicholas J. Pippenger

Publication date: 26 June 1992

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0220054


zbMATH Keywords

comparatorrandom walkclassifiersexpanding graphs


Mathematics Subject Classification ID

Searching and sorting (68P10)


Related Items (6)

Comparator networks for binary heap construction ⋮ Fragile complexity of adaptive algorithms ⋮ Fragile complexity of comparison-based algorithms ⋮ Fragile complexity of adaptive algorithms ⋮ On the complexity of monotone circuits for threshold symmetric Boolean functions ⋮ Comparator networks for binary heap construction







This page was built for publication: Selection Networks

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3982712&oldid=12032790"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 29 January 2024, at 23:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki