×

Found 22 Documents (Results 1–22)

Decidability classes for mobile agents computing. (English) Zbl 1353.68090

Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16–20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 362-374 (2012).
MSC:  68Q10 68M12 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Deterministic rendezvous in trees with little memory. (English) Zbl 1161.68336

Taubenfeld, Gadi (ed.), Distributed computing. 22nd international symposium, DISC 2008, Arcachon, France, September 22–24, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87778-3/pbk). Lecture Notes in Computer Science 5218, 242-256 (2008).
MSC:  68M14 68R10
PDFBibTeX XMLCite
Full Text: DOI

Distributed computing with advice: Information sensitivity of graph coloring. (English) Zbl 1171.68859

Arge, Lars (ed.) et al., Automata, languages and programming. 34th international colloquium, ICALP 2007, Wrocław, Poland, July 9–13, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73419-2/pbk). Lecture Notes in Computer Science 4596, 231-242 (2007).
PDFBibTeX XMLCite
Full Text: DOI HAL

Oracle size, a new measure of difficulty for communication tasks. (English) Zbl 1314.68023

Proceedings of the 25th annual ACM symposium on principles of distributed computing, PODC ’06, Denver, CO, USA, July 23–26, 2006. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-59593-384-0). 179-187 (2006).
PDFBibTeX XMLCite
Full Text: DOI

Tree exploration with an oracle. (English) Zbl 1132.68507

Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2006. 31st international symposium, MFCS 2006, Stará Lesná, Slovakia, August 28–September 1, 2006. Proceedings. Berlin: Springer (ISBN 3-540-37791-3/pbk). Lecture Notes in Computer Science 4162, 24-37 (2006).
PDFBibTeX XMLCite
Full Text: DOI HAL

Collective tree exploration. (English) Zbl 1196.68171

Farach-Colton, Martin (ed.), LATIN 2004: Theoretical informatics. 6th Latin American symposium, Buenos Aires, Argentina, April 5–8, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21258-2/pbk). Lecture Notes in Computer Science 2976, 141-151 (2004).
PDFBibTeX XMLCite
Full Text: DOI

Graph exploration by a finite automaton. (English) Zbl 1096.68080

Fiala, Jiří(ed.) et al., Mathematical foundations of computer Science 2004. 29th international symposium, MFCS 2004, Prague, Czech Republic, August 22–27, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22823-3/pbk). Lecture Notes in Computer Science 3153, 451-462 (2004).
MSC:  68Q45 05C85 68R10
PDFBibTeX XMLCite
Full Text: DOI

Tree exploration with little memory. (English) Zbl 1093.68615

Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 6–8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-513-X/pbk). 588-597 (2002).
MSC:  68R10 68T05 68T40
PDFBibTeX XMLCite

Assigning labels in unknown anonymous networks (extended abstract). (English) Zbl 1314.68374

Proceedings of the 19th annual ACM symposium on principles of distributed computing, PODC ’00, Portland, OR, USA, July 16–19, 2000. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-183-6). 101-111 (2000).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field