Results 1 to 10 of about 561,904 (322)
Voxelisation Algorithms and Data Structures: A Review
Sensors, 2021 Voxel-based data structures, algorithms, frameworks, and interfaces have been used in computer graphics and many other applications for decades. There is a general necessity to seek adequate digital representations, such as voxels, that would secure ...
Mitko Aleksandrov +2 more
doaj +5 more sources
Contention-sensitive data structures and algorithms [PDF]
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
G. Taubenfeld
openaire +3 more sources
Data Structures and Algorithms
Scientific American, 1984 Wirth, Niklaus, Gutknecht, Jürg
semanticscholar +4 more sources
DATA STRUCTURES AND ALGORITHMS
Data structures and algorithms serve as the cornerstone of efficient computational problemsolving, enabling the organization and manipulation of data with optimal resource utilization. This chapter delves into foundational data structures, including arrays, linked lists, stacks, queues, and trees, alongside critical algorithms for sorting (e.g ...
Monu Sharma +4 more
+16 more sources
Exactly Hittable Interval Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Given a set system $\mathcal{X} = \{\mathcal{U},\mathcal{S}\}$, where $\mathcal{U}$ is a set of elements and $\mathcal{S}$ is a set of subsets of $\mathcal{U}$, an exact hitting set $\mathcal{U}'$ is a subset of $\mathcal{U}$ such that each subset in ...
S. M. Dhannya +2 more
doaj +1 more source
Testing Distributions of Huge Objects [PDF]
TheoretiCS, 2023 We initiate a study of a new model of property testing that is a hybrid of testing properties of distributions and testing properties of strings. Specifically, the new model refers to testing properties of distributions, but these are distributions over ...
Oded Goldreich, Dana Ron
doaj +1 more source
BDD-Based Algorithm for SCC Decomposition of Edge-Coloured Graphs [PDF]
Logical Methods in Computer Science, 2022 Edge-coloured directed graphs provide an essential structure for modelling and analysis of complex systems arising in many scientific disciplines (e.g. feature-oriented systems, gene regulatory networks, etc.).
Nikola Beneš +3 more
doaj +1 more source
Educational technology research and development, 2023 An important course in the computer science discipline is ‘Data Structures and Algorithms’ (DSA). The coursework lays emphasis on experiential learning for building students’ programming and algorithmic reasoning abilities.
A. Barczak +3 more
semanticscholar +1 more source
Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time [PDF]
TheoretiCS, 2023 Dynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a randomized Las Vegas dynamic connectivity data structure with $O(\log n(\log\log n)^2)$ amortized expected update time and $O(\log n/\log\log\log n ...
Shang-En Huang +4 more
doaj +1 more source
Algorithms and Data Structures for Hyperedge Queries
ACM Journal of Experimental Algorithmics, 2022 We consider the problem of querying the existence of hyperedges in hypergraphs. More formally, given a hypergraph, we need to answer queries of the form: “Does the following set of vertices form a hyperedge in the given hypergraph?” Our aim is to set up data structures based on hashing to answer these queries as fast as possible.
Bertrand, Jules +3 more
openaire +4 more sources