The scientific works of Rainer Kemp (1949--2004)

DOI10.1016/J.TCS.2005.04.012zbMATH Open1086.01503OpenAlexW2042559922MaRDI QIDQ2369005FDOQ2369005

Yanyan Li

Publication date: 28 April 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.04.012

Recommendations

• scientific article; zbMATH DE number 2021772
• Kleitman and combinatorics: A celebration
• Connections in discrete mathematics. A celebration of the work of Ron Graham
• scientific article; zbMATH DE number 1832988
• scientific article

zbMATH Keywords

ObituaryBibliographyAnalysis of algorithmsCombinatorial enumerationAsymptotic methods

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70)

Cites Work

• The average height of planted plane trees with M leaves
• The average height of r-tuply rooted planted plane trees
• Title not available (Why is that?)
• Generating words lexicographically: An average-case analysis
• Title not available (Why is that?)
• The average number of registers needed to evaluate a binary tree optimally
• On the average oscillation of a stack
• Title not available (Why is that?)
• A note on the stack size of regularly distributed binary trees
• Title not available (Why is that?)
• A note on the density of inherently ambiguous context-free languages
• On the number of words in the language \(\{w \epsilon \Sigma^* | w=w^ r\}^ 2\)
• A one-to-one correspondence between two classes of ordered trees
• On the average depth of a prefix of the Dycklanguage \(D_ 1\).
• Title not available (Why is that?)
• On the number of deepest nodes in ordered trees
• Exact satisfiability, a natural extension of set partition, and its average case behavior
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on the number of leftist trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• LR(0) grammars generated by LR(0) parsers
• The expected additive weight of trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Binary search trees constructed from nondistinct keys with/without specified probabilities
• Title not available (Why is that?)
• On the joint distribution of the nodes in uniform multidimensional binary trees
• Automata, languages and programming. 2nd colloquium, University of Saarbrücken, July 29-August 2, 1974
• On the representation of simply generated trees by leftist trees
• A one-to-one correspondence between a class of leftist trees and binary trees
• Title not available (Why is that?)
• On the average height of \(b\)-balanced ordered trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• The average stack size of a derivation tree generated by a linear context-free grammar
• Title not available (Why is that?)
• Title not available (Why is that?)
• Balanced ordered trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the average minimal prefix-length of the generalized semi-Dycklanguage
• Uniformly growing backtrack trees
• Title not available (Why is that?)
• On the inner structure of multidimensional simply generated trees
• Die Grösse des Minimalen Analysators Einer Kontextfreien Grammatik

Cited In (1)

• Philippe Flajolet's early work in combinatorics

This page was built for publication: The scientific works of Rainer Kemp (1949--2004)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369005)