Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (Q1923858): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exponent of all pairs shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating (log <sup>c</sup> <i>n</i> )-wise independence in NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit $O(1)$ Probe Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonoblivious hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Separating Systems and Families of Perfect Hash Functions / 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: Witnesses for Boolean matrix multiplication and for transitive closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fredman–Komlós bounds and information theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing randomness in parallel computation without a processor penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of table expansion on the program complexity of perfect hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The probabilistic method yields deterministic parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Hashing and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic construction of deterministic algorithms: approximating packing integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Spatial Complexity of Oblivious <i>k</i>-Probe Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3481743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storing a sparse table / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01940874 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989682699 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:23, 30 July 2024

scientific article
Language Label Description Also known as
English
Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
scientific article

    Statements

    Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (English)
    0 references
    0 references
    0 references
    0 references
    3 March 1997
    0 references
    all pairs shortest path problem
    0 references
    matrix multiplication
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers