On the public citation graph
Randomized search trees
0 signed · 263 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jagm.1994.1040openalex-snapshot
Dynamic Point Location in General Subdivisions
inferredcites →https://doi.org/10.1007/3-540-55210-3_205openalex-snapshot
Four results on randomized incremental constructions
inferredcites →https://doi.org/10.1007/3-540-63165-8_161openalex-snapshot
LEDA: a platform for combinatorial and geometric computing
inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1016/0020-0190(79)90009-7openalex-snapshot
Addendum to “a storage scheme for height-balanced trees”
inferredcites →https://doi.org/10.1016/0020-0190(90)90214-iopenalex-snapshot
A guided tour of chernoff bounds
inferredcites →https://doi.org/10.1016/s0019-9958(86)80033-xopenalex-snapshot
Sorting jordan sequences in linear time using level-linked search trees
inferredcites →https://doi.org/10.1109/sfcs.1978.3openalex-snapshot
A dichromatic framework for balanced trees
inferredcites →https://doi.org/10.1109/sfcs.1991.185430openalex-snapshot
Faster uniquely represented dictionaries
inferredcites →https://doi.org/10.1137/0202005openalex-snapshot
Binary Search Trees of Bounded Balance
inferredcites →https://doi.org/10.1145/223248.223277openalex-snapshot
Deriving functional dependencies from the entity-relationship model
inferredcites →https://doi.org/10.1145/321941.321944openalex-snapshot
Fast Multiple-Precision Evaluation of Elementary Functions
inferredcites →https://doi.org/10.1145/358841.358852openalex-snapshot
A unifying look at data structures
inferredcites →https://doi.org/10.1145/5925.5930openalex-snapshot
A note on the height of binary search trees
inferredcites →https://doi.org/10.1145/75277.75305openalex-snapshot
Incremental computation via function caching
inferredcites →https://doi.org/10.1145/78973.78977openalex-snapshot
Skip lists: a probabilistic alternative to balanced trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/mma.8570openalex-snapshot
A mathematical assessment of the isolation random forest method for anomaly detection in big data
inferred← citeshttps://doi.org/10.1002/spe.2515openalex-snapshot
Developing IntegrityCatalog, a software system for managing integrity‐related metadata in digital repositories
inferred← citeshttps://doi.org/10.1002/spe.394openalex-snapshot
Self‐adjusting trees in practice for large text collections
inferred← citeshttps://doi.org/10.1002/spe.564openalex-snapshot
Untangling the balancing and searching of balanced binary search trees
inferred← citeshttps://doi.org/10.1007/11534273_24openalex-snapshot
Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes
inferred← citeshttps://doi.org/10.1007/11569596_79openalex-snapshot
Efficient Adaptive Data Compression Using Fano Binary Search Trees
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/11602613_49openalex-snapshot
Smoothed Analysis of Binary Search Trees
inferred← citeshttps://doi.org/10.1007/11670834_19openalex-snapshot
Information Retrieval of Sequential Data in Heterogeneous XML Databases
inferred← citeshttps://doi.org/10.1007/11672142_5openalex-snapshot
Amortized Rigidness in Dynamic Cartesian Trees
inferred← citeshttps://doi.org/10.1007/11733836_12openalex-snapshot
Efficient Maintenance of Ephemeral Data
inferred← citeshttps://doi.org/10.1007/11948148_38openalex-snapshot
Supporting QoS Monitoring in Virtual Organisations
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_26openalex-snapshot
Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure
inferred← citeshttps://doi.org/10.1007/3-540-38076-0_28openalex-snapshot
A New Randomized Data Structure for the 1 1/2-dimensional Range Query Problem
inferred← citeshttps://doi.org/10.1007/3-540-44808-x_18openalex-snapshot
Biased Skip Lists for Highly Skewed Access Patterns
inferred← citeshttps://doi.org/10.1007/3-540-44867-5_7openalex-snapshot
Search Data Structures for Skewed Strings
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_31openalex-snapshot
Estimating Rarity and Similarity over Data Stream Windows
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_34openalex-snapshot
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_22openalex-snapshot
Randomized K-Dimensional Binary Search Trees
inferred← citeshttps://doi.org/10.1007/3-540-49477-4_26openalex-snapshot
Randomized Meldable Priority Queues
inferred← citeshttps://doi.org/10.1007/978-1-4614-9242-9_6openalex-snapshot
Large-Scale Social Network Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4757-6130-6_7openalex-snapshot
Concurrent Data Structures for Tree Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-00479-8_20openalex-snapshot
Searching for a Modified Pattern in a Changing Text
inferred← citeshttps://doi.org/10.1007/978-3-030-59152-6_2openalex-snapshot
Verified Textbook Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_31openalex-snapshot
Zip-Zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent
inferred← citeshttps://doi.org/10.1007/978-3-319-11918-2_21openalex-snapshot
K 2-Treaps: Range Top-k Queries in Compact Space
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_15openalex-snapshot
The Power and Limitations of Static Binary Search Trees with Lazy Finger
inferred← citeshttps://doi.org/10.1007/978-3-319-69900-4_60openalex-snapshot
Random Binary Search Trees for Approximate Nearest Neighbour Search in Binary Space
inferred← citeshttps://doi.org/10.1007/978-3-319-70972-7_21openalex-snapshot
Improving Authenticated Dynamic Dictionaries, with Applications to Cryptocurrencies
inferred← citeshttps://doi.org/10.1007/978-3-319-93725-0_6openalex-snapshot
Arbres binaires de recherche
inferred← citeshttps://doi.org/10.1007/978-3-319-94821-8_12openalex-snapshot
Verified Analysis of Random Binary Tree Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_52openalex-snapshot
A General Technique for Managing Strings in Comparison-Driven Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_31openalex-snapshot
Improved Bounds for Finger Search on a RAM
inferred← citeshttps://doi.org/10.1007/978-3-540-68552-4_1openalex-snapshot
Reducing Splaying by Taking Advantage of Working Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_4openalex-snapshot
Uniquely Represented Data Structures for Computational Geometry
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_41openalex-snapshot
B-Treaps: A Uniquely Represented Alternative to B-Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_16openalex-snapshot
Rank-Sensitive Priority Queues
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_9openalex-snapshot
Maintaining Ideally Distributed Random Search Trees without Extra Space
inferred← citeshttps://doi.org/10.1007/978-3-642-04444-1_28openalex-snapshot
Data Structures with Unpredictable Timing
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-17551-0_2openalex-snapshot
Massive Graph Management for the Web and Web 2.0
inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_23openalex-snapshot
Skip Lift: A Probabilistic Alternative to Red-Black Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-22726-4_19openalex-snapshot
Multi-document Text Summarization in E-learning System for Operating System Domain
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_43openalex-snapshot
Independence of Tabulation-Based Hash Classes
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_67openalex-snapshot
A Self-adjusting Data Structure for Multidimensional Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_1openalex-snapshot
CBTree: A Practical Concurrent Self-Adjusting Search Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_10openalex-snapshot
A History of Distribution-Sensitive Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-40447-4_17openalex-snapshot
RELEASE: A High-Level Paradigm for Reliable Large-Scale Server Software
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_32openalex-snapshot
Local Update Algorithms for Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-49381-6_51openalex-snapshot
Treap Mining – A Comparison with Traditional Algorithm
inferred← citeshttps://doi.org/10.1007/bf01940869openalex-snapshot
Introduction to special issue on randomized and derandomized algorithms
inferred← citeshttps://doi.org/10.1007/bfb0054362openalex-snapshot
Probabilistic data structures for priority queues
inferred← citeshttps://doi.org/10.1007/s00224-006-1246-6openalex-snapshot
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
inferred← citeshttps://doi.org/10.1007/s00224-017-9839-9openalex-snapshot
Finger Search in Grammar-Compressed Strings
inferred← citeshttps://doi.org/10.1007/s00354-019-00073-zopenalex-snapshot
Concurrent Treaps and Impact of Locking Objects
inferred← citeshttps://doi.org/10.1007/s00446-014-0229-0openalex-snapshot
The CB tree: a practical concurrent self-adjusting search tree
inferred← citeshttps://doi.org/10.1007/s00453-002-0967-4openalex-snapshot
Reporting Red--Blue Intersections between Two Sets of Connected Line Segments
inferred← citeshttps://doi.org/10.1007/s00453-012-9636-4openalex-snapshot
Improved Bounds for Finger Search on a RAM
inferred← citeshttps://doi.org/10.1007/s00453-016-0224-xopenalex-snapshot
The Power and Limitations of Static Binary Search Trees with Lazy Finger
inferred← citeshttps://doi.org/10.1007/s00454-004-1122-6openalex-snapshot
Loops in Reeb Graphs of 2-Manifolds
inferred← citeshttps://doi.org/10.1007/s00454-009-9170-6openalex-snapshot
Markov Incremental Constructions
inferred← citeshttps://doi.org/10.1007/s00591-006-0001-zopenalex-snapshot
Zufällige binäre Bäume: Von der average-case Analyse zur Verteilungsasymptotik
inferred← citeshttps://doi.org/10.1007/s00778-007-0081-yopenalex-snapshot
Approximate voronoi cell computation on spatial data streams
inferred← citeshttps://doi.org/10.1007/s00778-023-00783-3openalex-snapshot
Sliding window-based approximate triangle counting with bounded memory usage
inferred← citeshttps://doi.org/10.1007/s10817-020-09545-0openalex-snapshot
Verified Analysis of Random Binary Tree Structures
inferred← citeshttps://doi.org/10.1007/s10958-013-1394-6openalex-snapshot
Straight-line programs: a practical test (extended abstract)
inferred← citeshttps://doi.org/10.1007/s13042-016-0546-7openalex-snapshot
Association rule mining using treap
inferred← citeshttps://doi.org/10.1016/j.aasri.2013.10.077openalex-snapshot
Matrix Multiplication Using r-Train Data Structure
inferred← citeshttps://doi.org/10.1016/j.asoc.2019.03.031openalex-snapshot
Random Binary Search Trees for approximate nearest neighbour search in binary spaces
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.01.002openalex-snapshot
Kinetic and dynamic data structures for convex hulls and upper envelopes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.11.001openalex-snapshot
A kinetic triangulation scheme for moving points in the plane
inferred← citeshttps://doi.org/10.1016/j.cose.2015.04.010openalex-snapshot
New models for efficient authenticated dictionaries
inferred← citeshttps://doi.org/10.1016/j.dam.2009.10.005openalex-snapshot
Maintaining dynamic minimum spanning trees: An experimental study
inferred← citeshttps://doi.org/10.1016/j.diin.2010.05.015openalex-snapshot
Hash based disk imaging using AFF4
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.069openalex-snapshot
Randomness Preserving Deletions on Special Binary Search Trees
inferred← citeshttps://doi.org/10.1016/j.ins.2019.08.007openalex-snapshot
Extending general compact querieable representations to GIS applications
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.02.014openalex-snapshot
Building Cartesian trees from free trees with k leaves
inferred← citeshttps://doi.org/10.1016/j.is.2016.03.004openalex-snapshot
Aggregated 2D range queries on clustered points
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.04.014openalex-snapshot
A locality-preserving cache-oblivious dynamic dictionary
inferred← citeshttps://doi.org/10.1016/j.jda.2011.12.017openalex-snapshot
Skip lift: A probabilistic alternative to red–black trees
inferred← citeshttps://doi.org/10.1016/j.jisa.2026.104439openalex-snapshot
Practical and secure history-independent indexing for queryable-encrypted databases
inferred← citeshttps://doi.org/10.1016/j.jksuci.2018.03.003openalex-snapshot
Dynamizing Dijkstra: A solution to dynamic shortest path problem through retroactive priority queue
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.11.007openalex-snapshot
A contention adapting approach to concurrent ordered sets
inferred← citeshttps://doi.org/10.1016/j.jspi.2010.01.028openalex-snapshot
Deletions in random binary search trees: A story of errors
inferred← citeshttps://doi.org/10.1016/j.patrec.2018.02.020openalex-snapshot
Efficient adaptive non-maximal suppression algorithms for homogeneous spatial keypoint distribution
inferred← citeshttps://doi.org/10.1016/j.procs.2019.11.260openalex-snapshot
Transactional memory as an approach to building a lock-free data structure
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.12.015openalex-snapshot
Reductions in binary search trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.035openalex-snapshot
Smoothed analysis of binary search trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.06.023openalex-snapshot
Random binary search tree with equal elements
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.030openalex-snapshot
The analysis of Range Quickselect and related problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.023openalex-snapshot
Towards a real time algorithm for parameterized longest common prefix computation
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.1016/s0166-3615(03)00147-7openalex-snapshot
Undo facilities for the extended z-buffer in NC machining simulation
inferred← citeshttps://doi.org/10.1051/ita/1997310302511openalex-snapshot
Skip trees, an alternative data structure to skip lists in a concurrent approach
inferred← citeshttps://doi.org/10.1088/2631-8695/ad76fbopenalex-snapshot
Design and development of a low-cost hyperspectral imaging setup via a machine-learningbased approach
inferred← citeshttps://doi.org/10.1093/bioinformatics/btad460openalex-snapshot
Chaining for accurate alignment of erroneous long reads to acyclic variation graphs
inferred← citeshttps://doi.org/10.1109/49.839932openalex-snapshot
Certificate revocation and certificate update
inferred← citeshttps://doi.org/10.1109/focs.2007.36openalex-snapshot
Strongly History-Independent Hashing with Applications
inferred← citeshttps://doi.org/10.1109/focs.2018.00019openalex-snapshot
Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00096openalex-snapshot
Online List Labeling: Breaking the log2n Barrier
inferred← citeshttps://doi.org/10.1109/glocom.2018.8647190openalex-snapshot
High-Performance IPv6 Lookup with Real-Time Updates Using Hierarchical-Balanced Search Tree
inferred← citeshttps://doi.org/10.1109/icaace61206.2024.10548671openalex-snapshot
Online Maintenance of Disjoint Line Segment Sets Utilizing Treap and Strict partial Ordering Theory
inferred← citeshttps://doi.org/10.1109/icc.2011.5962718openalex-snapshot
A Covert Timing Channel via Algorithmic Complexity Attacks: Design and Analysis
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00216openalex-snapshot
Querying for Interactions
inferred← citeshttps://doi.org/10.1109/icime.2009.128openalex-snapshot
A Survey on Maintaining Binary Search Tree in Optimal Shape
inferred← citeshttps://doi.org/10.1109/icip.2011.6115832openalex-snapshot
Efficiently selecting spatially distributed keypoints for visual tracking
inferred← citeshttps://doi.org/10.1109/icisat54145.2021.9678439openalex-snapshot
A Survey on Balanced Binary Search Trees methods
inferred← citeshttps://doi.org/10.1109/icsai57119.2022.10005475openalex-snapshot
Byzantine Consensus Based on Modified Treap Topology
inferred← citeshttps://doi.org/10.1109/informatics62280.2024.10900891openalex-snapshot
Comparison of the Approaches to the Traversal of a Binary Tree Structure Using Iterators
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536261openalex-snapshot
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161060openalex-snapshot
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
inferred← citeshttps://doi.org/10.1109/ipdps.2015.97openalex-snapshot
Distinct Random Sampling from a Distributed Stream
inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00087openalex-snapshot
PINT: Parallel INTerval-Based Race Detector
inferred← citeshttps://doi.org/10.1109/lcn.2009.5355038openalex-snapshot
npf-a simple, traffic-adaptive packet classifier using on-line reorganization of rule trees
inferred← citeshttps://doi.org/10.1109/saint.2010.64openalex-snapshot
Lightweight Traffic-Aware Packet Classification for Continuous Operation
inferred← citeshttps://doi.org/10.1109/sccc.2017.8405133openalex-snapshot
K2-treaps to represent and query data warehouses into main memory
inferred← citeshttps://doi.org/10.1109/sci68648.2025.11333837openalex-snapshot
LAC-Treap: Learning Augmented Concurrent Treap
inferred← citeshttps://doi.org/10.1109/tla.2018.8789552openalex-snapshot
Compact Data Structures to Represent and Query Data Warehouses into Main Memory
inferred← citeshttps://doi.org/10.1137/1.9781611972887.4openalex-snapshot
Implementing Partial Persistence in Object-Oriented Languages
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch49openalex-snapshot
Weighted dynamic finger in binary search trees
inferred← citeshttps://doi.org/10.1137/1.9781611975062.4openalex-snapshot
Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts
inferred← citeshttps://doi.org/10.1137/1.9781611976496.5openalex-snapshot
Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets
inferred← citeshttps://doi.org/10.1137/1.9781611977073.28openalex-snapshot
A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
inferred← citeshttps://doi.org/10.1137/110836377openalex-snapshot
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing
inferred← citeshttps://doi.org/10.1137/18m1195188openalex-snapshot
Smooth Heaps and a Dual View of Self-Adjusting Data Structures
inferred← citeshttps://doi.org/10.1137/22m1534468openalex-snapshot
Online List Labeling: Breaking the \({\log^2 n}\) Barrier
inferred← citeshttps://doi.org/10.1137/s0097539703424521openalex-snapshot
Distances and Finger Search in Random Binary Search Trees
inferred← citeshttps://doi.org/10.1137/s0097539703435728openalex-snapshot
Novel Transformation Techniques Using Q-Heaps with Applications to Computational Geometry
inferred← citeshttps://doi.org/10.1137/s0097539799350232openalex-snapshot
Constructing Planar Cuttings in Theory and Practice
inferred← citeshttps://doi.org/10.1142/9789812567673_0016openalex-snapshot
Applications of Stein's method in the analysis of random binary search trees
inferred← citeshttps://doi.org/10.1145/1007912.1007919openalex-snapshot
Simple efficient load balancing algorithms for peer-to-peer systems
inferred← citeshttps://doi.org/10.1145/1111609.1111610openalex-snapshot
Efficient management for large-scale flash-memory storage systems with resource conservation
inferred← citeshttps://doi.org/10.1145/1189769.1189773openalex-snapshot
Maintaining stream statistics over multiscale sliding windows
inferred← citeshttps://doi.org/10.1145/1233341.1233413openalex-snapshot
Exploring the duality between skip lists and binary search trees
inferred← citeshttps://doi.org/10.1145/1244002.1244248openalex-snapshot
On efficient wear leveling for large-scale flash-memory storage systems
inferred← citeshttps://doi.org/10.1145/1248648.1248651openalex-snapshot
A proposal for parallel self-adjusting computation
inferred← citeshttps://doi.org/10.1145/1376616.1376657openalex-snapshot
Sampling time-based sliding windows in bounded space
inferred← citeshttps://doi.org/10.1145/1377676.1377701openalex-snapshot
Markov incremental constructions
inferred← citeshttps://doi.org/10.1145/1435375.1435379openalex-snapshot
Kinetic and dynamic data structures for closest pair and all nearest neighbors
inferred← citeshttps://doi.org/10.1145/1810959.1810985openalex-snapshot
A kinetic triangulation scheme for moving points in the plane
inferred← citeshttps://doi.org/10.1145/1810959.1811002openalex-snapshot
A dynamic data structure for approximate range searching
inferred← citeshttps://doi.org/10.1145/2484028.2484088openalex-snapshot
Faster and smaller inverted indices with treaps
inferred← citeshttps://doi.org/10.1145/2723372.2742796openalex-snapshot
Design and Implementation of the LogicBlox System
inferred← citeshttps://doi.org/10.1145/276884.276921openalex-snapshot
Constructing cuttings in theory and practice
inferred← citeshttps://doi.org/10.1145/277651.277660openalex-snapshot
Fast set operations using treaps
inferred← citeshttps://doi.org/10.1145/2935764.2935768openalex-snapshot
Just Join for Parallel Ordered Sets
inferred← citeshttps://doi.org/10.1145/2939672.2939836openalex-snapshot
Fast Unsupervised Online Drift Detection Using Incremental Kolmogorov-Smirnov Test
inferred← citeshttps://doi.org/10.1145/3040718.3040719openalex-snapshot
Fast and Powerful Hashing using Tabulation
inferred← citeshttps://doi.org/10.1145/3041021.3054191openalex-snapshot
Top-k Query Processing with Conditional Skips
inferred← citeshttps://doi.org/10.1145/3210377.3210413openalex-snapshot
Lock-free Contention Adapting Search Trees
inferred← citeshttps://doi.org/10.1145/3323165.3323197openalex-snapshot
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries
inferred← citeshttps://doi.org/10.1145/3460874openalex-snapshot
Lock-free Contention Adapting Search Trees
inferred← citeshttps://doi.org/10.1145/3512769openalex-snapshot
Joinable Parallel Balanced Binary Trees
inferred← citeshttps://doi.org/10.1145/3572848.3577512openalex-snapshot
Unexpected Scaling in Path Copying Trees
inferred← citeshttps://doi.org/10.1145/3632868openalex-snapshot
Asynchronous Probabilistic Couplings in Higher-Order Separation Logic
inferred← citeshttps://doi.org/10.1145/3674632openalex-snapshot
Almost-Sure Termination by Guarded Refinement
inferred← citeshttps://doi.org/10.1145/3709660openalex-snapshot
An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs
inferred← citeshttps://doi.org/10.1145/3719027.3765149openalex-snapshot
Probabilistic Skipping-Based Data Structures with Robust Efficiency Guarantees
inferred← citeshttps://doi.org/10.1145/380752.380842openalex-snapshot
Optimal static range reporting in one dimension
inferred← citeshttps://doi.org/10.1145/380752.380843openalex-snapshot
Biased dictionaries with fast insert/deletes
inferred← citeshttps://doi.org/10.1145/3816782.3819216openalex-snapshot
Fast and Theoretically Efficient Batch-Parallel Link-Cut Trees, Euler Tour Trees, and Treaps
inferred← citeshttps://doi.org/10.1145/563857.563812openalex-snapshot
Performance of Data Structures for Small Sets of Strings
inferred← citeshttps://doi.org/10.1145/777792.777844openalex-snapshot
Loops in reeb graphs of 2-manifolds
inferred← citeshttps://doi.org/10.11606/d.55.2017.tde-13012017-095800openalex-snapshot
Classificação de fluxos de dados com mudança de conceito e latência de verificação
inferred← citeshttps://doi.org/10.1184/r1/6604220openalex-snapshot
Compact Representations of Ordered Sets
inferred← citeshttps://doi.org/10.1184/r1/6609716openalex-snapshot
Space-Efficient Finger Search on Degree-Balanced Search Trees
inferred← citeshttps://doi.org/10.1186/s12864-020-6611-3openalex-snapshot
Comparing copy-number profiles under multi-copy amplifications and deletions
inferred← citeshttps://doi.org/10.1186/s40537-022-00587-2openalex-snapshot
Efficient spatial data partitioning for distributed $$k$$NN joins
inferred← citeshttps://doi.org/10.1214/24-ejs2305openalex-snapshot
On the statistical properties of the isolation forest anomaly detection method
inferred← citeshttps://doi.org/10.1214/aoap/1042765668openalex-snapshot
Distribution of distances in random binary search trees
inferred← citeshttps://doi.org/10.13140/rg.2.2.15402.88008/1openalex-snapshot
Decomposition and Modeling in the Non-Manifold Domain
inferred← citeshttps://doi.org/10.14279/depositonce-3327openalex-snapshot
Network Flow Problems Arising From Evacuation Planning
inferred← citeshttps://doi.org/10.14711/thesis-b777639openalex-snapshot
Expected-case planar point location
inferred← citeshttps://doi.org/10.14778/2824032.2824075openalex-snapshot
Live programming in the LogicBlox system
inferred← citeshttps://doi.org/10.14778/3551793.3551868openalex-snapshot
Dynamic spanning trees for connectivity queries on fully-dynamic undirected graphs
showing the first 200 of 243 · page through all 243
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.