Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Sandlund, Bryce
19  Ergebnisse:
Personensuche X
?
1

Lazy Search Trees:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Sandlund, Bryce ; Wild, Sebastian - p. 704-715 , 2020
Link: https://doi.org/10.1109/..
 
?
2

Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
Peng, Richard ; Sandlund, Bryce ; Sleator, Daniel D. - p. 553-565 , 2019
Link: https://doi.org/10.1007/..
 
?
3

Baby-step giant-step algorithms for the symmetric group:

Bach, Eric ; Sandlund, Bryce
Journal of Symbolic Computation.  85 (2018)  - p. 55-71 , 2018
Link: https://doi.org/10.1016/..
 
?
4

Baby-Step Giant-Step Algorithms for the Symmetric Group:

, In: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation,
Bach, Eric ; Sandlund, Bryce - p. 55-62 , 2016
Link: https://dl.acm.org/doi/1..
 
?
5

Space-Efficient Data Structures for Lattices:

Munro, J. Ian ; Sandlund, Bryce ; Sinnamon, Corwin
doi:10.4230/LIPIcs.SWAT.2020.31.  , 2020
Link: https://doi.org/10.4230/..
 
?
6

A Simple Algorithm for Minimum Cuts in Near-Linear Time:

Bhardwaj, Nalin ; Molina Lovett, Antonio J ; Sandlund, Bryce
doi:10.4230/LIPIcs.SWAT.2020.12.  , 2020
Link: https://doi.org/10.4230/..
 
?
7

Lazy Search Trees:

Sandlund, Bryce ; Wild, Sebastian
http://arxiv.org/abs/2010.08840.  , 2020
Link: http://arxiv.org/abs/201..
 
?
8

Selectable Heaps and Optimal Lazy Search Trees:

Sandlund, Bryce ; Zhang, Lingyi
http://arxiv.org/abs/2011.11772.  , 2020
Link: http://arxiv.org/abs/201..
 
?
9

Faster Dynamic Range Mode:

Sandlund, Bryce ; Xu, Yinzhan
doi:10.4230/LIPIcs.ICALP.2020.94.  , 2020
Link: https://doi.org/10.4230/..
 
?
10

Faster Dynamic Range Mode:

Sandlund, Bryce ; Xu, Yinzhan
http://arxiv.org/abs/2004.08777.  , 2020
Link: http://arxiv.org/abs/200..
 
?
11

A Simple Algorithm for Minimum Cuts in Near-Linear Time:

Bhardwaj, Nalin ; Lovett, Antonio Molina ; Sandlund, Bryce
http://arxiv.org/abs/1908.11829.  , 2019
Link: http://arxiv.org/abs/190..
 
?
12

On Approximate Range Mode and Range Selection:

El-Zein, Hicham ; He, Meng ; Munro, J. Ian..
doi:10.4230/LIPIcs.ISAAC.2019.57.  , 2019
Link: https://doi.org/10.4230/..
 
?
13

Space-Efficient Data Structures for Lattices:

Munro, J. Ian ; Sandlund, Bryce ; Sinnamon, Corwin
http://arxiv.org/abs/1902.05166.  , 2019
Link: http://arxiv.org/abs/190..
 
?
14

On Approximate Range Mode and Range Selection:

El-Zein, Hicham ; He, Meng ; Munro, J. Ian..
http://arxiv.org/abs/1907.08579.  , 2019
Link: http://arxiv.org/abs/190..
 
?
15

On Euclidean Methods for Cubic and Quartic Jacobi Symbols:

Bach, Eric ; Sandlund, Bryce
http://arxiv.org/abs/1807.07719.  , 2018
Link: http://arxiv.org/abs/180..
 
1-15