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
Effective Algorithms for Calculation of Joint Action Spectr..:
, In:
2022 Ural-Siberian Conference on Biomedical Engineering, Radioelectronics and Information Technology (USBEREIT)
,
Nagrebetskaya, Julia
;
Panov, Vladimir
;
Vasilko, Ekaterina
.. - p. 212-215 , 2022
Link:
https://doi.org/10.1109/USBEREIT56278.2022.9923376
RT T1
2022 Ural-Siberian Conference on Biomedical Engineering, Radioelectronics and Information Technology (USBEREIT)
: T1
Effective Algorithms for Calculation of Joint Action Spectrum in the Theory of Sufficient Causes
UL https://suche.suub.uni-bremen.de/peid=ieee-9923376&Exemplar=1&LAN=DE A1 Nagrebetskaya, Julia A1 Panov, Vladimir A1 Vasilko, Ekaterina A1 Vakhitov, Elnaz A1 Ageev, Gleb YR 2022 K1 Java K1 Dictionaries K1 Toxicology K1 Computational modeling K1 Memory K1 C# languages K1 Time complexity K1 Boolean function K1 Boolean cube K1 Hamming weight K1 lattice-ordered set K1 poset K1 time complexity of an algorithm K1 dictionary K1 hash map K1 collision K1 response SP 212 OP 215 LK http://dx.doi.org/https://doi.org/10.1109/USBEREIT56278.2022.9923376 DO https://doi.org/10.1109/USBEREIT56278.2022.9923376 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)