CORE
馃嚭馃嚘聽
聽 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Filters
4 research outputs found
Optimal parallel selection has complexity O(Log Log N)
Author
Ajtai
Blum
+12聽more
Borodin
Cole
Endre Szemer茅di
Gabber
Ger茅b-Graus
J谩nos Koml贸s
Lubotzky
Margulis
Mikl贸s Ajtai
Reischuk
Valiant
W.L. Steiger
Publication venue
'Elsevier BV'
Publication date
Field of study
No full text
Crossref