| 2023 |
N Fathollahi and S Chester.
“Lock-free Vertex Clustering for Multicore Mesh Reduction.”
SIGGRAPH Asia: 10 pages.
|
| 2022 |
M Gray, S Chester, H Jabbari.
“KnotAli: informed energy minimization through the use of evolutionary information.”
BMC Bioinform.: 28 pages.
|
| 2021 |
TL Dam, S Chester, K Nørvåg, QH Duong.
“Efficient top-k recently-frequent term querying over spatio-temporal textual streams.”
Inf. Syst.: 14 pages.
|
| 2020 |
S Maropaki, S Chester, C Doulkeridis, K Nørvåg.
“Diversifying Top-k Point-of-Interest Queries via Collective Social Reach.”
CIKM: 4 pages.
|
| |
A Mehrafsa, S Chester, A Thomo.
“Vectorising k-Core Decomposition for GPU Acceleration.”
SSDBM: 4 pages.
|
| 2019 |
Y Santoso, S Venkatesh, A Thomo, S Chester.
“Triad Enumeration at Trillion-Scale using a Single Commodity Machine.”
EDBT: 718-721.
|
| 2018 |
D Šidlauskas, S Chester, ET Zacharatou, A Ailamaki.
“Improving Spatial Data Processing by Clipping Minimum Bounding Boxes.”
ICDE: 425-436.
|
| 2017 |
KS Bøgh, S Chester, D Šidlauskas, I Assent.
“Template Skycube Algorithms for Heterogeneous Parallelism on Multicore and GPU Architectures.”
SIGMOD: 447-462.
|
| 2016 |
KS Bøgh, S Chester, I Assent.
“SkyAlign: A Portable, Work-Efficient Skyline Algorithm for Multicore and GPU Architectures.”
VLDB J: 25(6): 817-841.
|
|
C Chen, S Chester, S Venkatesh, K Wu, A Thomo.
“Group-Aware Weighted Bipartite B-Matching.”
CIKM: 459-468.
|
|
L Derczynski and S Chester.
“Generalised Brown Clustering and Roll-Up Feature Generation.”
AAAI: 1533-1539.
|
| 2015 |
KS Bøgh, S Chester, I Assent.
“Work-Efficient Parallel Skyline Computation for the GPU.”
PVLDB 8(9): 962-973.
|
|
S Chester, D Šidlauskas, I Assent, KS Bøgh.
“Scalable parallelization of skyline computation for multi-core processors.”
ICDE: 1083-1094.
|
|
ML Mortensen, S Chester, I Assent, M Magnani.
“Efficient caching for constrained skyline queries.”
EDBT: 337-348.
|
|
S Chester and I Assent.
“Explanations for Skyline Query Results.”
EDBT: 349-360.
|
| 2014 |
S Chester, A Thomo, S Venkatesh, S Whitesides.
“Computing k-Regret Minimizing Sets.”
PVLDB 7(5): 389-400.
|
|
KS Bøgh, S Chester, D Šidlauskas, I Assent.
“Hashcube: A Data Structure for Space- and Query-Efficient Skycube Compression.”
CIKM: 1767-1770.
|
| 2013 |
S Chester, BM Kapron, G Ramesh, G Srivastava, A Thomo, S Venkatesh.
“Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes.”
Social Netw. Analys. Mining 3(3): 381-399.
|
|
S Chester, BM Kapron, G Srivastava, S Venkatesh.
“Complexity of social network anonymization.”
Social Netw. Analys. Mining 3(2): 151-166.
|