Deterministic Rendezvous in Trees with Little Memory - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Pierre Fraigniaud, Andrzej Pelc. Deterministic Rendezvous in Trees with Little Memory. In Gadi Taubenfeld, editor, Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008. Proceedings. Volume 5218 of Lecture Notes in Computer Science, pages 242-256, Springer, 2008. [doi]

The following publications are possibly variants of this publication:

Deterministic rendezvous in infinite treesSubhash Bhagat, Andrzej Pelc. TCS, 984:114313, February 2024. [doi]

Tree exploration with little memoryKrzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc. soda 2002: 588-597 [doi]

Tree exploration with little memoryKrzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc. jal, 51(1):38-63, 2004. [doi]

Delays Induce an Exponential Memory Gap for Rendezvous in TreesPierre Fraigniaud, Andrzej Pelc. TALG, 9(2):17, 2013. [doi]

Delays induce an exponential memory gap for rendezvous in treesPierre Fraigniaud, Andrzej Pelc. spaa 2010: 224-232 [doi]

Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal TerrainsJurek Czyzowicz, Adrian Kosowski, Andrzej Pelc. mst, 52(2):179-199, 2013. [doi]

Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal TerrainsJurek Czyzowicz, Adrian Kosowski, Andrzej Pelc. mfcs 2010: 294-305 [doi]

runs on WebDSL