FINDING CONNECTED COMPONENTS AND CONNECTED ONES ON A MESH-CONNECTED PARALLEL COMPUTERNASSIMI D; SAHNI S.1980; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1980; VOL. 9; NO 4; PP. 744-757; BIBL. 16 REF.Article

FLOWSHOP AND JOBSHOP SCHEDULES: COMPLEXITY AND APPROXIMATION.GONZALEZ T; SAHNI S.1978; OPER. RES.; U.S.A.; DA. 1978; VOL. 26; NO 1; PP. 36-52; BIBL. 11 REF.Article

Scheduling multipipeline and multiprocessor computersSAHNI, S.IEEE transactions on computers. 1984, Vol 33, Num 7, pp 637-645, issn 0018-9340Article

FINITE-TEMPERATURE EFFECTS ON COMMENSURATE-INCOMMENSURATE PHASE TRANSITIONS IN ONE AND TWO DIMENSIONSPARAMDEEP SAHNI S.1981; PHYS. REV. B; ISSN 0163-1829; USA; DA. 1981; VOL. 23; NO 3; PP. 1325-1338; BIBL. 31 REF.Article

SCHEDULING INDEPENDENT TASKS WITH DUE TINES ON A UNIFORM PROCESSOR SYSTEMSAHNI S; YOOKUN CHO.1980; J. ASS. COMPUTG MACHIN.; USA; DA. 1980; VOL. 27; NO 3; PP. 550-563; BIBL. 5 REF.Article

BITONIC SORT ON A MESH-CONNECTED PARALLEL COMPUTER = TRI BITONIQUE DANS UN CALCULATEUR SIMULTANE MAILLENASSIMI D; SAHNI S.1979; IEEE TRANS. COMPUTERS; USA; DA. 1979; VOL. 28; NO 1; PP. 2-7; BIBL. 9 REF.Article

BINARY TREES AND PARALLEL SCHEDULING ALGORITHMSDEKEL E; SAHNI S.1983; IEEE TRANSACTIONS ON COMPUTERS; ISSN 0018-9340; USA; DA. 1983; VOL. 32; NO 3; PP. 307-315; BIBL. 38 REF.Article

PARALLEL ALGORITHMS TO SET UP THE BENES PERMUTATION NETWORKNASSIMI D; SAHNI S.1982; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1982; VOL. 31; NO 2; PP. 148-154; BIBL. 16 REF.Article

COMBINATORIAL PROBLEMS: REDUCIBILITY AND APPROXIMATIONSAHNI S; HOROWITZ E.1978; OPER. RES.; USA; DA. 1978; VOL. 26; NO 5; PP. 718-759; BIBL. 4 P.Article

Scheduling master-slave multiprocessor systemsSAHNI, S.IEEE transactions on computers. 1996, Vol 45, Num 10, pp 1195-1199, issn 0018-9340Article

OPTIMAL BPC PERMUTATIONS ON A CUBE CONNECTED SIMD COMPUTERNASSIMI D; SAHNI S.1982; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1982; VOL. 31; NO 4; PP. 338-341; BIBL. 7 REF.Article

COMPLEXITY OF SCHEDULING SHOPS WITH NO WAIT IN PROCESSSAHNI S; CHO Y.1979; MATH. OPER. RES.; USA; DA. 1979; VOL. 4; NO 4; PP. 448-457; BIBL. 19 REF.Article

PARALLEL PERMUTATION AND SORTING ALGORITHMS AND A NEW GENERALIZED CONNECTION NETWORKNASSIMI D; SAHNI S.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 3; PP. 642-667; BIBL. 23 REF.Article

NEARLY ON LINE SCHEDULING OF A UNIFORM PROCESSOR SYSTEM WITH RELEASE TIMESSAHNI S; YOOKUN CHO.1979; S.I.A.M. J. COMPUTG; USA; DA. 1979; VOL. 8; NO 2; PP. 275-285; BIBL. 10 REF.Article

THE COMPUTATION OF POWERS OF SYMBOLIC POLYNOMIALS.HOROWITZ E; SAHNI S.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 2; PP. 201-208; BIBL. 8 REF.Article

ON THE COMPUTATIONAL COMPLEXITY OF PROGRAM SCHEME EQUIVALENCEHUNT HB III; CONSTABLE RL; SAHNI S et al.1980; S.I.A.M. J. COMPUTG.; USA; DA. 1980; VOL. 9; NO 2; PP. 396-416; BIBL. 14 REF.Article

Models, techniques, and algorithms for finding, selecting, and displaying patterns in strings and other discrete objectsMEHTA, D. P; SAHNI, S.The Journal of systems and software. 1997, Vol 39, Num 3, pp 201-221, issn 0164-1212Article

Np-hard module rotation problemsKEUMOG AHN; SAHNI, S.IEEE transactions on computers. 1993, Vol 42, Num 12, pp 1506-1510, issn 0018-9340Article

Computing biconnected components on a hypercubeJINWOON WOO; SAHNI, S.Journal of supercomputing. 1991, Vol 5, Num 1, pp 73-87, issn 0920-8542, 15 p.Article

Acrylated phosphonate esters containing 1,3-dioxane and 1,3-dioxolane moieties as adhesion-promoting agents for dentin and hard tissues. ICABASSO, I; SAHNI, S.Journal of biomedical materials research. 1990, Vol 24, Num 6, pp 705-720, issn 0021-9304, 16 p.Conference Paper

Coordination chemistry of chelating resins and ion exchangersSAHNI, S. K; REEDIJK, J.Coordination chemistry reviews. 1984, Vol 59, pp 1-139, issn 0010-8545Article

Nearly on-line scheduling of multiprocessor systems with memoriesLAI, T.-H; SAHNI, S.Journal of algorithms (Print). 1983, Vol 4, Num 4, pp 353-362, issn 0196-6774Article

Parallel generation of postfix and tree formsDEKEL, E; SAHNI, S.ACM transactions on programming languages and systems. 1983, Vol 5, Num 3, pp 300-317, issn 0164-0925Article

Dual criteria preemptive open-shop problems with minimum makespanVAIRAKTARAKIS, G; SAHNI, S.Naval research logistics. 1995, Vol 42, Num 1, pp 103-121, issn 0894-069XArticle

A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graphBHASKER, J; SAHNI, S.Networks (New York, NY). 1987, Vol 17, Num 3, pp 307-317, issn 0028-3045Article