Author:
Cheng Wen-Ju,Cox Jim,Zachos Stathis
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Aleliunas, R., Karp, R.M., Lipton, R.J., Lovász, L., Rackoff, C.: Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. In: 20th IEEE Symp. on Found. of Computer Science (FOCS 1979), pp. 218–223 (1979)
2. Armoni, R., Ta-Shma, A., Wigderson, A., Zhou, S.: An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs. J. ACM 47(2), 294–311 (2000)
3. Chaves, L.M., de Souza, D.J.: Waiting Time for a Run of N Success in Bernoulli Sequences. Rev. Bras. Biom (2007)
4. Chung, F.R.K.: Laplacians and the cheeger inequality for directed graphs. Annals of Combinatorics 9, 1–19 (2005)
5. Chung, K.-M., Reingold, O., Vadhan, S.: S-T Connectivity on Digraphs with a Known Stationary Distribution. ACM Transactions on Algorithms 7(3), Article 30 (2011)