Daniel Anderson

Generating author description...

All published works

Action	Title	Year	Authors
+	Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span	2023	Daniel Anderson Guy E. Blelloch
+	Turning manual concurrent memory reclamation into automatic reference counting	2022	Daniel Anderson Guy E. Blelloch Yuanhao Wei
+	Parallel Minimum Cuts in <i>O</i> ( <i>m</i> log <sup>2</sup> <i>n</i> ) Work and Low Depth	2021	Daniel Anderson Guy E. Blelloch
+	Efficient Parallel Self-Adjusting Computation	2021	Daniel Anderson Guy E. Blelloch Anubhav Baweja Umut A. Acar
+	Efficient Parallel Self-Adjusting Computation	2021	Daniel Anderson Guy E. Blelloch Anubhav Baweja Umut A. Acar
+ PDF Chat	Further results on an abstract model for branching and its application to mixed integer programming	2020	Daniel Anderson Pierre Le Bodic Kerri Morgan
+	Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model	2020	Daniel Anderson Guy E. Blelloch Kanat Tangwongsan
+	Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees.	2020	Umut A. Acar Daniel Anderson Guy E. Blelloch Laxman Dhulipala Sam Westrick
+	Parallel Batch-dynamic Trees via Change Propagation	2020	Umut A. Acar Daniel Anderson Guy E. Blelloch Laxman Dhulipala Sam Westrick
+	A Note on An Abstract Model for Branching and its Application to Mixed Integer Programming	2019	Daniel Anderson Pierre Le Bodic Kerri Morgan
+	Parallel Batch-Dynamic Graph Connectivity	2019	Umut A. Acar Daniel Anderson Guy E. Blelloch Laxman Dhulipala
+ PDF Chat	A high-performance algorithm for identifying frequent items in data streams	2017	Daniel Anderson Pryce Bevan Kevin Lang Edo Liberty Lee Rhodes Justin Thaler
+	A High-Performance Algorithm for Identifying Frequent Items in Data Streams	2017	Daniel Anderson Pryce Bevan Kevin Lang Edo Liberty Lee Rhodes Justin Thaler

Common Coauthors

Coauthor	Papers Together
Guy E. Blelloch	9
Umut A. Acar	5
Laxman Dhulipala	3
Pierre Le Bodic	2
Pryce Bevan	2
Edo Liberty	2
Sam Westrick	2
Lee Rhodes	2
Kevin Lang	2
Kerri Morgan	2
Justin Thaler	2
Anubhav Baweja	2
Kanat Tangwongsan	1
Yuanhao Wei	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Maintaining information in fully dynamic trees with top trees	2005	Stephen Alstrup Jacob Holm Kristian de Lichtenberg Mikkel Thorup	4
+	Parallel Batch-Dynamic Graph Connectivity	2019	Umut A. Acar Daniel Anderson Guy E. Blelloch Laxman Dhulipala	4
+	Optimal Parallel Algorithms in the Binary-Forking Model	2020	Guy E. Blelloch Jeremy T. Fineman Yan Gu Yihan Sun	3
+ PDF Chat	Batch-Parallel Euler Tour Trees	2019	Tom Tseng Laxman Dhulipala Guy E. Blelloch	3
+ PDF Chat	Parallel algorithms for geometric graph problems	2014	Alexandr Andoni Aleksandar Nikolov Krzysztof Onak Grigory Yaroslavtsev	2
+ PDF Chat	Exponentially Faster Massively Parallel Maximal Matching	2019	Soheil Behnezhad Mohammad Taghi Hajiaghayi David G. Harris	2
+ PDF Chat	An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems	2016	Arnab Bhattacharyya Palash Dey David P. Woodruff	2
+ PDF Chat	Parallel Minimum Cuts in Near-linear Work and Low Depth	2018	Barbara Geissmann Lukas Gianinazzi	2
+ PDF Chat	Faster Algorithms for Edge Connectivity via Random 2-Out Contractions	2019	Mohsen Ghaffari Krzysztof Nowicki Mikkel Thorup	2
+ PDF Chat	Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds	2019	Laxman Dhulipala David Durfee Janardhan Kulkarni Richard Peng Saurabh Sawlani Xiaorui Sun	2
+ PDF Chat	On the Irreducibility of Certain Trinomials and Quadrinomials.	1960	W. Ljunggren	2
+	Parallel Batch-dynamic Trees via Change Propagation	2020	Umut A. Acar Daniel Anderson Guy E. Blelloch Laxman Dhulipala Sam Westrick	2
+ PDF Chat	Simple and deterministic matrix sketching	2013	Edo Liberty	2
+	Beating CountSketch for heavy hitters in insertion streams	2016	Vladimir Braverman Stephen R. Chestnut Nikita Ivkin David P. Woodruff	2
+ PDF Chat	Just Join for Parallel Ordered Sets	2016	Guy E. Blelloch Daniel Ferizovic Yihan Sun	2
+ PDF Chat	A near-optimal algorithm for estimating the entropy of a stream	2010	Amit Chakrabarti Graham Cormode Andrew McGregor	2
+	Dynamic Algorithms for the Massively Parallel Computation Model	2019	Giuseppe F. Italiano Silvio Lattanzi Vahab Mirrokni Nikos Parotsidis	2
+	Experiments in mixed-integer linear programming	1971	M. Benichou J. M. Gauthier P. Girodet G. Hentges G. Ribière O. Vincent	2
+	Numerical Methods that Work	1972	J. N. L. Forman S. Acton	2
+ PDF Chat	An abstract model for branching and its application to mixed integer programming	2017	Pierre Le Bodic George L. Nemhauser	2
+	Learning to Branch	2018	Maria-Florina Balcan Travis Dick Tüomas Sandholm Ellen Vitercik	2
+	Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest	2018	Tsvi Kopelowitz Ely Porat Yair Rosenmutter	2
+	Probability and Computing: Randomized Algorithms and Probabilistic Analysis	2005	Michael Mitzenmacher Eli Upfal	2
+	Parallel Range and Segment Queries with Augmented Maps.	2018	Yihan Sun Guy E. Blelloch	1
+	Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable	2018	Laxman Dhulipala Guy E. Blelloch Julian Shun	1
+	Parallel Graph Connectivity in Log Diameter Rounds	2018	Alexandr Andoni Clifford Stein Zhao Song Zhengyu Wang Peilin Zhong	1
+	Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest	2018	Tsvi Kopelowitz Ely Porat Yair Rosenmutter	1
+	Matching and MIS for Uniformly Sparse Graphs in the Low-Memory MPC Model	2018	Sebastian Brandt Manuela Fischer Jara Uitto	1
+ PDF Chat	Parallel Weighted Random Sampling	2022	Lorenz Hübschle-Schneider Peter Sanders	1
+	Massively Parallel Computation via Remote Memory Access	2019	Soheil Behnezhad Laxman Dhulipala Hossein Esfandiari Jakub Łącki Warren Schudy Vahab Mirrokni	1
+	Massively Parallel Computation via Remote Memory Access	2019	Soheil Behnezhad Laxman Dhulipala Hossein Esfandiari Jakub Łącki Vahab Mirrokni Warren Schudy	1
+	Sorting, Searching, and Simulation in the MapReduce Framework	2011	Michael T. Goodrich Nodari Sitchinava Qin Zhang	1
+ PDF Chat	Faster Deterministic Fully-Dynamic Graph Connectivity	2013	Christian Wulff‐Nilsen	1
+ PDF Chat	A General Framework for Graph Sparsification	2019	Wai-Shing Fung Ramesh Hariharan Nicholas J. A. Harvey Debmalya Panigrahi	1
+ PDF Chat	Parallel Ordered Sets Using Join	2016	Guy E. Blelloch Daniel Ferizovic Yihan Sun	1
+ PDF Chat	Fast Parallel Operations on Search Trees	2016	Yaroslav Akhremtsev Peter Sanders	1
+	Fully dynamic connectivity in O(log n(log log n)2) amortized expected time	2017	Shang-En Huang Dawei Huang Tsvi Kopelowitz Seth Pettie	1
+ PDF Chat	Parallel Graph Connectivity in Log Diameter Rounds	2018	Alexandr Andoni Zhao Song Clifford Stein Zhengyu Wang Peilin Zhong	1
+	Minimum Cut in $O(m\log^2 n)$ Time	2019	Paweł Gawrychowski Shay Mozes Oren Weimann	1
+ PDF Chat	Round Compression for Parallel Matching Algorithms	2019	Artur Czumaj Jakub Łącki Aleksander Mądry Slobodan Mitrović Krzysztof Onak Piotr Sankowski	1
+	Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees.	2020	Umut A. Acar Daniel Anderson Guy E. Blelloch Laxman Dhulipala Sam Westrick	1
+	NVTraverse: in NVRAM data structures, the destination is more important than the journey	2020	Michal Friedman Naama Ben-David Yuanhao Wei Guy E. Blelloch Erez Petrank	1
+	Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model	2020	Daniel Anderson Guy E. Blelloch Kanat Tangwongsan	1
+ PDF Chat	Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs	2017	Shahbaz Khan	1
+	Parallel Working-Set Search Structures	2018	Kunal Agrawal Seth Gilbert Wei Quan Lim	1
+	Deterministic mincut in almost-linear time	2021	Jason Li	1
+	A Simple Algorithm for Minimum Cuts in Near-Linear Time	2019	Nalin Bhardwaj Antonio Molina Lovett Bryce Sandlund	1
+	Parallel Weighted Random Sampling	2019	Lorenz Hübschle-Schneider Peter Sanders	1
+ PDF Chat	Sorting, Searching, and Simulation in the MapReduce Framework	2011	Michael T. Goodrich Nodari Sitchinava Qin Zhang	1
+	Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time	2016	Shang-En Huang Dawei Huang Tsvi Kopelowitz Seth Pettie Mikkel Thorup	1