Pages that link to "Item:Q3766870"

The following pages link to Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time (Q3766870):

Displaying 48 items.

• A subquadratic algorithm for 3XOR (Q5005162) (← links)
• Corrigendum: Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions (Q5048295) (← links)
• Sorting and searching revisted (Q5054812) (← links)
• Stochastic analysis of dynamic processes (Q5055922) (← links)
• Two- and three- dimensional point location in rectangular subdivisions (Q5056154) (← links)
• Tables should be sorted (on random access machines) (Q5057459) (← links)
• Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP (Q5075760) (← links)
• Nearly Optimal Static Las Vegas Succinct Dictionary (Q5080480) (← links)
• Preconditioning for the Geometric Transportation Problem (Q5088942) (← links)
• Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes (Q5089193) (← links)
• Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs (Q5089210) (← links)
• Compressed Decision Problems in Hyperbolic Groups. (Q5090484) (← links)
• (Q5091234) (← links)
• The log-star revolution (Q5096787) (← links)
• A perfect parallel dictionary (Q5096824) (← links)
• Trans-dichotomous algorithms without multiplication — some upper and lower bounds (Q5096958) (← links)
• Reverse-Safe Text Indexing (Q5102053) (← links)
• Real-Time Streaming Multi-Pattern Search for Constant Alphabet (Q5111729) (← links)
• Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable (Q5111861) (← links)
• Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding (Q5138974) (← links)
• Longest Common Factor After One Edit Operation (Q5150915) (← links)
• Polynomial hash functions are reliable (Q5204320) (← links)
• DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES (Q5305064) (← links)
• m-Bonsai: A Practical Compact Dynamic Trie (Q5384619) (← links)
• Dilation-Optimal Edge Deletion in Polygonal Cycles (Q5387748) (← links)
• Optimal Higher Order Delaunay Triangulations of Polygons (Q5458523) (← links)
• FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE (Q5694056) (← links)
• (Q5743440) (← links)
• Slightly Superexponential Parameterized Problems (Q5745079) (← links)
• Two-way chaining for non-uniform distributions (Q5852152) (← links)
• Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces (Q5858649) (← links)
• The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651) (← links)
• Counting Subgraphs in Degenerate Graphs (Q5889797) (← links)
• Efficient dynamic approximate distance oracles for vertex-labeled planar graphs (Q5915659) (← links)
• Circular pattern matching with \(k\) mismatches (Q5918999) (← links)
• Faster algorithms for 1-mappability of a sequence (Q5919433) (← links)
• Upper tail analysis of bucket sort and random tries (Q5925527) (← links)
• Representing graphs implicitly using almost optimal space (Q5928875) (← links)
• Optimal Las Vegas reduction from one-way set reconciliation to error correction (Q5964019) (← links)
• Secure two-party input-size reduction: challenges, solutions and applications (Q6081302) (← links)
• Near-optimal search time in \(\delta \)-optimal space, and vice versa (Q6130318) (← links)
• A deterministic parallel reduction from weighted matroid intersection search to decision (Q6130320) (← links)
• Universal Hashing via Integer Arithmetic Without Primes, Revisited (Q6163629) (← links)
• Fast approximate dictionary matching (Q6487972) (← links)
• Predecessor on the Ultra-Wide Word RAM (Q6492089) (← links)
• Frequency-constrained substring complexity (Q6545444) (← links)
• Pattern masking for dictionary matching: theory and practice (Q6547212) (← links)
• Elastic-degenerate string matching with 1 error or mismatch (Q6635705) (← links)