scientific article; zbMATH DE number 2119714

MaRDI QIDQ4828987zbMATH OpenFDO

Authors Krzysztof Diks, Pierre Fraigniaud, Andrzej Pelc, Evangelos Kranakis

Publication date 29 November 2004

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)

Recommendations

• Tree exploration with little memory
• Tree exploration with logarithmic memory
• Tree exploration with logarithmic memory
• Graph exploration by a finite automaton
• Mathematical Foundations of Computer Science 2004

Cited in

(14)

• Tree exploration with logarithmic memory
• Searching without communicating: tradeoffs between performance and selection complexity
• Tree Exploration with an Oracle
• Optimal graph exploration without good maps
• Collective tree exploration
• STACS 2004
• Distributed chasing of network intruders
• Labeling schemes for tree representation
• Tree exploration with logarithmic memory
• Structural Information and Communication Complexity
• Black hole search in common interconnection networks
• Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
• Tree exploration with little memory
• Remembering without memory: tree exploration by asynchronous oblivious robots

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4828987)