Pseudo-random graphs and bit probe schemes with one-sided error (Q2254500): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
aliases / en / 0aliases / en / 0
 
Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error
description / endescription / en
scientific article
scientific article; zbMATH DE number 5908670
Property / title
 
Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error (English)
Property / title: Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1330.68123 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-20712-9_5 / rank
 
Normal rank
Property / published in
 
Property / published in: Computer Science – Theory and Applications / rank
 
Normal rank
Property / publication date
 
17 June 2011
Timestamp+2011-06-17T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 17 June 2011 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q87 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5908670 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999495042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2804894185 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1102.5538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space/time trade-offs in hash coding with allowable errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of an optimal non-blocking commutation scheme without reorganization / 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: Pseudorandom generators for space-bounded computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness vs randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and expansion of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are Bitvectors Optimal? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness conductors and constant-degree lossless expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic derandomization via complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storing information with extractors. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: How strong is Nisan's pseudo-random generator? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of finite sets in which no set is covered by the union of \(r\) others / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonoblivious hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loss-less condensers, unbalanced expanders, and extractors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of extractors using pseudo-random generators (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Membership in Constant Time and Almost-Minimum Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cell probe complexity of membership and perfect hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting all the randomness and reducing the error in Trevisan's extractors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuckoo hashing: Further analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuckoo hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the space-bounded version of Muchnik's conditional complexity theorem via ``naive'' derandomization / rank
 
Normal rank

Latest revision as of 15:32, 9 July 2024

scientific article; zbMATH DE number 5908670
  • Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error
Language Label Description Also known as
English
Pseudo-random graphs and bit probe schemes with one-sided error
scientific article; zbMATH DE number 5908670
  • Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error

Statements

Pseudo-random graphs and bit probe schemes with one-sided error (English)
0 references
Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error (English)
0 references
5 February 2015
0 references
17 June 2011
0 references
data structures
0 references
derandomization
0 references
pseudorandom number generators
0 references
expander graphs
0 references
0 references
0 references
0 references
0 references
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
0 references
0 references