Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Heaps' law

Known as: Heaps law, Herdan's law 
In linguistics, Heaps' law (also called Herdan's law) is an empirical law which describes the number of distinct words in a document (or set of… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Abstract The impact of mine spoil on the landscape is significant, as excavated rock-debris is commonly disposed in heaps that… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2014
2014
The history of coal mining in South Poland has left a legacy of many spoil heaps across the landscape. These have presented the… Expand
  • table 1
  • figure 1
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Persistent, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
The aim of this paper is to demystify some of the popular myths related to tropical soil fertility management that have gained… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 4
Is this relevant?
2005
2005
  • Seth Pettie
  • 46th Annual IEEE Symposium on Foundations of…
  • 2005
  • Corpus ID: 2717102
Fredman, Sedgewick, Sleator and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Publisher Summary This chapter describes mitosis in diatoms and explores how the observations and inferences from these cells… Expand
  • figure 2
  • figure 7
  • figure 10
  • figure 12
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Programmers hoping to achieve performance improvements often use custom memory allocators. This in-depth study examines eight… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
2002
2002
In the classical meldable heap data type we maintain an item-disjoint collection of heaps under the operations find-min, insert… Expand
Is this relevant?
2000
2000
The cache hierarchy prevalent in todays high performance processors has to be taken into account in order to design algorithms… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1988
Highly Cited
1988
The relaxed heap is a priority queue data structure that achieves the same amortized time bounds as the Fibonacci heap—a sequence… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?