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

Search the dblp DataBase

Title:
Author:
Lars Jacobsen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lars Jacobsen, Kim S. Larsen
    Exponentially Decreasing Number of Operations in Balanced Trees. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:293-311 [Conf]
  2. Lars Jacobsen, Kim S. Larsen
    Complexity of Layered Binary Search Trees with Relaxed Balance. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:269-284 [Conf]
  3. Lars Jacobsen, Kim S. Larsen
    Exponentially decreasing number of operations in balanced trees. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2005, v:42, n:1, pp:57-78 [Journal]
  4. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro
    The Complexity of Clickomania [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  5. Lars Jacobsen, Kim S. Larsen
    Variants of (A, B)-Trees with Relaxed Balance. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2001, v:12, n:4, pp:455-478 [Journal]
  6. Lars Jacobsen, Kim S. Larsen, Morten N. Nielsen
    On the existence and construction of non-extreme (a, b)-trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:2, pp:69-73 [Journal]

Search in 0.001secs, Finished in 0.001secs
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