The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Rainer Kemp: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rainer Kemp
    Die Größe des zustandsminimalen LR(0)-Analysators. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:223-232 [Conf]
  2. Ewald Speckenmeyer, Rainer Kemp
    On the Average Time Complexity of Set Partitioning. [Citation Graph (0, 0)][DBLP]
    CSL, 1989, pp:369-381 [Conf]
  3. Rainer Kemp
    The average depth of a prefix of the Dycklanguage D$. [Citation Graph (0, 0)][DBLP]
    FCT, 1979, pp:230-236 [Conf]
  4. Rainer Kemp
    Free cost measures of trees. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:175-190 [Conf]
  5. Rainer Kemp
    Monotonically Labelled Ordered Trees and Multidimensional Binary Trees. [Citation Graph (0, 0)][DBLP]
    FCT, 1993, pp:329-341 [Conf]
  6. Rainer Kemp
    An Estimation of the Set of States of the Minimal LR(0)-Acceptor. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:563-574 [Conf]
  7. Rainer Kemp
    Mehrdeutigkeiten Kontextfreier Grammatiken. [Citation Graph (0, 0)][DBLP]
    ICALP, 1974, pp:534-546 [Conf]
  8. Rainer Kemp
    On the Average Stack Size of Regularly Distributed Binary Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:340-355 [Conf]
  9. Rainer Kemp
    On a General Weight of Trees. [Citation Graph (0, 0)][DBLP]
    STACS, 1984, pp:109-120 [Conf]
  10. Rainer Kemp
    On the Expected Number of Nodes at Level k in 0-balanced Trees. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:566-576 [Conf]
  11. Rainer Kemp
    The Average Number of Registers Needed to Evaluate a Binary Tree Optimally. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1979, v:11, n:, pp:363-372 [Journal]
  12. Rainer Kemp
    A Note on the Density of Inherently Ambiguous Context-free Languages. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1980, v:14, n:, pp:295-298 [Journal]
  13. Rainer Kemp
    LR (0) Grammars Generated by LR (0) Parsers. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:265-280 [Journal]
  14. Rainer Kemp
    The Expected Additive Weight of Trees. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1989, v:26, n:8, pp:711-740 [Journal]
  15. Rainer Kemp
    Generating Words Lexicographically: An Average-Case Analysis. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:1, pp:17-89 [Journal]
  16. John W. Rosenthal, Ewald Speckenmeyer, Rainer Kemp
    Exact Satisfiability, a Natural Extension of Set Partition and Its Average Case Behavior. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1992, v:6, n:1-3, pp:185-200 [Journal]
  17. Rainer Kemp
    A Note on the Stack Size of Regularly Distributed Binary Trees. [Citation Graph (0, 0)][DBLP]
    BIT, 1980, v:20, n:2, pp:157-163 [Journal]
  18. Rainer Kemp
    On a Decidability and Translation Result Concerning LR(0) Grammars. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1984, v:20, n:12, pp:611-621 [Journal]
  19. Rainer Kemp
    The Analysis of an Additive Weight of Random Trees. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1987, v:23, n:10/11, pp:517-528 [Journal]
  20. Rainer Kemp
    A Note on Precedence Analysis. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1988, v:24, n:9, pp:401-413 [Journal]
  21. Rainer Kemp
    Binary Search Trees for d-dimensional Keys. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1989, v:25, n:10, pp:513-527 [Journal]
  22. Rainer Kemp
    Random Multidimensional Binary Trees. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1993, v:29, n:1, pp:9-36 [Journal]
  23. Rainer Kemp
    A Note on Two Classes of t-ary Trees. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1993, v:29, n:3, pp:167-174 [Journal]
  24. Rainer Kemp
    On the representation of simply generated trees by leftist trees. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2003, v:24, n:5, pp:581-605 [Journal]
  25. Rainer Kemp
    The Average Stack Size of a Derivation Tree Generated by a Linear Context-Free Grammar [Citation Graph (0, 0)][DBLP]
    Information and Control, 1979, v:42, n:3, pp:354-365 [Journal]
  26. Rainer Kemp
    A Note on the Number of Leftist Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:4, pp:227-232 [Journal]
  27. Rainer Kemp
    A One-to-One Correspondence between two Classes of Ordered Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:32, n:5, pp:229-234 [Journal]
  28. Rainer Kemp
    A One-to-One Correspondence Between a Class of Leftist Trees and Binary Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:3-4, pp:97-105 [Journal]
  29. Rainer Kemp
    The Reduction of Binary Trees by Means of an Input-Restricted Deque. [Citation Graph (0, 0)][DBLP]
    ITA, 1983, v:17, n:3, pp:249-284 [Journal]
  30. Rainer Kemp
    Uniformly Growing Backtrack Trees. [Citation Graph (0, 0)][DBLP]
    ITA, 1995, v:29, n:1, pp:45-73 [Journal]
  31. Rainer Kemp
    On the Average Minimal Prefix-Length of the Generalized Semi-Dycklanguage. [Citation Graph (0, 0)][DBLP]
    ITA, 1996, v:30, n:6, pp:545-561 [Journal]
  32. Rainer Kemp
    On the Expected Number of Leftist Nodes in Simply Generated Trees. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:3, pp:313-343 [Journal]
  33. Rainer Kemp
    On Prefixes of Formal Languages and Their Relation to the Average-Case Complexity of the Membership Problem. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1996, v:1, n:4, pp:259-304 [Journal]
  34. Rainer Kemp
    On Leftist Simply Generated Trees. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1999, v:4, n:4, pp:313-332 [Journal]
  35. Rainer Kemp
    Balanced Ordered Trees. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:1, pp:99-122 [Journal]
  36. Rainer Kemp
    On the Inner Structure of Multidimensional Simply Generated Trees. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:2/3, pp:121-146 [Journal]
  37. Rainer Kemp
    On the joint distribution of the nodes in uniform multidimensional binary trees. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:261-283 [Journal]
  38. Rainer Kemp
    Binary Search Trees Constructed from Nondistinct Keys with/without Specified Probabilities. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:156, n:1&2, pp:39-70 [Journal]

Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002