Maxim Gurevich

According to our database, Maxim Gurevich authored at least 16 papers between 2003 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Quantum invariants for decomposition problems in type <i>A</i> rings of representations.

Maxim Gurevich

J. Comb. Theory A, 2021

2013

Top-k Publish-Subscribe for Social Annotation of News.

Alexander Shraer, Maxim Gurevich, Marcus Fontoura, Vanja Josifovski

Proc. VLDB Endow., 2013

Permutation indexing: fast approximate retrieval from large corpora.

Maxim Gurevich, Tamás Sarlós

Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012

Overcoming browser cookie churn with clustering.

Anirban Dasgupta, Maxim Gurevich, Liang Zhang, Belle L. Tseng, Achint Oommen Thomas

Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

Fast top-k retrieval for model based recommendation.

Deepak Agarwal, Maxim Gurevich

Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

2011

Enhanced email spam filtering through combining similarity graphs.

Anirban Dasgupta, Maxim Gurevich, Kunal Punera

Proceedings of the Forth International Conference on Web Search and Web Data Mining, 2011

Preserving Personalized Pagerank in Subgraphs.

Andrea Vattani, Deepayan Chakrabarti, Maxim Gurevich

Proceedings of the 28th International Conference on Machine Learning, 2011

Efficiently encoding term co-occurrences in inverted indexes.

Marcus Fontoura, Maxim Gurevich, Vanja Josifovski, Sergei Vassilvitskii

Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

Factorization-based lossless compression of inverted indices.

George Beskales, Marcus Fontoura, Maxim Gurevich, Sergei Vassilvitskii, Vanja Josifovski

Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

2009

Estimating the impressionrank of web pages.

Ziv Bar-Yossef, Maxim Gurevich

Proceedings of the 18th International Conference on World Wide Web, 2009

Correctness of gossip-based membership under message loss.

Maxim Gurevich, Idit Keidar

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008

Mining search engine query logs via suggestion sampling.

Ziv Bar-Yossef, Maxim Gurevich

Proc. VLDB Endow., 2008

Brahms: byzantine resilient random membership sampling.

Edward Bortnikov, Maxim Gurevich, Idit Keidar, Gabriel Kliot, Alexander Shraer

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

2007

Efficient search engine measurements.

Ziv Bar-Yossef, Maxim Gurevich

Proceedings of the 16th International Conference on World Wide Web, 2007

2006

Random sampling from a search engine's index.

Ziv Bar-Yossef, Maxim Gurevich

Proceedings of the 15th international conference on World Wide Web, 2006

2003

Optimization Opportunities Created by Global Data Reordering.

Gadi Haber, Moshe Klausner, Vadim Eisenberg, Bilha Mendelson, Maxim Gurevich

Proceedings of the 1st IEEE / ACM International Symposium on Code Generation and Optimization (CGO 2003), 2003