Pith. sign in

Paper Citation Record · LEDGER

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

As of 18 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-18T06:34:40.430872+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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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:0a9e64852f1e61f4fb517d6680dcd4e93867471e94b4d934ff51d732580e0600

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

Pith citing papers

No inbound Pith citation observations are available.