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

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
aliases / en / 0aliases / en / 0
 
2-Server PIR with Subpolynomial Communication
description / endescription / en
 
scientific article; zbMATH DE number 6912651
Property / title
 
2-Server PIR with Subpolynomial Communication (English)
Property / title: 2-Server PIR with Subpolynomial Communication (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1407.94008 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1145/2968443 / rank
 
Normal rank
Property / published in
 
Property / published in: Journal of the ACM / rank
 
Normal rank
Property / publication date
 
2 August 2018
Timestamp+2018-08-02T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 2 August 2018 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6912651 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2570927556 / rank
 
Normal rank
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