default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRainer Kemp
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
[j29]Rainer Kemp:
On the representation of simply generated trees by leftist trees. Eur. J. Comb. 24(5): 581-605 (2003)- 2001
- [j28]Rainer Kemp:
On the Expected Number of Leftist Nodes in Simply Generated Trees. J. Autom. Lang. Comb. 6(3): 313-343 (2001)
1990 – 1999
- 1999
- [j27]Rainer Kemp:
A One-to-One Correspondence Between a Class of Leftist Trees and Binary Trees. Inf. Process. Lett. 71(3-4): 97-105 (1999) - [j26]Rainer Kemp:
On Leftist Simply Generated Trees. J. Autom. Lang. Comb. 4(4): 313-331 (1999) - 1998
- [j25]Rainer Kemp:
Generating Words Lexicographically: An Average-Case Analysis. Acta Informatica 35(1): 17-89 (1998) - [j24]Rainer Kemp:
On the joint distribution of the nodes in uniform multidimensional binary trees. Random Struct. Algorithms 13(3-4): 261-283 (1998) - [c11]Rainer Kemp:
On the Expected Number of Nodes at Level k in 0-balanced Trees. STACS 1998: 566-576 - 1996
- [j23]Rainer Kemp:
On the Average Minimal Prefix-Length of the Generalized Semi-Dycklanguage. RAIRO Theor. Informatics Appl. 30(6): 545-561 (1996) - [j22]Rainer Kemp:
On Prefixes of Formal Languages and Their Relation to the Average-Case Complexity of the Membership Problem. J. Autom. Lang. Comb. 1(4): 259-303 (1996) - [j21]Rainer Kemp:
Binary Search Trees Constructed from Nondistinct Keys with/without Specified Probabilities. Theor. Comput. Sci. 156(1&2): 39-70 (1996) - 1995
- [j20]Rainer Kemp:
Uniformly Growing Backtrack Trees. RAIRO Theor. Informatics Appl. 29(1): 45-73 (1995) - [j19]Rainer Kemp:
On the Inner Structure of Multidimensional Simply Generated Trees. Random Struct. Algorithms 6(2/3): 121-146 (1995) - 1994
- [j18]Rainer Kemp:
Balanced Ordered Trees. Random Struct. Algorithms 5(1): 99-122 (1994) - 1993
- [j17]Rainer Kemp:
Random Multidimensional Binary Trees. J. Inf. Process. Cybern. 29(1): 9-36 (1993) - [j16]Rainer Kemp:
A Note on Two Classes of t-ary Trees. J. Inf. Process. Cybern. 29(3): 167-174 (1993) - [c10]Rainer Kemp:
Monotonically Labelled Ordered Trees and Multidimensional Binary Trees. FCT 1993: 329-341 - 1992
- [j15]John W. Rosenthal, Ewald Speckenmeyer, Rainer Kemp:
Exact Satisfiability, a Natural Extension of Set Partition and Its Average Case Behavior. Ann. Math. Artif. Intell. 6(1-3): 185-200 (1992) - [p1]Rainer Kemp:
On the Stack Size of a Class of Backtrack Trees. Informatik 1992: 269-282
1980 – 1989
- 1989
- [j14]Rainer Kemp:
The Expected Additive Weight of Trees. Acta Informatica 26(8): 711-740 (1989) - [j13]Rainer Kemp:
Binary Search Trees for d-dimensional Keys. J. Inf. Process. Cybern. 25(10): 513-527 (1989) - [j12]Rainer Kemp:
A One-to-One Correspondence between two Classes of Ordered Trees. Inf. Process. Lett. 32(5): 229-234 (1989) - [c9]Ewald Speckenmeyer, Rainer Kemp:
On the Average Time Complexity of Set Partitioning. CSL 1989: 369-381 - 1988
- [j11]Rainer Kemp:
A Note on Precedence Analysis. J. Inf. Process. Cybern. 24(9): 401-413 (1988) - 1987
- [j10]Rainer Kemp:
The Analysis of an Additive Weight of Random Trees. J. Inf. Process. Cybern. 23(10/11): 517-528 (1987) - [j9]Rainer Kemp:
A Note on the Number of Leftist Trees. Inf. Process. Lett. 25(4): 227-232 (1987) - 1985
- [c8]Rainer Kemp:
Free cost measures of trees. FCT 1985: 175-190 - 1984
- [b1]Rainer Kemp:
Fundamentals of the average case analysis of particular algorithms. Wiley-Teubner series in computer science, Teubner 1984, ISBN 0471903221, pp. I-VIII, 1-233 - [j8]Rainer Kemp:
On a Decidability and Translation Result Concerning LR(0) Grammars. J. Inf. Process. Cybern. 20(12): 611-621 (1984) - [c7]Rainer Kemp:
On a General Weight of Trees. STACS 1984: 109-120 - 1983
- [j7]Rainer Kemp:
The Reduction of Binary Trees by Means of an Input-Restricted Deque. RAIRO Theor. Informatics Appl. 17(3): 249-284 (1983) - 1981
- [j6]Rainer Kemp:
LR (0) Grammars Generated by LR (0) Parsers. Acta Informatica 15: 265-280 (1981) - 1980
- [j5]Rainer Kemp:
A Note on the Density of Inherently Ambiguous Context-free Languages. Acta Informatica 14: 295-298 (1980) - [j4]Rainer Kemp:
A Note on the Stack Size of Regularly Distributed Binary Trees. BIT 20(2): 157-162 (1980) - [j3]Rainer Kemp:
The average height of r-typly rooted planted plane trees. Computing 25(3): 209-232 (1980)
1970 – 1979
- 1979
- [j2]Rainer Kemp:
The Average Number of Registers Needed to Evaluate a Binary Tree Optimally. Acta Informatica 11: 363-372 (1979) - [j1]Rainer Kemp:
The Average Stack Size of a Derivation Tree Generated by a Linear Context-Free Grammar. Inf. Control. 42(3): 354-365 (1979) - [c6]Rainer Kemp:
The average depth of a prefix of the Dycklanguage D$. FCT 1979: 230-236 - [c5]Rainer Kemp:
On the Average Stack Size of Regularly Distributed Binary Trees. ICALP 1979: 340-355 - 1975
- [c4]Rainer Kemp:
Die Größe des zustandsminimalen LR(0)-Analysators. Automata Theory and Formal Languages 1975: 223-232 - 1974
- [c3]Rainer Kemp:
Mehrdeutigkeiten Kontextfreier Grammatiken. ICALP 1974: 534-546 - 1972
- [c2]Rainer Kemp:
Die Grösse des minimalen Analysators einer kontextfreien Grammatik. GI Jahrestagung 1972: 99-106 - [c1]Rainer Kemp:
An Estimation of the Set of States of the Minimal LR(0)-Acceptor. ICALP 1972: 563-574
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
