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
Checking linearizability using hitting families:
, In:
Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming
,
Ozkan, Burcu Kulahcioglu
;
Majumdar, Rupak
;
Niksic, Filip
- p. 366-377 , 2019
Link:
https://dl.acm.org/doi/10.1145/3293883.3295726
RT T1
Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming
: T1
Checking linearizability using hitting families
UL https://suche.suub.uni-bremen.de/peid=acm-3295726&Exemplar=1&LAN=DE A1 Ozkan, Burcu Kulahcioglu A1 Majumdar, Rupak A1 Niksic, Filip PB ACM YR 2019 K1 concurrent data structures K1 hitting families K1 linearizability K1 scheduling K1 Software and its engineering K1 Software creation and management K1 Software verification and validation K1 Software defect analysis K1 Software testing and debugging K1 Mathematics of computing K1 Discrete mathematics K1 Combinatorics K1 Computing methodologies K1 Concurrent computing methodologies K1 Concurrent algorithms SP 366 OP 377 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3293883.3295726 DO https://dl.acm.org/doi/10.1145/3293883.3295726 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)