Skip to main content


eCommons@Cornell

eCommons@Cornell >

Browsing by Author Borodin, Allan B.

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:   
Sort by: In order: Results/Page Authors/Record:
Showing results 1 to 6 of 6
PreviewIssue DateTitleAuthor(s)
Aug-1969Computational Complexity and the Existence of Complexity GapsBorodin, Allan B.
Apr-1982Fast Parallel Matrix and GCD ComputationsBorodin, Allan B.; Von zur Gathen, Joachim; Hopcroft, John E.
Sep-1981Merging on Parallel Models of ComputationBorodin, Allan B.; Hopcroft, John E.
Mar-1970On the Efficiency of Programs in Subrecursive FormalismsConstable, Robert L.; Borodin, Allan B.
Nov-1981Routing in NetworksBorodin, Allan B.; Hopcroft, John E.
Jul-1976Some Comments on Functional Self-Reducibility and the NP HierarchyBorodin, Allan B.; Demers, Alan J.
Showing results 1 to 6 of 6

 

© 2014 Cornell University Library Contact Us