Optimization Opportunities Created by Global Data Reordering. - Gadi Haber; Moshe Klausner; Vadim Eisenberg; Bilha Mendelson; Maxim Gurevich (CGO, 2003)

Random sampling from a search engine's index. - Ziv Bar-Yossef; Maxim Gurevich (J. ACM, 2008)

Mining search engine query logs via suggestion sampling. - Ziv Bar-Yossef; Maxim Gurevich (Proc. VLDB Endow., 2008)

Estimating the impressionrank of web pages. - Ziv Bar-Yossef; Maxim Gurevich (WWW, 2009)

Brahms: Byzantine resilient random membership sampling. - Edward Bortnikov; Maxim Gurevich; Idit Keidar; Gabriel Kliot; Alexander Shraer (Comput. Networks, 2009)

Correctness of Gossip-Based Membership under Message Loss. - Maxim Gurevich; Idit Keidar (SIAM J. Comput., 2010)

Factorization-based lossless compression of inverted indices. - George Beskales; Marcus Fontoura; Maxim Gurevich; Sergei Vassilvitskii; Vanja Josifovski (CIKM, 2011)

Efficiently encoding term co-occurrences in inverted indexes. - Marcus Fontoura; Maxim Gurevich; Vanja Josifovski; Sergei Vassilvitskii (CIKM, 2011)

Preserving Personalized Pagerank in Subgraphs. - Andrea Vattani; Deepayan Chakrabarti; Maxim Gurevich (ICML, 2011)

Enhanced email spam filtering through combining similarity graphs. - Anirban Dasgupta 001; Maxim Gurevich; Kunal Punera (WSDM, 2011)

Efficient Search Engine Measurements. - Ziv Bar-Yossef; Maxim Gurevich (ACM Trans. Web, 2011)

Fast top-k retrieval for model based recommendation. - Deepak Agarwal; Maxim Gurevich (WSDM, 2012)

Overcoming browser cookie churn with clustering. - Anirban Dasgupta 001; Maxim Gurevich; Liang Zhang 021; Belle L. Tseng; Achint Oommen Thomas (WSDM, 2012)

Permutation indexing: fast approximate retrieval from large corpora. - Maxim Gurevich; Tamás Sarlós (CIKM, 2013)

Top-k Publish-Subscribe for Social Annotation of News. - Alexander Shraer; Maxim Gurevich; Marcus Fontoura; Vanja Josifovski (Proc. VLDB Endow., 2013)

Quantum invariants for decomposition problems in type A rings of representations. - Maxim Gurevich (J. Comb. Theory A, 2021)