Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("MEHLHORN K")

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

Language

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 94

  • Page / 4
Export

Selection :

  • and

SOME REMARKS ON BOOLEAN SUMSMEHLHORN K.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 374-380; BIBL. 6 REF.Conference Paper

HEARLY OPTIMAL BINARY SEARCH TREES.MEHLHORN K.1975; ACTA INFORMAT.; ALLEM.; DA. 1975; VOL. 5; NO 4; PP. 287-295; BIBL. 7 REF.Article

PARSING MACRO GRAMMARS TOP DOWNMEHLHORN K.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 40; NO 2; PP. 123-143; BIBL. 10 REF.Article

ON THE SIZE OF SETS OF COMPUTABLE FUNCTIONS.MEHLHORN K.1973; IN: ANNU. SYMP. SWITCHING AUTOM. THEORY. 14; IOWA CITY; 1973; NORTHRIDGE; INST. ELECTR. ELECTRON. ENG. INC.; DA. 1973; PP. 190-196; BIBL. 9 REF.Conference Paper

LOWER BOUNDS ON THE EFFICIENCY OF TRANSFORMING STATIC DATA STRUCTURES INTO DYNAMIC STRUCTURESMEHLHORN K.1981; MATH. SYST. THEORY; ISSN 0025-5661; DEU; DA. 1981; VOL. 15; NO 1; PP. 1-16; BIBL. 6 REF.Article

A NEW DATA STRUCTURE FOR REPRESENTING SORTED LISTSMEHLHORN K.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 100; PP. 90-112; BIBL. 7 REF.Conference Paper

ARBITRARY WEIGHT CHANGES IN DYNAMIC TREESMEHLHORN K.1981; R.A.I.R.O., INFORM. THEOR.; ISSN 0399-0540; FRA; DA. 1981; VOL. 15; NO 3; PP. 183-211; ABS. FRE; BIBL. 9 REF.Article

DYNAMIC BINARY SEARCHMEHLHORN K.1979; S.I.A.M. J. COMPUTG; USA; DA. 1979; VOL. 8; NO 2; PP. 175-198; BIBL. 24 REF.Article

AN IMPROVED LOWER BOUND ON THE FORMULA COMPLEXITY OF CONTEXT-FREE RECOGNITION.MEHLHORN K.1976; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1976; VOL. 12; NO 11-12; PP. 523-524; ABS. ALLEM. RUSSE; BIBL. 4 REF.Article

AN EFFICIENT ALGORITHM FOR CONSTRUCTING NEARLY OPTIMAL PREFIX CODESMEHLHORN K.1980; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1980; VOL. 26; NO 5; PP. 513-517; BIBL. 8 REF.Article

SEARCHING, SORTING AND INFORMATION THEORYMEHLHORN K.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 131-145; BIBL. 3 P.Conference Paper

SOME REMARKS ON BOOLEAN SUMSMEHLHORN K.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 12; NO 4; PP. 371-375; BIBL. 6 REF.Article

A PARTIAL ANALYSIS OF HEIGHT-BALANCED TREES UNDER RANDOM INSERTIONS AND DELETIONSMEHLHORN K.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 4; PP. 748-760; BIBL. 19 REF.Article

SORTING PRESORTED FILESMEHLHORN K.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 67; PP. 199-212; BIBL. 8 REF.Conference Paper

A BEST POSSIBLE BOUND FOR WEIGHTED PATH LENGTH OF BINARY SEARCH TREES.MEHLHORN K.1977; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 2; PP. 235-239; BIBL. 6 REF.Article

POLYNOMIAL AND ABSTRACT SUBRECURSIVE CLASSES.MEHLHORN K.1976; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1976; VOL. 12; NO 2; PP. 147-178; BIBL. 1 P. 1/2; (ANNU. ACM SYMP. THEORY COMPUT. 6; SEATTLE, WASH.; 1974)Conference Paper

BRACKET-LANGUAGES ARE RECOGNIZABLE IN LOGARITHMIC SPACE.MEHLHORN K.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 5; NO 6; PP. 168-170; BIBL. 8 REF.Article

ROBUST BALANCING IN B-TREESHUDDLESTON S; MEHLHORN K.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 234-244; BIBL. 9 REF.Conference Paper

CODES: UNEQUAL PROBABILITIES, UNEQUAL LETTER COSTS.ALTENKAMP D; MEHLHORN K.1978; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1978; NO 62; PP. 15-25; BIBL. 12 REF.; (AUTOM. LANG. PROGRAM. COLLOQ. 5; UDINE; 1978)Conference Paper

AT2-optimal VLSI integer division and integer square rootingMEHLHORN, K.Integration (Amsterdam). 1984, Vol 2, Num 2, pp 163-167, issn 0167-9260Article

A NEW DATA STRUCTURE FOR REPRESENTING SORTED LISTSHUDDLESTON S; MEHLHORN K.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 17; NO 2; PP. 157-184; BIBL. 14 REF.Article

VAN WIJNGAARDEN GRAMMARS AND SPACE COMPLEXITY CLASS EXSPACE.DEUSSEN P; MEHLHORN K.1977; ACTA INFORMAT.; ALLEM.; DA. 1977; VOL. 8; NO 2; PP. 193-199; BIBL. 4 REF.Article

A faster approximation algorithm for the Steiner problem in graphsMEHLHORN, K.Information processing letters. 1988, Vol 27, Num 3, pp 125-128, issn 0020-0190Article

MONOTONE SWITCHING CIRCUITS AND BOOLEAN MATRIX PRODUCT.MEHLHORN K; GALIL Z.1976; COMPUTING; AUSTR.; DA. 1976; VOL. 16; NO 1-2; PP. 99-111; ABS. ALLEM.; BIBL. 5 REF.Article

COMPLEXITY ARGUMENTS IN ALGEBRAIC LANGUAGE THEORYALT H; MEHLHORN K.1979; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1979; VOL. 13; NO 3; PP. 217-225; ABS. FRE; BIBL. 9 REF.Article

  • Page / 4