Results 1 to 10 of about 225,922 (311)
Voxelisation Algorithms and Data Structures: A Review [PDF]
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 +4 more sources
Contention-Sensitive Data Structures and Algorithms [PDF]
Theoretical Computer Science, 2009 Abstract A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in common cases, when there is no contention, or when processes with non-interfering operations access it concurrently.
Gadi Taubenfeld
openalex +3 more sources
Data structures and algorithms for tilings I
Theoretical Computer Science, 2003 AbstractBased on the mathematical theory of Delaney symbols, data structures and algorithms are presented for the analysis and manipulation of generalized periodic tilings in arbitrary dimensions.
Olaf Delgado‐Friedrichs
openalex +3 more sources
The design of data structures and algorithms
Science of Computer Programming, 1990 Vicky J. Bush
+6 more sources
ALGORITHMS AND DATA STRUCTURE LIBRARIES FOR JAVA
Acta Electrotechnica et Informatica, 2020 This paper is dedicated to the comparison of different libraries of algorithms and data structures for the Java language. Within the paper currently available and relevant libraries are analyzed and compared. Selected libraries are compared in terms of provided implementations of the particular data structures and algorithms, but also based on the ...
Patrik Patrik PERHÁČ +1 more
openalex +3 more sources
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
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
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
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
Defective Coloring on Classes of Perfect Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 In Defective Coloring we are given a graph $G$ and two integers $\chi_d$, $\Delta^*$ and are asked if we can $\chi_d$-color $G$ so that the maximum degree induced by any color class is at most $\Delta^*$.
Rémy Belmonte +2 more
doaj +1 more source