Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSean Chester
Person information
- affiliation: Norwegian University of Science and Technology, Trondheim, Norway
- affiliation: Aarhus University, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2013
[b1]Sean Chester:
Representative Subsets for Preference Queries. University of Victoria, Canada, 2013
Journal Articles
- 2022
- [j7]Mateo Gray, Sean Chester
, Hosna Jabbari:
KnotAli: informed energy minimization through the use of evolutionary information. BMC Bioinform. 23(1): 159 (2022) - 2021
- [j6]Thu-Lan Dam, Sean Chester, Kjetil Nørvåg, Quang-Huy Duong:
Efficient top-k recently-frequent term querying over spatio-temporal textual streams. Inf. Syst. 97: 101687 (2021) - 2016
- [j5]Kenneth S. Bøgh, Sean Chester, Ira Assent:
SkyAlign: a portable, work-efficient skyline algorithm for multicore and GPU architectures. VLDB J. 25(6): 817-841 (2016) - 2015
- [j4]Kenneth S. Bøgh, Sean Chester, Ira Assent:
Work-Efficient Parallel Skyline Computation for the GPU. Proc. VLDB Endow. 8(9): 962-973 (2015) - 2014
- [j3]Sean Chester, Alex Thomo, S. Venkatesh, Sue Whitesides:
Computing k-Regret Minimizing Sets. Proc. VLDB Endow. 7(5): 389-400 (2014) - 2013
- [j2]Sean Chester, Bruce M. Kapron, Gautam Srivastava, S. Venkatesh:
Complexity of social network anonymization. Soc. Netw. Anal. Min. 3(2): 151-166 (2013) - [j1]Sean Chester, Bruce M. Kapron, Ganesh Ramesh, Gautam Srivastava, Alex Thomo, S. Venkatesh:
Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes. Soc. Netw. Anal. Min. 3(3): 381-399 (2013)
Conference and Workshop Papers
- 2023
- [c26]Nima Fathollahi, Sean Chester:
Lock-free Vertex Clustering for Multicore Mesh Reduction. SIGGRAPH Asia 2023: 60:1-60:10 - 2022
- [c25]Amir Mehrafsa, Sean Chester, Alex Thomo:
Vectorising k-Truss Decomposition for Simple Multi-Core and SIMD Acceleration. IISA 2022: 1-6 - 2020
- [c24]Benjamin Smith, Sean Chester, Yvonne Coady:
Ship Detection in Satellite Optical Imagery. AICCC 2020: 11-18 - [c23]Stella Maropaki, Sean Chester, Christos Doulkeridis, Kjetil Nørvåg:
Diversifying Top-k Point-of-Interest Queries via Collective Social Reach. CIKM 2020: 2149-2152 - [c22]Amir Mehrafsa, Sean Chester, Alex Thomo:
Vectorising k-Core Decomposition for GPU Acceleration. SSDBM 2020: 24:1-24:4 - 2019
- [c21]Yudi Santoso, Alex Thomo, Venkatesh Srinivasan, Sean Chester:
Triad Enumeration at Trillion-Scale Using a Single Commodity Machine. EDBT 2019: 718-721 - 2018
- [c20]Darius Sidlauskas, Sean Chester, Eleni Tzirita Zacharatou, Anastasia Ailamaki:
Improving Spatial Data Processing by Clipping Minimum Bounding Boxes. ICDE 2018: 425-436 - 2017
- [c19]Kenneth S. Bøgh, Sean Chester, Darius Sidlauskas, Ira Assent:
Template Skycube Algorithms for Heterogeneous Parallelism on Multicore and GPU Architectures. SIGMOD Conference 2017: 447-462 - 2016
- [c18]Leon Derczynski, Sean Chester:
Generalised Brown Clustering and Roll-Up Feature Generation. AAAI 2016: 1533-1539 - [c17]Cheng Chen, Sean Chester, Venkatesh Srinivasan, Kui Wu, Alex Thomo:
Group-Aware Weighted Bipartite B-Matching. CIKM 2016: 459-468 - [c16]Sean Chester, Orestis Gkorgkas, Kjetil Nørvåg:
Top-k Dominating Queries, in Parallel, in Memory. EDBT 2016: 698-699 - [c15]Malene Søholm, Sean Chester, Ira Assent:
Maximum Coverage Representative Skyline. EDBT 2016: 702-703 - 2015
- [c14]Michael L. Mortensen, Sean Chester, Ira Assent, Matteo Magnani:
Efficient caching for constrained skyline queries. EDBT 2015: 337-348 - [c13]Sean Chester, Ira Assent:
Explanations for Skyline Query Results. EDBT 2015: 349-360 - [c12]Sean Chester, Darius Sidlauskas, Ira Assent, Kenneth S. Bøgh:
Scalable parallelization of skyline computation for multi-core processors. ICDE 2015: 1083-1094 - [c11]Leon Derczynski, Sean Chester, Kenneth S. Bøgh:
Tune Your Brown Clustering, Please. RANLP 2015: 110-117 - 2014
- [c10]Kenneth S. Bøgh, Sean Chester, Darius Sidlauskas, Ira Assent:
Hashcube: A Data Structure for Space- and Query-Efficient Skycube Compression. CIKM 2014: 1767-1770 - [c9]Sean Chester, Michael L. Mortensen, Ira Assent:
On the Suitability of Skyline Queries for Data Exploration. EDBT/ICDT Workshops 2014: 161-166 - 2013
- [c8]Sean Chester, Alex Thomo, S. Venkatesh, Sue Whitesides:
Indexing Reverse Top-k Queries in Two Dimensions. DASFAA (1) 2013: 201-208 - 2012
- [c7]Sean Chester, Jared Gaertner, Ulrike Stege, S. Venkatesh:
Anonymizing Subsets of Social Networks with Degree Constrained Subgraphs. ASONAM 2012: 418-422 - 2011
- [c6]Sean Chester, Bruce M. Kapron, Ganesh Ramesh, Gautam Srivastava, Alex Thomo, S. Venkatesh:
k-Anonymization of Social Networks by Vertex Addition. ADBIS (2) 2011: 107-116 - [c5]Sean Chester:
Updatable Indices for Efficient, Generalised Top-k Queries. ADBIS (2) 2011: 248-253 - [c4]Sean Chester, Gautam Srivastava:
Social Network Privacy for Attribute Disclosure Attacks. ASONAM 2011: 445-449 - [c3]Sean Chester, Alex Thomo, Srinivasan Venkatesh, Sue Whitesides:
Indexing for Vector Projections. DASFAA (2) 2011: 367-376 - [c2]Atousa Pahlevan, Sean Chester, Alex Thomo, Hausi A. Müller:
On supporting dynamic web service selection with histogramming. MESOCA 2011: 1-8 - 2009
- [c1]Sean Chester, Ian Sandler, Alex Thomo:
Scalable APRIORI-Based Frequent Pattern Discovery. CSE (1) 2009: 48-55
Reference Works
- 2018
- [r2]Sean Chester, Bruce M. Kapron, Gautam Srivastava, Venkatesh Srinivasan, Alex Thomo:
Anonymization and De-anonymization of Social Network Data. Encyclopedia of Social Network Analysis and Mining. 2nd Ed. 2018 - 2014
- [r1]Sean Chester, Bruce M. Kapron, Gautam Srivastava, Srinivasan Venkatesh, Alex Thomo:
Anonymization and De-anonymization of Social Network Data. Encyclopedia of Social Network Analysis and Mining 2014: 48-56
Informal and Other Publications
- 2012
- [i2]Sean Chester, Alex Thomo, S. Venkatesh, Sue Whitesides:
Indexing Reverse Top-k Queries. CoRR abs/1205.0837 (2012) - [i1]Sean Chester, Alex Thomo, S. Venkatesh, Sue Whitesides:
Computing optimal k-regret minimizing sets with top-k depth contours. CoRR abs/1207.6329 (2012)
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-04-21 17:29 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:
