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
An Optimal Algorithm for Finding the Spectrum of the Joint ..:
, In:
2023 IEEE Ural-Siberian Conference on Biomedical Engineering, Radioelectronics and Information Technology (USBEREIT)
,
Nagrebetskaya, Julia
;
Panov, Vladimir
;
Vasilko, Ekaterina
- p. 198-201 , 2023
Link:
https://doi.org/10.1109/USBEREIT58508.2023.10158845
RT T1 <cTitle>2023 IEEE Ural-Siberian Conference on Biomedical Engineering, Radioelectronics and Information Technology (USBEREIT)</cTitle>: T1 <Title>An Optimal Algorithm for Finding the Spectrum of the Joint Action of Binary Factors</Title> UL https://suche.suub.uni-bremen.de/peid=ieee-10158845&Exemplar=1&LAN=DE A1 Nagrebetskaya, Julia A1 Panov, Vladimir A1 Vasilko, Ekaterina YR 2023 SN 2769-3635 K1 Java K1 Boolean functions K1 Computer simulation K1 Biology K1 Time complexity K1 Information technology K1 Biomedical engineering K1 Boolean function K1 Boolean cube K1 linearly ordered set K1 directed graph K1 directed tree K1 binary relation K1 nonrecursive preorder traversal of nodes of a tree K1 algorithm time complexity SP 198 OP 201 LK http://dx.doi.org/https://doi.org/10.1109/USBEREIT58508.2023.10158845 DO https://doi.org/10.1109/USBEREIT58508.2023.10158845 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
