I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Nearly Optimal Communication and Query Complexity of Bipart..:
, In:
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
,
Blikstad, Joakim
;
Van Den Brand, Jan
;
Efron, Yuval
.. - p. 1174-1185 , 2022
Link:
https://doi.org/10.1109/FOCS54457.2022.00113
RT T1
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
: T1
Nearly Optimal Communication and Query Complexity of Bipartite Matching
UL https://suche.suub.uni-bremen.de/peid=ieee-9996858&Exemplar=1&LAN=DE A1 Blikstad, Joakim A1 Van Den Brand, Jan A1 Efron, Yuval A1 Mukhopadhyay, Sagnik A1 Nanongkai, Danupon YR 2022 SN 2575-8454 K1 Computer science K1 Analytical models K1 Quantum computing K1 Computational modeling K1 Complexity theory K1 F.1.1 Models of Computation K1 F.1.3 Complexity Measures and Classes K1 F.2 Analysis of Algorithms and Problem Complexity SP 1174 OP 1185 LK http://dx.doi.org/https://doi.org/10.1109/FOCS54457.2022.00113 DO https://doi.org/10.1109/FOCS54457.2022.00113 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)