On the public citation graph

Design and Analysis of a Data Structure for Representing Sorted Lists

https://doi.org/10.1137/0209045

0 signed · 118 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/bf00288683openalex-snapshot

Organization and maintenance of large ordered indexes

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

On random 2?3 trees

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

Big Omicron and big Omega and big Theta

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

A Fast Merging Algorithm

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.1006/jagm.1993.1048openalex-snapshot

Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network

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

Optimal Two-Dimensional Compressed Matching

inferred← citeshttps://doi.org/10.1006/jcss.1996.0025openalex-snapshot

Onk-Dimensional Balanced Binary Trees

inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_25openalex-snapshot

Adaptive Sorting with AVL Trees

inferred← citeshttps://doi.org/10.1007/11523468_15openalex-snapshot

Worst Case Optimal Union-Intersection Expression Evaluation

inferred← citeshttps://doi.org/10.1007/11533719_63openalex-snapshot

Improved Algorithms for the K-Maximum Subarray Problem for Small K

inferred← citeshttps://doi.org/10.1007/11732990_22openalex-snapshot

Efficient Enumeration of Phylogenetically Informative Substrings

inferred← citeshttps://doi.org/10.1007/3-540-10291-4_16openalex-snapshot

The analysis of search trees: A survey

inferred← citeshttps://doi.org/10.1007/3-540-13345-3_29openalex-snapshot

Measures of presortedness and optimal sorting algorithms

inferred← citeshttps://doi.org/10.1007/3-540-13345-3_44openalex-snapshot

AVL-trees for localized search

inferred← citeshttps://doi.org/10.1007/3-540-19487-8_4openalex-snapshot

Time parameter and arbitrary deunions in the set union problem

inferred← citeshttps://doi.org/10.1007/3-540-36136-7_3openalex-snapshot

Key Independent Optimality

inferred← citeshttps://doi.org/10.1007/3-540-36494-3_57openalex-snapshot

Adaptive Sorting and the Information Theoretic Lower Bound

inferred← citeshttps://doi.org/10.1007/3-540-45452-7_12openalex-snapshot

Identifying Occurrences of Maximal Pairs in Multiple Strings

inferred← citeshttps://doi.org/10.1007/3-540-45465-9_17openalex-snapshot

Priority Queues, Pairing, and Adaptive Sorting

inferred← citeshttps://doi.org/10.1007/3-540-45465-9_18openalex-snapshot

Exponential Structures for Efficient Cache-Oblivious Algorithms

inferred← citeshttps://doi.org/10.1007/3-540-46521-9_21openalex-snapshot

Group Updates for Bed-Black Trees

inferred← citeshttps://doi.org/10.1007/3-540-48318-7_18openalex-snapshot

An Experimental Evaluation of Hybrid Data Structures for Searching

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-51084-2_1openalex-snapshot

Dynamic maintenance of paths and path expressions on graphs

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

A constant update time finger search tree

inferred← citeshttps://doi.org/10.1007/3-540-56279-6_102openalex-snapshot

Sorting and/by merging finger trees

inferred← citeshttps://doi.org/10.1007/3-540-57301-1_21openalex-snapshot

An algorithm for the implementation of replicated tables

inferred← citeshttps://doi.org/10.1007/3-540-58201-0_70openalex-snapshot

Optimal two-dimensional compressed matching

inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_10openalex-snapshot

Bulk Operations on B-Trees

inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_11openalex-snapshot

Online Index Construction and Maintenance

inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_12openalex-snapshot

Concurrency Control by Versioning

inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_13openalex-snapshot

Distributed Transactions

inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_14openalex-snapshot

Transactions in Page-Server Systems

inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_15openalex-snapshot

Processing of Write-Intensive Transactions

inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_2openalex-snapshot

Operations on the Physical Database

inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_3openalex-snapshot

Logging and Buffering

inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_4openalex-snapshot

Transaction Rollback and Restart Recovery

inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_5openalex-snapshot

Transactional Isolation

inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_6openalex-snapshot

Lock-Based Concurrency Control

inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_7openalex-snapshot

B-Tree Traversals

inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_8openalex-snapshot

B-Tree Structure Modifications

inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_9openalex-snapshot

Advanced Locking Protocols

inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_50openalex-snapshot

A Simplified and Dynamic Unified Structure

inferred← citeshttps://doi.org/10.1007/978-3-540-24838-5_17openalex-snapshot

Fingered Multidimensional Search Trees

inferred← citeshttps://doi.org/10.1007/978-3-540-30213-1_24openalex-snapshot

Concurrency Control and I/O-Optimality in Bulk Insertion

inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_10openalex-snapshot

Distribution-Sensitive Binomial Queues

inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_34openalex-snapshot

Evaluation of General Set Expressions

inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_8openalex-snapshot

Some Results for Elementary Operations

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

A new data structure for representing sorted lists

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

Visibility between two edges of a simple polygon

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

Robust balancing in B-trees

inferred← citeshttps://doi.org/10.1007/s00236-007-0061-0openalex-snapshot

Adaptive sorting: an information theoretic perspective

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

A Tree-based Mergesort

inferred← citeshttps://doi.org/10.1007/s00453-004-1136-8openalex-snapshot

Key-Independent Optimality

inferred← citeshttps://doi.org/10.1007/s00607-008-0011-xopenalex-snapshot

Computing inversion pair cardinality through partition-based sorting

inferred← citeshttps://doi.org/10.1016/0020-0190(81)90101-0openalex-snapshot

Hysterical B-trees

inferred← citeshttps://doi.org/10.1016/0020-0190(94)00115-4openalex-snapshot

A constant update time finger search tree

inferred← citeshttps://doi.org/10.1016/0020-0255(94)90089-2openalex-snapshot

Cost-optimal parallel algorithms for constructing B-trees

inferred← citeshttps://doi.org/10.1016/0022-0000(89)90034-2openalex-snapshot

Making data structures persistent

inferred← citeshttps://doi.org/10.1016/0743-7315(91)90050-jopenalex-snapshot

Cost-optimal parallel algorithms for constructing 2–3 trees

inferred← citeshttps://doi.org/10.1016/b978-0-444-87137-4.50014-xopenalex-snapshot

Computing Visibility Properties of Polygons

inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50011-4openalex-snapshot

Data Structures

inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.01.005openalex-snapshot

Proximate point searching

inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.05.011openalex-snapshot

Local properties of geometric graphs

inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.09.001openalex-snapshot

On k-convex polygons

inferred← citeshttps://doi.org/10.1016/j.ipl.2006.12.008openalex-snapshot

Multidimensional heaps and complementary range searching

inferred← citeshttps://doi.org/10.1016/j.ipl.2015.05.003openalex-snapshot

Counting inversions adaptively

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.2006.03.018openalex-snapshot

Algorithms for extracting motifs from biological weighted sequences

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

A unified access bound on comparison-based dynamic dictionaries

inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80034-6openalex-snapshot

AVL-trees for localized search

inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80033-xopenalex-snapshot

Sorting jordan sequences in linear time using level-linked search trees

inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00088-2openalex-snapshot

Optimal layout of edge-weighted forests

inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80204-xopenalex-snapshot

Chapter 7 Fundamental algorithms and data structures

inferred← citeshttps://doi.org/10.1089/cmb.2007.r011openalex-snapshot

Efficient Enumeration of Phylogenetically Informative Substrings

inferred← citeshttps://doi.org/10.1093/comjnl/bxl007openalex-snapshot

Improved Algorithms for the K-Maximum Subarray Problem

inferred← citeshttps://doi.org/10.1093/comjnl/bxl058openalex-snapshot

Locating Maximal Multirepeats in Multiple Strings Under Various Constraints †

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

Improved Dynamic Planar Point Location

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

Fast Parallel Operations on Search Trees

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

A cache-aware data structure for representing boolean polynomials

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

Dynamic networking refinement in distributed systems

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

Concurrency and recovery in full-text indexing

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

Measures of Presortedness and Optimal Sorting Algorithms

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

Untangling Tanglegrams: Comparing Trees by Their Drawings

inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb22472.xopenalex-snapshot

Planar Point Location Using Persistent Search Treesa

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

A Partial Analysis of Height-Balanced Trees under Random Insertions and Deletions

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

Three Partition Refinement Algorithms

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

An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon

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

Fully Dynamic Algorithms for 2-Edge Connectivity

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

Amortized Computational Complexity

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

Distances and Finger Search in Random Binary Search Trees

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

A compendium of key search references

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

Improving the performance of multidimensional search using fingers

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

Data structures and algorithms for disjoint set union problems

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

Making data structures persistent

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

A linear-time algorithm for triangulating simple polygons

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

A survey of adaptive sorting algorithms

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

Purely functional representations of catenable sorted lists

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

Fast set operations using treaps

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

Group updates for relaxed height-balanced trees

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

Optimal Reissue Policies for Reducing Tail Latency

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

The Parametric Closure Problem

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

Optimal Parallel Algorithms in the Binary-Forking Model

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

Self-adjusting binary search trees

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

A locally adaptive data compression scheme

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

Planar point location using persistent search trees

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

Proximate planar point location

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

Localized search in sorted lists

inferred← citeshttps://doi.org/10.1184/r1/6609716openalex-snapshot

Space-Efficient Finger Search on Degree-Balanced Search Trees

inferred← citeshttps://doi.org/10.26021/1644openalex-snapshot

Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem

inferred← citeshttps://doi.org/10.5555/1109557.1109602openalex-snapshot

Design of data structures for mergeable trees

inferred← citeshttps://doi.org/10.5555/127787.127795openalex-snapshot

Fully persistent lists with catenation

inferred← citeshttps://doi.org/10.5555/314613.314842openalex-snapshot

Finger search trees with constant insertion time

inferred← citeshttps://doi.org/10.5555/365411.365522openalex-snapshot

Alternatives to splay trees with O(log n) worst-case access times

inferred← citeshttps://doi.org/10.5555/545381.545385openalex-snapshot

A locality-preserving cache-oblivious dynamic dictionary

inferred← citeshttps://doi.org/10.5821/dissertation-2117-93958openalex-snapshot

Design and Analysis of Multidimensional Data Structures

inferred← citeshttps://doi.org/10.70675/499492a6z4ee4z4c18z8ed9z476ec2c1fd0fopenalex-snapshot

Fonctions latticielles polynomiales pour l’interpolation et la classification monotone

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.