Pith. sign in

Paper Citation Record · LEDGER

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries

As of 14 August 2026, this Paper Citation Record lists 54 of 54 outbound references and 0 inbound Pith citation observations for arXiv:2607.04509.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.04509 v1

Coverage vector

measured 54 of 54 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-11T18:22:41.629378Z

measured 54 of 54 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

54 of 54 outbound references displayed

  • verified exact34
  • verified fuzzy0
  • unresolved17
  • parse uncertain0
  • malformed identifier3
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation d2a13f2d-50ce-43cc-b4db-1c2187c5f12f · outbound

This paper cites Two-dimensionalrangeminimum queries.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Two-dimensionalrangeminimum queries

Reference 1

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.217486Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:5fd62e9fcd1496abe9688c99749dcdc51f053ee7f8ce164042e67599cf28ce24

Observation a5b1bc28-e814-47f4-a64c-a3f7f24ccb2e · outbound

This paper cites Lrm-trees: Compressed in- dices, adaptive sorting, and compressed permutations.Theor.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Lrm-trees: Compressed in- dices, adaptive sorting, and compressed permutations.Theor

Reference 2

Resolution
unresolved
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:b6e5214021a25929a5cf3f0ba55c3fb758e52b493441b7825eb1722ce11a8075

Observation 7986bc93-1061-46b5-924b-bd1262bcbc28 · outbound

This paper cites an unresolved cited work.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Unresolved cited work

Reference 3

Resolution
unresolved
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:a55905927d0ea1833d8fea1c5fb1dc0b23371ef476888254c50e14ffdf0a4a6a

Observation 88ec5a32-ee90-41a8-b8a8-4ce34bdaa7ce · outbound

This paper cites Ian Munro, Gonzalo Navarro, and Yakov Nekrich.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Ian Munro, Gonzalo Navarro, and Yakov Nekrich

Reference 4

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.015753Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:01d00426d1bc32424139390bea97026a32a972880a2a8f38dbb947524d0794e3

Observation 9fea8222-cae5-4e3a-8fcd-e872f765a452 · outbound

This paper cites Bender and Martin Farach-Colton.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Bender and Martin Farach-Colton

Reference 5

Resolution
unresolved
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:556225a0040b702fda9cab91aa5b90cd4b70abc86814f27f9a32a6dbc57f7e47

Observation 15a508af-19d2-4e0c-8d5b-55c8baf3a571 · outbound

This paper cites Approximate range mode and range median queries.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Approximate range mode and range median queries

Reference 6

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.272844Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:a5ef1b45a618eedb2acfc25598bd6361bedce7bb9ca864eed59a44add2f75824

Observation 317b1c29-f5c3-46b6-814d-a9430f48df90 · outbound

This paper cites The encoding complexity of two dimensional range minimum data structures.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries The encoding complexity of two dimensional range minimum data structures

Reference 7

Resolution
unresolved
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:78a0ed31735822777bf7ee2432179458579f257295e9d74eef8dce13cdf5cf35

Observation e3b52bee-807e-4b6f-acf1-2b376755f7cb · outbound

This paper cites Two dimensional range minimum queries and fibonacci lattices.Theor.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Two dimensional range minimum queries and fibonacci lattices.Theor

Reference 8

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.180582Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:7918fac3ffb0058a7d7a8d52ebd61926ea5fe644d57e7197ab12b452956a736f

Observation d022565e-817a-42e1-9bd9-24fca2f20d3f · outbound

This paper cites Srinivasa Rao.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Srinivasa Rao

Reference 9

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.076600Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:3d121455ca017c466d9178531ea7fb2d9f7085f9fdd112314890fde37be37f58

Observation 2025634c-ab50-4ce3-be6b-3d3bfdab6e57 · outbound

This paper cites Wilkinson.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Wilkinson

Reference 10

Resolution
unresolved
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:39badd5eb9f27539af0f4c45f0f339f3f9af16e86f6bb3401f8b52e0aec73227

Observation 98b3f9e9-0fb7-4d6e-963d-bafb4df126ad · outbound

This paper cites Chan, Stephane Durocher, Matthew Skala, and Bryan T.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Chan, Stephane Durocher, Matthew Skala, and Bryan T

Reference 11

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.157181Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:4ef276da913fce50e96eb01651d3badea8f153f08688a87c4f25e49a01e57efb

Observation 3f5b458d-7c72-48cb-a4ca-5e769647c1b3 · outbound

This paper cites Srinivasa Rao.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Srinivasa Rao

Reference 12

Resolution
verified exact
arxiv_id, observed 2026-07-11T18:28:11.261813Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:225baa025e7f77f42591d51d293fa78f2d9330f0748914fcd54c860c79b707c2

Observation 5a1a1ffb-b548-41de-8652-2b70c3456566 · outbound

This paper cites On succinct representations of binary trees.Math.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries On succinct representations of binary trees.Math

Reference 13

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.059926Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:d92efecafb79dc993fd486898c8887bf882ee12ba54446e4b8e13deab0c26598

Observation 5d33ada8-a34f-4be1-9c49-a1d0b5373486 · outbound

This paper cites Demaine, Gad M.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Demaine, Gad M

Reference 14

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.045120Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:5fda8d2d288afbac6a3e414e3bfa07e019c1188698a3fb4505611f22ab5a8cf3

Observation 998e2482-a335-4466-838e-46216dbf36bd · outbound

This paper cites Ian Munro, Patrick K.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Ian Munro, Patrick K

Reference 15

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.031398Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:52646157ebb068288d033fb6df5bc8ea7df269c1a1fd2f0e9413b12109afebf3

Observation 2c2b0a82-80fc-4198-8223-6789c69c8f15 · outbound

This paper cites Ian Munro, Yakov Nekrich, and Bryce Sandlund.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Ian Munro, Yakov Nekrich, and Bryce Sandlund

Reference 16

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.114498Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:b1c2907bbb34e7628d4ea98e338a1e286d39344ad7dce83bc7f825dee3b4ed43

Observation c068cbb4-d436-454c-89e8-7b64c0e622ce · outbound

This paper cites Compressibility measures and succinct data structures for piecewise linear approximations.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Compressibility measures and succinct data structures for piecewise linear approximations

Reference 17

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.195837Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:3e485594933410464294c084b42935e7922c564f48a92041c824d5750c7a6bb6

Observation 0a7d3a63-f1d1-42c4-9af8-e349d84eb332 · outbound

This paper cites Finding range minima in the middle: Approximations and applications.Math.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Finding range minima in the middle: Approximations and applications.Math

Reference 18

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.042160Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:567b6f6be8b1bccee952b4a8f358eb09699e807eadc90a682a93ac56f4dc62d2

Observation 231ca734-92b2-4cc4-b48b-963416763656 · outbound

This paper cites Space-efficient preprocessing schemes for range min- imum queries on static arrays.SIAM J.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Space-efficient preprocessing schemes for range min- imum queries on static arrays.SIAM J

Reference 19

Resolution
malformed identifier
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:ad0d54ab4afd862e7d417420d83040d8caeed108d023cd5390117c900b129888

Observation 761c358a-8993-4b17-9ca0-581633ed3edf · outbound

This paper cites An(other) entropy-bounded compressed suffix tree.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries An(other) entropy-bounded compressed suffix tree

Reference 20

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.208579Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:29747542a7233406f2e6f41803c5922bd68b6d6659751e08d6d346158db251a4

Observation 849978c3-1806-43b1-882a-c81c63d944a3 · outbound

This paper cites Gabow, Jon Louis Bentley, and Robert Endre Tarjan.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Gabow, Jon Louis Bentley, and Robert Endre Tarjan

Reference 21

Resolution
verified exact
arxiv_id, observed 2026-07-11T18:28:11.246266Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:49a8e07d17a2a71a3e596dd08e9e722f5f36ff1ec7c87e814ac9dffd61ed9875

Observation eae21ffb-7db7-4a31-946d-c04a4a38ee0a · outbound

This paper cites Ian Munro, and Patrick K.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Ian Munro, and Patrick K

Reference 22

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.126630Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:e0f90d9e57a79442fc4dc53224fe67f104fe954644bd2a6dccd3a749d9d19faa

Observation 279eb5e7-3be7-4939-b28e-fc0f2cecb913 · outbound

This paper cites Compressed dynamic range majority and minority data structures.Algorithmica, 82(7):2063–2086, 2020.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Compressed dynamic range majority and minority data structures.Algorithmica, 82(7):2063–2086, 2020

Reference 23

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.029728Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:89b306b2a90048ddf65f865c919ba6b74f5af382c3808dc390bd459d54d59996

Observation e1777d8d-8590-42bc-b1d0-9081b1a4a1f3 · outbound

This paper cites Compressed range minimum queries.Theor.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Compressed range minimum queries.Theor

Reference 24

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.062108Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:e0a06fdc574ad84f38e96fa9f13a522016bddfe167fd213d289bed8a28abf09b

Observation c5a59c92-3140-40e8-9284-2f9f53be8792 · outbound

This paper cites Submatrix maximum queries in monge and partial monge matrices are equivalent to predecessor search.ACM Trans.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Submatrix maximum queries in monge and partial monge matrices are equivalent to predecessor search.ACM Trans

Reference 25

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.144103Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:446ccceb9fe69fe0bb7830030a1a2ae57a3b417fda6b989f23fe6fa107ef9f28

Observation daa211e7-aebd-42a3-9270-a81bac70dcae · outbound

This paper cites Nicholson.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Nicholson

Reference 26

Resolution
unresolved
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:6d865bbd5c19846988c96b178badd00a397876fee292255c3821e764e6917cb9

Observation 75b13ae3-eb11-41e3-8753-dff19d759bf4 · outbound

This paper cites Nicholson.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Nicholson

Reference 27

Resolution
verified exact
doi, observed 2026-07-11T18:28:10.962944Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:b70991d16ebd004c1e961022cfad2f475d06c94caaa92f09562972e8f3c3b447

Observation d29be7c5-73f4-4bab-b65b-cf207bc35e8e · outbound

This paper cites Golin, John Iacono, Danny Krizanc, Rajeev Raman, Srinivasa Rao Satti, and Sunil M.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Golin, John Iacono, Danny Krizanc, Rajeev Raman, Srinivasa Rao Satti, and Sunil M

Reference 28

Resolution
unresolved
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:2d122db9eb68e0f7717435297d238f0250be3dcbefe742dd3ef7186e93fb27fc

Observation 1adfee65-54dc-411f-aa51-7e4a68e94257 · outbound

This paper cites an unresolved cited work.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Unresolved cited work

Reference 29

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.198676Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:40774f5dc3a971d1630d7e6845dc2b7c3893f5871b9825bf963bc49f8d3708ed

Observation df24e93d-bd9d-41e4-912a-fb4e065c0a37 · outbound

This paper cites Cell probe lower bounds and approximations for range mode.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Cell probe lower bounds and approximations for range mode

Reference 30

Resolution
unresolved
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:251c7966a66646cd1df1c91e28956dcc4b68ab3a97a8aba05befff46e56f2f24

Observation f12322ac-bb12-4d67-aa7a-1ec44d1988d6 · outbound

This paper cites Srinivasa Rao.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Srinivasa Rao

Reference 31

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.166251Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:ffba3cc47b89c9f16992c2901180c5fb416ff252d97d64f36ff2b1fcc44102a7

Observation b2e7d772-49d5-4adc-8865-5e956eb4729f · outbound

This paper cites Fast algorithms for finding nearest common ancestors.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Fast algorithms for finding nearest common ancestors

Reference 32

Resolution
unresolved
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:6854405acc1aecabcace9021d168bde4c58807187b5638471d70c19b17032ffc

Observation fe1badf3-2380-4f21-a08e-ece2bc73c6c3 · outbound

This paper cites Space-efficient data structure for next/previous larger/smaller value queries.Algorithmica, 87(10):1369–1392, 2025.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Space-efficient data structure for next/previous larger/smaller value queries.Algorithmica, 87(10):1369–1392, 2025

Reference 33

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.094226Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:93b7aaf82e80b005d11e553e6d9d2f04823ed8722758ae8b8f09fdad38e3a2fc

Observation 34d7a84b-11bb-429b-9cb1-a2ceb9fee197 · outbound

This paper cites Encoding two-dimensional range top-k queries.Algorithmica, 83(11):3379–3402, 2021.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Encoding two-dimensional range top-k queries.Algorithmica, 83(11):3379–3402, 2021

Reference 34

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.172004Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:9066dbd98e9f925f31c69f41eb1c84b43ac4e6451ff0a199fea47e99f0048648

Observation 74826aca-558b-4a5f-b7a9-a8e0dc8d7afd · outbound

This paper cites Simultaneous encodings for range and next/previous larger/smaller value queries.Theor.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Simultaneous encodings for range and next/previous larger/smaller value queries.Theor

Reference 35

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.134810Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:d9beb7cd04e2160889c8be9b784a14553d29469a8211023762ef9f46a45f115c

Observation 210942c7-34cd-481c-ae48-d647048ef089 · outbound

This paper cites Encoding data structures for range queries on arrays.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Encoding data structures for range queries on arrays

Reference 36

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.052385Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:680114324fa52e60b386ce77477a3f750a6b1f09f0285f5d48a0e76b4a0b7ed9

Observation e12a5ae8-dcc8-4df9-a7b1-f685b128e2bb · outbound

This paper cites Encodings for range minimum queries over bounded alphabets.Theor.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Encodings for range minimum queries over bounded alphabets.Theor

Reference 37

Resolution
malformed identifier
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:dd60cce82cc6f1a3283f3547742b540f8fa5bd5a61ac5ab0776ece3c874d9410

Observation ade22c18-208b-40a0-b8ee-1bb25e25eda5 · outbound

This paper cites Submatrix maximum queries in monge matrices and partial monge matrices, and their applications.ACM Trans.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Submatrix maximum queries in monge matrices and partial monge matrices, and their applications.ACM Trans

Reference 38

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.004345Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:a36dad77b72313a62fc57f79b9694f0be2f885280599954430b866e2c47bc095

Observation 06780c5b-c534-4b3b-a9d7-18cb9780b256 · outbound

This paper cites Searching for frequent colors in rectangles.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Searching for frequent colors in rectangles

Reference 39

Resolution
unresolved
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:66ec3668569e50073a2659b0869c3f4bba5d3b2fca4a765f204a6cb82740f11c

Observation bd0672ab-ce09-4362-b902-461c469739de · outbound

This paper cites an unresolved cited work.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Unresolved cited work

Reference 40

Resolution
unresolved
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:31ad8282bb45c897bee017e1fca4bb45e13a13afeae5f55254a3bfdc06949efe

Observation b8317e5e-5c9e-4a77-93e3-5d4cfa8e326b · outbound

This paper cites Nearly Tight Lower Bounds for Succinct Range Minimum Query.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Nearly Tight Lower Bounds for Succinct Range Minimum Query

Reference 41

Resolution
unresolved
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:196baa418b47aae663929bf482db55345a1a8fa49349b9d9ff4ff17cd52cad6b

Observation 5919c33f-79e5-42f4-965e-85590b1a53a3 · outbound

This paper cites Lower bound for succinct range minimum query.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Lower bound for succinct range minimum query

Reference 42

Resolution
unresolved
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:524d0fdc9ddb9180899e77158b7ac79f516cf50ae2b6d4eb2ecaeb4b78533602

Observation 0f9fd9d2-ef34-4e85-95c9-2b864cc5dbad · outbound

This paper cites Ian Munro, Patrick K.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Ian Munro, Patrick K

Reference 43

Resolution
unresolved
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:d1d0a47e18fd0f27b7ae2bf1a539f6e3acd71dadfaa792ad9fc0f21d55de3be5

Observation dd39a998-b324-4604-b888-74f8cb30ed6d · outbound

This paper cites Thankachan.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Thankachan

Reference 44

Resolution
verified exact
doi, observed 2026-07-11T18:28:10.971467Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:6a8180792ac6b97235c20f505152ade0190c273326d41b42b4e6e7ce4ef2e4ea

Observation c8d16164-7a8b-4d6a-9bee-9ad0b2ee62d0 · outbound

This paper cites Improved bounds for range mode and range median queries.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Improved bounds for range mode and range median queries

Reference 45

Resolution
unresolved
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:750843767efe3febb31e19851e8666365eca27ac2b75975c10f1fa1a9bbbd865

Observation a62cfa6f-a055-49dd-a91d-8ab348e3f53c · outbound

This paper cites Range mode and range median queries in constant time and sub-quadratic space.Inf.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Range mode and range median queries in constant time and sub-quadratic space.Inf

Reference 46

Resolution
unresolved
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:dc4d09bfcde923aae55fd6b93f6a0443a290990096dd395df2d0b4dcbce57ef5

Observation 55590eb8-50bd-45d1-9367-0fd70b19992a · outbound

This paper cites Optimal range max datacube for fixed dimensions.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Optimal range max datacube for fixed dimensions

Reference 47

Resolution
verified exact
doi, observed 2026-07-11T18:28:10.998877Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:af69e0a4f203107eb01e5f4d0594c427b3c8cd30044578d0e9b1417ad853e0f4

Observation 013f95ad-44f7-4e00-8045-fc71d881ec7e · outbound

This paper cites Encoding data structures.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Encoding data structures

Reference 48

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.226003Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:23fb2e9eecf45847f55730d608a68d8f67443e8c475e2a90b0efec2fb6245b29

Observation 0aef8d78-95a2-4db1-aa9e-4fb87ba498f5 · outbound

This paper cites Srinivasa Rao.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Srinivasa Rao

Reference 49

Resolution
unresolved
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:dbda19837b9881deecca2ade7a40573cca0095091224f55f31565eced008eefd

Observation 01528aac-d78a-490d-ad02-c7a0fde06fe3 · outbound

This paper cites Succinct data structures for flexible text retrieval systems.J.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Succinct data structures for flexible text retrieval systems.J

Reference 50

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.073507Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:a10e89cf7eaf5a021524e3f16ce0e8fb51f2d87351c45d966675de9c4e7c8724

Observation 376c4f8f-59a1-4a86-871f-769633bc2187 · outbound

This paper cites On finding lowest common ancestors: Simplification and parallelization.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries On finding lowest common ancestors: Simplification and parallelization

Reference 51

Resolution
verified exact
doi, observed 2026-07-11T18:28:10.976270Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:d219f3e5dd49f1edb94fa2a371958124befa402f84b7e31160fbda318be81632

Observation 0be9dd3b-060b-4e16-ba34-838495f8d7dc · outbound

This paper cites Array range queries.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Array range queries

Reference 52

Resolution
malformed identifier
no resolver link, observed 2026-07-11T18:22:41.629378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:83ff35186438709b4ce86bc5b3016334df91c0f6c5f1638ce2ac51258eff1b8c

Observation 93ba42a3-3c18-4099-9ee2-7e95ec6eec87 · outbound

This paper cites Theeffectiveentropyofnext/previouslarger/smallervaluequeries.Inf.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Theeffectiveentropyofnext/previouslarger/smallervaluequeries.Inf

Reference 53

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.098945Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:88e0081f00102d3ce52fea96afb560ba9b538fe8b64ccdc8e964b2880fa89984

Observation 50256e54-cb6d-424c-bd7a-1e3a3c3a658d · outbound

This paper cites an unresolved cited work.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries Unresolved cited work

Reference 54

Resolution
verified exact
doi, observed 2026-07-11T18:28:11.018951Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-07-11T18:22:41.629378Z digest=sha256:2d9143a700fb70e822801e4af590526b05fb3dbd1ed1d5974ff156adcbf78635

Pith citing papers

No inbound Pith citation observations are available.