Go to the corresponding LIPIcs Volume Portal 
Mucha, Marcin ; Nederlof, Jesper ; Pawlewicz, Jakub ; Wegrzycki, Karol
pdfformat: 

@InProceedings{mucha_et_al:LIPIcs:2019:11194, author = {Marcin Mucha and Jesper Nederlof and Jakub Pawlewicz and Karol Wegrzycki}, title = {{EqualSubsetSum Faster Than the MeetintheMiddle}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {73:173:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771245}, ISSN = {18688969}, year = {2019}, volume = {144}, editor = {Michael A. Bender and Ola Svensson and Grzegorz Herman}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11194}, URN = {urn:nbn:de:0030drops111946}, doi = {10.4230/LIPIcs.ESA.2019.73}, annote = {Keywords: EqualSubsetSum, SubsetSum, meetinthemiddle, enumeration technique, randomized algorithm} }
Keywords:  EqualSubsetSum, SubsetSum, meetinthemiddle, enumeration technique, randomized algorithm  
Seminar:  27th Annual European Symposium on Algorithms (ESA 2019)  
Issue Date:  2019  
Date of publication:  06.09.2019 