暂无分享,去创建一个
Yann Disser | Angelika Steger | Frank Mousset | Nemanja Skoric | Andreas Noever | A. Steger | Frank Mousset | Y. Disser | N. Skoric | A. Noever
[1] Sergey Yekhanin,et al. Towards 3-query locally decodable codes of subexponential length , 2008, JACM.
[2] Richard J. Lipton,et al. Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[3] Xiaotie Deng,et al. Exploring an unknown graph , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[4] Mona Singh,et al. Piecemeal Graph Exploration by a Mobile Robot , 1999, Inf. Comput..
[5] Andrzej Pelc,et al. Graph exploration by a finite automaton , 2005, Theor. Comput. Sci..
[6] Omer Reingold,et al. Undirected connectivity in log-space , 2008, JACM.
[7] Frank Hoffmann. One Pebble Does Not Suffice to Search Plane Labyrinths , 1981, FCT.
[8] Michael A. Bender,et al. The power of a pebble: exploring and mapping directed graphs , 1998, STOC '98.
[9] Stefan Langerman,et al. Online graph exploration algorithms for cycles and trees by multiple searchers , 2012, Journal of Combinatorial Optimization.
[10] Christian Schindelhauer,et al. Online multi-robot exploration of grid graphs with rectangular obstacles , 2012, SPAA '12.
[11] Christian Schindelhauer,et al. Why Robots Need Maps , 2007, SIROCCO.
[12] Andrzej Pelc,et al. Tree exploration with logarithmic memory , 2007, SODA '07.
[13] Andrzej Pelc,et al. Collective tree exploration , 2004, Networks.
[14] Jérémie Chalopin,et al. Mapping Simple Polygons: The Power of Telling Convex from Reflex , 2015, TALG.
[15] Dana Ron,et al. A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor , 2013, ICALP.
[16] Susanne Albers,et al. Exploring Unknown Environments , 2000, SIAM J. Comput..
[17] Michael A. Bender,et al. The power of team exploration: two robots can learn unlabeled directed graphs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[18] Adrian Kosowski,et al. Fast Collaborative Graph Exploration , 2013, ICALP.
[19] Christian Schindelhauer,et al. A Recursive Approach to Multi-robot Exploration of Trees , 2014, SIROCCO.
[20] Christian Schindelhauer,et al. Strategies for parallel unaware cleaners , 2015, Theor. Comput. Sci..
[21] Leah Epstein,et al. On the online unit clustering problem , 2007, TALG.
[22] V. S. Anil Kumar,et al. Optimal constrained graph exploration , 2001, SODA '01.
[23] Manuel Blum,et al. On the power of the compass (or, why mazes are easier to search than graphs) , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[24] Krzysztof Diks,et al. Tree exploration with little memory , 2002, SODA.
[25] Thomas Sauerwald,et al. Tight bounds for the cover time of multiple random walks , 2009, Theor. Comput. Sci..
[26] Jérémie Chalopin,et al. Mapping Simple Polygons: How Robots Benefit from Looking Back , 2011, Algorithmica.
[27] Max Klimm,et al. Undirected Graph Exploration with ⊝(log log n) Pebbles , 2016, SODA.
[28] Noga Alon,et al. Many random walks are faster than one , 2007, SPAA '08.