Work-efficient query evaluation in constant time with PRAMs
From MaRDI portal
Cites work
- \textsf{PANDA}: query evaluation in submodular width
- Algorithmic aspects of parallel data processing
- An Optimal O(\log \log N)-Time Parallel Algorithm for Detecting all Squares in a String
- Communication steps for parallel query processing
- Counting Δ_0 sets
- Dyn-FO: A parallel, dynamic complexity class
- Expressibility and Parallel Complexity
- Fine-grained complexity of analyzing compressed data: quantifying improvements over decompress-and-solve
- scientific article; zbMATH DE number 1003255 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- scientific article; zbMATH DE number 549850 (Why is no real title available?)
- scientific article; zbMATH DE number 1142308 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 5485586 (Why is no real title available?)
- Hypertree decompositions and tractable queries
- If the current clique algorithms are optimal, so is Valiant's parser
- Incremental and decremental evaluation of transitive closure by first- order queries
- On a compaction theorem of Ragde
- On Acyclic Conjunctive Queries and Constant Delay Enumeration
- On the complexity of division and set joins in the relational algebra
- On uniformity within \(NC^ 1\)
- Parallel approximate maximum flows in near-linear work and polylogarithmic depth
- Parallel exact shortest paths in almost linear work and square root depth
- Power of Natural Semijoins
- Relations between Concurrent-Write Models of Parallel Computation
- Sensitive functions and approximate problems
- Size bounds and query plans for relational joins
- The log-star revolution
- The semijoin algebra and the guarded fragment
- Tight Comparison Bounds on the Complexity of Parallel Sorting
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- Work-sensitive dynamic complexity of formal languages
- Worst-case optimal algorithms for parallel query processing
- Worst-case optimal join algorithms
This page was built for publication: Work-efficient query evaluation in constant time with PRAMs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7308605)
