Results 61 to 70 of about 37,551,526 (314)
FASTSET: A Fast Data Structure for the Representation of Sets of Integers
We describe a simple data structure for storing subsets of { 0 , … , N − 1 } , with N a given integer, which has optimal time performance for all the main set operations, whereas previous data structures are non-optimal for at least ...
Giuseppe Lancia, Marcello Dalpasso
doaj +1 more source
Interactive System for Algorithm and Data Structure Visualization [PDF]
This work is dedicated to the design, implementation and evaluation of a new algorithm visualization system. The currently available systems and libraries are briefly compared with each other based on the visualizations and functionalities they provide ...
Patrik Perhac, Slavomir Simonak
doaj
An alternative efficient chessboard representation based on 4-bit piece coding [PDF]
This paper describes theoretical and practical aspects of an alternative efficient chessboard representation based on 4-bit piece coding technique. There are two main approaches used by the majority of computer chess programs: arrays and bitboards ...
Vučković Vladan
doaj +1 more source
Specific "scientific" data structures, and their processing
Programming physicists use, as all programmers, arrays, lists, tuples, records, etc., and this requires some change in their thought patterns while converting their formulae into some code, since the "data structures" operated upon, while elaborating ...
Carl M. Bender+14 more
core +3 more sources
Interaction extracellular vesicles (iEVs) are hybrid vesicles formed through host‐pathogen communication. They facilitate immune evasion, transfer pathogens' molecules, increase host cell uptake, and enhance virulence. This Perspective article illustrates the multifunctional roles of iEVs and highlights their emerging relevance in infection dynamics ...
Bruna Sabatke+2 more
wiley +1 more source
Key Concepts, Weakness and Benchmark on Hash Table Data Structures
Most computer programs or applications need fast data structures. The performance of a data structure is necessarily influenced by the complexity of its common operations; thus, any data-structure that exhibits a theoretical complexity of amortized ...
Santiago Tapia-Fernández+2 more
doaj +1 more source
Data structures for retrieval on integer grids [PDF]
A family of data structures is presented for retrieval of the sum of values of points within a half-plane or polygon, given that the points are on integer coordinates in the plane.
Katz, Martin David, Volper, Dennis J.
core +1 more source
Succinct data structures for representing equivalence classes
Given a partition of an n element set into equivalence classes, we consider time-space tradeoffs for representing it to support the query that asks whether two given elements are in the same equivalence class.
Lewenstein, Moshe+2 more
core +1 more source
Deterministic sub-linear space LCE data structures with efficient construction [PDF]
Given a string $S$ of $n$ symbols, a longest common extension query $\mathsf{LCE}(i,j)$ asks for the length of the longest common prefix of the $i$th and $j$th suffixes of $S$. LCE queries have several important applications in string processing, perhaps
Bannai, Hideo+5 more
core +2 more sources
B cells sense external mechanical forces and convert them into biochemical signals through mechanotransduction. Understanding how malignant B cells respond to physical stimuli represents a groundbreaking area of research. This review examines the key mechano‐related molecules and pathways in B lymphocytes, highlights the most relevant techniques to ...
Marta Sampietro+2 more
wiley +1 more source