Go to the corresponding OASIcs Volume Portal 
pdfformat: 

@InProceedings{jin_et_al:OASIcs:2018:10043, author = {Ce Jin and Hongxun Wu}, title = {{A Simple NearLinear Pseudopolynomial Time Randomized Algorithm for Subset Sum}}, booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)}, pages = {17:117:6}, series = {OpenAccess Series in Informatics (OASIcs)}, ISBN = {9783959770996}, ISSN = {21906807}, year = {2018}, volume = {69}, editor = {Jeremy T. Fineman and Michael Mitzenmacher}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/10043}, URN = {urn:nbn:de:0030drops100436}, doi = {10.4230/OASIcs.SOSA.2019.17}, annote = {Keywords: subset sum, formal power series, FFT} }
Keywords:  subset sum, formal power series, FFT  
Collection:  2nd Symposium on Simplicity in Algorithms (SOSA 2019)  
Issue Date:  2018  
Date of publication:  08.01.2019 