On the public citation graph
Dynamic fractional cascading
0 signed · 179 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.1002/net.3230130308openalex-snapshot
Finding a manhattan path and related problems
inferredcites →https://doi.org/10.1007/3-540-18088-5_41openalex-snapshot
A Lower Bound on the Complexity of the Union-Split-Find Problem
inferredcites →https://doi.org/10.1007/978-3-642-69672-5openalex-snapshot
Data Structures and Algorithms 1
inferredcites →https://doi.org/10.1007/978-3-642-69897-2openalex-snapshot
Data Structures and Algorithms 2
inferredcites →https://doi.org/10.1007/978-3-642-69900-9openalex-snapshot
Data Structures and Algorithms 3
inferredcites →https://doi.org/10.1007/bf00288968openalex-snapshot
A new data structure for representing sorted lists
inferredcites →https://doi.org/10.1007/bf00289142openalex-snapshot
Maintaining order in a generalized linked list
inferredcites →https://doi.org/10.1007/bf01683268openalex-snapshot
Design and implementation of an efficient priority queue
inferredcites →https://doi.org/10.1007/bf01840440openalex-snapshot
Fractional cascading: I. A data structuring technique
inferredcites →https://doi.org/10.1016/0020-0190(79)90117-0openalex-snapshot
Decomposable searching problems
inferredcites →https://doi.org/10.1016/0020-0190(84)90105-4openalex-snapshot
An O(n log n) Manhattan path algorithm
inferredcites →https://doi.org/10.1016/0020-0190(85)90054-7openalex-snapshot
Fast dynamic intersection searching in a set of isothetic line segments
inferredcites →https://doi.org/10.1016/0022-0000(85)90014-5openalex-snapshot
A linear-time algorithm for a special case of disjoint set union
inferredcites →https://doi.org/10.1016/0196-6774(82)90016-5openalex-snapshot
Rectilinear line segment intersection, layered segment trees, and dynamization
inferredcites →https://doi.org/10.1016/0196-6774(87)90024-1openalex-snapshot
Dynamic orthogonal segment intersection search
inferredcites →https://doi.org/10.1016/0304-3975(80)90018-3openalex-snapshot
On the average number of rebalancing operations in weight-balanced trees
inferredcites →https://doi.org/10.1109/sfcs.1978.1openalex-snapshot
A data structure for orthogonal range queries
inferredcites →https://doi.org/10.1137/0214019openalex-snapshot
New Data Structures for Orthogonal Range Queries
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1145/12130.12142openalex-snapshot
Making data structures persistent
inferredcites →https://doi.org/10.1145/323233.323256openalex-snapshot
Dynamization of geometric data structures
inferredcites →https://doi.org/10.1145/3828.3839openalex-snapshot
Adding range restriction capability to dynamic data structures
inferredcites →https://doi.org/10.1145/800105.803395openalex-snapshot
A new representation for linear lists
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1994.1040openalex-snapshot
Dynamic Point Location in General Subdivisions
inferred← citeshttps://doi.org/10.1006/jagm.1996.0054openalex-snapshot
Off-Line Maintenance of Planar Configurations
inferred← citeshttps://doi.org/10.1006/jagm.1996.0063openalex-snapshot
Range Searching and Point Location among Fat Objects
inferred← citeshttps://doi.org/10.1006/jcss.1996.0012openalex-snapshot
Applications of Range Query Theory to Relational Data Base Join and Selection Operations
inferred← citeshttps://doi.org/10.1006/jcss.2002.1822openalex-snapshot
Optimal Bounds for the Predecessor Problem and Related Problems
inferred← citeshttps://doi.org/10.1006/jcss.2002.1848openalex-snapshot
An Algorithm for Handling Many Relational Calculus Queries Efficiently
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/11841036_64openalex-snapshot
Algorithmic Aspects of Proportional Symbol Maps
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_1openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-44732-6_22openalex-snapshot
A New Geometric Tool for Pattern Recognition - An Algorithm for Real Time Insertion of Layered Segment Trees
inferred← citeshttps://doi.org/10.1007/3-540-45551-5_45openalex-snapshot
Dynamic Algorithms with Worst-Case Performance for Packet Classification
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_26openalex-snapshot
Three-Dimensional Layers of Maxima
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_79openalex-snapshot
Output-sensitive generation of the perspective view of isothetic parallelepipeds
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_174openalex-snapshot
Computational geometry for the gourmet old fare and new dishes
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_80openalex-snapshot
Rectangular point location and the dynamic closest pair problem
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_20openalex-snapshot
Selected topics from computational geometry, data structures and motion planning
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_256openalex-snapshot
Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract)
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_4openalex-snapshot
De-amortization of Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_27openalex-snapshot
Map of Geometric Minimal Cuts with Applications*
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_27-1openalex-snapshot
Map of Geometric Minimal Cuts with Applications
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_9openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-34347-6_2openalex-snapshot
Point Enclosure Problem for Homothetic Polygons
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_16openalex-snapshot
Using Ray-Shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-42634-1_26openalex-snapshot
The Maximum Disjoint Routing Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_23openalex-snapshot
Approximating Energy Efficient Paths in Wireless Multi-hop Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_11openalex-snapshot
Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_26openalex-snapshot
Computing the Map of Geometric Minimal Cuts
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_41openalex-snapshot
Optimal Cover of Points by Disks in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_29openalex-snapshot
An Optimal Algorithm for Computing Angle-Constrained Spanners
inferred← citeshttps://doi.org/10.1007/978-3-642-19094-0_13openalex-snapshot
Efficient Top-k Queries for Orthogonal Ranges
inferred← citeshttps://doi.org/10.1007/978-3-642-19094-0_14openalex-snapshot
Range-Aggregate Queries Involving Geometric Aggregation Operations
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_51openalex-snapshot
A Fast Algorithm for Three-Dimensional Layers of Maxima Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-24583-1_15openalex-snapshot
Fast Computation of a String Duplication History under No-Breakpoint-Reuse
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_41openalex-snapshot
External Memory Orthogonal Range Reporting with Fast Updates
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_69openalex-snapshot
Amortized Bounds for Dynamic Orthogonal Range Reporting
inferred← citeshttps://doi.org/10.1007/bf01758847openalex-snapshot
Output-sensitive generation of the perspective view of isothetic parallelepipeds
inferred← citeshttps://doi.org/10.1007/bf01941686openalex-snapshot
Optimal Cooperative Search in Fractional Cascaded Data Structures
inferred← citeshttps://doi.org/10.1007/bf02187852openalex-snapshot
Maintaining the minimal distance of a point set in polylogarithmic time
inferred← citeshttps://doi.org/10.1007/bf02523237openalex-snapshot
Efficient construction of a bounded-degree spanner with low weight
inferred← citeshttps://doi.org/10.1007/bfb0049396openalex-snapshot
Efficient construction of a bounded degree spanner with low weight
inferred← citeshttps://doi.org/10.1007/bfb0049412openalex-snapshot
Range searching and point location among fat objects
inferred← citeshttps://doi.org/10.1007/bfb0100976openalex-snapshot
Towards optimal indexing for segment databases
inferred← citeshttps://doi.org/10.1007/s00453-007-9030-9openalex-snapshot
Space Efficient Dynamic Orthogonal Range Reporting
inferred← citeshttps://doi.org/10.1007/s00453-009-9281-8openalex-snapshot
Algorithmic Aspects of Proportional Symbol Maps
inferred← citeshttps://doi.org/10.1007/s00453-009-9355-7openalex-snapshot
Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems
inferred← citeshttps://doi.org/10.1007/s00453-010-9414-0openalex-snapshot
Energy-Efficient Paths in Radio Networks
inferred← citeshttps://doi.org/10.1007/s00453-011-9517-2openalex-snapshot
Near-Linear Approximation Algorithms for Geometric Hitting Sets
inferred← citeshttps://doi.org/10.1007/s00453-012-9704-9openalex-snapshot
Computing the Map of Geometric Minimal Cuts
inferred← citeshttps://doi.org/10.1007/s00453-021-00807-wopenalex-snapshot
Active-Learning a Convex Body in Low Dimensions
inferred← citeshttps://doi.org/10.1007/s00453-026-01395-3openalex-snapshot
Segment Proximity Graphs and Nearest Neighbor Queries amid Disjoint Segments
inferred← citeshttps://doi.org/10.1007/s004530010036openalex-snapshot
The Temporal Precedence Problem
inferred← citeshttps://doi.org/10.1007/s00454-004-1121-7openalex-snapshot
Fault-Tolerant Geometric Spanners
inferred← citeshttps://doi.org/10.1007/s00454-006-1239-xopenalex-snapshot
The Lifting Model for Reconfiguration
inferred← citeshttps://doi.org/10.1007/s00778-019-00559-8openalex-snapshot
Indexing in flash storage devices: a survey on challenges, current approaches, and future trends
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90062-3openalex-snapshot
Hidden line elimination for isooriented rectangles
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90004-copenalex-snapshot
Dynamic output-sensitive hidden surface removal for c-oriented polyhedra
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90027-popenalex-snapshot
Upper envelope onion peeling
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50011-5openalex-snapshot
Geometric Data Structures
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50021-8openalex-snapshot
Closest-Point Problems in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.comgeo.2003.04.001openalex-snapshot
I/O-efficient dynamic planar point location
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.03.006openalex-snapshot
Optimizing active ranges for consistent dynamic map labeling
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.08.009openalex-snapshot
Sequential dependency computation via geometric data structures
inferred← citeshttps://doi.org/10.1016/j.cor.2009.04.004openalex-snapshot
Maximizing the number of obnoxious facilities to locate within a bounded region
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.03.031openalex-snapshot
On the representation of the search region in multi-objective optimization
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104633openalex-snapshot
Online recognition of dictionary with one gap
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.07.003openalex-snapshot
Lower bounds for intersection searching and fractional cascading in higher dimension
inferred← citeshttps://doi.org/10.1016/j.peva.2021.102219openalex-snapshot
THAAD: Efficient matching queries under temporal abstraction for anomaly detection
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00134-3openalex-snapshot
An efficient algorithm for computing least cost paths with turn constraints
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00141-0openalex-snapshot
Efficient algorithms for the temporal precedence problem
inferred← citeshttps://doi.org/10.1016/s0031-3203(01)00202-3openalex-snapshot
Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00008-4openalex-snapshot
New results on binary space partitions in the plane
inferred← citeshttps://doi.org/10.1016/s0925-7721(99)00014-0openalex-snapshot
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
inferred← citeshttps://doi.org/10.1017/s0960129505004913openalex-snapshot
Efficient algorithms for isomorphisms of simple types
inferred← citeshttps://doi.org/10.1098/rsta.2013.0133openalex-snapshot
Fast computation of a string duplication history under no-breakpoint-reuse
inferred← citeshttps://doi.org/10.1109/5.163409openalex-snapshot
Dynamic algorithms in computational geometry
inferred← citeshttps://doi.org/10.1109/aim.2012.6265936openalex-snapshot
A portrait drawing robot using a geometric graph approach: Furthest Neighbour Theta-graphs
inferred← citeshttps://doi.org/10.1109/focs.2006.40openalex-snapshot
Improved Dynamic Planar Point Location
inferred← citeshttps://doi.org/10.1109/focs.2015.31openalex-snapshot
Towards an Optimal Method for Dynamic Planar Point Location
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00072openalex-snapshot
2D Generalization of Fractional Cascading on Axis-aligned Planar Subdivisions
inferred← citeshttps://doi.org/10.1109/infcom.2003.1209247openalex-snapshot
Efficient channel scheduling algorithms in optical burst switched networks
inferred← citeshttps://doi.org/10.1109/itcc.2005.74openalex-snapshot
An efficient clustering algorithm using graphical techniques
inferred← citeshttps://doi.org/10.1109/jsac.2004.835157openalex-snapshot
Efficient Burst Scheduling Algorithms in Optical Burst-Switched Networks Using Geometric Techniques
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365722openalex-snapshot
Randomized and deterministic algorithms for geometric spanners of small diameter
inferred← citeshttps://doi.org/10.1109/tevc.2003.817234openalex-snapshot
Reducing the Run-Time Complexity of Multiobjective EAs: The NSGA-II and Other Algorithms
inferred← citeshttps://doi.org/10.1109/tvcg.2023.3291138openalex-snapshot
Efficient and Robust From-Point Visibility
inferred← citeshttps://doi.org/10.1134/s000143462560276xopenalex-snapshot
Efficient Search for a Minimum Tree in a Space with the $$l_1$$-Norm
inferred← citeshttps://doi.org/10.1137/1.9781611973402.73openalex-snapshot
Concurrent Range Reporting in Two-Dimensional Space
inferred← citeshttps://doi.org/10.1137/1.9781611976465.133openalex-snapshot
A Lower Bound for Dynamic Fractional Cascading
inferred← citeshttps://doi.org/10.1137/10078791xopenalex-snapshot
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
inferred← citeshttps://doi.org/10.1137/100808459openalex-snapshot
Optimal Cover of Points by Disks in a Simple Polygon
inferred← citeshttps://doi.org/10.1137/130908245openalex-snapshot
Optimal Dynamic Sequence Representations
inferred← citeshttps://doi.org/10.1137/16m1066506openalex-snapshot
Towards an Optimal Method for Dynamic Planar Point Location
inferred← citeshttps://doi.org/10.1137/s0097539703436722openalex-snapshot
Fully Dynamic Orthogonal Range Reporting on RAM
inferred← citeshttps://doi.org/10.1137/s0097539793259458openalex-snapshot
New Techniques for Exact and Approximate Dynamic Closest-Point Problems
inferred← citeshttps://doi.org/10.1142/s0218195913600042openalex-snapshot
EXTERNAL MEMORY ORTHOGONAL RANGE REPORTING WITH FAST UPDATES
inferred← citeshttps://doi.org/10.1145/1064092.1064139openalex-snapshot
Space efficient dynamic orthogonal range reporting
inferred← citeshttps://doi.org/10.1145/116873.116878openalex-snapshot
Data structures and algorithms for disjoint set union problems
inferred← citeshttps://doi.org/10.1145/1377676.1377681openalex-snapshot
Optimizing active ranges for consistent dynamic map labeling
inferred← citeshttps://doi.org/10.1145/1541885.1541889openalex-snapshot
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
inferred← citeshttps://doi.org/10.1145/1542362.1542368openalex-snapshot
Near-linear approximation algorithms for geometric hitting sets
inferred← citeshttps://doi.org/10.1145/177424.177601openalex-snapshot
Biased finger trees and three-dimensional layers of maxima
inferred← citeshttps://doi.org/10.1145/177424.177621openalex-snapshot
New techniques for exact and approximate dynamic closest-point problems
inferred← citeshttps://doi.org/10.1145/195058.195415openalex-snapshot
Lower bounds for union-split-find related problems on random access machines
inferred← citeshttps://doi.org/10.1145/2525314.2594229openalex-snapshot
Algorithms for Computing Prominence on Grid Terrains
inferred← citeshttps://doi.org/10.1145/2996453openalex-snapshot
Computational Fact Checking through Query Perturbations
inferred← citeshttps://doi.org/10.1145/336154.336205openalex-snapshot
I/O-efficient dynamic planar point location (extended abstract)
inferred← citeshttps://doi.org/10.1145/3406325.3451100openalex-snapshot
Dynamic planar point location in optimal time
inferred← citeshttps://doi.org/10.1145/3514240openalex-snapshot
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
inferred← citeshttps://doi.org/10.1145/3733723.3733732openalex-snapshot
An Adaptive Index for Oscillating Write-Heavy and Read-Heavy Workloads
inferred← citeshttps://doi.org/10.1145/380752.380818openalex-snapshot
Lower bounds for intersection searching and fractional cascading in higher dimension
inferred← citeshttps://doi.org/10.1145/380752.380843openalex-snapshot
Biased dictionaries with fast insert/deletes
inferred← citeshttps://doi.org/10.1145/637201.637211openalex-snapshot
Statistical analysis of malformed packets and their origins in the modern internet
inferred← citeshttps://doi.org/10.1145/73393.73413openalex-snapshot
An efficient output-sensitive hidden surface removal algorithm and its parallelization
inferred← citeshttps://doi.org/10.1145/777792.777794openalex-snapshot
Fault-tolerant geometric spanners
inferred← citeshttps://doi.org/10.1145/97444.97698openalex-snapshot
Optimal cooperative search in fractional cascaded data structures
inferred← citeshttps://doi.org/10.1145/984622.984668openalex-snapshot
Fractionally cascaded information in a sensor network
inferred← citeshttps://doi.org/10.11606/d.45.2000.tde-20220712-115327openalex-snapshot
Problemas dinâmicos em geometria computacional
inferred← citeshttps://doi.org/10.1515/9780773591134-020openalex-snapshot
An optimal algorithm for dynamic post-office problem in R²₁ and related problems
inferred← citeshttps://doi.org/10.15607/rss.2005.i.013openalex-snapshot
A polynomial-time algorithm to design push plans for sensorless parts sorting
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10035openalex-snapshot
Ad Auctions and Cascade Model: GSP Inefficiency and Algorithms
inferred← citeshttps://doi.org/10.1613/jair.5438openalex-snapshot
Adopting the Cascade Model in Ad Auctions: Efficiency Bounds and Truthful Algorithmic Mechanisms
inferred← citeshttps://doi.org/10.17877/de290r-43openalex-snapshot
Coresets and streaming algorithms for the k-means problem and related clustering objectives
inferred← citeshttps://doi.org/10.18725/oparu-365openalex-snapshot
Algorithms and a software system for comparative genome analysis
inferred← citeshttps://doi.org/10.22028/d291-25999openalex-snapshot
Geometric optimization and querying : exact & approximate
inferred← citeshttps://doi.org/10.2498/cit.1001047openalex-snapshot
Constant Time Queries for Energy Efficient Paths in Multi-hop Wireless Networks
inferred← citeshttps://doi.org/10.3923/jeasci.2011.71.78openalex-snapshot
A Novel Scheduling Algorithm in OBS Networks
inferred← citeshttps://doi.org/10.4213/mzm14366openalex-snapshot
Эффективный поиск минимального дерева на точках пространства в $l_1$-норме
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.25openalex-snapshot
Worst-Case Efficient Dynamic Geometric Independent Set
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.64openalex-snapshot
An implementation of range trees with fractional cascading in C++
inferred← citeshttps://doi.org/10.4230/lipics.socg.2018.25openalex-snapshot
Dynamic Planar Orthogonal Point Location in Sublogarithmic Time
inferred← citeshttps://doi.org/10.4230/lipics.socg.2018.62openalex-snapshot
Approximate Range Queries for Clustering
inferred← citeshttps://doi.org/10.48550/arxiv.1004.0558openalex-snapshot
Querying for the Largest Empty Geometric Object in a Desired Location
inferred← citeshttps://doi.org/10.48550/arxiv.1111.2918openalex-snapshot
Localized Geometric Query Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1507.06866openalex-snapshot
Compressed Data Structures for Dynamic Sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1903.06601openalex-snapshot
Dynamic Planar Point Location in External Memory
inferred← citeshttps://doi.org/10.48550/arxiv.2009.05541openalex-snapshot
2D Fractional Cascading on Axis-aligned Planar Subdivisions
inferred← citeshttps://doi.org/10.48550/arxiv.2110.11758openalex-snapshot
The Crew: The Quest for Planet Nine is NP-Complete
inferred← citeshttps://doi.org/10.5441/002/edbt.2018.06openalex-snapshot
On Complexity and Efficiency of Mutual Information Estimation on Static and Dynamic Data
inferred← citeshttps://doi.org/10.5555/1070432.1070546openalex-snapshot
An optimal dynamic interval stabbing-max data structure?
inferred← citeshttps://doi.org/10.5555/127787.127796openalex-snapshot
Maintaining the minimal distance of a point set in polylogarithmic time
inferred← citeshttps://doi.org/10.5555/127787.127801openalex-snapshot
Offline maintenance of planar configurations
inferred← citeshttps://doi.org/10.5555/127787.127809openalex-snapshot
Persistence, amortization and randomization
inferred← citeshttps://doi.org/10.5555/1283383.1283386openalex-snapshot
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
inferred← citeshttps://doi.org/10.5555/2634074.2634147openalex-snapshot
Concurrent range reporting in two-dimensional space
inferred← citeshttps://doi.org/10.7146/brics.v5i7.19279openalex-snapshot
Marked Ancestor Problems (Preliminary Version)
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.