Pages that link to "Item:Q1923858"

The following pages link to Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (Q1923858):

Displaying 32 items.

• Parsing by matrix multiplication generalized to Boolean grammars (Q385966) (← links)
• Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
• Path Laplacian matrices: introduction and application to the analysis of consensus in networks (Q417470) (← links)
• On minimum witnesses for Boolean matrix multiplication (Q517804) (← links)
• All-pairs bottleneck paths in vertex weighted graphs (Q633850) (← links)
• A fast output-sensitive algorithm for Boolean matrix multiplication (Q634680) (← links)
• Improved parallel approximation of a class of integer programming problems (Q676274) (← links)
• Quantum and approximation algorithms for maximum witnesses of Boolean matrix products (Q831754) (← links)
• Generalised cumulative arrays in secret sharing (Q851749) (← links)
• All-pairs disjoint paths from a common ancestor in \(\widetilde O (n^\omega)\) time (Q924140) (← links)
• Faster multi-witnesses for Boolean matrix multiplication (Q976085) (← links)
• Optimal linear perfect hash families (Q1269893) (← links)
• Improved algorithms via approximations of probability distributions (Q1582012) (← links)
• Perfect hash families: Probabilistic methods and explicit constructions (Q1586126) (← links)
• Are unique subgraphs not easier to find? (Q1707980) (← links)
• Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393) (← links)
• Some intriguing upper bounds for separating hash families (Q1729948) (← links)
• Extreme witnesses and their applications (Q1799232) (← links)
• Algebraic methods in the congested clique (Q2010605) (← links)
• New space/time tradeoffs for top-\(k\) document retrieval on sequences (Q2015136) (← links)
• Faster algorithms for finding lowest common ancestors in directed acyclic graphs (Q2373733) (← links)
• A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
• Unique subgraphs are not easier to find (Q2855752) (← links)
• A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs (Q2891383) (← links)
• Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
• Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
• Extreme Witnesses and Their Applications (Q3467863) (← links)
• Bounds And Constructions For Threshold Shared Generation Of Authenticators (Q4792963) (← links)
• Separating Hash Families: A Johnson-type bound and New Constructions (Q5298169) (← links)
• Explicit constructions of perfect hash families from algebraic curves over finite fields (Q5929836) (← links)
• Broadcast authentication for group communication (Q5958610) (← links)
• Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)