Subject
General Computer Science,Theoretical Computer Science
Reference9 articles.
1. Lower bound arguments with “inaccessible” numbers;Dietzfelbinger;J. Comput. System Sci.,1988
2. On the complexity of computations under varying sets of primitives;Dobkin;J. Comput. System Sci.,1979
3. How good is the information theory bound in sorting?;Fredman;Theoret. Comput. Sci.,1976
4. Sorting X + Y;Harper;Comm. Assoc. Comput. Mach.,1975
5. Balancing poset extensions;Kahn;Order,1984
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献