Upper and lower bounds for fully retroactive graph problems (Q832892): Difference between revisions

@@ Property / cites work @@
+Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version)
+Normal rank
@@ Property / cites work @@
+A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching
+Normal rank
@@ Property / cites work @@
+Q3579414
@@ Property / cites work: Q3579414 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5116497
@@ Property / cites work: Q5116497 / rank @@
+Normal rank
@@ Property / cites work @@
+Retroactive data structures
@@ Property / cites work: Retroactive data structures / rank @@
+Normal rank
@@ Property / cites work @@
+Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing
+Normal rank
@@ Property / cites work @@
+Cloning Voronoi Diagrams via Retroactive Data Structures
+Normal rank
@@ Property / cites work @@
+Making data structures persistent
@@ Property / cites work: Making data structures persistent / rank @@
+Normal rank
@@ Property / cites work @@
+Making data structures confluently persistent
@@ Property / cites work: Making data structures confluently persistent / rank @@
+Normal rank
@@ Property / cites work @@
+Q3140418
@@ Property / cites work: Q3140418 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934578
@@ Property / cites work: Q2934578 / rank @@
+Normal rank
@@ Property / cites work @@
+Fully Retroactive Approximate Range and Nearest Neighbor Searching
+Normal rank
@@ Property / cites work @@
+Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
+Normal rank
@@ Property / cites work @@
+Randomized fully dynamic graph algorithms with polylogarithmic time per operation
+Normal rank
@@ Property / cites work @@
+Maintaining Minimum Spanning Forests in Dynamic Graphs
+Normal rank
@@ Property / cites work @@
+Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
+Normal rank
@@ Property / cites work @@
+Faster Fully-Dynamic Minimum Spanning Forest
@@ Property / cites work: Faster Fully-Dynamic Minimum Spanning Forest / rank @@
+Normal rank
@@ Property / cites work @@
+Logarithmic Lower Bounds in the Cell-Probe Model
@@ Property / cites work: Logarithmic Lower Bounds in the Cell-Probe Model / rank @@
+Normal rank
@@ Property / cites work @@
+A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time
+Normal rank
@@ Property / cites work @@
+Q3311639
@@ Property / cites work: Q3311639 / rank @@
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank