A Van Emde Boas tree (or Van Emde Boas priority queue; Dutch pronunciation: [vɑn 'ɛmdə 'boːɑs]), also known as a vEB tree, is a tree data structure… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Paul-Virak Khuong, Pat Morin
- ACM Journal of Experimental Algorithmics
- 2017

We attempt to determine the best order and search algorithm to store <i>n</i> comparable data items in an array, <i>A</i>, of… (More)

Is this relevant?

2015

2015

- Konrad Kulakowski
- ArXiv
- 2015

The growing popularity of shared-memory multiprocessor machines has caused significant changes in the design of concurrent… (More)

Is this relevant?

2015

2015

Is this relevant?

2015

2015

- Daxin Zhu, Lei Wang, Yingjie Wu, Xiaodong Wang
- ArXiv
- 2015

In this paper, we revisit the much studied LCS problem for two given sequences. Based on the algorithm of Iliopoulos and Rahman… (More)

Is this relevant?

2013

2013

The stratified tree, also called van Emde Boas tree, is a data structure implementing the full repertoire of instructions… (More)

Is this relevant?

2007

2007

Priority queues are essential for various network processing applications, including per-flow queueing with quality-of-service… (More)

Is this relevant?

2006

2006

- George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis
- J. Discrete Algorithms
- 2006

We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion… (More)

Is this relevant?

2004

2004

- Roman Dementiev, Lutz Kettner, Jens Mehnert, Peter Sanders
- ALENEX/ANALC
- 2004

Search tree data structures like van Emde Boas (vEB) trees are a theoretically attractive alternative to comparison based search… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Dan E. Willard
- SIAM J. Comput.
- 2000

This article illustrates several examples of computer science problems whose performance can be improved with the use of either… (More)

Is this relevant?

1985