Maxim Gurevich

Orcid: 0000-0003-4693-0556

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Quantum invariants for decomposition problems in type <i>A</i> rings of representations.
J. Comb. Theory, Ser. A, 2021

2013
Top-k Publish-Subscribe for Social Annotation of News.
Proc. VLDB Endow., 2013

Permutation indexing: fast approximate retrieval from large corpora.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012
Overcoming browser cookie churn with clustering.
Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

Fast top-k retrieval for model based recommendation.
Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

2011
Efficient Search Engine Measurements.
ACM Trans. Web, 2011

Enhanced email spam filtering through combining similarity graphs.
Proceedings of the Forth International Conference on Web Search and Web Data Mining, 2011

Preserving Personalized Pagerank in Subgraphs.
Proceedings of the 28th International Conference on Machine Learning, 2011

Efficiently encoding term co-occurrences in inverted indexes.
Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

Factorization-based lossless compression of inverted indices.
Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

2010
Correctness of Gossip-Based Membership under Message Loss.
SIAM J. Comput., 2010

2009
Brahms: Byzantine resilient random membership sampling.
Comput. Networks, 2009

Estimating the impressionrank of web pages.
Proceedings of the 18th International Conference on World Wide Web, 2009

2008
Mining search engine query logs via suggestion sampling.
Proc. VLDB Endow., 2008

Random sampling from a search engine's index.
J. ACM, 2008

2003
Optimization Opportunities Created by Global Data Reordering.
Proceedings of the 1st IEEE / ACM International Symposium on Code Generation and Optimization (CGO 2003), 2003


  Loading...