Q5009570 (Q5009570): Difference between revisions

@@ Property / cites work @@
+A random NC algorithm for depth first search
@@ Property / cites work: A random NC algorithm for depth first search / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Depth-First Search in General Directed Graphs
+Normal rank
@@ Property / cites work @@
+The space complexity of approximating the frequency moments
+Normal rank
@@ Property / cites work @@
+Parallelism and the maximal path problem
@@ Property / cites work: Parallelism and the maximal path problem / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Reprint of: Memory-constrained algorithms for simple polygons
+Normal rank
@@ Property / cites work @@
+Depth-First Search Using $$O(n)$$ Bits
@@ Property / cites work: Depth-First Search Using $$O(n)$$ Bits / rank @@
+Normal rank
@@ Property / cites work @@
+$\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability
+Normal rank
@@ Property / cites work @@
+Q2968076
@@ Property / cites work: Q2968076 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Space Efficient Algorithms for BFS, DFS and Applications
+Normal rank
@@ Property / cites work @@
+Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs
+Normal rank
@@ Property / cites work @@
+Space-time trade-offs for stack-based algorithms
@@ Property / cites work: Space-time trade-offs for stack-based algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
+Normal rank
@@ Property / cites work @@
+A general Sequential Time-Space Tradeoff for Finding Unique Elements
+Normal rank
@@ Property / cites work @@
+A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
+Normal rank
@@ Property / cites work @@
+A time-space tradeoff for sorting on non-oblivious machines
+Normal rank
@@ Property / cites work @@
+Towards in-place geometric algorithms and data structures
+Normal rank
@@ Property / cites work @@
+Computing with a full memory
@@ Property / cites work: Computing with a full memory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4601876
@@ Property / cites work: Q4601876 / rank @@
+Normal rank
@@ Property / cites work @@
+New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs.
+Normal rank
@@ Property / cites work @@
+Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits
+Normal rank
@@ Property / cites work @@
+Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
+Normal rank
@@ Property / cites work @@
+Space-efficient algorithms for maximum cardinality search, stack BFS, queue BFS and applications
+Normal rank
@@ Property / cites work @@
+Multi-pass geometric algorithms
@@ Property / cites work: Multi-pass geometric algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers
+Normal rank
@@ Property / cites work @@
+Selection and Sorting in the “Restore” Model
@@ Property / cites work: Selection and Sorting in the “Restore” Model / rank @@
+Normal rank
@@ Property / cites work @@
+Space Lower Bounds for Maze Threadability on Restricted Machines
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem
+Normal rank
@@ Property / cites work @@
+Changing base without losing space
@@ Property / cites work: Changing base without losing space / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Lower Bounds for <i>st</i>-Connectivity on the NNJAG Model
+Normal rank
@@ Property / cites work @@
+Embedding and canonizing graphs of bounded genus in logspace
+Normal rank
@@ Property / cites work @@
+Canonizing Graphs of Bounded Tree Width in Logspace
+Normal rank
@@ Property / cites work @@
+Space-efficient Basic Graph Algorithms
@@ Property / cites work: Space-efficient Basic Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Selection from read-only memory with limited workspace
+Normal rank
@@ Property / cites work @@
+On graph problems in a semi-streaming model
@@ Property / cites work: On graph problems in a semi-streaming model / rank @@
+Normal rank
@@ Property / cites work @@
+Implicit dictionaries with <i>O</i>(1) modifications per update and fast search
+Normal rank
@@ Property / cites work @@
+In-Place Suffix Sorting
@@ Property / cites work: In-Place Suffix Sorting / rank @@
+Normal rank
@@ Property / cites work @@
+Radix Sorting with No Extra Space
@@ Property / cites work: Radix Sorting with No Extra Space / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds for time-space trade-offs in sorting and selection
+Normal rank
@@ Property / cites work @@
+Q4608619
@@ Property / cites work: Q4608619 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4967204
@@ Property / cites work: Q4967204 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3796767
@@ Property / cites work: Q3796767 / rank @@
+Normal rank
@@ Property / cites work @@
+Selection and sorting with limited storage
@@ Property / cites work: Selection and sorting with limited storage / rank @@
+Normal rank
@@ Property / cites work @@
+Selection from read-only memory and sorting with minimum data movement
+Normal rank
@@ Property / cites work @@
+An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
+Normal rank
@@ Property / cites work @@
+Symmetric Complementation
@@ Property / cites work: Symmetric Complementation / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-first search is inherently sequential
@@ Property / cites work: Depth-first search is inherently sequential / rank @@
+Normal rank
@@ Property / cites work @@
+Undirected connectivity in log-space
@@ Property / cites work: Undirected connectivity in log-space / rank @@
+Normal rank
@@ Property / cites work @@
+Logspace optimization problems and their approximability properties
+Normal rank
@@ Property / cites work @@
+Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations
+Normal rank