On the public citation graph

Computing on a free tree via complexity-preserving mappings

0 signed · 105 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01840440openalex-snapshot

Fractional cascading: I. A data structuring technique

inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot

A data structure for dynamic trees

inferredcites →https://doi.org/10.1080/00207168308803364openalex-snapshot

A new approach to rectangle intersections part I

inferredcites →https://doi.org/10.1080/00207168308803365openalex-snapshot

A new approach to rectangle intersections

inferredcites →https://doi.org/10.1109/sfcs.1984.715916openalex-snapshot

Linear Verification For Spanning Trees

inferredcites →https://doi.org/10.1109/sfcs.1985.51openalex-snapshot

Slimming down search structures: A functional approach to algorithm design

inferredcites →https://doi.org/10.1137/0213024openalex-snapshot

Fast Algorithms for Finding Nearest Common Ancestors

inferredcites →https://doi.org/10.1137/0214019openalex-snapshot

New Data Structures for Orthogonal Range Queries

inferredcites →https://doi.org/10.1137/0214021openalex-snapshot

Priority Search Trees

inferredcites →https://doi.org/10.1137/0217026openalex-snapshot

A Functional Approach to Data Structures and Its Use in Multidimensional Searching

inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot

Efficiency of a Good But Not Linear Set Union Algorithm

inferredcites →https://doi.org/10.1145/322154.322161openalex-snapshot

Applications of Path Compression on Balanced Trees

inferredcites →https://doi.org/10.1145/358841.358850openalex-snapshot

Multidimensional divide-and-conquer

inferredcites →https://doi.org/10.1145/358841.358852openalex-snapshot

A unifying look at data structures

inferredcites →https://doi.org/10.1145/3828.3835openalex-snapshot

Self-adjusting binary search trees

inferredcites →https://doi.org/10.1145/800057.808675openalex-snapshot

Scaling and related techniques for geometry problems

inferredcites →https://doi.org/10.1145/800070.802185openalex-snapshot

Space-time tradeoff for answering range queries (Extended Abstract)

inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot

The Art of Computer Programming

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.3230210503openalex-snapshot

Efficient algorithms for generalized cut‐trees

inferred← citeshttps://doi.org/10.1006/inco.1999.2814openalex-snapshot

Parallel Preprocessing for Path Queries without Concurrent Reading

inferred← citeshttps://doi.org/10.1006/jagm.1996.0829openalex-snapshot

Parallel Shortcutting of Rooted Trees

inferred← citeshttps://doi.org/10.1006/jagm.1998.0961openalex-snapshot

All-Pairs Min-Cut in Sparse Networks

inferred← citeshttps://doi.org/10.1007/11602613_96openalex-snapshot

Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time

inferred← citeshttps://doi.org/10.1007/3-540-45022-x_8openalex-snapshot

Improved Algorithms for Finding Level Ancestors in Dynamic Trees

inferred← citeshttps://doi.org/10.1007/3-540-53504-7_100openalex-snapshot

A parallel algorithm for path-min queries in trees

inferred← citeshttps://doi.org/10.1007/3-540-56402-0_48openalex-snapshot

On shortcutting digraphs

inferred← citeshttps://doi.org/10.1007/3-540-57273-2_49openalex-snapshot

Trekking in the Alps without freezing or getting tired

inferred← citeshttps://doi.org/10.1007/3-540-60084-1_78openalex-snapshot

Shortest path queries in digraphs of small treewidth

inferred← citeshttps://doi.org/10.1007/3-540-60692-0_61openalex-snapshot

All-pairs min-cut in sparse networks

inferred← citeshttps://doi.org/10.1007/3-540-61258-0_11openalex-snapshot

Perfect hashing for strings: Formalization and algorithms

inferred← citeshttps://doi.org/10.1007/3-540-63165-8_186openalex-snapshot

Dynamic algorithms for graphs of bounded treewidth

inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_45openalex-snapshot

Dynamic Path Counting and Reporting in Linear Space

inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_34openalex-snapshot

Dynamic Tree Shortcut with Constant Degree

inferred← citeshttps://doi.org/10.1007/978-3-319-24024-4_23openalex-snapshot

Simple Parallel Algorithms for Dynamic Range Products

inferred← citeshttps://doi.org/10.1007/978-3-319-75172-6_8openalex-snapshot

Faster Network Algorithms Based on Graph Decomposition

inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_34openalex-snapshot

Efficient Provably-Secure Hierarchical Key Assignment Schemes

inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_16openalex-snapshot

An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees

inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_34openalex-snapshot

Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners

inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_5openalex-snapshot

Balancing Degree, Diameter and Weight in Euclidean Spanners

inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_10openalex-snapshot

Transitive-Closure Spanners: A Survey

inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_64openalex-snapshot

Steiner Transitive-Closure Spanners of Low-Dimensional Posets

inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_25openalex-snapshot

Path Minima Queries in Dynamic Weighted Trees

inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_16openalex-snapshot

Path Queries in Weighted Trees

inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_16openalex-snapshot

Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree

inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_50openalex-snapshot

Succinct Data Structures for Path Queries

inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_21openalex-snapshot

Succinct Indices for Path Minimum, with Applications to Path Reporting

inferred← citeshttps://doi.org/10.1007/bf02187747openalex-snapshot

Visibility and intersection problems in plane geometry

inferred← citeshttps://doi.org/10.1007/s00453-013-9779-yopenalex-snapshot

Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree

inferred← citeshttps://doi.org/10.1007/s00453-016-0170-7openalex-snapshot

Succinct Indices for Path Minimum, with Applications

inferred← citeshttps://doi.org/10.1007/s00453-018-0413-xopenalex-snapshot

Dynamic Path Queries in Linear Space

inferred← citeshttps://doi.org/10.1007/s00453-022-01045-4openalex-snapshot

Shortest Beer Path Queries in Outerplanar Graphs

inferred← citeshttps://doi.org/10.1007/s00453-026-01398-0openalex-snapshot

Compressed Dictionary Matching on Run-Length Encoded Strings

inferred← citeshttps://doi.org/10.1007/s004530010016openalex-snapshot

Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms

inferred← citeshttps://doi.org/10.1007/s00454-008-9115-5openalex-snapshot

Small Hop-diameter Sparse Spanners for Doubling Metrics

inferred← citeshttps://doi.org/10.1007/s00493-006-0014-1openalex-snapshot

An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification*

inferred← citeshttps://doi.org/10.1007/s00493-014-2833-9openalex-snapshot

Steiner transitive-closure spanners of low-dimensional posets

inferred← citeshttps://doi.org/10.1016/j.dam.2016.12.016openalex-snapshot

Shortcutting directed and undirected networks with a degree constraint

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.jda.2012.08.003openalex-snapshot

Succinct representations of weighted trees supporting path queries

inferred← citeshttps://doi.org/10.1016/j.orl.2015.12.017openalex-snapshot

Reconstructing edge-disjoint paths faster

inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.024openalex-snapshot

Efficient provably-secure hierarchical key assignment schemes

inferred← citeshttps://doi.org/10.1016/j.tcs.2020.05.039openalex-snapshot

Tree path majority data structures

inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80002-9openalex-snapshot

Finding level-ancestors in trees

inferred← citeshttps://doi.org/10.1016/s0167-6377(03)00022-1openalex-snapshot

Reconstructing edge-disjoint paths

inferred← citeshttps://doi.org/10.1017/s0963548300001668openalex-snapshot

Shortcutting Planar Digraphs

inferred← citeshttps://doi.org/10.1090/conm/223/03131openalex-snapshot

Geometric range searching and its relatives

inferred← citeshttps://doi.org/10.1109/71.862207openalex-snapshot

Recognizing unordered depth-first search trees of an undirected graph in parallel

inferred← citeshttps://doi.org/10.1109/focs.2011.13openalex-snapshot

Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy

inferred← citeshttps://doi.org/10.1109/focs54457.2022.00105openalex-snapshot

Low Treewidth Embeddings of Planar and Minor-Free Metrics

inferred← citeshttps://doi.org/10.1109/sfcs.1989.63478openalex-snapshot

Recursive *-tree parallel data-structure

inferred← citeshttps://doi.org/10.1109/sfcs.1993.366879openalex-snapshot

Random sampling in matroids, with applications to graph connectivity and minimum spanning trees

inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181892openalex-snapshot

An inverse-Ackermann style lower bound for the online minimum spanning tree verification problem

inferred← citeshttps://doi.org/10.1137/1.9781611973068.101openalex-snapshot

Transitive-Closure Spanners

inferred← citeshttps://doi.org/10.1137/1.9781611974782.36openalex-snapshot

A Hierarchy of Lower Bounds for Sublinear Additive Spanners

inferred← citeshttps://doi.org/10.1137/1.9781611977073.131openalex-snapshot

Better Lower Bounds for Shortcut Sets and Additive Spanners via an Improved Alternation Product

inferred← citeshttps://doi.org/10.1137/100808186openalex-snapshot

Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners

inferred← citeshttps://doi.org/10.1137/110826655openalex-snapshot

Transitive-Closure Spanners

inferred← citeshttps://doi.org/10.1137/110840741openalex-snapshot

Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy

inferred← citeshttps://doi.org/10.1137/120901295openalex-snapshot

Balancing Degree, Diameter, and Weight in Euclidean Spanners

inferred← citeshttps://doi.org/10.1137/16m1105815openalex-snapshot

A Hierarchy of Lower Bounds for Sublinear Additive Spanners

inferred← citeshttps://doi.org/10.1137/18m1163865openalex-snapshot

Minimum Cuts and Sparsification in Hypergraphs

inferred← citeshttps://doi.org/10.1137/23m1564845openalex-snapshot

Space Complexity of Vertex Connectivity Oracles

inferred← citeshttps://doi.org/10.1137/s0097539792225303openalex-snapshot

The Serial Transitive Closure Problem for Trees

inferred← citeshttps://doi.org/10.1145/1102120.1102147openalex-snapshot

Dynamic and efficient key management for access hierarchies

inferred← citeshttps://doi.org/10.1145/1198513.1198516openalex-snapshot

Succinct ordinal trees with level-ancestor queries

inferred← citeshttps://doi.org/10.1145/1455526.1455531openalex-snapshot

Dynamic and Efficient Key Management for Access Hierarchies

inferred← citeshttps://doi.org/10.1145/1951365.1951402openalex-snapshot