Skip to main content


eCommons@Cornell >

Browsing by Title

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 23301 to 23320 of 30586
< previous   next >
PreviewIssue DateTitleAuthor(s)
Dec-1976On Polynomial Time Isomorphism of Complete SetsBerman, L.; Hartmanis, Juris
Apr-1995On Presenting Monotonicity and On EA=>AEGries, David
Jun-1994On Program TransformationsEfremidis, Sofoklis G.
Sep-1993On Properties of Random ReductionsRohatgi, Pankaj
Feb-1989On p-SeparabilityDubhashi, Devdatt P.
1988On Puns: the Foundation of LettersCuller, Jonathan D.
Jun-1998On Quiescent Reliable CommunicationAguilera, Marcos Kawazoe; Chen, Wei; Toueg, Sam
Jan-1986On Randomized Stopping Points and Perfect GraphsDalang, R.; Trotter, L. E.; de Werra, D.
Dec-1986On RankingHemachandra, Lane A.
Nov-1995On Regularity-Preserving FunctionsKozen, Dexter
Mar-1979On Restrictions to Ensure Reproducible Behavior in Concurrent ProgramsSchneider, Fred B.; Bernstein, A. J.
Jul-1970On Scheduling MeetingsWagner, Robert A.
Dec-1973On Scolnik's Proposed Polynomial-Time Linear Programming AlgorithmGay, David M.
Jul-1973On Simple Goedel Numberings and TranslationsHartmanis, Juris; Baker, Theodore Paul
Jan-1975On Some Central Problems in Computational ComplexitySimon, Janos
Jul-1971On Some Methods Based on Broyden's Secant Approximation to the HessianDennis, John E., Jr.
Aug-1986On Some Most Probable Separations of Complexity ClassesCai, Jin-yi
1912On soul-winners and soul-winningWilson, J. Wallace
Oct-1985On Sparse Oracles Separating Feasible Complexity ClassesHartmanis, Juris; Hemachandra, Lane A.
Aug-1982On Sparse Sets in NP-PHartmanis, Juris
Showing results 23301 to 23320 of 30586
< previous   next >


© 2014 Cornell University Library Contact Us