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
Lower Bounds for Searching Robots, some Faulty:
, In:
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
,
Kupavskii, Andrey
;
Welzl, Emo
- p. 447-453 , 2018
Link:
https://dl.acm.org/doi/10.1145/3212734.3212745
RT T1 <cTitle>Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing</cTitle>: T1 <Title>Lower Bounds for Searching Robots, some Faulty</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3212745&Exemplar=1&LAN=DE A1 Kupavskii, Andrey A1 Welzl, Emo PB ACM YR 2018 K1 cow-at-a-fence problem K1 hybrid algorithms K1 lower bounds K1 m-ray search K1 Computing methodologies K1 Distributed computing methodologies K1 Distributed algorithms K1 Computer systems organization K1 Embedded and cyber-physical systems K1 Robotics K1 Dependable and fault-tolerant systems and networks K1 Mathematics of computing K1 Discrete mathematics K1 Combinatorics K1 Combinatorial algorithms SP 447 OP 453 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3212734.3212745 DO https://dl.acm.org/doi/10.1145/3212734.3212745 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
