Author:
Courtiel Julien,Dorbec Paul,Lecoq Romain
Funder
European Regional Development Fund
European Science Foundation
Région Normandie
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference15 articles.
1. Couder, C.: Fighting regressions with git bisect (2009). https://git-scm.com/docs/git-bisect-lk2009
2. Carmo, R., Donadelli, J., Kohayakawa, Y., Laber, E.: Searching in random partially ordered sets. Theoret. Comput. Sci. 321(1), 41–57 (2004). https://doi.org/10.1016/j.tcs.2003.06.001
3. Ben-Asher, Y., Farchi, E., Newman, I.: Optimal search in trees (1999). https://doi.org/10.1137/S009753979731858X
4. Onak, K., Parys, P.: Generalization of binary search: searching in trees and forest-like partial orders, pp. 379–388 (2006). https://doi.org/10.1109/FOCS.2006.32
5. Mozes, S., Onak, K., Weimann, O.: Finding an optimal tree searching strategy in linear time, pp. 1096–1105 (2008)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Random Generation of Git Graphs;Electronic Proceedings in Theoretical Computer Science;2024-06-24