Bryce Sandlund

According to our database1, Bryce Sandlund authored at least 14 papers between 2014 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Selectable Heaps and Optimal Lazy Search Trees.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021
Efficient Data Structures for Partial Orders, Range Modes, and Graph Cuts.
PhD thesis, 2021

2020
Space-Efficient Data Structures for Lattices.
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

A Simple Algorithm for Minimum Cuts in Near-Linear Time.
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Faster Dynamic Range Mode.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Lazy Search Trees.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
A Simple Algorithm for Minimum Cuts in Near-Linear Time.
CoRR, 2019

Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

On Approximate Range Mode and Range Selection.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018
Baby-step giant-step algorithms for the symmetric group.
J. Symb. Comput., 2018

On Euclidean Methods for Cubic and Quartic Jacobi Symbols.
CoRR, 2018

Improved Time and Space Bounds for Dynamic Range Mode.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Offline Dynamic Higher Connectivity.
CoRR, 2017

2014
Numerical Tic-Tac-Toe on the 4×4 Board.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014


  Loading...