2-Server PIR with Sub-Polynomial Communication (Q2941552): Difference between revisions

From MaRDI portal
Merged Item from Q3177815
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On Approximate Distance Labels and Routing Schemes with Affine Stretch / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse spanners of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Linear Time Construction of Sparse Neighborhood Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles with constant query time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Constructing t-Spanners and Paths with Stretch t / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey partitions and proximity data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5414573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path queries in static networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank

Latest revision as of 15:56, 10 July 2024

scientific article; zbMATH DE number 6912651
  • 2-Server PIR with Subpolynomial Communication
Language Label Description Also known as
English
2-Server PIR with Sub-Polynomial Communication
scientific article; zbMATH DE number 6912651
  • 2-Server PIR with Subpolynomial Communication

Statements

2-Server PIR with Sub-Polynomial Communication (English)
0 references
2-Server PIR with Subpolynomial Communication (English)
0 references
0 references
0 references
21 August 2015
0 references
2 August 2018
0 references
locally decodable codes
0 references
private information retrieval
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references