Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("SAKS M")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 35

  • Page / 2
Export

Selection :

  • and

ANONYMITY IN LETTERS TO THE EDITORSAKS M. J; OSTROM T.PUBLIC (THE) OPINION QUARTERLY. 1973, Vol 37, Num 3, pp 417-422Article

A CLASS OF PERFECT GRAPHS ASSOCIATED WITH PLANAR RECTILINEAR REGIONSSAKS M.1982; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 3; PP. 330-342; BIBL. 4 REF.Article

Removing the Blinkers? A Critique of Recent Contributions to the Sociology of ProfessionsSAKS, M.Sociological (The) Review Keele. 1983, Vol 31, Num 1, pp 1-21Article

GROUP LABELINGS OF GRAPHSEDELMAN PH; SAKS M.1979; J. GRAPH. THEORY; USA; DA. 1979; VOL. 3; NO 2; PP. 135-140; BIBL. 2 REF.Article

A limit theorem for (min, +) matrix multiplicationSAKS, M. E.Mathematics of operations research. 1988, Vol 13, Num 4, pp 606-618, issn 0364-765XArticle

ON CHAINS AND SPERNER K-FAMILIES IN RANKED POSETS. IIGRIGGS JR; STURTEVANT D; SAKS M et al.1980; J. COMB. THEORY, SER. A; ISSN 0097-3165; USA; DA. 1980; VOL. 29; NO 3; PP. 391-394; BIBL. 3 REF.Article

COVERING REGIONS BY RECTANGLESCHAIKEN S; KLEITMAN DJ; SAKS M et al.1981; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1981; VOL. 2; NO 4; PP. 394-410; BIBL. 6 REF.Article

Approximating threshold circuits by rational functionsPATURI, R; SAKS, M. E.Information and computation (Print). 1994, Vol 112, Num 2, pp 257-272, issn 0890-5401Article

On computing majority by comparisonsSAKS, M. E; WERMAN, M.Combinatorica (Print). 1991, Vol 11, Num 4, pp 383-387, issn 0209-9683Article

A polyomino with no stochastic functionKAHN, J; SAKS, M.Combinatorica (Print). 1984, Vol 4, Num 2-3, pp 181-182, issn 0209-9683Article

Optimal space distributed order-preserving listsSAKS, M; ZAHAROGLOU, F.Journal of algorithms (Print). 1999, Vol 31, Num 2, pp 320-334, issn 0196-6774Article

Every poset has a central elementLINIAL, N; SAKS, M.Journal of combinatorial theory. Series A. 1985, Vol 40, Num 2, pp 195-210, issn 0097-3165Article

Non-deterministic communication complexity with few witnessesKARCHMER, M; NEWMAN, I; SAKS, M et al.Journal of computer and system sciences (Print). 1994, Vol 49, Num 2, pp 247-257, issn 0022-0000Article

A topological approach to evasivenessKAHN, J; SAKS, M; STURTEVANT, D et al.Combinatorica (Print). 1984, Vol 4, Num 4, pp 297-306, issn 0209-9683Article

Sample spaces with small bias on neighborhoods and error-correcting communication protocolsSAKS, M; ZHOU, S.Algorithmica. 2001, Vol 30, Num 3, pp 418-431, issn 0178-4617Article

Evolution of a transfer RNA gene through a point mutation in the anticodonSAKS, M. E; SAMPSON, J. R; ABELSON, J et al.Science (Washington, D.C.). 1998, Vol 279, Num 5357, pp 1665-1670, issn 0036-8075Article

Laparoscopic therapy for tubal pregnancy using prostaglandinsDECKARDT, R; SAKS, M; GRÄFF, H et al.Journal of reproductive medicine. 1993, Vol 38, Num 8, pp 587-591, issn 0024-7758Conference Paper

Some extremal problems arising from discrete control processesLICHTENSTEIN, D; LINIAL, N; SAKS, M et al.Combinatorica (Print). 1989, Vol 9, Num 3, pp 269-287, issn 0209-9683, 19 p.Article

Largest digraphs contained in all n-tournamentsLINIAL, N; SAKS, M; SOS, V. T et al.Combinatorica (Print). 1983, Vol 3, Num 1, pp 101-104, issn 0209-9683Article

Sample spaces with small bias on neighborhoods and error-correcting communication protocolsSAKS, M; ZHOU, S.Lecture notes in computer science. 1997, pp 95-109, issn 0302-9743, isbn 3-540-63248-4Conference Paper

Contributions of discrete tRNASer domains to amino-acylation by E.coli seryl-tRNA synthetase : a kinetic analysis using model RNA substratesSAMPSON, J. R; SAKS, M. E.Nucleic acids research. 1993, Vol 21, Num 19, pp 4467-4475, issn 0305-1048Article

Communication complexity and combinatorial lattice theoryLOVASZ, L; SAKS, M.Journal of computer and system sciences (Print). 1993, Vol 47, Num 2, pp 322-349, issn 0022-0000Conference Paper

The periodic balanced sorting networkDOWD, M; PERL, Y; RUDOLPH, L et al.Journal of the Association for Computing Machinery. 1989, Vol 36, Num 4, pp 738-757, issn 0004-5411Article

Size-depth tradeoffs for threshold circuitsIMPAGLIAZZO, R; PATURI, R; SAKS, M. E et al.SIAM journal on computing (Print). 1997, Vol 26, Num 3, pp 693-707, issn 0097-5397Article

Local Management of a global resource in a communication networkAFEK, Y; AWERBUCH, B; PLOTKIN, S et al.Journal of the Association for Computing Machinery. 1996, Vol 43, Num 1, pp 1-19, issn 0004-5411Article

  • Page / 2