Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{singer:LIPIcs.APPROX/RANDOM.2023.15, author = {Singer, Noah G.}, title = {{Oblivious Algorithms for the MaxkAND Problem}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)}, pages = {15:115:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772969}, ISSN = {18688969}, year = {2023}, volume = {275}, editor = {Megow, Nicole and Smith, Adam}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18840}, URN = {urn:nbn:de:0030drops188409}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.15}, annote = {Keywords: streaming algorithm, approximation algorithm, constraint satisfaction problem (CSP), factorrevealing linear program} }
Keywords:  streaming algorithm, approximation algorithm, constraint satisfaction problem (CSP), factorrevealing linear program  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)  
Issue Date:  2023  
Date of publication:  04.09.2023  
Supplementary Material:  Software (Source Code): https://github.com/singerng/obliviouscsps archived at: https://archive.softwareheritage.org/swh:1:dir:0662828b8cd21f298e6a1163db40e7b7d2253825 