On the public citation graph

Handbook of Data Structures and Applications

https://doi.org/10.1201/9781420035179
0 signed · 313 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.5281/zenodo.5603255openalex-extracted
inferred← citeshttps://doi.org/10.1002/9780470892107.ch1openalex-snapshot
String Data Structures for Computational Molecular Biology
inferred← citeshttps://doi.org/10.1002/9781118337462.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/cpe.2995openalex-snapshot
A concurrent van Emde Boas array as a fast and simple concurrent dynamic set alternative
inferred← citeshttps://doi.org/10.1002/fld.4900openalex-snapshot
Adjoint variable‐based shape optimization with bounding surface constraints
inferred← citeshttps://doi.org/10.1002/jcc.21868openalex-snapshot
A comparison of neighbor search algorithms for large rigid molecules
inferred← citeshttps://doi.org/10.1002/met.70043openalex-snapshot
Science–policy–practice insights for compound and multi‐hazard risks
inferred← citeshttps://doi.org/10.1007/11523468_47openalex-snapshot
Cache-Aware and Cache-Oblivious Adaptive Sorting
inferred← citeshttps://doi.org/10.1007/11590156_3openalex-snapshot
Developments in Data Structure Research During the First 25 Years of FSTTCS
inferred← citeshttps://doi.org/10.1007/11672142_4openalex-snapshot
External String Sorting: Faster and Cache-Oblivious
inferred← citeshttps://doi.org/10.1007/11841036_5openalex-snapshot
Dynamic Connectivity for Axis-Parallel Rectangles
inferred← citeshttps://doi.org/10.1007/11841036_63openalex-snapshot
Skewed Binary Search Trees
inferred← citeshttps://doi.org/10.1007/11889205_2openalex-snapshot
Algorithms and Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-1-4419-1216-9_6openalex-snapshot
Future Directions: Dynamic Graphs
inferred← citeshttps://doi.org/10.1007/978-1-84800-070-4_12openalex-snapshot
Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-24289-3_27openalex-snapshot
Simple and Fast Oexp(N) Algorithm for Finding an Exact Maximum Distance in E2 Instead of O(N^2) or O(N lgN)
inferred← citeshttps://doi.org/10.1007/978-3-030-34968-4_25openalex-snapshot
A Multi-target Code Generator for High-Level B
inferred← citeshttps://doi.org/10.1007/978-3-030-46714-2_14openalex-snapshot
Performance Analysis of Zippers
inferred← citeshttps://doi.org/10.1007/978-3-030-48981-6_2openalex-snapshot
Introduction to Mobile Robots Navigation, Localization and Mapping
inferred← citeshttps://doi.org/10.1007/978-3-030-57675-2_29openalex-snapshot
A Compression-Based Design for Higher Throughput in a Lock-Free Hash Map
inferred← citeshttps://doi.org/10.1007/978-3-030-65771-0openalex-snapshot
Pattern Recognition, Tracking and Vertex Reconstruction in Particle Detectors
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_44openalex-snapshot
Routing on Heavy-Path WSPD-Spanners
inferred← citeshttps://doi.org/10.1007/978-3-031-25820-6_3openalex-snapshot
Introduction to Matrix Factorizations
inferred← citeshttps://doi.org/10.1007/978-3-031-29313-9_32openalex-snapshot
Heuristic Algorithm for Extracting Frequent Patterns in Transactional Databases
inferred← citeshttps://doi.org/10.1007/978-3-032-05294-0_12openalex-snapshot
Algebraic and Dynamic Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_18openalex-snapshot
On Strictly Output-Sensitive Color Frequency Reporting
inferred← citeshttps://doi.org/10.1007/978-3-319-21963-9_24openalex-snapshot
Fast Algorithm for Finding Maximum Distance with Space Subdivision in E2
inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_19openalex-snapshot
Approximating the k-Level in Three-Dimensional Plane Arrangements
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_37openalex-snapshot
Beyond Level Planarity
inferred← citeshttps://doi.org/10.1007/978-3-319-50901-3_45openalex-snapshot
Efficient Genealogical Graph Layout
inferred← citeshttps://doi.org/10.1007/978-3-319-57315-1_15openalex-snapshot
O
inferred← citeshttps://doi.org/10.1007/978-3-319-57315-1_17openalex-snapshot
Q
inferred← citeshttps://doi.org/10.1007/978-3-319-57315-1_3openalex-snapshot
C
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_156-1openalex-snapshot
Incremental Sliding Window Analytics
inferred← citeshttps://doi.org/10.1007/978-3-319-66999-1_5openalex-snapshot
Information II: Science, Technology, and Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_20openalex-snapshot
Agglomerative Clustering of Growing Squares
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_58openalex-snapshot
A Framework for Algorithm Stability and Its Application to Kinetic Euclidean MSTs
inferred← citeshttps://doi.org/10.1007/978-3-319-77525-8_156openalex-snapshot
Incremental Sliding Window Analytics
inferred← citeshttps://doi.org/10.1007/978-3-319-90530-3_27openalex-snapshot
A New Algorithm for Finding Closest Pair of Vectors (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-319-92040-5_4openalex-snapshot
DTF: An I/O Arbitration Framework for Multi-component Data Processing Workflows
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_2openalex-snapshot
Cache-Oblivious Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_10openalex-snapshot
Additional PC-Tree Planarity Conditions
inferred← citeshttps://doi.org/10.1007/978-3-540-71351-7_21openalex-snapshot
Combinatorial Scientific Computing: The Enabling Power of Discrete Algorithms in Computational Science
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_41openalex-snapshot
Cuttings for Disks and Axis-Aligned Rectangles
inferred← citeshttps://doi.org/10.1007/978-3-540-75336-0_15openalex-snapshot
On the Limits of Cache-Oblivious Matrix Transposition
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_67openalex-snapshot
Finding Popular Places
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_8openalex-snapshot
Cache-Oblivious Red-Blue Line Segment Intersection
inferred← citeshttps://doi.org/10.1007/978-3-642-02008-7_9openalex-snapshot
Storage and Retrieval of Individual Genomes
inferred← citeshttps://doi.org/10.1007/978-3-642-02441-2_5openalex-snapshot
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_38openalex-snapshot
Universal Succinct Representations of Trees?
inferred← citeshttps://doi.org/10.1007/978-3-642-04444-1_41openalex-snapshot
Super-Efficient Aggregating History-Independent Persistent Authenticated Dictionaries
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_12openalex-snapshot
Approximate Weighted Farthest Neighbors and Minimum Dilation Stars
inferred← citeshttps://doi.org/10.1007/978-3-642-23397-5_14openalex-snapshot
A Generic Parallel Collection Framework
inferred← citeshttps://doi.org/10.1007/978-3-642-29035-0_8openalex-snapshot
Colored Range Searching on Internal Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_20openalex-snapshot
Dynamizing Succinct Tree Representations
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_28openalex-snapshot
Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_55openalex-snapshot
Finger Search in the Implicit Model
inferred← citeshttps://doi.org/10.1007/978-3-642-35926-2_30openalex-snapshot
Range Extremum Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-36036-7_11openalex-snapshot
Lock-Free Resizeable Concurrent Tries
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_64openalex-snapshot
Quad-K-d Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-55415-5_24openalex-snapshot
Authenticated Dictionary Based on Frequency
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_72openalex-snapshot
Replacing Mark Bits with Randomness in Fibonacci Heaps
inferred← citeshttps://doi.org/10.1007/978-981-95-0218-9_5openalex-snapshot
Sum-of-Max Chain Partition of a Tree
inferred← citeshttps://doi.org/10.1007/s00180-011-0235-7openalex-snapshot
Mutable objects in R
inferred← citeshttps://doi.org/10.1007/s00224-013-9455-2openalex-snapshot
Linear-Space Data Structures for Range Mode Query in Arrays
inferred← citeshttps://doi.org/10.1007/s00366-021-01304-yopenalex-snapshot
Strategy and algorithms for the parallel solution of the nearest neighborhood problem in shared-memory processors
inferred← citeshttps://doi.org/10.1007/s00453-008-9234-7openalex-snapshot
Dynamic Connectivity for Axis-Parallel Rectangles
inferred← citeshttps://doi.org/10.1007/s00453-008-9270-3openalex-snapshot
Guarding a Terrain by Two Watchtowers
inferred← citeshttps://doi.org/10.1007/s00454-009-9158-2openalex-snapshot
Cuttings for Disks and Axis-Aligned Rectangles in Three-Space
inferred← citeshttps://doi.org/10.1007/s00454-010-9265-0openalex-snapshot
An Improved Bound on the Number of Unit Area Triangles
inferred← citeshttps://doi.org/10.1007/s00454-012-9410-zopenalex-snapshot
Optimal Partition Trees
inferred← citeshttps://doi.org/10.1007/s00454-012-9443-3openalex-snapshot
Simple Proofs of Classical Theorems in Discrete Geometry via the Guth–Katz Polynomial Partitioning Technique
inferred← citeshttps://doi.org/10.1007/s00454-012-9465-xopenalex-snapshot
Witnessed k-Distance
inferred← citeshttps://doi.org/10.1007/s00454-014-9629-yopenalex-snapshot
A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-015-9701-2openalex-snapshot
Multilevel Polynomial Partitions and Simplified Range Searching
inferred← citeshttps://doi.org/10.1007/s00607-022-01085-2openalex-snapshot
On the correctness of a lock-free compression-based elastic mechanism for a hash trie design
inferred← citeshttps://doi.org/10.1007/s00778-016-0436-3openalex-snapshot
Order Indexes: supporting highly dynamic hierarchical data in relational main-memory database systems
inferred← citeshttps://doi.org/10.1007/s00778-024-00873-wopenalex-snapshot
Enabling space-time efficient range queries with REncoder
inferred← citeshttps://doi.org/10.1007/s10590-017-9193-3openalex-snapshot
Improving retrieval performance of translation memories using morphosyntactic analyses and generalized suffix arrays
inferred← citeshttps://doi.org/10.1007/s10766-015-0398-xopenalex-snapshot
A Loosely Coordinated Model for Heap-Based Priority Queues in Multicore Environments
inferred← citeshttps://doi.org/10.1007/s11554-021-01193-wopenalex-snapshot
Parallel fractal image compression using quadtree partition with task and dynamic parallelism
inferred← citeshttps://doi.org/10.1016/b978-0-12-415993-8.00044-xopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.cad.2021.103189openalex-snapshot
Sweep Encoding: Serializing Space Subdivision Schemes for Optimal Slicing
inferred← citeshttps://doi.org/10.1016/j.cma.2024.116997openalex-snapshot
Adaptive Deep Fourier Residual method via overlapping domain decomposition
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.01.001openalex-snapshot
Approximation algorithm for the kinetic robust K-center problem
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.09.002openalex-snapshot
A sensor-based framework for kinetic data compression
inferred← citeshttps://doi.org/10.1016/j.comgeo.2024.102090openalex-snapshot
Hierarchical categories in colored searching
inferred← citeshttps://doi.org/10.1016/j.comgeo.2024.102121openalex-snapshot
Routing on heavy path WSPD spanners
inferred← citeshttps://doi.org/10.1016/j.cpc.2011.09.005openalex-snapshot
Sinusoidal shaking in event-driven simulations
inferred← citeshttps://doi.org/10.1016/j.cpc.2021.108249openalex-snapshot
triSurfaceImmersion: Computing volume fractions and signed distances from triangulated surfaces immersed in unstructured meshes
inferred← citeshttps://doi.org/10.1016/j.dam.2008.10.006openalex-snapshot
Kinetic maintenance of mobile k -centres on trees
inferred← citeshttps://doi.org/10.1016/j.dam.2012.10.031openalex-snapshot
On the tree-depth of random graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2014.11.022openalex-snapshot
Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations
inferred← citeshttps://doi.org/10.1016/j.dam.2019.03.006openalex-snapshot
Querying relational event graphs using colored range searching data structures
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.07.029openalex-snapshot
Parallel local search algorithms for high school timetabling problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.07.031openalex-snapshot
Operations research applications of dichotomous search
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104794openalex-snapshot
c-trie++: A dynamic trie tailored for fast prefix searches
inferred← citeshttps://doi.org/10.1016/j.ins.2022.12.085openalex-snapshot
Concept drift detection with quadtree-based spatial mapping of streaming data
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.10.001openalex-snapshot
The d-deap*: a fast and simple cache-aligned d-ary deap
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.04.008openalex-snapshot
Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
inferred← citeshttps://doi.org/10.1016/j.is.2019.101427openalex-snapshot
Dual-PISA: An index for aggregation operations on time series data
inferred← citeshttps://doi.org/10.1016/j.is.2023.102316openalex-snapshot
CoCo-trie: Data-aware compression and indexing of strings
inferred← citeshttps://doi.org/10.1016/j.isprsjprs.2022.08.001openalex-snapshot
Repairing geometric errors in 3D urban models with kinetic data structures
inferred← citeshttps://doi.org/10.1016/j.jaccedu.2025.100968openalex-snapshot
Reforming accounting as a STEM discipline
inferred← citeshttps://doi.org/10.1016/j.jal.2012.02.001openalex-snapshot
Reasoning about visibility
inferred← citeshttps://doi.org/10.1016/j.jcta.2009.03.008openalex-snapshot
Extremal problems on triangle areas in two and three dimensions
inferred← citeshttps://doi.org/10.1016/j.jda.2010.12.001openalex-snapshot
Position heaps: A simple and dynamic text indexing data structure
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2017.11.026openalex-snapshot
Switching topology approach for UAV formation based on binary-tree network
inferred← citeshttps://doi.org/10.1016/j.jnca.2013.08.011openalex-snapshot
Reducing view inconsistency by predicting avatars' motion in multi-server distributed virtual environments
inferred← citeshttps://doi.org/10.1016/j.jpdc.2013.04.008openalex-snapshot
Oblivious algorithms for multicores and networks of processors
inferred← citeshttps://doi.org/10.1016/j.jpdc.2023.02.005openalex-snapshot
Policy enforcement in traditional non-SDN networks
inferred← citeshttps://doi.org/10.1016/j.jvolgeores.2014.07.012openalex-snapshot
Knowledge engineering in volcanology: Practical claims and general approach
inferred← citeshttps://doi.org/10.1016/j.mex.2019.02.028openalex-snapshot
A simple and space efficient segment tree implementation
inferred← citeshttps://doi.org/10.1016/j.neucom.2020.04.038openalex-snapshot
Remote-sensing image retrieval with tree-triplet-classification networks
inferred← citeshttps://doi.org/10.1016/j.patcog.2013.04.012openalex-snapshot
Self-organizing maps whose topologies can be learned with adaptive binary search trees using conditional rotations
inferred← citeshttps://doi.org/10.1016/j.scico.2019.102308openalex-snapshot
Modelling concurrent objects running on the TSO and ARMv8 memory models
inferred← citeshttps://doi.org/10.1016/j.scico.2022.102779openalex-snapshot
Compositional noninterference on hardware weak memory models
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.03.009openalex-snapshot
On coding labeled trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.04.036openalex-snapshot
On the limits of cache-oblivious rational permutations
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.12.030openalex-snapshot
Quad-kd trees: A general framework for kd trees and quad trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.03.011openalex-snapshot
A new coding-based algorithm for finding closest pair of vectors
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.11.024openalex-snapshot
Beyond level planarity: Cyclic, torus, and simultaneous level planarity
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.06.027openalex-snapshot
Fully persistent B-trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.10.011openalex-snapshot
Data structures for categorical path counting queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115537openalex-snapshot
Succinct encodings of binary trees with application to AVL trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115543openalex-snapshot
Bottom-up rebalancing binary search trees by flipping a coin
inferred← citeshttps://doi.org/10.1017/s0956796813000099openalex-snapshot
A consistent semantics of self-adjusting computation
inferred← citeshttps://doi.org/10.1017/s0956796814000033openalex-snapshot
Implicit self-adjusting computation for purely functional programs
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1017/s0963548308009127openalex-snapshot
On a Question of Bourgain about Geometric Incidences
inferred← citeshttps://doi.org/10.1017/s0963548311000010openalex-snapshot
Non-Degenerate Spheres in Three Dimensions
inferred← citeshttps://doi.org/10.1017/s1471068425000067openalex-snapshot
ASP-Based Multi-Shot Reasoning via DLV2 with Incremental Grounding
inferred← citeshttps://doi.org/10.1063/1.4826047openalex-snapshot
Fast Oexpected(N) algorithm for finding exact maximum distance in E2 instead of O(N2) or O(N lgN)
inferred← citeshttps://doi.org/10.1063/1.4881978openalex-snapshot
Heterogeneous delays making parents synchronized: A coupled maps on Cayley tree model
inferred← citeshttps://doi.org/10.1080/10618600.2026.2675431openalex-snapshot
Efficient Distributional Regression Trees Learning Algorithms for Calibrated Non-Parametric Probabilistic Forecasts
inferred← citeshttps://doi.org/10.1080/13658816.2014.965711openalex-snapshot
Rank-based strategies for cleaning inconsistent spatial databases
inferred← citeshttps://doi.org/10.1080/16864360.2007.10738552openalex-snapshot
Layered Modeling of Porous Structures with Voronoi Diagrams
inferred← citeshttps://doi.org/10.1080/17530350.2019.1708780openalex-snapshot
The editorial playlist as container technology: on Spotify and the logistical role of digital music packages
inferred← citeshttps://doi.org/10.1089/cmb.2009.0169openalex-snapshot
Storage and Retrieval of Highly Repetitive Sequence Collections
inferred← citeshttps://doi.org/10.1090/conm/837/16789openalex-snapshot
Divided difference operators for partial flag varieties
inferred← citeshttps://doi.org/10.1093/bioinformatics/bts380openalex-snapshot
Indel-tolerant read mapping with trinucleotide frequencies using cache-oblivious kd-trees
inferred← citeshttps://doi.org/10.1093/comjnl/bxac031openalex-snapshot
Mining Frequent Serial Positioning Episode Rules with Forward and Backward Search Technique from Event Sequences
inferred← citeshttps://doi.org/10.1093/comjnl/bxw018openalex-snapshot
Complete Balancing via Rotation
inferred← citeshttps://doi.org/10.1107/s2059798318009191openalex-snapshot
Improving signal strength in serial crystallography with DIALS geometry refinement
inferred← citeshttps://doi.org/10.1109/access.2013.2282500openalex-snapshot
LC/DC: Lockless Containers and Data Concurrency a Novel Nonblocking Container Library for Multicore Applications
inferred← citeshttps://doi.org/10.1109/aiccsa.2006.205131openalex-snapshot
The N-tree: an Indexing Technique for Nearest-Neighbor Queries
inferred← citeshttps://doi.org/10.1109/asianhost.2017.8354005openalex-snapshot
Obfuscating branch decisions based on encrypted data using MISR and hash digests
inferred← citeshttps://doi.org/10.1109/asonam.2018.8508257openalex-snapshot
Content-Aware Tweet Location Inference Using Quadtree Spatial Partitioning and Jaccard-Cosine Word Embedding
inferred← citeshttps://doi.org/10.1109/bibe.2016.17openalex-snapshot
2D Adaptive Grid-Based Image Analysis Approach for Biological Networks
inferred← citeshttps://doi.org/10.1109/bigdataservice49289.2020.00036openalex-snapshot
Data Structure for Packet De-Duplication in Distributed Environments
inferred← citeshttps://doi.org/10.1109/cdc.2010.5718001openalex-snapshot
Closed-loop optimal experiment design: The partial correlation approach
inferred← citeshttps://doi.org/10.1109/clei67442.2025.11420520openalex-snapshot
Brodnik’s Data Structure in Practice, Revisited
inferred← citeshttps://doi.org/10.1109/csci54926.2021.00356openalex-snapshot
Preservation of Manual Changes and Provenance for Data Quality using the Nano Version Control Repo
inferred← citeshttps://doi.org/10.1109/ee-rds53766.2021.9708575openalex-snapshot
Nano Version Control and the Repo as the Next Data Structure in Computer Science and Artificial Intelligence
inferred← citeshttps://doi.org/10.1109/eeei.2010.5661956openalex-snapshot
The impact of memory and processor in determining the performance of programs
inferred← citeshttps://doi.org/10.1109/glocom.2010.5683219openalex-snapshot
Monitoring-Tree: An Innovative Technique for Failure Localization in WDM Translucent Networks
inferred← citeshttps://doi.org/10.1109/hpsr52026.2021.9481841openalex-snapshot
High-speed Connection Tracking in Modern Servers
inferred← citeshttps://doi.org/10.1109/iccd.2012.6378696openalex-snapshot
Track assignment considering crosstalk-induced performance degradation
inferred← citeshttps://doi.org/10.1109/iccsa.2007.50openalex-snapshot
Dynamic Software Adaptation with Dependence Analysis for Multi-Agent Platform
inferred← citeshttps://doi.org/10.1109/iccsa.2007.72openalex-snapshot
Kinetic Convex Hull Algorithm Using Spiral Kinetic Data Structure
inferred← citeshttps://doi.org/10.1109/iccse.2013.6553999openalex-snapshot
Efficient computation of matrix chain
inferred← citeshttps://doi.org/10.1109/icdcs.2019.00061openalex-snapshot
Dependable Policy Enforcement in Traditional Non-SDN Networks
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00158openalex-snapshot
REncoder: A Space-Time Efficient Range Filter with Local Encoder
inferred← citeshttps://doi.org/10.1109/icns65417.2025.10976940openalex-snapshot
Proposal of UAS Strategic Conflict Detection Concept with a Centralised Service in Multi-USSP Environment Using an Octree Data Structure
inferred← citeshttps://doi.org/10.1109/iscc.2013.6755014openalex-snapshot
PUBSUB: An efficient publish/subscribe system
inferred← citeshttps://doi.org/10.1109/ispdc52870.2021.9521630openalex-snapshot
Towards an Elastic Lock-Free Hash Trie Design
inferred← citeshttps://doi.org/10.1109/isssr.2016.017openalex-snapshot
Reliability of Software Backup System in the Presence of Common Cause Failure
inferred← citeshttps://doi.org/10.1109/itherm55375.2024.10709367openalex-snapshot
Accurate Temperature Prediction of Complex Die Power Maps using Quadtree Based Surrogate
inferred← citeshttps://doi.org/10.1109/ithings/greencom/cpscom/smartdata.2019.00084openalex-snapshot
Computing Symmetric Brothers of a Node in a Perfect Binary Tree
inferred← citeshttps://doi.org/10.1109/mm.2010.52openalex-snapshot
Future Directions in Computer Architecture Research
inferred← citeshttps://doi.org/10.1109/percom64205.2025.00023openalex-snapshot
EcoVis: Towards Energy and Connectivity Optimized Visual Surveillance
inferred← citeshttps://doi.org/10.1109/samos.2013.6621118openalex-snapshot
Concurrent multi-level arrays: Wait-free extensible hash maps
inferred← citeshttps://doi.org/10.1109/scc.2019.00048openalex-snapshot
Ephemeral Data Handling in Microservices
inferred← citeshttps://doi.org/10.1109/tc.2010.38openalex-snapshot
Priority Tries for IP Address Lookup
inferred← citeshttps://doi.org/10.1109/tc.2013.29openalex-snapshot
FLOTT—A Fast, Low Memory T-TransformAlgorithm for Measuring String Complexity
inferred← citeshttps://doi.org/10.1109/tc.2014.2315636openalex-snapshot
Pubsub: An Efficient Publish/Subscribe System
inferred← citeshttps://doi.org/10.1109/tcad.2012.2201480openalex-snapshot
TRECO: Dynamic Technology Remapping for Timing Engineering Change Orders
inferred← citeshttps://doi.org/10.1109/tcbb.2008.135openalex-snapshot
A Unified Approach for Reconstructing Ancient Gene Clusters
inferred← citeshttps://doi.org/10.1109/tcss.2021.3064836openalex-snapshot
Fast Core Maintenance in Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/tdsc.2020.3004442openalex-snapshot
Achieving Efficient and Privacy-Preserving Exact Set Similarity Search over Encrypted Data
inferred← citeshttps://doi.org/10.1109/tgrs.2018.2873966openalex-snapshot
Scene Classification Using Hierarchical Wasserstein CNN
inferred← citeshttps://doi.org/10.1109/tifs.2008.2011081openalex-snapshot
Robust Blind Watermarking of Point-Sampled Geometry
inferred← citeshttps://doi.org/10.1109/tifs.2015.2491309openalex-snapshot
Practical Foundations of History Independence
inferred← citeshttps://doi.org/10.1109/tkde.2014.2298015openalex-snapshot
Computing Spatial Distance Histograms for Large Scientific Data Sets On-the-Fly
inferred← citeshttps://doi.org/10.1109/tnet.2008.2010594openalex-snapshot
Succinct Representation of Static Packet Classifiers
inferred← citeshttps://doi.org/10.1109/tpds.2017.2762298openalex-snapshot
Quadboost: A Scalable Concurrent Quadtree
inferred← citeshttps://doi.org/10.1109/tpds.2018.2835441openalex-snapshot
Core Maintenance in Dynamic Graphs: A Parallel Approach Based on Matching
inferred← citeshttps://doi.org/10.1109/tvcg.2009.71openalex-snapshot
RACBVHs: Random-Accessible Compressed Bounding Volume Hierarchies
inferred← citeshttps://doi.org/10.1109/vecims.2009.5068892openalex-snapshot
Quadtree based mouse trajectory analysis for efficacy evaluation of Voice-enabled CAD
inferred← citeshttps://doi.org/10.1111/cgf.12274openalex-snapshot
A Weighted Delaunay Triangulation Framework for Merging Triangulations in a Connectivity Oblivious Fashion
inferred← citeshttps://doi.org/10.1111/j.1467-8659.2006.00970.xopenalex-snapshot
Cache‐Efficient Layouts of Bounding Volume Hierarchies
inferred← citeshttps://doi.org/10.1111/j.1467-8659.2008.01172.xopenalex-snapshot
Computational Geometry Education for Computer Graphics Students
inferred← citeshttps://doi.org/10.1119/10.0005403openalex-snapshot
Using Hilbert curves to organize, sample, and sonify solar data
inferred← citeshttps://doi.org/10.1134/s0361768821050029openalex-snapshot
Efficient Implementation of Fast Hough Transform Using CPCA Coprocessor
inferred← citeshttps://doi.org/10.1137/23m1575792openalex-snapshot
Optimal Resizable Arrays
inferred← citeshttps://doi.org/10.1142/s0129054107004607openalex-snapshot
UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES
inferred← citeshttps://doi.org/10.1142/s0218195908002568openalex-snapshot
SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
inferred← citeshttps://doi.org/10.1142/s0218195910003189openalex-snapshot
FINDING POPULAR PLACES
inferred← citeshttps://doi.org/10.1145/1064092.1064138openalex-snapshot
The skip quadtree
inferred← citeshttps://doi.org/10.1145/1137856.1137866openalex-snapshot
Colored intersection searching via sparse rectangular matrix multiplication
showing the first 200 of 313 · page through all 313
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.