- A. Borodin. Computational
complexity and the existence of complexity gaps. Journal of
the ACM, 19(1):158-174, January 1972.
References,
Citations,
etc.
- Robert L. Constable and Allan B. Borodin. Subrecursive programming
languages, part I: Efficiency and program structure. Journal
of the ACM, 19(3):526-568, July 1972.
References,
etc.
- A. Borodin. Corrigendum:
``Computational complexity and the existence of complexity gaps''.
Journal of the ACM, 19(3):576, July 1972.
References
and Citations.
- Allan Borodin, Nathan Linial, and Michael E. Saks. An optimal on-line algorithm for
metrical task system. Journal of the ACM,
39(4):745-763, October 1992.
References
and Citations.
- Allan Borodin, Prabhakar Raghavan, Baruch Schieber, and Eli Upfal. How much can hardware
help routing? Journal of the ACM, 44(5):726-741,
September 1997.
References,
Citations,
etc.
Shortcuts: