Research archive

Non Geometric Data Structures Algorithms

Historical research material converted from the original PmWiki site.

Research archive · original page Research.NonGeometricDataStructuresAlgorithms · last recorded update 2009-11-14

Here are some algorithms and data structures that are neither geometric nor cartographic.

  1. W. Randolph Franklin. On an improved algorithm for decentralized extrema finding. Comm. ACM, 25(5):336–337, May 1982.
    BibTeX
    @article{wrf-cacm-82,
        author = "Franklin, W. Randolph",
        title = "On an Improved Algorithm for Decentralized Extrema Finding",
        journal = "Comm. ACM",
        volume = "25",
        number = "5",
        month = "May",
        year = "1982",
        pages = "336--337",
        fulltext = "https://wrfranklin.org/p/14-cacm82-ring.pdf",
        href = "\bibhref{14-cacm82-ring}"
    }
    
  2. W. Randolph Franklin. Padded lists—set operations in $O(log log N)$ time. Information Processing Letters, 9(4):161–166, November 1979.
    BibTeX
    @article{wrf-ipl-79,
        author = "Franklin, W. Randolph",
        title = "Padded Lists---Set Operations in {$O(log log N)$} Time",
        journal = "Information Processing Letters",
        volume = "9",
        number = "4",
        month = "November",
        year = "1979",
        pages = "161--166",
        fulltext = "https://wrfranklin.org/p/3-ipl79-padded.pdf",
        href = "\bibhref{3-ipl79-padded}"
    }
    
Explore all pages →Back to top ↑