On data structures and asymmetric communication complexity (Q1273860): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jcss.1998.1577 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcss.1998.1577 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2165461157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the difficulty of range searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for finding predecessors in Yao's cell probe model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for orthogonal range searching: I. The reporting case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surpassing the information theoretic bound with fusion trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Circuits for Connectivity Require Super-Logarithmic Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for union-split-find related problems on random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cell probe complexity of polynomial evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounds in Communication Complexity Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial-Match Retrieval Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log-logarithmic worst-case range queries are possible in space theta(N) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Should Tables Be Sorted? / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JCSS.1998.1577 / rank
 
Normal rank

Latest revision as of 17:16, 10 December 2024

scientific article
Language Label Description Also known as
English
On data structures and asymmetric communication complexity
scientific article

    Statements

    Identifiers