Search results

...) amortized time and deletion in ''O''((log ''n'' log log ''n'')/f(''n'')) amortized time, for any choice of 1 ≤ f(''n'') ≤ log log ''n''.<ref>{{cite tech repor ...two [[binary heap]]s efficiently if these heaps are implemented as [[Array data structure|array]]s. Specifically, the running time of shadow merge on two h ...

...tructure for a longer time than the removed item. Insertions take constant amortized time. ...ructure consists of a [[doubly linked list]] and a [[2–3–4 tree|2–4 tree]] data structure, each modified to keep track of its minimum-priority element. The ...

...ds on the difference between the largest and smallest key or constant. The data structure consists mainly of a series of buckets, the size of which increas ==Description of data structure== ...

Paul Dietz first introduced a data structure to solve this problem in }}.</ref> This data ...

{{Short description|Computer science data structure}} ...ent data structure]] with properties similar to a (non-persistent) [[array data structure|array]]. That is, after a value's update in a persistent array, t ...

{{Short description|Abstract data type in computer science}} ...notone priority queue''' is a variant of the [[priority queue]] [[abstract data type]] in which the priorities of extracted items are required to form a [[ ...

...="2" style="font-size: 125%; text-align: center" | '''Iacono's working set data structure''' Every element that has been inserted in the data structure is stored in exactly one of the trees and its corresponding deque ...

...|Programming technique for resolving duplicate hash values in a hash table data structure}} ...echnique for resolving [[hash collision|collisions]] in a [[hash table]] [[data structure]].<ref name="inventor">Fredman, M. L., Komlós, J., and Szemerédi, ...

...areas, including the [[order-maintenance problem]], [[cache-oblivious data structures]],<ref name="BenderCacheObl">{{citation | year = 2005}}.</ref> [[persistent data structure|data structure persistence]],<ref ...

{{Short description|Data structure for processing palindromes}} {{Infobox data structure ...

...puting]] and [[graph theory]], a '''dynamic connectivity''' structure is a data structure that dynamically maintains information about the connected compon ...[[if and only if]] they belong to the same set. The [[Amortized analysis|amortized]] time per operation is <math>\Theta(\alpha(n))</math>, where ''n'' is the ...

{{Short description|Data structure for priority queues}} {{Infobox data structure ...

{{Short description|Data structure}} ...nce been augmented to maintain dynamically various properties of a [[Tree (data structure)|tree]] such as diameter, center and median. ...

{{Short description|Data structure for approximate set membership}} A '''cuckoo filter''' is a space-efficient [[probabilistic]] [[data structure]] that is used to test whether an [[Element (mathematics)|element ...

{{Short description|Data structure}} {{Infobox data structure ...

{{Short description|Optimal data structure for priority queues}} {{Infobox data structure-amortized ...

{{Infobox data structure | type = [[Tree (data structure)|Tree]] ...

| contribution = Data structures and network algorithms | title = Data structures and network algorithms ...

...rst1=Jean-Paul |last1=Tremblay |first2=Grant A. |last2=Cheston |title=Data Structures and Software Development in an object-oriented domain |publisher=Eiffel Ed ...oven. It is an [[open problem]] whether there exists a dynamically optimal data structure in this model. ...

{{short description|Deep learning generative model to encode data representation}} ...instead of a single point, the network can avoid overfitting the training data. Both networks are typically trained together with the usage of the [[#Repa ...