Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("PRODINGER, H")

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 40

  • Page / 2
Export

Selection :

  • and

NON-REPETITIVE SEQUENCES AND GRAY CODEPRODINGER H.1983; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1983; VOL. 43; NO 1; PP. 113-116; BIBL. 7 REF.Article

A NOTE ON A RESULT OF R. KEMP ON R-TUPLY ROOTED PLANTED PLANE TREESPRODINGER H.1982; COMPUTING (WIEN); ISSN 0010-485X; AUT; DA. 1982; VOL. 28; NO 4; PP. 363-366; ABS. GER; BIBL. 3 REF.Article

GENERALIZING THE SUM OF DIGITS FUNCTIONPRODINGER H.1982; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 1; PP. 35-42; BIBL. 7 REF.Article

CONGRUENCES DEFINED BY LANGUAGES AND FILTERSPRODINGER H.1980; INFORM. AND CONTROL; USA; DA. 1980; VOL. 44; NO 1; PP. 36-46; BIBL. 7 REF.Article

ON THE INTERPOLATION OF DOL-SEQUENCESPRODINGER H.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 10; NO 1; PP. 107-108; BIBL. 9 REF.Article

ON A GENERALIZATION OF THE DYCK-LANGUAGE OVER A TWO LETTER ALPHABETPRODINGER H.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 28; NO 3; PP. 269-276; BIBL. 6 REF.Article

INFINITE 0-1-SEQUENCES WITHOUT LONG ADJACENT IDENTICAL BLOCKSPRODINGER H; URBANEK FJ.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 28; NO 3; PP. 277-289; BIBL. 12 REF.Article

External internal nodes in digital search trees via Mellin transformsPRODINGER, H.SIAM journal on computing (Print). 1992, Vol 21, Num 6, pp 1180-1183, issn 0097-5397Article

Hypothetical analyses : approximate counting in the style of Knuth, path length in the style of FlajoletPRODINGER, H.Theoretical computer science. 1992, Vol 100, Num 1, pp 243-251, issn 0304-3975Article

ON THE AVERAGE OSCILLATION OF THE CONTOUR OF MONOTONICALLY LABELLED ORDERED TREESKIRSCHENHOFER P; PRODINGER H.1982; WORLD CONFERENCE ON MATHEMATICS AT THE SERVICE OF MAN. 2/1982-06-28/LAS PALMAS; ESP; DA. 1982; PP. 394-399; BIBL. 14 REF.Conference Paper

The average height of the d-th highest leaf of a planted plane treePRODINGER, H.Networks (New York, NY). 1986, Vol 16, Num 1, pp 67-75, issn 0028-3045Article

Analysis of an algorithm to construct Fibonacci partitionsPRODINGER, H.R.A.I.R.O. Informatique théorique. 1984, Vol 18, Num 4, pp 387-394, issn 0399-0540Article

On the number of combinations without a fixed distancePRODINGER, H.Journal of combinatorial theory. Series A. 1983, Vol 35, Num 3, pp 362-365, issn 0097-3165Article

Partial match queries in relaxed multidimensional search treesMARTINEZ, C; PANHOLZER, A; PRODINGER, H et al.Algorithmica. 2001, Vol 29, Num 1-2, pp 181-204, issn 0178-4617Article

ON THE HEIGHT OF DERIVATION TREESKUICH W; PRODINGER H; URBANEK J et al.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 370-384; BIBL. 10 REF.Conference Paper

An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communicationGRABNER, P. J; PRODINGER, H.Information processing letters. 1998, Vol 65, Num 2, pp 89-93, issn 0020-0190Article

On stirling numbers for complex arguments and hankel contoursFLAJOLET, P; PRODINGER, H.SIAM journal on discrete mathematics (Print). 1999, Vol 12, Num 2, pp 155-159, issn 0895-4801Article

Average-Case Analysis of AlgorithmsPRODINGER, H; SZPANKOWSKI, W.Algorithmica. 2001, Vol 29, Num 1-2, issn 0178-4617, 369 p.Serial Issue

A result in order statistics related to probabilistic countingKIRSCHENHOFER, P; PRODINGER, H.Computing (Wien. Print). 1993, Vol 51, Num 1, pp 15-27, issn 0010-485XArticle

Efficient reorganization of binary search treesHOFRI, M; SHACHNAI, H.Algorithmica. 2001, Vol 31, Num 3, pp 378-402, issn 0178-4617Article

An analytic approach to the height of binary search treesDRMOTA, M.Algorithmica. 2001, Vol 29, Num 1-2, pp 89-119, issn 0178-4617Article

The contraction method for recursive algorithmsRÖSLER, U; RÜSCHENDORF, L.Algorithmica. 2001, Vol 29, Num 1-2, pp 3-33, issn 0178-4617Article

On the balance property of Patricia tries: external path length viewpointKIRSCHENHOFER, P; PRODINGER, H; SZPANKOWSKI, W et al.Theoretical computer science. 1989, Vol 68, Num 1, pp 1-17, issn 0304-3975Article

On the variance of the external path length in a symmetric digital trieKIRSCHENHOFER, P; PRODINGER, H; SZPANKOWSKI, W et al.Discrete applied mathematics. 1989, Vol 25, Num 1-2, pp 129-143, issn 0166-218X, 15 p.Article

Analytic variations on the Airy distributionFLAJOLET, P; LOUCHARD, G.Algorithmica. 2001, Vol 31, Num 3, pp 361-377, issn 0178-4617Article

  • Page / 2