default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBryce Sandlund
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c10]Bryce Sandlund, Lingyi Zhang:
Selectable Heaps and Optimal Lazy Search Trees. SODA 2022: 1962-1975- 2021
- [b1]Bryce Sandlund:
Efficient Data Structures for Partial Orders, Range Modes, and Graph Cuts. University of Waterloo, Ontario, Canada, 2021 - 2020
- [c9]Bryce Sandlund, Sebastian Wild
:
Lazy Search Trees. FOCS 2020: 704-715 - [c8]Bryce Sandlund, Yinzhan Xu:
Faster Dynamic Range Mode. ICALP 2020: 94:1-94:14 - [c7]Nalin Bhardwaj, Antonio Molina Lovett, Bryce Sandlund:
A Simple Algorithm for Minimum Cuts in Near-Linear Time. SWAT 2020: 12:1-12:18 - [c6]J. Ian Munro, Bryce Sandlund, Corwin Sinnamon:
Space-Efficient Data Structures for Lattices. SWAT 2020: 31:1-31:22 - [i10]Bryce Sandlund, Yinzhan Xu:
Faster Dynamic Range Mode. CoRR abs/2004.08777 (2020) - [i9]Bryce Sandlund, Sebastian Wild:
Lazy Search Trees. CoRR abs/2010.08840 (2020) - [i8]Bryce Sandlund, Lingyi Zhang:
Selectable Heaps and Optimal Lazy Search Trees. CoRR abs/2011.11772 (2020)
2010 – 2019
- 2019
- [c5]Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund:
On Approximate Range Mode and Range Selection. ISAAC 2019: 57:1-57:14 - [c4]Richard Peng, Bryce Sandlund, Daniel Dominic Sleator:
Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity. WADS 2019: 553-565 - [i7]J. Ian Munro, Bryce Sandlund, Corwin Sinnamon:
Space-Efficient Data Structures for Lattices. CoRR abs/1902.05166 (2019) - [i6]Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund:
On Approximate Range Mode and Range Selection. CoRR abs/1907.08579 (2019) - [i5]Antonio Molina Lovett, Bryce Sandlund:
A Simple Algorithm for Minimum Cuts in Near-Linear Time. CoRR abs/1908.11829 (2019) - 2018
- [j1]Eric Bach, Bryce Sandlund:
Baby-step giant-step algorithms for the symmetric group. J. Symb. Comput. 85: 55-71 (2018) - [c3]Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund:
Improved Time and Space Bounds for Dynamic Range Mode. ESA 2018: 25:1-25:13 - [i4]Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund:
Improved Time and Space Bounds for Dynamic Range Mode. CoRR abs/1807.03827 (2018) - [i3]Eric Bach, Bryce Sandlund:
On Euclidean Methods for Cubic and Quartic Jacobi Symbols. CoRR abs/1807.07719 (2018) - 2017
- [i2]Richard Peng, Bryce Sandlund, Daniel Dominic Sleator:
Offline Dynamic Higher Connectivity. CoRR abs/1708.03812 (2017) - 2016
- [c2]Eric Bach, Bryce Sandlund:
Baby-Step Giant-Step Algorithms for the Symmetric Group. ISSAC 2016: 55-62 - [i1]Eric Bach, Bryce Sandlund:
Baby-Step Giant-Step Algorithms for the Symmetric Group. CoRR abs/1612.03456 (2016) - 2014
- [c1]Bryce Sandlund, Kerrick Staley, Michael Dixon, Steve Butler:
Numerical Tic-Tac-Toe on the 4×4 Board. COCOON 2014: 537-546
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
