Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("EVEN S")

Document Type [dt]

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

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 46

  • Page / 2

Export

Selection :

  • and

AN ALGORITHM FOR DETERMINING WHETHER THE CONNECTIVITY OF A GRAPH IS AT LEAST K.EVEN S.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 3; PP. 393-396; BIBL. 9 REF.Article

PARALLELISM IN TAPESORTING. = PARALLELISME DANS LE TRI SUR BANDEEVEN S.1974; COMMUNIC. A.C.M.; U.S.A.; DA. 1974; VOL. 17; NO 4; PP. 202-204Article

THE MINIMUM-LENGTH GENERATOR SEQUENCE PROBLEM IS NP-HARDEVEN S; GOLDREICH O.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 3; PP. 311-313; BIBL. 5 REF.Article

NETWORK FLOW AND TESTING GRAPH CONNECTIVITY.EVEN S; TARJAN RE.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 4; PP. 507-518; BIBL. 11 REF.Article

ECONOMICAL ENCODING OF COMMAS BETWEEN STRINGS.EVEN S; RODEH M.1978; COMMUNIC. A.C.M.; U.S.A.; DA. 1978; VOL. 21; NO 4; PP. 315-317; BIBL. 3 REF.Article

PERMUTATION GRAPHS AND TRANSITIVE GRAPHSEVEN S; PNUELI A.1972; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1972; VOL. 19; NO 3; PP. 400-410; BIBL. 4 REF.Serial Issue

AN OBSERVATION CONCERNING THE COMPLEXITY OF PROBLEMS WITH FEW SOLUTIONS AND ITS APPLICATION TO CRYPTOGRAPHYEVEN S; YACOBI Y.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 100; PP. 270-278; BIBL. 11 REF.Conference Paper

COMPUTING AN ST-NUMBERING.EVEN S; TARJAN RE.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 2; NO 3; PP. 339-344; BIBL. 5 REF.Article

AN O(N2.5) ALGORITHM FOR MAXIMUM MATCHING IN GENERAL GRAPHS.EVEN S; KARIV Q.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 100-112; BIBL. 6 REF.Conference Paper

AN ON-LINE EDGE-DELETION PROBLEMEVEN S; SHILOACH Y.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 1; PP. 1-4; BIBL. 4 REF.Article

CRYPTOCOMPLEXITY AND NP-COMPLETENESSEVEN S; YACOBI Y.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 195-207; BIBL. 14 REF.Conference Paper

A COMBINATORIAL PROBLEM WHICH IS COMPLETE IN POLYNOMIAL SPACE.EVEN S; TARJAN RE.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 4; PP. 710-719; BIBL. 10 REF.Article

A LINEAR-TIME APPROXIMATION ALGORITHM FOR THE WEIGHTED VERTEX COVER PROBLEMBAR YEHUDA R; EVEN S.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 2; PP. 198-203; BIBL. 6 REF.Article

EFFICIENT GENERATION OF OPTIMAL PREFIX CODE: EQUIPROBABLE WORDS USING UNEQUAL COST LETTERS.PERL Y; GAREY MR; EVEN S et al.1975; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1975; VOL. 22; NO 2; PP. 202-214; BIBL. 6 REF.Article

LINEAR ALGORITHM FOR DATA COMPRESSION VIA STRING MATCHINGRODEH M; PRATT VR; EVEN S et al.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 1; PP. 16-24; BIBL. 12 REF.Article

ON THE COMPLEXITY OF TIMETABLE AND MULTICOMMODITY FLOW PROBLEMS.EVEN S; ITAI A; SHAMIR A et al.1976; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 4; PP. 691-703; BIBL. 10 REF.Article

ON THE COMPLEXITY OF TIMETABLE AND MULTI-COMMODITY FLOW PROBLEMS.EVEN S; ITAI A; SHAMIR A et al.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 184-193; BIBL. 15 REF.Conference Paper

INTERSECTION GRAPHS OF CURVES IN THE PLANE.EHRLICH G; EVEN S; TARJAN RE et al.1976; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1976; VOL. 21; NO 1; PP. 8-20; BIBL. 4 REF.Article

Embedding interconnection networks in grids via the layered cross productEVEN, G; EVEN, S.Networks (New York, NY). 2000, Vol 36, Num 2, pp 91-95, issn 0028-3045Article

Reliable broadcast protocols in unreliable networksAWERBUCH, B; EVEN, S.Networks (New York, NY). 1986, Vol 16, Num 4, pp 381-396, issn 0028-3045Article

A construction of a cipher from a single pseudorandom permutationEVEN, S; MANSOUR, Y.Journal of cryptology. 1997, Vol 10, Num 3, pp 151-161, issn 0933-2790Article

A note on cake cuttingEVEN, S; PAZ, A.Discrete applied mathematics. 1984, Vol 7, Num 3, pp 285-296, issn 0166-218XArticle

Un modèle hydraulique de la Seine à l'étiageEVEN, S; POULIN, M.Rencontres hydrologiques Franco-Roumaine. Contribution au Programme Hydrologique International. 1992, pp 167-176Conference Paper

DES-like functions can generate the alternating groupEVEN, S; GOLDREICH, O.IEEE transactions on information theory. 1983, Vol 29, Num 6, pp 863-865, issn 0018-9448Article

A note on limited preemptionCOFFMAN, E. G; EVEN, S.Parallel processing letters. 1998, Vol 8, Num 1, pp 3-6, issn 0129-6264Article

  • Page / 2