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
Fully dynamic maximal independent set with sublinear update..:
, In:
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
,
Assadi, Sepehr
;
Onak, Krzysztof
;
Schieber, Baruch
. - p. 815-826 , 2018
Link:
https://dl.acm.org/doi/10.1145/3188745.3188922
RT T1 <cTitle>Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing</cTitle>: T1 <Title>Fully dynamic maximal independent set with sublinear update time</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3188922&Exemplar=1&LAN=DE A1 Assadi, Sepehr A1 Onak, Krzysztof A1 Schieber, Baruch A1 Solomon, Shay PB ACM YR 2018 K1 dynamic distributed algorithms K1 dynamic graph algorithms K1 maximal independent set K1 Theory of computation K1 Design and analysis of algorithms K1 Graph algorithms analysis K1 Dynamic graph algorithms K1 Mathematics of computing K1 Discrete mathematics K1 Graph theory K1 Graph algorithms SP 815 OP 826 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3188745.3188922 DO https://dl.acm.org/doi/10.1145/3188745.3188922 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
